Home
last modified time | relevance | path

Searched refs:KEY_SIZE (Results 1 – 22 of 22) sorted by relevance

/linux/drivers/md/bcache/
A Dextents.c93 if (!KEY_SIZE(k)) in bch_ptr_status()
294 if (!KEY_SIZE(i->k)) { in bch_extent_sort_fixup()
349 BUG_ON(!KEY_SIZE(insert)); in bch_extent_insert_fixup()
358 if (KEY_SIZE(k)) in bch_extent_insert_fixup()
368 old_size = KEY_SIZE(k); in bch_extent_insert_fixup()
423 KEY_SIZE(insert)); in bch_extent_insert_fixup()
490 KEY_SIZE(insert)); in bch_extent_insert_fixup()
499 if (!KEY_SIZE(k)) in __bch_extent_invalid()
502 if (KEY_SIZE(k) > KEY_OFFSET(k)) in __bch_extent_invalid()
614 if (KEY_SIZE(l) + KEY_SIZE(r) > USHRT_MAX) { in bch_extent_merge()
[all …]
A Ddebug.c26 (void *) i < (void *) (start) + (KEY_SIZE(&b->key) << 9) &&\
55 bio->bi_iter.bi_size = KEY_SIZE(&v->key) << 9; in bch_btree_verify()
62 memcpy(ondisk, sorted, KEY_SIZE(&v->key) << 9); in bch_btree_verify()
A Dmovinggc.c83 DIV_ROUND_UP(KEY_SIZE(&io->w->key), PAGE_SECTORS), 0); in moving_init()
87 bio->bi_iter.bi_size = KEY_SIZE(&io->w->key) << 9; in moving_init()
149 DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS)), in read_moving()
A Dwriteback.c335 DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS), 0); in dirty_init()
339 bio->bi_iter.bi_size = KEY_SIZE(&w->key) << 9; in dirty_init()
531 size += KEY_SIZE(&next->key); in read_dirty()
540 DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS)), in read_dirty()
863 KEY_START(k), KEY_SIZE(k)); in sectors_dirty_init_fn()
A Dbcache_ondisk.h51 KEY_FIELD(KEY_SIZE, high, 20, KEY_SIZE_BITS)
83 #define KEY_START(k) (KEY_OFFSET(k) - KEY_SIZE(k))
A Dbset.c64 ret += KEY_SIZE(k); in __bch_count_data()
214 SET_PTR_OFFSET(k, i, PTR_OFFSET(k, i) + KEY_SIZE(k) - len); in __bch_cut_front()
216 BUG_ON(len > KEY_SIZE(k)); in __bch_cut_front()
235 BUG_ON(len > KEY_SIZE(k)); in __bch_cut_back()
890 BUG_ON(b->ops->is_extents && !KEY_SIZE(k)); in bch_btree_insert_key()
925 KEY_PTRS(m) == KEY_PTRS(k) && !KEY_SIZE(m)) in bch_btree_insert_key()
A Dbtree.c209 bset_sector_offset(&b->keys, i) < KEY_SIZE(&b->key); in bch_btree_node_read_done()
254 bio->bi_iter.bi_size = KEY_SIZE(&b->key) << 9; in bch_btree_node_read()
545 return ilog2(KEY_SIZE(k) / PAGE_SECTORS ?: 1); in btree_order()
1271 GC_SECTORS_USED(g) + KEY_SIZE(k), in __bch_btree_mark_key()
1330 gc->data += KEY_SIZE(k); in btree_gc_mark_node()
2667 if (!KEY_SIZE(k)) /* end key */ in refill_keybuf_fn()
A Dbcache.h763 ((unsigned int) (KEY_SIZE(&b->key) >> (b)->c->block_bits))
A Drequest.c227 n = bio_next_split(bio, KEY_SIZE(k), GFP_NOIO, split); in CLOSURE_CALLBACK()
553 if (!KEY_SIZE(k)) in cache_lookup_fn()
A Dsuper.c433 bio->bi_iter.bi_size = KEY_SIZE(k) << 9; in uuid_io()
/linux/fs/reiserfs/
A Dibalance.c170 memcpy(ih, inserted, KEY_SIZE); in internal_insert_childs()
172 memcpy(ih + 1, inserted + 1, KEY_SIZE); in internal_insert_childs()
178 KEY_SIZE)); in internal_insert_childs()
248 (nr - first_i - del_num) * KEY_SIZE + (nr + 1 - in internal_delete_pointers_items()
255 (del_num * (KEY_SIZE + DC_SIZE))); in internal_delete_pointers_items()
375 dc_size(t_dc) + (KEY_SIZE * (cpy_num - 1) + in internal_copy_pointers_items()
449 RFALSE(B_FREE_SPACE(dest) < KEY_SIZE, in internal_insert_key()
473 put_dc_size(t_dc, dc_size(t_dc) + KEY_SIZE); in internal_insert_key()
1066 KEY_SIZE); in balance_internal()
1079 KEY_SIZE); in balance_internal()
[all …]
A Dfix_node.c66 vn->vn_nr_item = (vn->vn_size - DC_SIZE) / (DC_SIZE + KEY_SIZE); in create_virtual_node()
205 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
291 tb->rnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_right()
431 i = ((to - from) * (KEY_SIZE + DC_SIZE) + DC_SIZE); in get_num_ver()
1293 + ((h) ? KEY_SIZE : 0)) { in can_node_be_removed()
1796 (DC_SIZE + KEY_SIZE); in dc_check_balance_internal()
1813 (DC_SIZE + KEY_SIZE); in dc_check_balance_internal()
1858 KEY_SIZE); in dc_check_balance_internal()
1873 KEY_SIZE); in dc_check_balance_internal()
2692 KEY_SIZE) * (tb->blknum[h] - 1) + in fix_nodes()
[all …]
A Dstree.c509 if (nr > (blocksize - BLKH_SIZE - DC_SIZE) / (KEY_SIZE + DC_SIZE)) { in is_internal()
515 used_space = BLKH_SIZE + KEY_SIZE * nr + DC_SIZE * (nr + 1); in is_internal()
774 KEY_SIZE, in search_by_key()
A Ddo_balan.c1249 memcpy(insert_key + i, leaf_key(tb->S_new[i], 0), KEY_SIZE); in balance_leaf_new_nodes()
1571 KEY_SIZE); in replace_key()
1574 KEY_SIZE); in replace_key()
A Dlbalance.c73 memcpy(&new_ih.ih_key, &ih->ih_key, KEY_SIZE); in leaf_copy_dir_entries()
478 memcpy(&n_ih.ih_key, &ih->ih_key, KEY_SIZE); in leaf_item_bottle()
A Dreiserfs.h1328 #define KEY_SIZE (sizeof(struct reiserfs_key)) macro
2048 ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
2063 #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
2998 memcpy(to, from, KEY_SIZE); in copy_key()
A Dprints.c756 bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - in check_internal_block_head()
A Dinode.c1506 memset(INODE_PKEY(inode), 0, KEY_SIZE); in reiserfs_make_bad_inode()
1950 memcpy(INODE_PKEY(inode), &ih.ih_key, KEY_SIZE); in reiserfs_new_inode()
/linux/drivers/infiniband/hw/hfi1/
A Dfirmware.c73 #define KEY_SIZE 256 macro
86 u8 modulus[KEY_SIZE];
88 u8 signature[KEY_SIZE];
94 u8 modulus[KEY_SIZE];
96 u8 signature[KEY_SIZE];
97 u8 r2[KEY_SIZE];
375 invalid_header(dd, "key_size", css->key_size, KEY_SIZE / 4) || in verify_css_header()
377 KEY_SIZE / 4) || in verify_css_header()
784 write_rsa_data(dd, MISC_CFG_RSA_SIGNATURE, signature, KEY_SIZE); in run_rsa()
892 write_rsa_data(dd, MISC_CFG_RSA_MODULUS, fdet->modulus, KEY_SIZE); in load_security_variables()
[all …]
/linux/include/trace/events/
A Dbcache.h55 __entry->size = KEY_SIZE(k);
352 __entry->size = KEY_SIZE(k);
/linux/tools/bpf/bpftool/Documentation/
A Dbpftool-map.rst29 | **bpftool** **map create** *FILE* **type** *TYPE* **key** *KEY_SIZE* **value** *VALUE_SIZE* \
75 bpftool map create *FILE* type *TYPE* key *KEY_SIZE* value *VALUE_SIZE* entries *MAX_ENTRIES* name…
/linux/drivers/crypto/ccree/
A Dcc_hw_queue_defs.h53 #define WORD4_KEY_SIZE CC_HWQ_GENMASK(4, KEY_SIZE)

Completed in 97 milliseconds