HomeSort by relevance Sort by last modified time
    Searched refs:children (Results 426 - 450 of 1029) sorted by null

<<11121314151617181920>>

  /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/
ViewHierarchyLoader.java 109 parent.children.add(lastNode);
141 for (ViewNode node : root.children) {
  /external/quake/quake/src/QW/client/
gl_model.c 98 node = node->children[0];
100 node = node->children[1];
837 Mod_SetParent (node->children[0], node);
838 Mod_SetParent (node->children[1], node);
877 p = LittleShort (in->children[j]);
879 out->children[j] = loadmodel->nodes + p;
881 out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
998 out->children[0] = LittleShort(in->children[0]);
999 out->children[1] = LittleShort(in->children[1])
    [all...]
model.c 96 node = node->children[0];
98 node = node->children[1];
823 Mod_SetParent (node->children[0], node);
824 Mod_SetParent (node->children[1], node);
863 p = LittleShort (in->children[j]);
865 out->children[j] = loadmodel->nodes + p;
867 out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
968 out->children[0] = LittleShort(in->children[0]);
969 out->children[1] = LittleShort(in->children[1])
    [all...]
  /external/quake/quake/src/WinQuake/
gl_model.cpp 98 node = node->children[0];
100 node = node->children[1];
837 Mod_SetParent (node->children[0], node);
838 Mod_SetParent (node->children[1], node);
877 p = LittleShort (in->children[j]);
879 out->children[j] = loadmodel->nodes + p;
881 out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
989 out->children[0] = LittleShort(in->children[0]);
990 out->children[1] = LittleShort(in->children[1])
    [all...]
model.cpp 101 node = node->children[0];
103 node = node->children[1];
841 Mod_SetParent (node->children[0], node);
842 Mod_SetParent (node->children[1], node);
881 p = LittleShort (in->children[j]);
883 out->children[j] = loadmodel->nodes + p;
885 out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
986 out->children[0] = LittleShort(in->children[0]);
987 out->children[1] = LittleShort(in->children[1])
    [all...]
  /cts/tools/utils/
DescriptionGenerator.java 359 Collection<Node> children = getSuiteChildren(elem); local
364 for (Node child : children) {
394 NodeList children = elem.getChildNodes(); local
395 for (int i = 0; i < children.getLength(); i++) {
396 Node child = children.item(i);
  /external/iproute2/misc/
ifstat.c 420 static int children; variable
515 if (children >= 5) {
519 children++;
532 while (children && waitpid(-1, &status, WNOHANG) > 0)
533 children--;
nstat.c 312 static int children; variable
400 if (children >= 5) {
404 children++;
417 while (children && waitpid(-1, &status, WNOHANG) > 0)
418 children--;
  /external/webkit/Tools/DumpRenderTree/chromium/
TestShell.cpp 407 const WebVector<WebHistoryItem>& children = item.children(); local
408 if (!children.isEmpty()) {
413 for (size_t i = 0; i < children.size(); ++i)
414 sortedChildren.push_back(children[i]);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/descriptors/
CustomViewDescriptorService.java 460 // A custom view accepts children if its parent descriptor also does.
461 // The only exception to this is ViewGroup, which accepts children even though
465 ViewElementDescriptor[] children = null; local
467 // We can't figure out what the allowable children are by just
469 children = builtInList.toArray(new ViewElementDescriptor[builtInList.size()]);
474 children, project, null);
525 ElementDescriptor[] children, IProject project,
535 children,
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas 84 /// a list of element as the children. If you want a flat tree (a list)
115 /// in list children of t.
119 /// Warning: if t has no children, but child does and child isNil then you
120 /// can decide it is ok to move children to t via t.children = child.children;
128 /// if it's not ok to move children to t with a simple assignment.
134 /// If oldRoot is a nil root, just copy or move the children to newRoot.
158 /// children; i.e., you don't have to copy the list. We are
204 /// If oldRoot is a nil root, just copy or move the children to newRoot
    [all...]
  /external/libxml2/
relaxng.c 109 xmlRelaxNGGrammarPtr children; /* the children grammar if any */ member in struct:_xmlRelaxNGGrammar
303 xmlNodePtr seq; /* the sequence of children left to validate */
864 if (grammar->children != NULL) {
865 xmlRelaxNGFreeGrammar(grammar->children);
    [all...]
SAX2.c 568 (ret->children == NULL) &&
576 xmlNodePtr children; local
579 ret->ExternalID, &children);
581 xmlAddChildList((xmlNodePtr) ret, children);
    [all...]
c14n.c 950 value = xmlNodeListGetString(ctx->doc, attr->children, 1);
1013 res = xmlNodeListGetString(ctx->doc, xml_base_attr->children, 1);
1025 tmp_str = xmlNodeListGetString(ctx->doc, attr->children, 1);
    [all...]
  /external/webkit/Source/WebCore/platform/graphics/qt/
GraphicsLayerQt.cpp 354 const QList<QGraphicsItem*> children = childItems(); local
356 for (cit = children.constBegin(); cit != children.constEnd(); ++cit) {
567 // Apply perspective for the use of this item's children. Perspective is always applied from the item's
589 const QList<QGraphicsItem*> children = childItems(); local
591 for (it = children.constBegin(); it != children.constEnd(); ++it)
702 // We basically do an XOR operation on the list of current children and the list of wanted
703 // children, and remove/add.
705 const Vector<GraphicsLayer*> newChildrenVector = (m_layer->children());
    [all...]
  /external/v8/tools/
profile.js 658 * prior to visiting node's children.
660 * after visiting node's children.
681 this.children = {};
694 * Node total weight (includes weights of all children).
707 this.children[label] = child;
725 * Returns all node's children as an array.
740 return this.children[label] || null;
761 for (var c in this.children) {
762 f(this.children[c]);
  /libcore/luni/src/test/java/libcore/xml/
DomTest.java 1019 NodeList children = formerParent.getChildNodes(); local
1525 NodeList children = menu.getChildNodes(); local
1546 NodeList children = menu.getChildNodes(); local
    [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...]
  /external/webkit/Source/WebCore/platform/graphics/texmap/
TextureMapperNode.cpp 231 // DefaultLayer: draws itself and its children directly to the current framebuffer.
247 // A clip layer is a layer that masks to bounds, doesn't preserve 3D, has children, and has a transparency/mask or a non-rectangular transform.
253 // ScissorLayer: draws to the current framebuffer, and applies an extra scissor before drawing its children.
254 // A scissor layer is a layer with children that masks to bounds, is not a transparency layer, and has a rectangular clip.
264 // Used for layers with children and transparency/mask that preserve 3D or don't mask to bounds.
768 for (size_t i = 0; i < graphicsLayer->children().size(); ++i) {
769 if (TextureMapperNode* child = toTextureMapperNode(graphicsLayer->children()[i])) {
868 Vector<GraphicsLayer*> children = graphicsLayer->children();
869 for (int i = children.size() - 1; i >= 0; --i)
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gre/
ViewMetadataRepository.java 170 NodeList children = element.getChildNodes(); local
171 if (children.getLength() > 1 && (children.item(1) instanceof Element)) {
172 Element child = (Element) children.item(1);
230 NodeList children = element.getChildNodes(); local
231 for (int j = 0, m = children.getLength(); j < m; j++) {
232 Node childNode = children.item(j);
    [all...]
  /ndk/sources/host-tools/make-3.81/
job.c 206 /* Chain of all live (or recently deceased) children. */
208 struct child *children = 0;
210 /* Number of children currently running. */
218 /* Chain of children waiting to run until the load average goes down. */
413 the dead children. In this case we don't need the dead_children count.
416 use the dead_children count to reap children as best we can. */
437 DB (DB_JOBS, (_("Got a SIGCHLD; %u unreaped children.\n"), dead_children));
443 /* Reap all dead children, storing the returned status and the new command
469 We're blocking for a complete child OR there are more children to reap
471 we'll keep reaping children. *
207 struct child *children = 0; variable in typeref:struct:child
    [all...]
  /external/chromium/chrome/browser/sync/engine/
conflict_resolver.cc 123 Directory::ChildHandles children; local
126 &children);
127 if (0 != children.size()) {
  /external/clang/bindings/python/tests/cindex/
test_type.py 83 children = list(tu.cursor.get_children())
84 assert len(children) > 0
86 cursor = children[0]
  /external/libxslt/libxslt/
variables.c 338 if (RVT->children != NULL) {
339 xmlFreeNodeList(RVT->children);
340 RVT->children = NULL;
    [all...]
  /external/qemu/hw/
qdev.c 102 QLIST_INSERT_HEAD(&bus->children, dev, sibling);
446 QLIST_INIT(&bus->children);
513 QLIST_FOREACH(dev, &bus->children, sibling) {

Completed in 3419 milliseconds

<<11121314151617181920>>