Home
last modified time | relevance | path

Searched refs:rb (Results 1 – 25 of 66) sorted by relevance

123

/linux-4.19.296/drivers/lightnvm/
Dpblk-rb.c25 void pblk_rb_data_free(struct pblk_rb *rb) in pblk_rb_data_free() argument
30 list_for_each_entry_safe(p, t, &rb->pages, list) { in pblk_rb_data_free()
43 int pblk_rb_init(struct pblk_rb *rb, struct pblk_rb_entry *rb_entry_base, in pblk_rb_init() argument
46 struct pblk *pblk = container_of(rb, struct pblk, rwb); in pblk_rb_init()
53 rb->entries = rb_entry_base; in pblk_rb_init()
54 rb->seg_size = (1 << power_seg_sz); in pblk_rb_init()
55 rb->nr_entries = (1 << power_size); in pblk_rb_init()
56 rb->mem = rb->subm = rb->sync = rb->l2p_update = 0; in pblk_rb_init()
57 rb->flush_point = EMPTY_ENTRY; in pblk_rb_init()
59 spin_lock_init(&rb->w_lock); in pblk_rb_init()
[all …]
Dpblk.h728 int pblk_rb_init(struct pblk_rb *rb, struct pblk_rb_entry *rb_entry_base,
731 void *pblk_rb_entries_ref(struct pblk_rb *rb);
732 int pblk_rb_may_write_user(struct pblk_rb *rb, struct bio *bio,
734 int pblk_rb_may_write_gc(struct pblk_rb *rb, unsigned int nr_entries,
736 void pblk_rb_write_entry_user(struct pblk_rb *rb, void *data,
738 void pblk_rb_write_entry_gc(struct pblk_rb *rb, void *data,
741 struct pblk_w_ctx *pblk_rb_w_ctx(struct pblk_rb *rb, unsigned int pos);
742 void pblk_rb_flush(struct pblk_rb *rb);
744 void pblk_rb_sync_l2p(struct pblk_rb *rb);
745 unsigned int pblk_rb_read_to_bio(struct pblk_rb *rb, struct nvm_rq *rqd,
[all …]
/linux-4.19.296/drivers/misc/mic/scif/
Dscif_rb.c36 void scif_rb_init(struct scif_rb *rb, u32 *read_ptr, u32 *write_ptr, in scif_rb_init() argument
39 rb->rb_base = rb_base; in scif_rb_init()
40 rb->size = (1 << size); in scif_rb_init()
41 rb->read_ptr = read_ptr; in scif_rb_init()
42 rb->write_ptr = write_ptr; in scif_rb_init()
43 rb->current_read_offset = *read_ptr; in scif_rb_init()
44 rb->current_write_offset = *write_ptr; in scif_rb_init()
48 static void memcpy_torb(struct scif_rb *rb, void *header, in memcpy_torb() argument
53 if (header + size >= rb->rb_base + rb->size) { in memcpy_torb()
55 size1 = (u32)(rb->rb_base + rb->size - header); in memcpy_torb()
[all …]
Dscif_rb.h83 void scif_rb_init(struct scif_rb *rb, u32 *read_ptr, u32 *write_ptr,
87 int scif_rb_write(struct scif_rb *rb, void *msg, u32 size);
89 void scif_rb_commit(struct scif_rb *rb);
91 u32 scif_rb_space(struct scif_rb *rb);
95 u32 scif_rb_get_next(struct scif_rb *rb, void *msg, u32 size);
97 void scif_rb_update_read_ptr(struct scif_rb *rb);
99 u32 scif_rb_count(struct scif_rb *rb, u32 size);
/linux-4.19.296/drivers/hid/intel-ish-hid/ishtp/
Dclient-buffers.c32 struct ishtp_cl_rb *rb; in ishtp_cl_alloc_rx_ring() local
37 rb = ishtp_io_rb_init(cl); in ishtp_cl_alloc_rx_ring()
38 if (!rb) { in ishtp_cl_alloc_rx_ring()
42 ret = ishtp_io_rb_alloc_buf(rb, len); in ishtp_cl_alloc_rx_ring()
46 list_add_tail(&rb->list, &cl->free_rb_list.list); in ishtp_cl_alloc_rx_ring()
105 struct ishtp_cl_rb *rb; in ishtp_cl_free_rx_ring() local
111 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, in ishtp_cl_free_rx_ring()
113 list_del(&rb->list); in ishtp_cl_free_rx_ring()
114 kfree(rb->buffer.data); in ishtp_cl_free_rx_ring()
115 kfree(rb); in ishtp_cl_free_rx_ring()
[all …]
Dclient.c33 struct ishtp_cl_rb *rb; in ishtp_read_list_flush() local
38 list_for_each_entry_safe(rb, next, &cl->dev->read_list.list, list) in ishtp_read_list_flush()
39 if (rb->cl && ishtp_cl_cmp_id(cl, rb->cl)) { in ishtp_read_list_flush()
40 list_del(&rb->list); in ishtp_read_list_flush()
41 ishtp_io_rb_free(rb); in ishtp_read_list_flush()
442 struct ishtp_cl_rb *rb; in ishtp_cl_read_start() local
472 rb = NULL; in ishtp_cl_read_start()
476 rb = list_entry(cl->free_rb_list.list.next, struct ishtp_cl_rb, list); in ishtp_cl_read_start()
477 list_del_init(&rb->list); in ishtp_cl_read_start()
480 rb->cl = cl; in ishtp_cl_read_start()
[all …]
/linux-4.19.296/lib/
Drbtree_test.c19 struct rb_node rb; member
38 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
44 rb_link_node(&node->rb, parent, new); in insert()
45 rb_insert_color(&node->rb, &root->rb_root); in insert()
56 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
64 rb_link_node(&node->rb, parent, new); in insert_cached()
65 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
70 rb_erase(&node->rb, &root->rb_root); in erase()
75 rb_erase_cached(&node->rb, root); in erase_cached()
82 if (node->rb.rb_left) { in augment_recompute()
[all …]
/linux-4.19.296/fs/jffs2/
Dnodelist.h230 struct rb_node rb; member
271 struct rb_node rb; member
334 return rb_entry(node, struct jffs2_node_frag, rb); in frag_first()
344 return rb_entry(node, struct jffs2_node_frag, rb); in frag_last()
347 #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
348 #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
349 #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
350 #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
351 #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
352 #define frag_erase(frag, list) rb_erase(&frag->rb, list);
[all …]
Dnodelist.c124 struct rb_node *parent = &base->rb; in jffs2_fragtree_insert()
131 base = rb_entry(parent, struct jffs2_node_frag, rb); in jffs2_fragtree_insert()
134 link = &base->rb.rb_right; in jffs2_fragtree_insert()
136 link = &base->rb.rb_left; in jffs2_fragtree_insert()
143 rb_link_node(&newfrag->rb, &base->rb, link); in jffs2_fragtree_insert()
189 rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
193 rb_link_node(&holefrag->rb, NULL, &root->rb_node); in no_overlapping_node()
195 rb_insert_color(&holefrag->rb, root); in no_overlapping_node()
204 rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); in no_overlapping_node()
207 rb_link_node(&newfrag->rb, NULL, &root->rb_node); in no_overlapping_node()
[all …]
Dreadinode.c185 tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb); in jffs2_lookup_tn()
188 next = tn->rb.rb_right; in jffs2_lookup_tn()
190 next = tn->rb.rb_left; in jffs2_lookup_tn()
286 rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); in jffs2_add_tn_to_tree()
344 insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); in jffs2_add_tn_to_tree()
346 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
349 link = &insert_point->rb.rb_left; in jffs2_add_tn_to_tree()
351 link = &insert_point->rb.rb_right; in jffs2_add_tn_to_tree()
353 rb_link_node(&tn->rb, &insert_point->rb, link); in jffs2_add_tn_to_tree()
354 rb_insert_color(&tn->rb, &rii->tn_root); in jffs2_add_tn_to_tree()
[all …]
/linux-4.19.296/include/linux/
Drbtree_augmented.h78 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
80 while (rb != stop) { \
81 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
86 rb = rb_parent(&node->rbfield); \
119 #define rb_color(rb) __rb_color((rb)->__rb_parent_color) argument
120 #define rb_is_red(rb) __rb_is_red((rb)->__rb_parent_color) argument
121 #define rb_is_black(rb) __rb_is_black((rb)->__rb_parent_color) argument
123 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) in rb_set_parent() argument
125 rb->__rb_parent_color = rb_color(rb) | (unsigned long)p; in rb_set_parent()
128 static inline void rb_set_parent_color(struct rb_node *rb, in rb_set_parent_color() argument
[all …]
Dinterval_tree_generic.h184 struct rb_node *rb = node->ITRB.rb_right, *prev; \
194 if (rb) { \
195 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
203 rb = rb_parent(&node->ITRB); \
204 if (!rb) \
207 node = rb_entry(rb, ITSTRUCT, ITRB); \
208 rb = node->ITRB.rb_right; \
209 } while (prev == rb); \
/linux-4.19.296/drivers/xen/xenbus/
Dxenbus_dev_frontend.c130 struct read_buffer *rb; in xenbus_file_read() local
148 rb = list_entry(u->read_buffers.next, struct read_buffer, list); in xenbus_file_read()
151 size_t sz = min_t(size_t, len - i, rb->len - rb->cons); in xenbus_file_read()
153 ret = copy_to_user(ubuf + i, &rb->msg[rb->cons], sz); in xenbus_file_read()
156 rb->cons += sz - ret; in xenbus_file_read()
165 if (rb->cons == rb->len) { in xenbus_file_read()
166 list_del(&rb->list); in xenbus_file_read()
167 kfree(rb); in xenbus_file_read()
170 rb = list_entry(u->read_buffers.next, in xenbus_file_read()
191 struct read_buffer *rb; in queue_reply() local
[all …]
/linux-4.19.296/fs/ocfs2/
Drefcounttree.c85 struct ocfs2_refcount_block *rb = in ocfs2_validate_refcount_block() local
97 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &rb->rf_check); in ocfs2_validate_refcount_block()
105 if (!OCFS2_IS_VALID_REFCOUNT_BLOCK(rb)) { in ocfs2_validate_refcount_block()
109 rb->rf_signature); in ocfs2_validate_refcount_block()
113 if (le64_to_cpu(rb->rf_blkno) != bh->b_blocknr) { in ocfs2_validate_refcount_block()
117 (unsigned long long)le64_to_cpu(rb->rf_blkno)); in ocfs2_validate_refcount_block()
121 if (le32_to_cpu(rb->rf_fs_generation) != OCFS2_SB(sb)->fs_generation) { in ocfs2_validate_refcount_block()
125 le32_to_cpu(rb->rf_fs_generation)); in ocfs2_validate_refcount_block()
459 struct ocfs2_refcount_block *rb; in ocfs2_lock_refcount_tree() local
485 rb = (struct ocfs2_refcount_block *)ref_root_bh->b_data; in ocfs2_lock_refcount_tree()
[all …]
/linux-4.19.296/fs/nilfs2/
Drecovery.c341 struct nilfs_recovery_block *rb; in nilfs_scan_dsync_log() local
349 rb = kmalloc(sizeof(*rb), GFP_NOFS); in nilfs_scan_dsync_log()
350 if (unlikely(!rb)) { in nilfs_scan_dsync_log()
354 rb->ino = ino; in nilfs_scan_dsync_log()
355 rb->blocknr = blocknr++; in nilfs_scan_dsync_log()
356 rb->vblocknr = le64_to_cpu(binfo->bi_vblocknr); in nilfs_scan_dsync_log()
357 rb->blkoff = le64_to_cpu(binfo->bi_blkoff); in nilfs_scan_dsync_log()
359 list_add_tail(&rb->list, head); in nilfs_scan_dsync_log()
378 struct nilfs_recovery_block *rb; in dispose_recovery_list() local
380 rb = list_first_entry(head, struct nilfs_recovery_block, list); in dispose_recovery_list()
[all …]
/linux-4.19.296/drivers/i2c/
Di2c-stub.c102 struct smbus_block_data *b, *rb = NULL; in stub_find_block() local
106 rb = b; in stub_find_block()
110 if (rb == NULL && create) { in stub_find_block()
111 rb = devm_kzalloc(dev, sizeof(*rb), GFP_KERNEL); in stub_find_block()
112 if (rb == NULL) in stub_find_block()
113 return rb; in stub_find_block()
114 rb->command = command; in stub_find_block()
115 list_add(&rb->node, &chip->smbus_blocks); in stub_find_block()
117 return rb; in stub_find_block()
/linux-4.19.296/fs/ubifs/
Dorphan.c85 o = rb_entry(parent, struct ubifs_orphan, rb); in ubifs_add_orphan()
99 rb_link_node(&orphan->rb, parent, p); in ubifs_add_orphan()
100 rb_insert_color(&orphan->rb, &c->orph_tree); in ubifs_add_orphan()
123 o = rb_entry(p, struct ubifs_orphan, rb); in ubifs_delete_orphan()
451 rb_erase(&orphan->rb, &c->orph_tree); in erase_deleted()
525 o = rb_entry(parent, struct ubifs_orphan, rb); in insert_dead_orphan()
537 rb_link_node(&orphan->rb, parent, p); in insert_dead_orphan()
538 rb_insert_color(&orphan->rb, &c->orph_tree); in insert_dead_orphan()
734 struct rb_node rb; member
755 o = rb_entry(p, struct ubifs_orphan, rb); in dbg_find_orphan()
[all …]
Dlog.c50 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_search_bud()
83 bud = rb_entry(p, struct ubifs_bud, rb); in ubifs_get_wbuf()
134 b = rb_entry(parent, struct ubifs_bud, rb); in ubifs_add_bud()
142 rb_link_node(&bud->rb, parent, p); in ubifs_add_bud()
143 rb_insert_color(&bud->rb, &c->buds); in ubifs_add_bud()
314 bud = rb_entry(p1, struct ubifs_bud, rb); in remove_buds()
540 struct rb_node rb; member
559 dr = rb_entry(parent, struct done_ref, rb); in done_already()
574 rb_link_node(&dr->rb, parent, p); in done_already()
575 rb_insert_color(&dr->rb, done_tree); in done_already()
[all …]
/linux-4.19.296/fs/kernfs/
Ddir.c34 #define rb_to_kn(X) rb_entry((X), struct kernfs_node, rb)
75 struct kernfs_root *ra = kernfs_root(a), *rb = kernfs_root(b); in kernfs_common_ancestor() local
77 if (ra != rb) in kernfs_common_ancestor()
81 db = kernfs_depth(rb->kn, b); in kernfs_common_ancestor()
368 node = &pos->rb.rb_left; in kernfs_link_sibling()
370 node = &pos->rb.rb_right; in kernfs_link_sibling()
376 rb_link_node(&kn->rb, parent, node); in kernfs_link_sibling()
377 rb_insert_color(&kn->rb, &kn->parent->dir.children); in kernfs_link_sibling()
399 if (RB_EMPTY_NODE(&kn->rb)) in kernfs_unlink_sibling()
405 rb_erase(&kn->rb, &kn->parent->dir.children); in kernfs_unlink_sibling()
[all …]
/linux-4.19.296/crypto/
Dtgr192.c402 static void tgr192_round(u64 * ra, u64 * rb, u64 * rc, u64 x, int mul) in tgr192_round() argument
405 u64 b = *rb; in tgr192_round()
416 *rb = b; in tgr192_round()
421 static void tgr192_pass(u64 * ra, u64 * rb, u64 * rc, u64 * x, int mul) in tgr192_pass() argument
424 u64 b = *rb; in tgr192_pass()
437 *rb = b; in tgr192_pass()
/linux-4.19.296/fs/btrfs/
Dextent_map.c229 struct rb_node *rb; in try_merge_map() local
243 rb = rb_prev(&em->rb_node); in try_merge_map()
244 if (rb) in try_merge_map()
245 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
246 if (rb && mergable_maps(merge, em)) { in try_merge_map()
262 rb = rb_next(&em->rb_node); in try_merge_map()
263 if (rb) in try_merge_map()
264 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
265 if (rb && mergable_maps(em, merge)) { in try_merge_map()
/linux-4.19.296/drivers/of/
Dof_reserved_mem.c213 const struct reserved_mem *ra = a, *rb = b; in __rmem_cmp() local
215 if (ra->base < rb->base) in __rmem_cmp()
218 if (ra->base > rb->base) in __rmem_cmp()
226 if (ra->size < rb->size) in __rmem_cmp()
228 if (ra->size > rb->size) in __rmem_cmp()
/linux-4.19.296/drivers/iio/
Dindustrialio-buffer.c110 struct iio_buffer *rb = indio_dev->buffer; in iio_buffer_read_first_n_outer() local
119 if (!rb || !rb->access->read_first_n) in iio_buffer_read_first_n_outer()
122 datum_size = rb->bytes_per_datum; in iio_buffer_read_first_n_outer()
134 to_wait = min_t(size_t, n / datum_size, rb->watermark); in iio_buffer_read_first_n_outer()
136 add_wait_queue(&rb->pollq, &wait); in iio_buffer_read_first_n_outer()
143 if (!iio_buffer_ready(indio_dev, rb, to_wait, n / datum_size)) { in iio_buffer_read_first_n_outer()
154 ret = rb->access->read_first_n(rb, n, buf); in iio_buffer_read_first_n_outer()
158 remove_wait_queue(&rb->pollq, &wait); in iio_buffer_read_first_n_outer()
176 struct iio_buffer *rb = indio_dev->buffer; in iio_buffer_poll() local
178 if (!indio_dev->info || rb == NULL) in iio_buffer_poll()
[all …]
/linux-4.19.296/drivers/i2c/busses/
Di2c-cpm.c197 u_char *rb; in cpm_i2c_parse_message() local
206 rb = cpm->rxbuf[rx]; in cpm_i2c_parse_message()
209 rb = (u_char *) (((ulong) rb + 1) & ~1); in cpm_i2c_parse_message()
255 u_char *rb; in cpm_i2c_check_message() local
262 rb = cpm->rxbuf[rx]; in cpm_i2c_check_message()
265 rb = (u_char *) (((uint) rb + 1) & ~1); in cpm_i2c_check_message()
285 memcpy(pmsg->buf, rb, pmsg->len); in cpm_i2c_check_message()
/linux-4.19.296/fs/xfs/
Dxfs_trans_refcount.c79 struct xfs_refcount_intent *rb; in xfs_refcount_update_diff_items() local
82 rb = container_of(b, struct xfs_refcount_intent, ri_list); in xfs_refcount_update_diff_items()
84 XFS_FSB_TO_AGNO(mp, rb->ri_startblock); in xfs_refcount_update_diff_items()

123