/linux-master/fs/bcachefs/ |
H A D | bkey_sort.h | 43 bch2_key_sort_fix_overlapping(struct bch_fs *, struct bset *, 47 bch2_sort_repack(struct bset *, struct btree *,
|
H A D | btree_types.h | 41 * better: see comments in bset.c at cacheline_to_bkey() for 571 static inline struct bset *bset(const struct btree *b, function 580 __btree_node_ptr_to_offset(b, vstruct_last(bset(b, t))); 584 const struct bset *i) 590 static inline struct bset *btree_bset_first(struct btree *b) 592 return bset(b, b->set); 595 static inline struct bset *btree_bset_last(struct btree *b) 597 return bset(b, bset_tree_last(b)); 614 return t->data_offset + offsetof(struct bset, _dat [all...] |
H A D | bset.h | 40 * A bset is an array of bkeys laid out contiguously in memory in sorted order, 48 * (described below) for searching an individial bset, and on top of that we 53 * Most of the code in bcache doesn't care about an individual bset - it needs 62 * Since keys are variable length, we can't use a binary search on a bset - we 181 * It definites the number of bytes (in struct bset) per struct bkey_float in 186 * we're touching one fewer cacheline in the bset tree in exchange for one more 254 static inline struct bset *bset_next_set(struct btree *b, 257 struct bset *i = btree_bset_last(b); 266 void bch2_bset_init_first(struct btree *, struct bset *); 464 unsigned bset, [all...] |
H A D | Makefile | 12 bset.o \
|
H A D | btree_io.c | 92 static void set_needs_whiteout(struct bset *i, int v) 210 (compacting && !bset_written(b, bset(b, t))); 224 struct bset *i = bset(b, t); 297 struct bset *start_bset = bset(b, &b->set[start_idx]); 309 u64s += le16_to_cpu(bset(b, t)->u64s); 333 /* Make sure we preserve bset journal_seq: */ 335 seq = max(seq, le64_to_cpu(bset(b, t)->journal_seq)); 414 * We're about to add another bset t [all...] |
H A D | bkey_sort.c | 6 #include "bset.h" 95 bch2_key_sort_fix_overlapping(struct bch_fs *c, struct bset *dst, 123 bch2_sort_repack(struct bset *dst, struct btree *src,
|
H A D | btree_io.h | 6 #include "bset.h" 93 static inline struct nonce btree_nonce(struct bset *i, unsigned offset) 103 static inline int bset_encrypt(struct bch_fs *c, struct bset *i, unsigned offset)
|
H A D | btree_update_interior.h | 224 static inline bool bset_written(struct btree *b, struct bset *i) 278 if (unlikely(bset_written(b, bset(b, t)))) { 311 * write lock must be held on @b (else the dirty bset that we were going to
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/pmu/fuc/ |
H A D | idle.fuc | 53 bset $flags $p0 72 bset $flags $p2
|
H A D | i2c_.fuc | 106 bset $flags $p1 115 bset $flags $p1 230 bset $flags $p1 292 bset $r13 3 322 bset $flags $p2
|
/linux-master/drivers/md/bcache/ |
H A D | Makefile | 5 bcache-y := alloc.o bset.o btree.o debug.o extents.o io.o\
|
H A D | bset.h | 40 * A bset is an array of bkeys laid out contiguously in memory in sorted order, 48 * (described below) for searching an individial bset, and on top of that we 53 * Most of the code in bcache doesn't care about an individual bset - it needs 62 * Since keys are variable length, we can't use a binary search on a bset - we 161 * better: see comments in bset.c at cacheline_to_bkey() for 176 * The nodes in the bset tree point to specific keys - this 186 struct bset *data; 250 struct bset *i) 256 struct bset *i) 284 static inline struct bset *bset_next_se [all...] |
H A D | btree.h | 102 #include "bset.h" 180 static inline struct bset *btree_bset_first(struct btree *b) 185 static inline struct bset *btree_bset_last(struct btree *b) 190 static inline unsigned int bset_block_offset(struct btree *b, struct bset *i)
|
H A D | debug.c | 34 struct bset *ondisk, *sorted, *inmemory; 72 struct bset *i;
|
/linux-master/block/ |
H A D | bsg-lib.c | 278 struct bsg_set *bset = local 291 ret = bset->job_fn(blk_mq_rq_to_pdu(req)); 323 struct bsg_set *bset = local 326 bsg_unregister_queue(bset->bd); 329 blk_mq_free_tag_set(&bset->tag_set); 330 kfree(bset); 337 struct bsg_set *bset = local 340 if (!bset->timeout_fn) 342 return bset->timeout_fn(rq); 364 struct bsg_set *bset; local [all...] |
/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/gr/fuc/ |
H A D | com.fuc | 68 bset $flags $p1 96 bset $r12 31 // MMIO_CTRL_PENDING 115 bset $r12 31 // MMIO_CTRL_PENDING 116 bset $r12 30 // MMIO_CTRL_WRITE 190 bset $r9 0 // BASE_EN 196 bset $r9 1 // MULTI_EN 201 bset $r11 12 // QLIMIT = 0x10 237 bset $r11 12 // QLIMIT = 0x10 238 bset $r11 18 // STOP_TRIGGER
|
/linux-master/arch/arc/lib/ |
H A D | strcmp.S | 42 bset.lo r0,r0,31 58 bset.lo r0,r0,31 80 bset.lo r0,r0,31
|
H A D | strcmp-archs.S | 42 bset.lo r0, r0, 31 61 bset.lo r0, r0, 31
|
H A D | memcmp.S | 60 bset r0,r0,SHIFT 104 bset.cs r0,r0,31 109 bset.cs r0,r0,31
|
/linux-master/arch/m68k/math-emu/ |
H A D | fp_emu.h | 133 bset #(\bit&7),(FPD_FPSR+3-(\bit/8),FPDATA)
|
H A D | fp_cond.S | 181 bset #15,%d1 182 bset #7,%d1
|
H A D | fp_util.S | 138 bset #31,%d0 | set explizit bit 176 bset #31,%d0 | set explizit bit 637 4: bset #30,%d0 761 bset #0,%d0 | Yes, so set the "sticky bit". 776 bset #0,%d0 | Sticky bit. 780 bset #0,%d0 873 bset #0,%d0 941 bset #0,%d0 | Sticky bit. 946 bset #0,%d0 | Sticky bit. 1033 bset # [all...] |
/linux-master/arch/arc/kernel/ |
H A D | head.S | 32 bset r5, r5, 0 ; I$ exists, but is not used 44 bset r5, r5, 0 ; Disable (+Inv) 56 bset r5, r5, STATUS_AD_BIT
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/ce/fuc/ |
H A D | com.fuc | 151 bset $flags ie0 159 bset $flags $p0 265 bset $flags $p1 408 bset $r3 0x1e 448 bset $flags $p2 556 bset $r4 $r7 813 bset $r4 7 816 bset $flags $p2 824 bset $r4 8
|
/linux-master/arch/m68k/lib/ |
H A D | udivsi3.S | 149 bset IMM (0),d0 | set the low order bit of a to 1,
|