/external/clang/include/clang/AST/ |
H A D | StmtCXX.h | 54 child_range children() { return child_range(&HandlerBlock, &HandlerBlock+1); } function in class:clang::CXXCatchStmt 115 child_range children() { function in class:clang::CXXTryStmt 199 child_range children() { function in class:clang::CXXForRangeStmt
|
H A D | StmtObjC.h | 67 child_range children() { function in class:clang::ObjCForCollectionStmt 117 child_range children() { return child_range(&Body, &Body + 1); } function in class:clang::ObjCAtCatchStmt 148 child_range children() { function in class:clang::ObjCAtFinallyStmt 250 child_range children() { 306 child_range children() { function in class:clang::ObjCAtTryStmt 342 child_range children() { return child_range(&Throw, &Throw+1); } function in class:clang::ObjCAtThrowStmt 375 child_range children() { return child_range(&SubStmt, &SubStmt + 1); } function in class:clang::ObjCAutoreleasePoolStmt
|
/external/collada/include/dae/ |
H A D | daeElement.h | 112 * Finds the last index into the array of children of the name specified. 114 * @return Returns the index into the children array of the last element with name elementName. -1 if 115 * there are no children of name elementName. 451 * Gets the children/sub-elements of this element. 452 * This is a helper function used to easily access an element's children without the use of the 455 * @return The return value. An elementref array to append this element's children to. 462 * @param array The return value. An elementref array to append this element's children to. 468 * Gets all the children of a particular type. 486 daeTArray< daeSmartRef<daeElement> > children; local 487 getChildren(children); [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 222 RegionSet children; member in class:llvm::Region 238 /// verifyRegionNest - Verify if the region and its children are valid 433 /// @param moveChildren Move the children of this region, that are also 469 iterator begin() { return children.begin(); } 470 iterator end() { return children.end(); } 472 const_iterator begin() const { return children.begin(); } 473 const_iterator end() const { return children.end(); } 500 /// are direct children of this Region. It does not iterate over any
|
/external/v8/src/ |
H A D | global-handles.h | 79 // a list of children objects. If the parent is alive, all the children 84 Object*** children, 91 CopyWords(group->children_, children, static_cast<int>(length)); 190 Object*** children, 83 New(HeapObject** parent, Object*** children, size_t length) argument
|
/external/webkit/Source/WebCore/loader/archive/android/ |
H A D | WebArchiveAndroid.cpp | 68 int children = frame->tree()->childCount(); local 72 for (int child = 0; child < children; child++)
|
/external/webkit/Source/WebCore/platform/graphics/texmap/ |
H A D | GraphicsLayerTextureMapper.cpp | 87 bool GraphicsLayerTextureMapper::setChildren(const Vector<GraphicsLayer*>& children) argument 90 return GraphicsLayer::setChildren(children);
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderTableSection.h | 41 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::RenderTableSection 42 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::RenderTableSection 122 virtual RenderObjectChildList* virtualChildren() { return children(); } 123 virtual const RenderObjectChildList* virtualChildren() const { return children(); }
|
/external/webkit/Source/WebCore/wml/ |
H A D | WMLTableElement.cpp | 124 RefPtr<NodeList> children = startElement->childNodes(); local 125 if (!children) 128 unsigned length = children->length(); 130 Node* child = children->item(i); 140 RefPtr<NodeList> children = sourceElement->childNodes(); local 141 if (!children) 146 unsigned length = children->length(); 148 RefPtr<Node> clonedNode = children->item(i)->cloneNode(true);
|
/external/webkit/Source/WebKit/chromium/src/ |
H A D | WebHistoryItem.cpp | 259 WebVector<WebHistoryItem> WebHistoryItem::children() const function in class:WebKit::WebHistoryItem 261 return m_private->children();
|
/external/webkit/Source/WebKit/gtk/webkit/ |
H A D | webkitwebhistoryitem.cpp | 493 const WebCore::HistoryItemVector& children = item->children(); local 494 if (!children.size()) 497 unsigned size = children.size(); 500 kids = g_list_prepend(kids, kit(children[i].get()));
|
H A D | webkitwebviewprivate.h | 67 HashSet<GtkWidget*> children; member in struct:_WebKitWebViewPrivate
|
/external/wpa_supplicant_8/wpa_supplicant/dbus/ |
H A D | dbus_new_introspect.c | 178 char **children; local 182 dbus_connection_list_registered(con, path, &children); 183 for (i = 0; children[i]; i++) 184 wpabuf_printf(xml, "<node name=\"%s\"/>", children[i]); 185 dbus_free_string_array(children);
|
/external/chromium/chrome/browser/extensions/ |
H A D | extension_menu_manager.h | 113 const List& children() { return children_; } function in class:ExtensionMenuItem 156 // Recursively removes all descendant items (children, grandchildren, etc.), 187 // Any children this item may have. 209 // children. A view can then decide how to display these, including whether to 277 // all items the menu manager knows about, including all children of top-level
|
/external/chromium/chrome/common/ |
H A D | sandbox_policy.cc | 122 // If |children| is set to true, we need to add the wildcard rules to also 124 bool AddDirectory(int path, const wchar_t* sub_dir, bool children, argument 143 if (children)
|
/external/chromium/net/disk_cache/ |
H A D | mem_entry_impl.cc | 85 EntryMap children; local 86 children.swap(*children_); 87 for (EntryMap::iterator i = children.begin(); 88 i != children.end(); ++i) {
|
/external/chromium/webkit/glue/ |
H A D | glue_serialize.cc | 337 const WebVector<WebHistoryItem>& children = item.children(); local 338 WriteInteger(static_cast<int>(children.size()), obj); 339 for (size_t i = 0, c = children.size(); i < c; ++i) 340 WriteHistoryItem(children[i], obj);
|
H A D | webkit_glue.cc | 225 const WebVector<WebHistoryItem>& children = item.children(); local 226 if (!children.isEmpty()) { 231 for (size_t i = 0; i < children.size(); ++i) 232 sorted_children.push_back(children[i]);
|
/external/collada/src/dae/ |
H A D | daeSIDResolver.cpp | 68 // Add the children to the list of elements to check 69 daeElementRefArray children; local 70 elt->getChildren(children); 71 for (size_t j = 0; j < children.getCount(); j++) 72 elts.push_back(children[j]);
|
/external/collada/src/modules/LIBXMLPlugin/ |
H A D | daeLIBXMLPlugin.cpp | 358 daeElementRefArray children; local 359 element->getChildren( children ); 361 for ( unsigned int i = 0; i < children.getCount(); i++ ) 363 if ( strcmp( children[i]->getTypeName(), "float_array" ) == 0 || 364 strcmp( children[i]->getTypeName(), "int_array" ) == 0 ) 368 else if ( strcmp( children[i]->getTypeName(), "technique_common" ) == 0 ) 393 daeElementRefArray children; local 394 element->getChildren( children ); 395 for ( size_t x = 0; x < children.getCount(); x++ ) { 396 writeElement( children 476 daeElementRefArray children; local [all...] |
/external/dbus/dbus/ |
H A D | dbus-message-factory.c | 342 DBusMessageIter *children; local 352 children = dbus_new(DBusMessageIter, levels + 1); 365 &children[i]); 367 parents[i] = children[i-1]; 370 dbus_message_iter_append_basic (&children[i], DBUS_TYPE_INT32, &v_INT32); 373 dbus_message_iter_close_container (&parents[i], &children[i]); 378 dbus_free(children);
|
/external/iproute2/misc/ |
H A D | nstat.c | 312 static int children; variable 400 if (children >= 5) { 404 children++; 417 while (children && waitpid(-1, &status, WNOHANG) > 0) 418 children--;
|
H A D | rtacct.c | 294 static int children; variable 394 if (children >= 5) { 398 children++; 408 while (children && waitpid(-1, &status, WNOHANG) > 0) 409 children--;
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | NestedMapData.java | 39 * Number of children a node can have before we bother allocating a HashMap. We currently allocate 49 private Map<String, NestedMapData> children = null; field in class:NestedMapData 50 // Number of children 52 // First child (first sibling of children) 54 // Last child (last sibling of children) 98 // children Hashmap, initialize it now. 99 if (sym.children == null && sym.childCount >= CHILD_MAP_THRESHOLD) { 100 sym.children = new HashMap<String, NestedMapData>(); 101 // Copy in existing children. 104 sym.children [all...] |
/external/oprofile/daemon/ |
H A D | opd_perfmon.c | 98 static struct child * children; variable in typeref:struct:child 121 if (children[i].pid == getpid()) { 122 children[i].sigusr1 = 1; 134 if (children[i].pid == getpid()) { 135 children[i].sigusr2 = 1; 319 struct child * self = &children[cpu]; 433 children = xmalloc(sizeof(struct child) * nr_cpus); 434 bzero(children, sizeof(struct child) * nr_cpus); 439 if (pipe(children[i].up_pipe)) { 449 close(children[ [all...] |