/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 | 32 /// How many to add to "this" to get the sibling. 70 // our sibling will be some index after "this". 95 void setSibling(DWARFDebugInfoEntryMinimal *sibling) { argument 96 if (sibling) { 98 // our sibling will be some index after "this". 99 SiblingIdx = sibling - this; 100 sibling->setParent(getParent());
|
/external/bluetooth/glib/gobject/ |
H A D | gobject-query.c | 58 GType sibling, 75 sibling ? O_BRANCH : (type != root ? O_LLEAF : O_SPACE), 89 if (sibling) 57 show_nodes(GType type, GType sibling, const gchar *indent) argument
|
/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/bluetooth/glib/glib/ |
H A D | gqueue.c | 930 * @sibling: a #GList link that <emphasis>must</emphasis> be part of @queue 933 * Inserts @data into @queue before @sibling. 935 * @sibling must be part of @queue. 941 GList *sibling, 945 g_return_if_fail (sibling != NULL); 947 queue->head = g_list_insert_before (queue->head, sibling, data); 954 * @sibling: a #GList link that <emphasis>must</emphasis> be part of @queue 957 * Inserts @data into @queue after @sibling 959 * @sibling must be part of @queue 965 GList *sibling, 940 g_queue_insert_before(GQueue *queue, GList *sibling, gpointer data) argument 964 g_queue_insert_after(GQueue *queue, GList *sibling, gpointer data) argument [all...] |
H A D | glist.c | 232 * @sibling: the list element before which the new element 242 GList *sibling, 249 g_return_val_if_fail (sibling == NULL, list); 252 else if (sibling) 258 node->prev = sibling->prev; 259 node->next = sibling; 260 sibling->prev = node; 268 g_return_val_if_fail (sibling == list, node); 241 g_list_insert_before(GList *list, GList *sibling, gpointer data) argument
|
H A D | gslist.c | 229 * @sibling: node to insert @data before 232 * Inserts a node before @sibling containing @data. 238 GSList *sibling, 246 g_return_val_if_fail (sibling == NULL, slist); 254 if (node == sibling) 237 g_slist_insert_before(GSList *slist, GSList *sibling, gpointer data) argument
|
/external/webkit/Source/WebCore/platform/graphics/texmap/ |
H A D | GraphicsLayerTextureMapper.cpp | 111 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/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/kernel-headers/original/linux/ |
H A D | ioport.h | 22 struct resource *parent, *sibling, *child; member in struct:resource
|
/external/mesa3d/src/talloc/ |
H A D | hieralloc.c | 114 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;
|
/external/webkit/Source/WebCore/platform/graphics/ |
H A D | GraphicsLayer.cpp | 140 void GraphicsLayer::addChildBelow(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 147 if (sibling == m_children[i]) { 160 void GraphicsLayer::addChildAbove(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 167 if (sibling == m_children[i]) {
|
/external/webkit/Source/WebCore/platform/graphics/android/ |
H A D | GLWebViewState.cpp | 206 TiledPage* GLWebViewState::sibling(TiledPage* page) function in class:WebCore::GLWebViewState
|
H A D | TiledPage.cpp | 404 TiledPage* TiledPage::sibling() function in class:WebCore::TiledPage 408 return m_glWebViewState->sibling(this);
|
H A D | GraphicsLayerAndroid.cpp | 185 void GraphicsLayerAndroid::addChildBelow(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 187 LOG("(%x) addChild %x Below %x", this, childLayer, sibling); 188 GraphicsLayer::addChildBelow(childLayer, sibling); 193 void GraphicsLayerAndroid::addChildAbove(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 195 LOG("(%x) addChild %x Above %x", this, childLayer, sibling); 196 GraphicsLayer::addChildAbove(childLayer, sibling);
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderCounter.cpp | 56 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/svg/ |
H A D | SVGElementInstance.h | 151 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling; } argument 152 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = sibling; } argument
|
/external/skia/src/xml/ |
H A D | SkDOM.cpp | 106 const Node* sibling = node->fNextSibling; local 109 for (; sibling != NULL; sibling = sibling->fNextSibling) 110 if (!strcmp(name, sibling->fName)) 113 return sibling;
|
/external/webkit/Source/WebCore/platform/graphics/chromium/ |
H A D | GraphicsLayerChromium.cpp | 153 void GraphicsLayerChromium::addChildBelow(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 155 GraphicsLayer::addChildBelow(childLayer, sibling); 159 void GraphicsLayerChromium::addChildAbove(GraphicsLayer* childLayer, GraphicsLayer *sibling) argument 161 GraphicsLayer::addChildAbove(childLayer, sibling);
|
/external/webkit/Source/WebCore/platform/graphics/win/ |
H A D | GraphicsLayerCACF.cpp | 179 void GraphicsLayerCACF::addChildBelow(GraphicsLayer* childLayer, GraphicsLayer* sibling) argument 181 GraphicsLayer::addChildBelow(childLayer, sibling); 185 void GraphicsLayerCACF::addChildAbove(GraphicsLayer* childLayer, GraphicsLayer *sibling) argument 187 GraphicsLayer::addChildAbove(childLayer, sibling);
|
/external/webkit/Source/WebKit/android/WebCoreSupport/autofill/ |
H A D | FormManagerAndroid.cpp | 149 // text accumulated at descendant and sibling. Search is limited to within 10 184 Node* sibling = previous->previousSibling(); local 185 if (sibling && sibling->isElementNode()) { 186 Element* element = static_cast<Element*>(sibling);
|
/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.
|