/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/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/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
H A D | CompilingClassLoader.java | 175 JavaFileObject.Kind kind, FileObject sibling) throws IOException { 174 getJavaFileForOutput(Location location, final String className, JavaFileObject.Kind kind, FileObject sibling) argument
|
/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/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
|
/external/chromium/chrome/browser/ui/gtk/ |
H A D | gtk_tree.cc | 182 GtkTreeIter sibling; local 183 gtk_tree_model_iter_nth_child(GTK_TREE_MODEL(list_store_), &sibling, NULL, local 185 gtk_list_store_insert_after(list_store_, &iter, &sibling);
|
H A D | task_manager_gtk.cc | 372 GtkTreeIter sibling; local 373 gtk_tree_model_iter_nth_child(GTK_TREE_MODEL(process_list_), &sibling, local 375 gtk_list_store_insert_before(process_list_, &iter, &sibling);
|
/external/chromium_org/chrome/browser/ui/gtk/ |
H A D | gtk_tree.cc | 184 GtkTreeIter sibling; local 185 gtk_tree_model_iter_nth_child(GTK_TREE_MODEL(list_store_), &sibling, NULL, local 187 gtk_list_store_insert_after(list_store_, &iter, &sibling);
|
H A D | task_manager_gtk.cc | 370 GtkTreeIter sibling; local 371 gtk_tree_model_iter_nth_child(GTK_TREE_MODEL(process_list_), &sibling, local 373 gtk_list_store_insert_before(process_list_, &iter, &sibling);
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGElementInstance.h | 172 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling; } argument 173 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = sibling; } argument
|
/external/chromium_org/ui/views/widget/ |
H A D | root_view.cc | 715 View* sibling) { 719 if (sibling && p->Contains(sibling)) 712 NotifyEnterExitOfDescendant(const ui::MouseEvent& event, ui::EventType type, View* view, View* sibling) argument
|
/external/kernel-headers/original/linux/ |
H A D | ioport.h | 22 struct resource *parent, *sibling, *child; member in struct:resource
|
H A D | sched.h | 823 * pointers to (original) parent process, youngest child, younger sibling, 824 * older sibling, respectively. (p->father can be replaced with 830 * children/sibling forms the list of my children plus the 834 struct list_head sibling; /* linkage in my parent's children list */ member in struct:task_struct 1314 #define remove_parent(p) list_del_init(&(p)->sibling) 1315 #define add_parent(p) list_add_tail(&(p)->sibling,&(p)->parent->children)
|
/external/linux-tools-perf/util/ |
H A D | trace-event-info.c | 80 struct events *sibling; member in struct:events
|
/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_org/third_party/icu/source/tools/ctestfw/ |
H A D | ctest.c | 45 struct TestNode* sibling; member in struct:TestNode 174 newNode->sibling = NULL; 189 if(tn->sibling != NULL) { 190 cleanUpTestTree(tn->sibling); 263 nextNode = nextNode -> sibling; 269 curNode->sibling = nextNode; 480 iterateTestsWithLevel ( root->sibling, depth, nodeList, mode ); 591 nextNode = nextNode -> sibling;
|
/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/icu4c/tools/ctestfw/ |
H A D | ctest.c | 45 struct TestNode* sibling; member in struct:TestNode 174 newNode->sibling = NULL; 189 if(tn->sibling != NULL) { 190 cleanUpTestTree(tn->sibling); 263 nextNode = nextNode -> sibling; 269 curNode->sibling = nextNode; 480 iterateTestsWithLevel ( root->sibling, depth, nodeList, mode ); 591 nextNode = nextNode -> sibling;
|
/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/chrome/browser/sync/syncable/ |
H A D | syncable.cc | 1476 PutParentIdPropertyOnly(value); // Makes sibling order inconsistent. 1477 PutPredecessor(Id()); // Fixes up the sibling order inconsistency. 1772 ParentIdChildIndex::iterator sibling = LocateInParentChildIndex(lock, local 1777 while (sibling != first_sibling) { 1778 --sibling; 1779 EntryKernel* candidate = *sibling; 1806 // This item will be the first in the sibling order.
|
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | ApplyStyleCommand.cpp | 351 // an ancestor of the start node), we gather nodes up to the next sibling of the end node 432 // cloned/split, the new node is always a sibling of it. Therefore, we scan 710 Node* sibling = NodeTraversal::nextSkippingChildren(node); 711 for (Node* descendent = node.firstChild(); descendent && descendent != sibling; descendent = NodeTraversal::next(*descendent)) { 787 Node* sibling = node->nextSibling(); local 788 while (sibling && sibling != pastEndNode && !sibling->contains(pastEndNode.get()) 789 && (!isBlock(sibling) || sibling [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
H A D | GraphicsLayer.cpp | 210 void GraphicsLayer::addChildBelow(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 217 if (sibling == m_children[i]) { 232 void GraphicsLayer::addChildAbove(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 239 if (sibling == m_children[i]) {
|
/external/chromium_org/ui/base/x/ |
H A D | x11_util.cc | 1103 void RestackWindow(XID window, XID sibling, bool above) { argument 1105 changes.sibling = sibling;
|
/external/libmtp/src/ |
H A D | libmtp.h | 688 LIBMTP_folder_t *sibling; /**< Next folder at same level or NULL if no more */ member in struct:LIBMTP_folder_struct
|