/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | SiblingTraversalStrategies.h | 62 for (const Element* sibling = element->previousElementSibling(); sibling; sibling = sibling->previousElementSibling()) { 63 if (sibling->hasTagName(type)) 71 for (const Element* sibling = element->nextElementSibling(); sibling; sibling = sibling->nextElementSibling()) { 72 if (sibling [all...] |
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/channel/ |
H A D | StreamForwarder.java | 27 StreamForwarder sibling; field in class:StreamForwarder 31 StreamForwarder(Channel c, StreamForwarder sibling, Socket s, InputStream is, OutputStream os, String mode) argument 38 this.sibling = sibling; 84 if (sibling != null) 86 while (sibling.isAlive()) 90 sibling.join();
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | TreeWalker.cpp | 148 for (RefPtr<Node> sibling = node->previousSibling(); sibling; ) { 149 short acceptNodeResult = acceptNode(state, sibling.get()); 154 m_current = sibling.release(); 157 if (sibling->lastChild()) { 158 sibling = sibling->lastChild(); 159 node = sibling; 166 sibling = sibling [all...] |
H A D | NodeRenderingContext.cpp | 99 for (Node* sibling = NodeRenderingTraversal::nextSibling(m_node); sibling; sibling = NodeRenderingTraversal::nextSibling(sibling)) { 100 RenderObject* renderer = sibling->renderer(); 123 for (Node* sibling = NodeRenderingTraversal::previousSibling(m_node); sibling; sibling = NodeRenderingTraversal::previousSibling(sibling)) { 124 RenderObject* renderer = sibling [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLImport.cpp | 81 HTMLImport* sibling = parent->m_children[i]; local 82 if (sibling == this) 84 if (!sibling->isLoaded()) 142 HTMLImport* sibling = m_children[m_children.size() - i - 1]; local 143 if (sibling == child) 145 HTMLImport::block(sibling);
|
/external/markdown/markdown/extensions/ |
H A D | 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/ |
H A D | 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[ [all...] |
/external/tcpdump/ |
H A D | 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/llvm/lib/DebugInfo/ |
H A D | DWARFDebugInfoEntry.h | 34 /// How many to add to "this" to get the sibling. 84 // our sibling will be some index after "this". 109 void setSibling(DWARFDebugInfoEntryMinimal *sibling) { argument 110 if (sibling) { 112 // our sibling will be some index after "this". 113 SiblingIdx = sibling - this; 114 sibling->setParent(getParent());
|
/external/chromium_org/ui/views/focus/ |
H A D | 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/bintrees/bintrees/ |
H A D | 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/dom/shadow/ |
H A D | ComposedShadowTreeWalker.cpp | 82 for (const Node* sibling = node; sibling; sibling = (direction == TraversalDirectionForward ? sibling->nextSibling() : sibling->previousSibling())) { 83 if (Node* found = traverseNode(sibling, direction))
|
/external/chromium_org/third_party/WebKit/Source/core/page/ |
H A D | FrameTree.cpp | 327 Frame* sibling = nextSibling(); 328 if (sibling) { 329 ASSERT(!stayWithin || sibling->tree()->isDescendantOf(stayWithin)); 330 return sibling; 334 while (!sibling && (!stayWithin || frame->tree()->parent() != stayWithin)) { 338 sibling = frame->tree()->nextSibling(); 342 ASSERT(!stayWithin || !sibling || sibling->tree()->isDescendantOf(stayWithin)); 343 return sibling;
|
/external/qemu/hw/ |
H A D | qdev.h | 25 QLIST_ENTRY(DeviceState) sibling; member in struct:DeviceState 41 QLIST_ENTRY(BusState) sibling; member in struct:BusState
|
H A D | qdev.c | 102 QLIST_INSERT_HEAD(&bus->children, dev, sibling); 230 QLIST_REMOVE(dev, sibling); 410 QLIST_FOREACH(bus, &dev->child_bus, sibling) { 448 QLIST_INSERT_HEAD(&parent->child_bus, bus, sibling); 501 QLIST_FOREACH(child, &dev->child_bus, sibling) { 513 QLIST_FOREACH(dev, &bus->children, sibling) {
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGElementInstance.h | 173 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling; } argument 174 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = sibling; } argument
|
/external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
H A D | webtreemap.js | 54 for (var i = 0, sibling; sibling = root.children[i]; ++i) { 55 if (sibling.dom) 56 sibling.dom.style.zIndex = 0;
|
/external/libmtp/examples/ |
H A D | emptyfolders.c | 56 prune_empty_folders(device,files,folderlist->sibling,do_delete); // recurse along
|
H A D | folders.c | 39 dump_folder_list(folderlist->sibling, level);
|
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | pattern.c | 898 xmlNodePtr sibling = node; local 900 while (sibling != NULL) { 901 if (sibling == previous) 905 (sibling->name != NULL) && 906 (previous->name[0] == sibling->name[0]) && 907 (xmlStrEqual(previous->name, sibling->name))) 910 ((sibling->ns != NULL) && 912 sibling->ns->href)))) 915 sibling = sibling 1030 xmlNodePtr sibling = node; local [all...] |
/external/elfutils/tests/ |
H A D | run-show-die-info.sh | 96 Attrs : sibling name low_pc high_pc prototyped decl_file decl_line external frame_base type 103 Attrs : sibling name decl_file decl_line declaration external type 175 Attrs : sibling name type 191 Attrs : sibling name byte_size decl_file decl_line 417 Attrs : sibling byte_size decl_file decl_line 428 Attrs : sibling type 485 Attrs : sibling byte_size decl_file decl_line 496 Attrs : sibling type 576 Attrs : sibling name byte_size decl_file decl_line 697 Attrs : sibling nam [all...] |
/external/libxslt/libxslt/ |
H A D | pattern.c | 898 xmlNodePtr sibling = node; local 900 while (sibling != NULL) { 901 if (sibling == previous) 905 (sibling->name != NULL) && 906 (previous->name[0] == sibling->name[0]) && 907 (xmlStrEqual(previous->name, sibling->name))) 910 ((sibling->ns != NULL) && 912 sibling->ns->href)))) 915 sibling = sibling 1030 xmlNodePtr sibling = node; local [all...] |
/external/chromium_org/third_party/skia/src/xml/ |
H A D | SkDOM.cpp | 98 const Node* sibling = node->fNextSibling; local 101 for (; sibling != NULL; sibling = sibling->fNextSibling) 102 if (!strcmp(name, sibling->fName)) 105 return sibling;
|
/external/skia/src/xml/ |
H A D | SkDOM.cpp | 98 const Node* sibling = node->fNextSibling; local 101 for (; sibling != NULL; sibling = sibling->fNextSibling) 102 if (!strcmp(name, sibling->fName)) 105 return sibling;
|
/external/chromium/chrome/browser/resources/options/ |
H A D | search_page.js | 76 // This bubble is 'owned' by the next sibling. 451 var sibling = element.previousElementSibling; 452 if (sibling && (sibling.classList.contains('search-bubble') || 453 sibling.classList.contains('search-bubble-wrapper')))
|