Searched refs:deepest (Results 1 – 22 of 22) sorted by relevance
322 struct rb_node *deepest; in ext2fs_rb_augment_erase_begin() local325 deepest = ext2fs_rb_parent(node); in ext2fs_rb_augment_erase_begin()327 deepest = node->rb_left; in ext2fs_rb_augment_erase_begin()329 deepest = node->rb_right; in ext2fs_rb_augment_erase_begin()331 deepest = ext2fs_rb_next(node); in ext2fs_rb_augment_erase_begin()332 if (deepest->rb_right) in ext2fs_rb_augment_erase_begin()333 deepest = deepest->rb_right; in ext2fs_rb_augment_erase_begin()334 else if (ext2fs_rb_parent(deepest) != node) in ext2fs_rb_augment_erase_begin()335 deepest = ext2fs_rb_parent(deepest); in ext2fs_rb_augment_erase_begin()338 return deepest; in ext2fs_rb_augment_erase_begin()
1141 ComponentPathNode &deepest{componentPath_.back()}; in Increment() local1142 if (deepest.component()) { in Increment()1143 if (!deepest.descended()) { in Increment()1144 deepest.set_descended(true); in Increment()1146 derived{PlanComponentTraversal(*deepest.component())}) { in Increment()1150 } else if (!deepest.visited()) { in Increment()1151 deepest.set_visited(true); in Increment()1155 auto &nameIterator{deepest.nameIterator()}; in Increment()1156 if (nameIterator == deepest.nameEnd()) { in Increment()1159 deepest.set_component(*nameIterator++->second); in Increment()[all …]
85 ``CPU_SUSPEND`` to deepest power level on all CPUs in parallel152 ``CPU_SUSPEND`` to deepest power level on all CPUs in sequence214 ``CPU_OFF`` on all non-lead CPUs in sequence then ``CPU_SUSPEND`` on lead CPU to deepest power level221 2. Program wake up timer and suspend the lead CPU to the deepest power level.
679 int deepest; in choose_x_overlay_visual() local699 deepest = min_depth; in choose_x_overlay_visual()751 if (deepvis!=NULL && vislist->depth <= deepest) { in choose_x_overlay_visual()758 deepest = vislist->depth; in choose_x_overlay_visual()
85 sunlight to the deepest darkest shadows.
55 …els found in real scenes ranging from the brightest direct sunlight to the deepest darkest shadows.
412 …on's depth is calculated, it is inserted into a per block list sorted by deepest instruction. Unr…423 …uctions to insert or remove. Start scheduling each basic block from the deepest node in the depth…
75 "A \"No\" uttered from deepest conviction is better and greater than a
264 created whose name is the last 12 hex digits in the deepest directory. The
153 Defines the local power state corresponding to the deepest power down162 Defines the local power state corresponding to the deepest retention state
6013 3. Text may be added to the last (deepest) open block remaining
1283 deepest contempt. `I've seen a good many little girls in my
2616 To deepest Hell, and, to repair that loss, 4248 And so from Heaven to deepest Hell; O fall
1280 deepest contempt. `I've seen a good many little girls in my
17579 deepest
1a 2A 3Aaron 4AARON 5abaissiez 6abandon 7abandoned 8abase 9Abase 10 ...
18748 with length of the absolute path of the deepest one exceeding PATH_MAX,
50004 deepest %29028 dˈipəst
42102 deepest %37347 dˈipəst