Searched refs:rightmost (Results 1 - 4 of 4) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/xz/src/liblzma/common/
H A Dindex.c55 /// The rightmost node in the tree. Since the tree is filled
57 index_tree_node *rightmost; member in struct:__anon19419
186 tree->rightmost = NULL;
233 node->parent = tree->rightmost;
243 tree->rightmost = node;
248 assert(tree->rightmost->uncompressed_base <= node->uncompressed_base);
249 assert(tree->rightmost->compressed_base < node->compressed_base);
251 // Add the new node after the rightmost node. It's the correct
253 tree->rightmost->right = node;
254 tree->rightmost
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/tools/misc/xz/src/liblzma/common/
H A Dindex.c55 /// The rightmost node in the tree. Since the tree is filled
57 index_tree_node *rightmost; member in struct:__anon20413
186 tree->rightmost = NULL;
233 node->parent = tree->rightmost;
243 tree->rightmost = node;
248 assert(tree->rightmost->uncompressed_base <= node->uncompressed_base);
249 assert(tree->rightmost->compressed_base < node->compressed_base);
251 // Add the new node after the rightmost node. It's the correct
253 tree->rightmost->right = node;
254 tree->rightmost
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/
H A Dsched_fair.c1092 struct sched_entity *rightmost, *se = &curr->se; local
1112 * Find the rightmost entry in the rbtree:
1114 rightmost = __pick_last_entity(cfs_rq);
1116 * Already in the rightmost position?
1118 if (unlikely(!rightmost || entity_before(rightmost, se)))
1126 se->vruntime = rightmost->vruntime + 1;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/mm/
H A Dmemcontrol.c500 struct rb_node *rightmost = NULL; local
505 rightmost = rb_last(&mctz->rb_root);
506 if (!rightmost)
509 mz = rb_entry(rightmost, struct mem_cgroup_per_zone, tree_node);

Completed in 122 milliseconds