Searched refs:sibling (Results 1 - 25 of 69) sorted by relevance

123

/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/channel/
H A DStreamForwarder.java27 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/webkit/Source/WebCore/dom/
H A DTreeWalker.cpp145 for (RefPtr<Node> sibling = node->previousSibling(); sibling; ) {
146 short acceptNodeResult = acceptNode(state, sibling.get());
151 m_current = sibling.release();
154 if (sibling->lastChild()) {
155 sibling = sibling->lastChild();
156 node = sibling;
163 sibling = sibling
[all...]
/external/markdown/markdown/extensions/
H A Ddef_list.py44 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 Dblockprocessors.py131 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 Dmakemib207 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 DDWARFDebugInfoEntry.h34 /// How many to add to "this" to get the sibling.
79 // our sibling will be some index after "this".
104 void setSibling(DWARFDebugInfoEntryMinimal *sibling) { argument
105 if (sibling) {
107 // our sibling will be some index after "this".
108 SiblingIdx = sibling - this;
109 sibling->setParent(getParent());
/external/webkit/Source/WebCore/rendering/
H A DRenderCounter.cpp56 Element* sibling; local
61 sibling = parent->previousElementSibling();
68 sibling = parent->lastElementChild();
74 while (sibling) {
75 if (RenderObject* renderer = sibling->renderer()) {
78 parent = sibling;
79 sibling = sibling->lastElementChild();
80 if (!sibling) {
86 sibling
102 Element* sibling; local
[all...]
/external/webkit/Source/WebCore/page/
H A DFrameTree.cpp267 Frame* sibling = nextSibling();
268 if (sibling) {
269 ASSERT(!stayWithin || sibling->tree()->isDescendantOf(stayWithin));
270 return sibling;
274 while (!sibling && (!stayWithin || frame->tree()->parent() != stayWithin)) {
278 sibling = frame->tree()->nextSibling();
282 ASSERT(!stayWithin || !sibling || sibling->tree()->isDescendantOf(stayWithin));
283 return sibling;
/external/qemu/hw/
H A Dqdev.h25 QLIST_ENTRY(DeviceState) sibling; member in struct:DeviceState
41 QLIST_ENTRY(BusState) sibling; member in struct:BusState
H A Dqdev.c102 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/webkit/Source/WebCore/platform/graphics/chromium/
H A DGraphicsLayerChromium.h53 virtual void addChildAbove(GraphicsLayer*, GraphicsLayer* sibling);
54 virtual void addChildBelow(GraphicsLayer*, GraphicsLayer* sibling);
/external/webkit/Source/WebCore/platform/graphics/qt/
H A DGraphicsLayerQt.h48 virtual void addChildAbove(GraphicsLayer* layer, GraphicsLayer* sibling);
49 virtual void addChildBelow(GraphicsLayer* layer, GraphicsLayer* sibling);
/external/webkit/Source/WebCore/platform/graphics/texmap/
H A DGraphicsLayerTextureMapper.h53 virtual void addChildAbove(GraphicsLayer* layer, GraphicsLayer* sibling);
54 virtual void addChildBelow(GraphicsLayer* layer, GraphicsLayer* sibling);
H A DGraphicsLayerTextureMapper.cpp111 void GraphicsLayerTextureMapper::addChildAbove(GraphicsLayer* layer, GraphicsLayer* sibling) argument
113 GraphicsLayer::addChildAbove(layer, sibling);
119 void GraphicsLayerTextureMapper::addChildBelow(GraphicsLayer* layer, GraphicsLayer* sibling) argument
122 GraphicsLayer::addChildBelow(layer, sibling);
/external/webkit/Source/WebCore/platform/graphics/win/
H A DGraphicsLayerCACF.h50 virtual void addChildAbove(GraphicsLayer *layer, GraphicsLayer *sibling);
51 virtual void addChildBelow(GraphicsLayer *layer, GraphicsLayer *sibling);
/external/libmtp/examples/
H A Demptyfolders.c56 prune_empty_folders(device,files,folderlist->sibling,do_delete); // recurse along
H A Dfolders.c39 dump_folder_list(folderlist->sibling, level);
/external/webkit/Source/WebCore/svg/
H A DSVGElementInstance.h151 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling; } argument
152 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = sibling; } argument
H A DSVGUseElement.cpp881 // lose the sibling chain when we are back from recursion.
883 for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling = sibling->nextSibling())
884 expandUseElementsInShadowTree(sibling.get());
929 // lose the sibling chain when we are back from recursion.
931 for (RefPtr<Node> sibling = element->nextSibling(); sibling; sibling
[all...]
/external/elfutils/tests/
H A Drun-show-die-info.sh96 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 Dpattern.c898 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/skia/src/xml/
H A DSkDOM.cpp98 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 Dsearch_page.js76 // 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')))
/external/webkit/Source/WebCore/platform/graphics/android/
H A DGraphicsLayerAndroid.h64 virtual void addChildAbove(GraphicsLayer* layer, GraphicsLayer* sibling);
65 virtual void addChildBelow(GraphicsLayer* layer, GraphicsLayer* sibling);
/external/mesa3d/src/talloc/
H A Dhieralloc.c114 hieralloc_header_t * sibling = header->prevSibling; local
119 if (sibling)
121 if (sibling->nextSibling != header)
123 printf("&sibling->nextSibling=%p &header=%p \n", &sibling->nextSibling, &header);
124 printf("sibling->nextSibling=%p header=%p \n", sibling->nextSibling, header);
126 sibling->nextSibling = header->nextSibling;
128 header->nextSibling->prevSibling = sibling;

Completed in 477 milliseconds

123