| /external/linux-tools-perf/perf-3.12.0/lib/ |
| rbtree.c | 205 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; local
215 sibling = parent->rb_right;
216 if (node != sibling) { /* node == parent->rb_left */
217 if (rb_is_red(sibling)) {
227 parent->rb_right = tmp1 = sibling->rb_left;
228 sibling->rb_left = parent;
230 __rb_rotate_set_parents(parent, sibling, root,
232 augment_rotate(parent, sibling);
233 sibling = tmp1;
235 tmp1 = sibling->rb_right
[all...] |
| /external/chromium_org/third_party/markdown/extensions/ |
| def_list.py | 85 sibling = self.lastChild(parent)
86 if not terms and sibling is None:
91 if not terms and sibling.tag == 'p':
94 terms = sibling.text.split('\n')
95 parent.remove(sibling)
96 # Aquire new sibling
97 sibling = self.lastChild(parent)
101 if sibling and sibling.tag == 'dl':
103 dl = sibling
[all...] |
| admonition.py | 102 sibling = self.lastChild(parent)
104 (block.startswith(' ' * self.tab_length) and sibling and \
105 sibling.get('class', '').find(self.CLASSNAME) != -1)
108 sibling = self.lastChild(parent)
126 div = sibling
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| TreeWalker.cpp | 145 for (RefPtrWillBeRawPtr<Node> sibling = node->previousSibling(); sibling; ) {
146 short acceptNodeResult = acceptNode(sibling.get(), exceptionState);
151 m_current = sibling.release();
154 if (sibling->lastChild()) {
155 sibling = sibling->lastChild();
156 node = sibling;
163 sibling = sibling->previousSibling()
[all...] |
| NodeRenderingTraversal.cpp | 224 for (Node* sibling = NodeRenderingTraversal::nextSibling(node); sibling; sibling = NodeRenderingTraversal::nextSibling(sibling)) {
225 RenderObject* renderer = sibling->renderer();
234 for (Node* sibling = NodeRenderingTraversal::previousSibling(node); sibling; sibling = NodeRenderingTraversal::previousSibling(sibling)) {
235 RenderObject* renderer = sibling->renderer()
[all...] |
| /external/markdown/markdown/extensions/ |
| def_list.py | 44 sibling = self.lastChild(parent)
45 if not terms and sibling.tag == 'p':
48 terms = sibling.text.split('\n')
49 parent.remove(sibling)
50 # Aquire new sibling
51 sibling = self.lastChild(parent)
55 if sibling and sibling.tag == 'dl':
57 dl = sibling
|
| /external/markdown/markdown/ |
| blockprocessors.py | 131 level, sibling = self.get_level(parent, block)
138 elif sibling.tag in self.ITEM_TYPES:
139 # The sibling is a li. Use it as parent.
140 self.parser.parseBlocks(sibling, [block])
141 elif len(sibling) and sibling[-1].tag in self.ITEM_TYPES:
144 if sibling[-1].text:
146 block = '%s\n\n%s' % (sibling[-1].text, block)
147 sibling[-1].text = ''
148 self.parser.parseChunk(sibling[-1], block
[all...] |
| /external/libedit/src/ |
| keymacro.c | 81 struct keymacro_node_t *sibling;/* ptr to another key with same prefix*/ member in struct:keymacro_node_t
302 if (ptr->sibling) {
303 /* try next sibling */
304 return node_trav(el, ptr->sibling, ch, val);
306 /* no next sibling -- mismatch */
325 for (xm = ptr; xm->sibling != NULL; xm = xm->sibling)
326 if (xm->sibling->ch == *str)
328 if (xm->sibling == NULL)
329 xm->sibling = node__get(*str); /* setup new node *
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SiblingTraversalStrategies.h | 83 for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling))
92 for (const Element* sibling = ElementTraversal::previousSibling(element, HasTagName(type)); sibling; sibling = ElementTraversal::previousSibling(*sibling, HasTagName(type)))
100 for (const Element* sibling = ElementTraversal::nextSibling(element); sibling; sibling = ElementTraversal::nextSibling(*sibling)
[all...] |
| /external/chromium_org/third_party/markdown/ |
| blockprocessors.py | 190 level, sibling = self.get_level(parent, block)
205 elif sibling.tag in self.ITEM_TYPES:
206 # The sibling is a li. Use it as parent.
207 self.parser.parseBlocks(sibling, [block])
208 elif len(sibling) and sibling[-1].tag in self.ITEM_TYPES:
211 if sibling[-1].text:
216 p.text = sibling[-1].text
217 sibling[-1].text = ''
218 sibling[-1].insert(0, p
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderMultiColumnFlowThread.cpp | 57 for (RenderObject* sibling = nextSibling(); sibling; sibling = sibling->nextSibling()) {
58 if (sibling->isRenderMultiColumnSet())
59 return toRenderMultiColumnSet(sibling);
66 for (RenderObject* sibling = multiColumnBlockFlow()->lastChild(); sibling; sibling = sibling->previousSibling())
[all...] |
| RenderMultiColumnSet.cpp | 58 for (RenderObject* sibling = nextSibling(); sibling; sibling = sibling->nextSibling()) {
59 if (sibling->isRenderMultiColumnSet())
60 return toRenderMultiColumnSet(sibling);
67 for (RenderObject* sibling = previousSibling(); sibling; sibling = sibling->previousSibling())
[all...] |
| /external/tcpdump/ |
| makemib | 207 for (sib = child[parent]; sib != ""; sib = sibling[sib])
223 sibling[new] = child[parent]
234 # printf "/* %s c=%s s=%s */\n", newitem, child[item], sibling[item]
241 if (sibling[item] != "") {
242 dump(sibling[item])
243 s = "&_"sibling[item]"_obj"
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| ComposedTreeWalker.cpp | 60 for (const Node* sibling = node; sibling; sibling = (direction == TraversalDirectionForward ? sibling->nextSibling() : sibling->previousSibling())) {
61 if (Node* found = traverseNode(sibling, direction))
|
| /external/chromium_org/ui/views/focus/ |
| focus_search.cc | 132 // - go to the right sibling and start the search from there (by invoking
134 // - if the view has no right sibling, go up the parents until you find a parent
135 // with a right sibling and start the search from there.
172 // Then try the right sibling.
173 View* sibling = starting_view->GetNextFocusableView(); local
174 if (sibling) {
175 View* v = FindNextFocusableViewImpl(sibling,
183 // Then go up to the parent sibling.
187 sibling = parent->GetNextFocusableView();
188 if (sibling) {
251 View* sibling = starting_view->GetPreviousFocusableView(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/devices/ |
| DevicesView.js | 86 for (var sibling = parent.firstElementChild; sibling; sibling = sibling.nextElementSibling) {
87 if (sibling.id && sibling.id > child.id) {
88 parent.insertBefore(child, sibling);
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| rbtree.py | 236 sibling = parent[1 - last]
237 if sibling is not None:
238 if (not is_red(sibling[1 - last])) and (not is_red(sibling[last])):
241 sibling.red = True
245 if is_red(sibling[last]):
247 elif is_red(sibling[1-last]):
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| FrameTree.cpp | 323 Frame* sibling = nextSibling();
324 if (sibling) {
325 ASSERT(!stayWithin || sibling->tree().isDescendantOf(stayWithin));
326 return sibling;
330 while (!sibling && (!stayWithin || frame->tree().parent() != stayWithin)) {
334 sibling = frame->tree().nextSibling();
338 ASSERT(!stayWithin || !sibling || sibling->tree().isDescendantOf(stayWithin));
339 return sibling;
|
| /cts/tools/dex-tools/test/dex/reader/util/ |
| SpecialJavaFileManager.java | 44 JavaFileObject.Kind kind, FileObject sibling) {
|
| /external/chromium_org/ash/ime/ |
| candidate_view.cc | 230 // Moves the drag target to the sibling view.
234 CandidateView* sibling = local
236 if (sibling == this)
239 ConvertPointFromWidget(sibling, &location_in_sibling);
240 if (sibling->HitTestPoint(location_in_sibling)) {
241 GetWidget()->GetRootView()->SetMouseHandler(sibling);
242 sibling->SetHighlighted(true);
243 return sibling->OnMouseDragged(ui::MouseEvent(event, this, sibling));
|
| /external/chromium_org/tools/profile_chrome/third_party/ |
| perf_to_tracing.py | 217 # Try to reduce misplaced stack leaves by moving them up into sibling nodes.
223 # If parent's sibling has same node name, has no children and small weight,
224 # transplant sibling's samples into the current node.
225 for sibling in parent_siblings:
226 if sibling.name == node.name and \
227 len(sibling.children) == 0 and \
228 sibling.GetTotalWeight() <= node.GetTotalWeight() * 0.15:
230 # Transplant samples from sibling to current node.
231 for samp in sibling.samples:
234 sibling.samples = [
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| sidenav_data_source.py | 48 for sibling in items:
49 sibling['related'] = True
|
| /external/qemu/include/hw/ |
| qdev-core.h | 23 QLIST_ENTRY(DeviceState) sibling; member in struct:DeviceState
39 QLIST_ENTRY(BusState) sibling; member in struct:BusState
|
| /external/libmtp/examples/ |
| emptyfolders.c | 56 prune_empty_folders(device,files,folderlist->sibling,do_delete); // recurse along
|
| folders.c | 39 dump_folder_list(folderlist->sibling, level);
|
