Searched refs:rb (Results 1 - 23 of 23) sorted by relevance

/u-boot/include/linux/
H A Drbtree_augmented.h43 rbname ## _propagate(struct rb_node *rb, struct rb_node *stop) \
45 while (rb != stop) { \
46 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
51 rb = rb_parent(&node->rbfield); \
82 #define rb_color(rb) __rb_color((rb)->__rb_parent_color)
83 #define rb_is_red(rb) __rb_is_red((rb)->__rb_parent_color)
84 #define rb_is_black(rb) __rb_is_black((rb)
86 rb_set_parent(struct rb_node *rb, struct rb_node *p) argument
91 rb_set_parent_color(struct rb_node *rb, struct rb_node *p, int color) argument
[all...]
/u-boot/drivers/mtd/ubi/
H A Dwl.c155 e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);
170 rb_link_node(&e->u.rb, parent, p);
171 rb_insert_color(&e->u.rb, root);
251 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
311 e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
318 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
352 first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
353 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb);
356 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);
392 rb_erase(&e->u.rb,
1415 struct rb_node *rb; local
[all...]
H A Dattach.c270 av = rb_entry(parent, struct ubi_ainf_volume, rb);
297 rb_link_node(&av->rb, parent, p);
298 rb_insert_color(&av->rb, &ai->volumes);
481 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
592 rb_link_node(&aeb->u.rb, parent, p);
593 rb_insert_color(&aeb->u.rb, &av->root);
612 av = rb_entry(p, struct ubi_ainf_volume, rb);
633 struct rb_node *rb; local
638 while ((rb = rb_first(&av->root))) {
639 aeb = rb_entry(rb, struc
1171 struct rb_node *rb; local
[all...]
H A Dubi.h164 * @u.rb: link in the corresponding (free/used) RB-tree
175 struct rb_node rb; member in union:ubi_wl_entry::__anon89
184 * @rb: links RB-tree nodes
197 struct rb_node rb; member in struct:ubi_ltree_entry
644 * @u.rb: link in the per-volume RB-tree of &struct ubi_ainf_peb objects
660 struct rb_node rb; member in union:ubi_ainf_peb::__anon90
679 * @rb: link in the volume RB-tree
695 struct rb_node rb; member in struct:ubi_ainf_volume
962 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->free, u.rb)
971 ubi_rb_for_each_entry((tmp_rb), (e), &(ubi)->used, u.rb)
[all...]
H A Dfastmap-wl.c39 ubi_rb_for_each_entry(p, e, root, u.rb) {
72 ubi_rb_for_each_entry(p, e, root, u.rb)
107 rb_erase(&e->u.rb, &ubi->free);
154 rb_erase(&e->u.rb, &ubi->free);
392 struct ubi_wl_entry, u.rb);
H A Deba.c100 le = rb_entry(p, struct ubi_ltree_entry, rb);
166 le1 = rb_entry(parent, struct ubi_ltree_entry, rb);
181 rb_link_node(&le->rb, parent, p);
182 rb_insert_color(&le->rb, &ubi->ltree);
227 rb_erase(&le->rb, &ubi->ltree);
279 rb_erase(&le->rb, &ubi->ltree);
303 rb_erase(&le->rb, &ubi->ltree);
1301 struct rb_node *rb; local
1341 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb)
1393 struct rb_node *rb; local
[all...]
H A Dfastmap.c197 av = rb_entry(parent, struct ubi_ainf_volume, rb);
223 rb_link_node(&av->rb, parent, p);
224 rb_insert_color(&av->rb, &ai->volumes);
248 tmp_aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
263 rb_link_node(&aeb->u.rb, parent, p);
264 rb_insert_color(&aeb->u.rb, &av->root);
287 aeb = rb_entry(parent, struct ubi_ainf_peb, u.rb);
358 rb_link_node(&new_aeb->u.rb, parent, p);
359 rb_insert_color(&new_aeb->u.rb, &av->root);
391 tmp_av = rb_entry(parent, struct ubi_ainf_volume, rb);
[all...]
H A Dvtbl.c377 struct rb_node *rb; local
410 ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) {
/u-boot/test/cmd/
H A Drw.c41 static void init_buffers(char *rb, char *wb, size_t size, unsigned seed) argument
43 memset(rb, 0, size);
/u-boot/fs/ubifs/
H A Dlog.c43 bud = rb_entry(p, struct ubifs_bud, rb);
76 bud = rb_entry(p, struct ubifs_bud, rb);
127 b = rb_entry(parent, struct ubifs_bud, rb);
135 rb_link_node(&bud->rb, parent, p);
136 rb_insert_color(&bud->rb, &c->buds);
307 bud = rb_entry(p1, struct ubifs_bud, rb);
529 * @rb: rb-tree node
533 struct rb_node rb; member in struct:done_ref
539 * @done_tree: rb
[all...]
H A Dorphan.c37 * Orphans are accumulated in a rb-tree. When an inode's link count drops to
38 * zero, the inode number is added to the rb-tree. It is removed from the tree
76 o = rb_entry(parent, struct ubifs_orphan, rb);
90 rb_link_node(&orphan->rb, parent, p);
91 rb_insert_color(&orphan->rb, &c->orph_tree);
114 o = rb_entry(p, struct ubifs_orphan, rb);
442 rb_erase(&orphan->rb, &c->orph_tree);
500 * must be kept until the next commit, so it is added to the rb-tree and the
516 o = rb_entry(parent, struct ubifs_orphan, rb);
528 rb_link_node(&orphan->rb, paren
725 struct rb_node rb; member in struct:check_orphan
[all...]
H A Drecovery.c1240 * @rb: link in the RB-tree of sizes
1248 struct rb_node rb; member in struct:size_entry
1272 e = rb_entry(parent, struct size_entry, rb);
1288 rb_link_node(&e->rb, parent, p);
1289 rb_insert_color(&e->rb, &c->size_tree);
1305 e = rb_entry(p, struct size_entry, rb);
1327 rb_erase(&e->rb, &c->size_tree);
1339 rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) {
1358 * To accomplish those purposes, a rb-tree is constructed containing an entry
1491 e = rb_entry(this, struct size_entry, rb);
[all...]
H A Ddebug.c593 struct rb_node *rb; local
635 for (rb = rb_first(&c->buds); rb; rb = rb_next(rb)) {
636 bud = rb_entry(rb, struct ubifs_bud, rb);
667 struct rb_node *rb; local
729 for (rb = rb_first((struct rb_root *)&c->buds); rb; r
1835 struct rb_node rb; member in struct:fsck_inode
[all...]
H A Dreplay.c274 struct replay_entry *ra, *rb; local
281 rb = list_entry(b, struct replay_entry, list);
282 ubifs_assert(ra->sqnum != rb->sqnum);
283 if (ra->sqnum > rb->sqnum)
H A Dubifs.h870 * @rb: rb-tree node
875 struct rb_node rb; member in struct:ubifs_old_idx
1308 * @rb: link in the tree of all buds
1315 struct rb_node rb; member in struct:ubifs_bud
1508 * @rb: rb-tree node of rb-tree of orphans sorted by inode number
1519 struct rb_node rb; member in struct:ubifs_orphan
1729 * @orph_tree: rb
[all...]
H A Dtnc.c95 o = rb_entry(parent, struct ubifs_old_idx, rb);
110 rb_link_node(&old_idx->rb, parent, p);
111 rb_insert_color(&old_idx->rb, &c->old_idx);
187 rbtree_postorder_for_each_entry_safe(old_idx, n, &c->old_idx, rb)
H A Dsuper.c1066 rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb)
/u-boot/arch/arm/mach-at91/include/mach/
H A Dat91_tc.h15 u32 rb; /* 0x18 Register B */ member in struct:at91_tcc
/u-boot/drivers/mtd/nand/raw/
H A Dsunxi_nand.c211 * @rb: the Ready/Busy description
215 struct sunxi_nand_rb rb; member in struct:sunxi_nand_chip_sel
391 struct sunxi_nand_rb *rb; local
398 rb = &sunxi_nand->sels[sunxi_nand->selected].rb;
400 switch (rb->type) {
403 NFC_RB_STATE(rb->info.nativeid));
409 NFC_RB_STATE(rb->info.nativeid));
412 ret = dm_gpio_get_value(&rb->info.gpio);
446 if (sel->rb
[all...]
/u-boot/drivers/mtd/nand/raw/atmel/
H A Dnand-controller.c163 struct atmel_nand_rb rb; member in struct:atmel_nand_cs
400 return dm_gpio_get_value(&nand->activecs->rb.gpio);
416 if (nand->activecs->rb.type == ATMEL_NAND_GPIO_RB)
431 return status & ATMEL_HSMC_NFC_SR_RBEDGE(nand->activecs->rb.id);
450 if (nand->activecs->rb.type == ATMEL_NAND_NATIVE_RB)
907 if (nand->activecs->rb.type != ATMEL_NAND_NATIVE_RB) {
1407 if (cs->rb.type == ATMEL_NAND_NATIVE_RB)
1408 cs->smcconf.timings |= ATMEL_HSMC_TIMINGS_RBNSEL(cs->rb.id);
1559 if (!ofnode_read_u32(np, "atmel,rb", &val)) {
1563 nand->cs[i].rb
[all...]
/u-boot/tools/
H A Dmips-relocs.c190 const struct mips_reloc *ra = a, *rb = b; local
192 return ra->offset - rb->offset;
/u-boot/lib/
H A Drbtree.c37 static inline void rb_set_black(struct rb_node *rb) argument
39 rb->__rb_parent_color |= RB_BLACK;
/u-boot/drivers/clk/renesas/
H A Dr9a06g032-clocks.c718 struct regbit rb, unsigned int on)
720 uint reg = rb.reg * 4;
721 uint bit = rb.bit;
733 struct regbit rb)
735 uint reg = rb.reg * 4;
736 uint bit = rb.bit;
717 clk_rdesc_set(struct r9a06g032_priv *clocks, struct regbit rb, unsigned int on) argument
732 clk_rdesc_get(struct r9a06g032_priv *clocks, struct regbit rb) argument

Completed in 192 milliseconds