Home
last modified time | relevance | path

Searched +full:mi +full:- +full:v (Results 1 – 25 of 92) sorted by relevance

1234

/linux-6.15/drivers/crypto/allwinner/sun4i-ss/
Dsun4i-ss-hash.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * sun4i-ss-hash.c - hardware cryptographic accelerator for Allwinner A20 SoC
5 * Copyright (C) 2013-2015 Corentin LABBE <clabbe.montjoie@gmail.com>
11 #include "sun4i-ss.h"
21 struct ahash_alg *alg = __crypto_ahash_alg(tfm->__crt_alg); in sun4i_hash_crainit()
28 op->ss = algt->ss; in sun4i_hash_crainit()
30 err = pm_runtime_resume_and_get(op->ss->dev); in sun4i_hash_crainit()
43 pm_runtime_put(op->ss->dev); in sun4i_hash_craexit()
51 struct ahash_alg *alg = __crypto_ahash_alg(tfm->base.__crt_alg); in sun4i_hash_init()
57 op->mode = algt->mode; in sun4i_hash_init()
[all …]
Dsun4i-ss-cipher.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * sun4i-ss-cipher.c - hardware cryptographic accelerator for Allwinner A20 SoC
5 * Copyright (C) 2013-2015 Corentin LABBE <clabbe.montjoie@gmail.com>
13 #include "sun4i-ss.h"
19 struct sun4i_ss_ctx *ss = op->ss; in sun4i_ss_opti_poll()
22 u32 mode = ctx->mode; in sun4i_ss_opti_poll()
27 u32 v; in sun4i_ss_opti_poll() local
30 unsigned int ileft = areq->cryptlen; in sun4i_ss_opti_poll()
31 unsigned int oleft = areq->cryptlen; in sun4i_ss_opti_poll()
35 struct sg_mapping_iter mi, mo; in sun4i_ss_opti_poll() local
[all …]
/linux-6.15/arch/x86/boot/
Dvideo.c1 // SPDX-License-Identifier: GPL-2.0-only
2 /* -*- linux-c -*- ------------------------------------------------------- *
5 * Copyright 2007 rPath, Inc. - All Rights Reserved
8 * ----------------------------------------------------------------------- */
58 * parameters in the default 80x25 mode -- these are set directly,
66 /* For graphics mode, it is up to the mode-setting driver in store_mode_params()
67 (currently only video-vesa.c) to store the parameters */ in store_mode_params()
103 unsigned int v; in get_entry() local
111 len--; in get_entry()
127 v = 0; in get_entry()
[all …]
/linux-6.15/arch/x86/crypto/
Dpolyval-clmulni_asm.S1 /* SPDX-License-Identifier: GPL-2.0 */
6 * This is an efficient implementation of POLYVAL using intel PCLMULQDQ-NI
20 * two-step process only requires 1 finite field reduction for every 8
36 #define MI %xmm14 macro
54 * Performs schoolbook1_iteration on two lists of 128-bit polynomials of length
66 * Computes the product of two 128-bit polynomials at the memory locations
68 * the 256-bit product into LO, MI, HI.
76 * MI += X_0 * Y_1 + X_1 * Y_0
79 * Later, the 256-bit result can be extracted as:
96 vpxor %xmm2, MI, MI
[all …]
Daes-gcm-avx10-x86_64.S1 /* SPDX-License-Identifier: Apache-2.0 OR BSD-2-Clause */
3 // VAES and VPCLMULQDQ optimized AES-GCM for x86_64
9 //------------------------------------------------------------------------------
11 // This file is dual-licensed, meaning that you can use it under your choice of
17 // http://www.apache.org/licenses/LICENSE-2.0
49 //------------------------------------------------------------------------------
51 // This file implements AES-GCM (Galois/Counter Mode) for x86_64 CPUs that
54 // decryption update functions which are the most performance-critical, are
55 // provided in two variants generated from a macro: one using 256-bit vectors
56 // (suffix: vaes_avx10_256) and one using 512-bit vectors (vaes_avx10_512). The
[all …]
/linux-6.15/drivers/video/fbdev/
Dpxa168fb.c2 * linux/drivers/video/pxa168fb.c -- Marvell PXA168 LCD Controller
7 * 2009-02-16 adapted from original version for PXA168/910
27 #include <linux/dma-mapping.h>
42 if (var->bits_per_pixel == 8) in determine_best_pix_fmt()
48 if (var->bits_per_pixel == 16 && var->red.length <= 5 && in determine_best_pix_fmt()
49 var->green.length <= 6 && var->blue.length <= 5) { in determine_best_pix_fmt()
50 if (var->transp.length == 0) { in determine_best_pix_fmt()
51 if (var->red.offset >= var->blue.offset) in determine_best_pix_fmt()
57 if (var->transp.length == 1 && var->green.length <= 5) { in determine_best_pix_fmt()
58 if (var->red.offset >= var->blue.offset) in determine_best_pix_fmt()
[all …]
/linux-6.15/fs/bcachefs/
Dalloc_background.c1 // SPDX-License-Identifier: GPL-2.0
61 u64 v; in alloc_field_v1_get() local
63 if (!(a->fields & (1 << field))) in alloc_field_v1_get()
68 v = *((const u8 *) *p); in alloc_field_v1_get()
71 v = le16_to_cpup(*p); in alloc_field_v1_get()
74 v = le32_to_cpup(*p); in alloc_field_v1_get()
77 v = le64_to_cpup(*p); in alloc_field_v1_get()
84 return v; in alloc_field_v1_get()
90 const struct bch_alloc *in = bkey_s_c_to_alloc(k).v; in bch2_alloc_unpack_v1()
91 const void *d = in->data; in bch2_alloc_unpack_v1()
[all …]
Dalloc_foreground.c1 // SPDX-License-Identifier: GPL-2.0
58 * - They track buckets that have been partially allocated, allowing for
59 * sub-bucket sized allocations - they're used by the sector allocator below
61 * - They provide a reference to the buckets they own that mark and sweep GC
66 * with a reference to an open bucket - the caller is required to put that
74 memset(ca->alloc_cursor, 0, sizeof(ca->alloc_cursor)); in bch2_reset_alloc_cursors()
80 open_bucket_idx_t idx = ob - c->open_buckets; in bch2_open_bucket_hash_add()
81 open_bucket_idx_t *slot = open_bucket_hashslot(c, ob->dev, ob->bucket); in bch2_open_bucket_hash_add()
83 ob->hash = *slot; in bch2_open_bucket_hash_add()
89 open_bucket_idx_t idx = ob - c->open_buckets; in bch2_open_bucket_hash_remove()
[all …]
Dalloc_background.h1 /* SPDX-License-Identifier: GPL-2.0 */
35 return a.gen - a.oldest_gen; in alloc_gc_gen()
40 dst->gen = src.gen; in alloc_to_bucket()
41 dst->data_type = src.data_type; in alloc_to_bucket()
42 dst->stripe_sectors = src.stripe_sectors; in alloc_to_bucket()
43 dst->dirty_sectors = src.dirty_sectors; in alloc_to_bucket()
44 dst->cached_sectors = src.cached_sectors; in alloc_to_bucket()
45 dst->stripe = src.stripe; in alloc_to_bucket()
50 dst->gen = src.gen; in __bucket_m_to_alloc()
51 dst->data_type = src.data_type; in __bucket_m_to_alloc()
[all …]
Dbtree_node_scan.c1 // SPDX-License-Identifier: GPL-2.0
27 bch2_btree_id_level_to_text(out, n->btree_id, n->level); in found_btree_node_to_text()
29 n->seq, n->journal_seq, n->cookie); in found_btree_node_to_text()
30 bch2_bpos_to_text(out, n->min_key); in found_btree_node_to_text()
31 prt_str(out, "-"); in found_btree_node_to_text()
32 bch2_bpos_to_text(out, n->max_key); in found_btree_node_to_text()
34 if (n->range_updated) in found_btree_node_to_text()
37 for (unsigned i = 0; i < n->nr_ptrs; i++) { in found_btree_node_to_text()
39 bch2_extent_ptr_to_text(out, c, n->ptrs + i); in found_btree_node_to_text()
57 set_bkey_val_u64s(&bp->k, sizeof(struct bch_btree_ptr_v2) / sizeof(u64) + f->nr_ptrs); in found_btree_node_to_key()
[all …]
Ddisk_groups.c1 // SPDX-License-Identifier: GPL-2.0
4 #include "sb-members.h"
5 #include "super-io.h"
14 return ((BCH_GROUP_DELETED(l) > BCH_GROUP_DELETED(r)) - in group_cmp()
16 ((BCH_GROUP_PARENT(l) > BCH_GROUP_PARENT(r)) - in group_cmp()
18 strncmp(l->label, r->label, sizeof(l->label)); in group_cmp()
31 for (i = 0; i < sb->nr_devices; i++) { in bch2_sb_disk_groups_validate()
38 group_id = BCH_MEMBER_GROUP(&m) - 1; in bch2_sb_disk_groups_validate()
43 return -BCH_ERR_invalid_sb_disk_groups; in bch2_sb_disk_groups_validate()
46 if (BCH_GROUP_DELETED(&groups->entries[group_id])) { in bch2_sb_disk_groups_validate()
[all …]
Dbackpointers.c1 // SPDX-License-Identifier: GPL-2.0
24 bkey_fsck_err_on(bp.v->level > BTREE_MAX_DEPTH, in bch2_backpointer_validate()
27 bp.v->level, BTREE_MAX_DEPTH); in bch2_backpointer_validate()
29 bkey_fsck_err_on(bp.k->p.inode == BCH_SB_MEMBER_INVALID, in bch2_backpointer_validate()
41 struct bch_dev *ca = bch2_dev_rcu_noerror(c, bp.k->p.inode); in bch2_backpointer_to_text()
44 struct bpos bucket = bp_pos_to_bucket_and_offset(ca, bp.k->p, &bucket_offset); in bch2_backpointer_to_text()
49 …prt_printf(out, "sector=%llu:%llu ", bp.k->p.inode, bp.k->p.offset >> MAX_EXTENT_COMPRESS_RATIO_SH… in bch2_backpointer_to_text()
52 bch2_btree_id_level_to_text(out, bp.v->btree_id, bp.v->level); in bch2_backpointer_to_text()
54 bch2_prt_data_type(out, bp.v->data_type); in bch2_backpointer_to_text()
56 (u32) bp.k->p.offset & ~(~0U << MAX_EXTENT_COMPRESS_RATIO_SHIFT), in bch2_backpointer_to_text()
[all …]
Dextents.c1 // SPDX-License-Identifier: GPL-2.0
27 #include "super-io.h"
32 #define x(n, v) [BCH_EXTENT_FLAG_##n] = #n, argument
53 for (i = f->devs; i < f->devs + f->nr; i++) in bch2_dev_io_failures()
54 if (i->dev == dev) in bch2_dev_io_failures()
64 struct bch_dev_io_failures *f = bch2_dev_io_failures(failed, p->ptr.dev); in bch2_mark_io_failure()
67 BUG_ON(failed->nr >= ARRAY_SIZE(failed->devs)); in bch2_mark_io_failure()
69 f = &failed->devs[failed->nr++]; in bch2_mark_io_failure()
71 f->dev = p->ptr.dev; in bch2_mark_io_failure()
74 if (p->do_ec_reconstruct) in bch2_mark_io_failure()
[all …]
Dbuckets.c1 // SPDX-License-Identifier: GPL-2.0
34 usage->buckets[i] = percpu_u64_get(&ca->usage->d[i].buckets); in bch2_dev_usage_read_fast()
40 acc_u64s_percpu((u64 *) usage, (u64 __percpu *) ca->usage, in bch2_dev_usage_full_read_fast()
55 ret.capacity = c->capacity - in __bch2_fs_usage_read_short()
56 percpu_u64_get(&c->usage->hidden); in __bch2_fs_usage_read_short()
58 data = percpu_u64_get(&c->usage->data) + in __bch2_fs_usage_read_short()
59 percpu_u64_get(&c->usage->btree); in __bch2_fs_usage_read_short()
60 reserved = percpu_u64_get(&c->usage->reserved) + in __bch2_fs_usage_read_short()
61 percpu_u64_get(c->online_reserved); in __bch2_fs_usage_read_short()
64 ret.free = ret.capacity - ret.used; in __bch2_fs_usage_read_short()
[all …]
Dsuper.c1 // SPDX-License-Identifier: GPL-2.0
3 * bcachefs setup/teardown code, and some metadata io - read a superblock and
34 #include "fs-io.h"
35 #include "fs-io-buffered.h"
36 #include "fs-io-direct.h"
52 #include "sb-clean.h"
53 #include "sb-counters.h"
54 #include "sb-errors.h"
55 #include "sb-members.h"
59 #include "super-io.h"
[all …]
Dsysfs.c1 // SPDX-License-Identifier: GPL-2.0
38 #include "super-io.h"
63 if (out.pos && out.buf[out.pos - 1] != '\n') \
67 ret = -ENOMEM; \
70 ret = min_t(size_t, out.pos, PAGE_SIZE - 1); \
193 for (unsigned i = 0; i < ARRAY_SIZE(c->writes); i++) in bch2_write_refs_to_text()
194 prt_printf(out, "%s\t%li\n", bch2_write_refs[i], atomic_long_read(&c->writes[i])); in bch2_write_refs_to_text()
235 struct btree_cache *bc = &c->btree_cache; in BCH_TIME_STATS()
239 mutex_lock(&bc->lock); in BCH_TIME_STATS()
240 list_for_each_entry(b, &bc->live[0].list, list) in BCH_TIME_STATS()
[all …]
Dchardev.c1 // SPDX-License-Identifier: GPL-2.0
14 #include "sb-counters.h"
15 #include "super-io.h"
27 /* returns with ref on ca->ref */
34 if (dev >= c->sb.nr_devices) in bch2_device_lookup()
35 return ERR_PTR(-EINVAL); in bch2_device_lookup()
39 return ERR_PTR(-EINVAL); in bch2_device_lookup()
63 int ret = -EFAULT;
66 return -EFAULT;
69 return -EINVAL;
[all …]
Dsuper-io.c1 // SPDX-License-Identifier: GPL-2.0
14 #include "sb-clean.h"
15 #include "sb-counters.h"
16 #include "sb-downgrade.h"
17 #include "sb-errors.h"
18 #include "sb-members.h"
19 #include "super-io.h"
24 #include <linux/backing-dev.h>
34 #define x(n, v) { \ argument
35 .version = v, \
[all …]
/linux-6.15/arch/arm64/crypto/
Dpolyval-ce-core.S1 /* SPDX-License-Identifier: GPL-2.0 */
22 * two-step process only requires 1 finite field reduction for every 8
58 MI .req v21 label
65 .arch armv8-a+crypto
72 * Computes the product of two 128-bit polynomials in X and Y and XORs the
73 * components of the 256-bit product into LO, MI, HI.
81 * MI += (X_0 + X_1) * (Y_0 + Y_1)
84 * Later, the 256-bit result can be extracted as:
105 eor MI.16b, MI.16b, v27.16b
111 * Same as karatsuba1, except overwrites HI, LO, MI rather than XORing into
[all …]
/linux-6.15/net/sched/
Dact_ife.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * net/sched/ife.c Inter-FE action based on ForCES WG InterFE LFB
6 * draft-ietf-forces-interfelfb-03
9 * "Distributing Linux Traffic Control Classifier-Action
44 int ife_encode_meta_u16(u16 metaval, void *skbdata, struct tcf_meta_info *mi) in ife_encode_meta_u16() argument
48 if (mi->metaval) in ife_encode_meta_u16()
49 edata = *(u16 *)mi->metaval; in ife_encode_meta_u16()
57 return ife_tlv_meta_encode(skbdata, mi->metaid, 2, &edata); in ife_encode_meta_u16()
61 int ife_get_meta_u32(struct sk_buff *skb, struct tcf_meta_info *mi) in ife_get_meta_u32() argument
63 if (mi->metaval) in ife_get_meta_u32()
[all …]
/linux-6.15/arch/xtensa/kernel/
Dsetup.c9 * Copyright (C) 2001 - 2005 Tensilica Inc.
10 * Copyright (C) 2014 - 2016 Cadence Design Systems Inc.
75 * The Xtensa port uses a list of variable-sized tags to pass data to
77 * to be recognised. The list is terminated with a zero-sized
93 struct bp_meminfo *mi = (struct bp_meminfo *)(tag->data); in parse_tag_mem() local
95 if (mi->type != MEMORY_TYPE_CONVENTIONAL) in parse_tag_mem()
96 return -1; in parse_tag_mem()
98 return memblock_add(mi->start, mi->end - mi->start); in parse_tag_mem()
107 struct bp_meminfo *mi = (struct bp_meminfo *)(tag->data); in parse_tag_initrd() local
109 initrd_start = (unsigned long)__va(mi->start); in parse_tag_initrd()
[all …]
/linux-6.15/drivers/net/ethernet/intel/ice/
Dice_parser_rt.c1 // SPDX-License-Identifier: GPL-2.0
8 rt->gpr[ICE_GPR_TSR_IDX] = tsr; in ice_rt_tsr_set()
13 rt->gpr[ICE_GPR_HO_IDX] = ho; in ice_rt_ho_set()
14 memcpy(&rt->gpr[ICE_GPR_HV_IDX], &rt->pkt_buf[ho], ICE_GPR_HV_SIZE); in ice_rt_ho_set()
19 rt->gpr[ICE_GPR_NP_IDX] = pc; in ice_rt_np_set()
24 rt->gpr[ICE_GPR_NN_IDX] = node; in ice_rt_nn_set()
30 struct ice_hw *hw = rt->psr->hw; in ice_rt_flag_set()
37 rt->gpr[ICE_GPR_FLG_IDX + word] |= (u16)BIT(id); in ice_rt_flag_set()
40 rt->gpr[ICE_GPR_FLG_IDX + word] &= ~(u16)BIT(id); in ice_rt_flag_set()
47 struct ice_hw *hw = rt->psr->hw; in ice_rt_gpr_set()
[all …]
/linux-6.15/arch/arm/kernel/
Dopcodes.c1 // SPDX-License-Identifier: GPL-2.0-only
24 0xFF00, /* MI == N set */
26 0xAAAA, /* VS == V set */
30 0xAA55, /* GE == (N==V) */
31 0x55AA, /* LT == (N!=V) */
32 0x0A05, /* GT == (!Z && (N==V)) */
33 0xF5FA, /* LE == (Z || (N!=V)) */
40 * ARM_OPCODE_CONDTEST_FAIL - if condition fails
41 * ARM_OPCODE_CONDTEST_PASS - if condition passes (including AL)
42 * ARM_OPCODE_CONDTEST_UNCOND - if NV condition, or separate unconditional
/linux-6.15/drivers/media/platform/rockchip/rkisp1/
Drkisp1-capture.c1 // SPDX-License-Identifier: (GPL-2.0+ OR MIT)
3 * Rockchip ISP1 Driver - V4l capture device
13 #include <media/v4l2-common.h>
14 #include <media/v4l2-event.h>
15 #include <media/v4l2-fh.h>
16 #include <media/v4l2-ioctl.h>
17 #include <media/v4l2-mc.h>
18 #include <media/v4l2-subdev.h>
19 #include <media/videobuf2-dma-contig.h>
21 #include "rkisp1-common.h"
[all …]
/linux-6.15/drivers/gpu/drm/nouveau/include/nvif/
Dpush.h44 if (push->cur + size >= push->end) { in PUSH_WAIT()
45 int ret = push->wait(push, size); in PUSH_WAIT()
50 push->seg = push->cur + size; in PUSH_WAIT()
58 push->kick(push); in PUSH_KICK()
65 u32 __o = _ppp->cur - (u32 *)_ppp->mem.object.map.ptr; \
66 NVIF_DEBUG(&_ppp->mem.object, "%08x: "f, __o * 4, ##a); \
85 PUSH_ASSERT(_p->cur < _p->seg, "segment overrun"); \
86 PUSH_ASSERT(_p->cur < _p->end, "pushbuf overrun"); \
88 *_p->cur++ = _d; \
91 #define PUSH_DATA_(X,p,m,i0,i1,d,s,f,a...) PUSH_DATA__((p), (d), "-> "#m f, ##a)
[all …]

1234