| /external/clang/include/clang/AST/ |
| ExprCXX.h | 417 child_range children() { return child_range(); } function in class:clang::CXXBoolLiteralExpr
442 child_range children() { return child_range(); } function in class:clang::CXXNullPtrLiteralExpr
520 child_range children() { function in class:clang::CXXTypeidExpr
595 child_range children() { function in class:clang::CXXUuidofExpr
643 child_range children() { return child_range(); } function in class:clang::CXXThisExpr
694 child_range children() { function in class:clang::CXXThrowExpr
782 child_range children() { return child_range(); } function in class:clang::CXXDefaultArgExpr
859 child_range children() { return child_range(&SubExpr, &SubExpr + 1); } function in class:clang::CXXBindTemporaryExpr
1374 child_range children() { function in class:clang::LambdaExpr
1419 child_range children() { return child_range(); } function in class:clang::CXXScalarValueInitExpr
[all...] |
| RecursiveASTVisitor.h | [all...] |
| /external/v8/src/ |
| profile-generator.cc | 390 return node->children()->at(child_idx_);
393 return child_idx_ < node->children()->length();
990 children()[child_index].Init(child_index, type, name, entry);
1000 children()[child_index].Init(child_index, type, index, entry);
1007 children()[child_index].Init(child_index, index, entry);
1036 Vector<HeapGraphEdge> ch = children();
2767 Object*** children = group->children_; local
3175 Vector<HeapGraphEdge> children = entry->children(); local
3223 Vector<HeapGraphEdge> children = entries[root_index]->children(); local
3256 Vector<HeapGraphEdge> children = entries[i]->children(); local
3532 Vector<HeapGraphEdge> children = entry->children(); local
[all...] |
| /bionic/libc/bionic/ |
| pthread_debug.c | 60 a new lock, we walk through the "history children" of the lock, looking
78 sequences "ABC", "AC", "AD". A has three children, {B, C, D}. C is also
80 Every node can have multiple parents and multiple children.)
83 children to see if A or C appears. It does, so we reject the attempt.
393 MutexInfoList children; member in struct:MutexInfo
426 growingListInit(&object->children);
509 historyListAdd(&parent->children, child);
514 historyListRemove(&parent->children, child);
582 MutexInfoList* pList = &obj->children;
636 if (historyListHas(&mrl->children, object) >= 0
[all...] |
| /external/bluetooth/glib/gio/ |
| gcontenttype.c | 1363 GFile **children; member in struct:__anon2330
[all...] |
| /frameworks/base/core/java/android/widget/ |
| ExpandableListConnector.java | 36 * <li> cPos - Child position, the position of a child among all the children
42 * features such as collapsing/expanding groups containing children). By
63 /** The number of children from all currently expanded groups */
120 * There aren't any expanded groups (hence no visible children
137 * the same as the flat list position (since there are no children before
394 * number of children from currently expanded groups (a value we keep
511 * @param forceChildrenCountRefresh Forces refreshing of the children count
559 * Get the number of children, try to refrain from calling
565 /* Num children for this group is its last child's fl pos minus
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionManager.java | 588 * children).
825 * In case of multiple selection, we also need to remove all children when their
827 * children.
911 List<UiElementNode> children = parentUiNode.getUiChildren(); local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/renderer/ |
| RenderManager.java | 687 List<Spatial> children = n.getChildren();
local
688 for (int i = 0; i < children.size(); i++) {
689 renderShadow(children.get(i), rq);
717 // recurse for all children
719 List<Spatial> children = n.getChildren();
local
720 for (int i = 0; i < children.size(); i++) {
721 preloadScene(children.get(i));
749 * called on its children.
786 // recurse for all children
788 List<Spatial> children = n.getChildren(); local
[all...] |
| /external/clang/lib/AST/ |
| Stmt.cpp | 142 (void) sizeof(is_good(implements_children(&type::children)))
157 Stmt::child_range Stmt::children() { function in class:Stmt
163 return static_cast<type*>(this)->children();
819 Children[TRY] = TryBlock;
820 Children[HANDLER] = Handler;
845 Children[FILTER_EXPR] = reinterpret_cast<Stmt*>(FilterExpr);
846 Children[BLOCK] = Block;
|
| /external/dbus/dbus/ |
| 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);
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderObjectChildList.cpp | 56 // Destroy any anonymous children remaining in the render tree, as well as implicit (shadow) DOM elements like those used in the engine-based text fields.
158 // Keep our layer hierarchy updated. Optimize for the common case where we don't have any children
218 // Keep our layer hierarchy updated. Optimize for the common case where we don't have any children
267 // Therefore we should skip these generated run-ins when checking our immediate children.
269 // generated inline run-in in the next level of children.
411 // Generated content consists of a single container that houses multiple children (specified
449 // Make a generated box that might be any display type now that we are able to drill down into children
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/descriptors/ |
| LayoutDescriptors.java | 161 * It first computes the new children of the descriptor and then update them
236 // It gets everything else as children but it is not made a child itself.
344 null, // children
394 null, // children
415 null, // children
490 null, // children
512 null, // children
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gre/ |
| ViewMetadataRepository.java | 164 NodeList children = element.getChildNodes(); local
165 if (children.getLength() > 1 && (children.item(1) instanceof Element)) {
166 Element child = (Element) children.item(1);
223 NodeList children = element.getChildNodes(); local
224 for (int j = 0, m = children.getLength(); j < m; j++) {
225 Node childNode = children.item(j);
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer_util.cc | 81 syncable::Directory::ChildHandles* children) {
92 trans->directory()->GetChildHandles(trans, old_id, children);
93 Directory::ChildHandles::iterator i = children->begin();
94 while (i != children->end()) {
100 // among the children will be valid after the loop, since we update all
101 // the children at once.
125 syncable::Directory::ChildHandles children; local
126 ChangeEntryIDAndUpdateChildren(trans, entry, new_id, &children);
283 // If we have still-existing children, then we need to deal with
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.cpp | 715 // Count children in the count if they are also nodes.
[all...] |
| CodeGenDAGPatterns.h | 324 std::vector<TreePatternNode*> Children;
328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
365 unsigned getNumChildren() const { return Children.size(); }
366 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
368 Children[i] = N;
371 /// hasChild - Return true if N is any of our children.
373 for (unsigned i = 0, e = Children.size(); i != e; ++i)
374 if (Children[i] == N) return true;
448 /// this node and its children in the tree. This returns true if it makes a
|
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityRenderObject.cpp | 3364 const AccessibilityObject::AccessibilityChildrenVector& AccessibilityRenderObject::children() function in class:WebCore::AccessibilityRenderObject
3390 AccessibilityChildrenVector children = obj->children(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.js | 94 // add DOWN node if t has children
99 // and now add all its children
105 // add UP node if t has children
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemElement.java | 194 * for the attributes and children of the created element.
297 * only the non-attribute children of this node will be processed.
355 * Call the children visitors.
|
| ElemForEach.java | 154 * This after the template's children have been composed.
377 // Loop through the children of the template, calling execute on
449 * Call the children visitors.
|
| ElemTemplateElement.java | 204 * This after the template's children have been composed.
533 * NodeList method: Count the immediate children of this node
535 * @return The count of children of this node
541 // the children. Therefore, we can access the first child
565 // the children. Therefore, we can access the first child
1023 * processing parents before children).
[all...] |
| ElemValueOf.java | 261 * @param newChild Child to add to children list
263 * @return Child just added to children list
279 * Call the children visitors.
|
| /external/chromium/chrome/browser/history/ |
| query_parser.cc | 138 QueryNodeVector* children() { return &children_; } function in class:QueryNodeList
174 if (list_node->children()->empty()) {
280 nodes->swap(*root.children());
|
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_editor_gtk_unittest.cc | 86 // Children of the other node.
101 // The root should have two children, one for the bookmark bar node,
251 // F2 in the model should have two children now: F21 and the node edited.
|
| /external/chromium/chrome/browser/ui/views/bookmarks/ |
| bookmark_editor_view_unittest.cc | 119 // Children of the other node.
135 // The root should have two children, one for the bookmark bar node,
238 // F2 in the model should have two children now: F21 and the node edited.
|
