HomeSort by relevance Sort by last modified time
    Searched defs:child (Results 501 - 525 of 654) sorted by null

<<21222324252627

  /external/chromium/chrome/browser/
browser_about_handler.cc 1110 DictionaryValue* child = new DictionaryValue(); local
    [all...]
  /external/chromium/chrome/browser/chromeos/login/
screen_locker.cc 283 // A child widget that grabs both keyboard and pointer input.
484 Window root, child; local
489 &root, &child, &root_x, &root_y,
    [all...]
  /external/chromium/chrome/browser/ui/gtk/
find_bar_gtk.cc 157 void BuildBorder(GtkWidget* child,
170 gtk_container_add(GTK_CONTAINER(*alignment), child);
929 GtkWidget* child = gtk_bin_get_child(GTK_BIN(widget)); local
931 gtk_container_propagate_expose(GTK_CONTAINER(widget), child, e); local
    [all...]
  /external/e2fsprogs/e2fsck/
dict.c 78 * its right child C are rearranged so that the P instead becomes the left
79 * child of C. The left subtree of C is inherited as the new right subtree
618 /* rotation between parent and child preserves grandpa */
661 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent; local
691 * moving up its right child into its place.
694 child = next->right;
695 child->parent = nextparent;
698 nextparent->left = child;
701 nextparent->right = child;
728 child = (delete->left != nil) ? delete->left : delete->right
    [all...]
profile.c 1034 * or more child nodes, pointed to by first_child.
1046 struct profile_node *child, *next; local
1054 for (child=node->first_child; child; child = next) {
1055 next = child->next;
1056 profile_free_node(child);
    [all...]
  /external/icu4c/tools/ctestfw/
ctest.c 46 struct TestNode* child; member in struct:TestNode
175 newNode->child = NULL;
186 if(tn->child != NULL) {
187 cleanUpTestTree(tn->child);
231 /* Start with the next child */
232 nextNode = curNode->child;
249 curNode->child = createTestNode(name, nameLen);
250 /* printf("*** added %s\n", curNode->child->name );*/
251 curNode = curNode->child;
439 if(root->child) {
    [all...]
  /external/jsilver/src/com/google/clearsilver/jsilver/interpreter/
TemplateInterpreter.java 369 * &lt;?cs each:x=Stuff &gt; ... &lt;?cs /each &gt; command. Loops over child items of a data
523 // we need to create a path for each child when generating the
531 for (Data child : items.getChildren()) {
533 pathBuilder.append(child.getName());
  /external/libxml2/
schematron.c 1294 xmlNodePtr child, node; local
    [all...]
xinclude.c 863 * @no: the child number
865 * Returns the @n'th element child of @cur or NULL
2268 xmlNodePtr child = node->children; local
    [all...]
xmlsave.c 1057 xmlNodePtr child = cur->children; local
1059 while (child != NULL) {
1063 xhtmlNodeDumpOutput(ctxt, child);
1066 xmlNodeDumpOutputInternal(ctxt, child);
1068 child = child->next;
    [all...]
xpointer.c 123 * A few helper functions for child sequences *
132 * Returns the number of child for an element, -1 in case of error
175 * @no: the child number
177 * Returns the @no'th element child of @cur or NULL
915 * @index: the child number
918 * given child if found
1208 * @name: a possible ID name of the child sequence
1213 * Parse and evaluate a Child Sequence. This routine also handle the
1235 int child = 0; local
1239 child = child * 10 + (CUR - '0')
    [all...]
  /external/libxslt/libxslt/
xsltutils.c 1569 xmlNodePtr child = result->children; local
2002 xmlNodePtr root, child; local
    [all...]
  /external/quake/quake/src/QW/client/
gl_model.c 1012 mnode_t *in, *child; local
1033 child = in->children[j];
1034 if (child->contents < 0)
1035 out->children[j] = child->contents;
1037 out->children[j] = child - loadmodel->nodes;
    [all...]
model.c 982 mnode_t *in, *child; local
1003 child = in->children[j];
1004 if (child->contents < 0)
1005 out->children[j] = child->contents;
1007 out->children[j] = child - loadmodel->nodes;
    [all...]
  /external/quake/quake/src/WinQuake/
gl_model.cpp 1003 mnode_t *in, *child; local
1024 child = in->children[j];
1025 if (child->contents < 0)
1026 out->children[j] = child->contents;
1028 out->children[j] = child - loadmodel->nodes;
    [all...]
model.cpp 1000 mnode_t *in, *child; local
1021 child = in->children[j];
1022 if (child->contents < 0)
1023 out->children[j] = child->contents;
1025 out->children[j] = child - loadmodel->nodes;
    [all...]
  /external/skia/src/animator/
SkScriptTokenizer.cpp 424 SkOpArray* child = (*array)[index].fArray; local
425 forget(child); // forgets children of child
426 int found = fTrackArray.find(child);
    [all...]
  /external/srec/tools/grxmlcompile/
grxmldoc.cpp 145 // The "current" subgraph is substituted with the new subgraph for all ops on child nodes.
146 // After processing child nodes the original subgraph is reinstated
169 TiXmlNode* child; local
170 for( child = node.FirstChild(); child; child = child->NextSibling() )
172 parseNode ( *child, p_SubGraph, level+1 );
    [all...]
  /external/strace/
process.c 415 /* TCP is creating a child we want to follow.
440 tcp->auxstr = "child process";
458 tcp->auxstr = "child process";
509 #define CLONE_PTRACE 0x00002000 /* set if we want to let tracing continue on the child too */
510 #define CLONE_VFORK 0x00004000 /* set if the parent wants the child to wake it up on mm_release */
515 #define CLONE_SETTLS 0x00080000 /* create a new TLS for the child */
517 #define CLONE_CHILD_CLEARTID 0x00200000 /* clear the TID in the child */
518 #define CLONE_DETACHED 0x00400000 /* parent wants no child-exit signal */
520 #define CLONE_CHILD_SETTID 0x01000000 /* set the TID in the child */
834 /* The child already reported its startup tra
1989 struct tcb *child = NULL; local
    [all...]
  /external/valgrind/main/coregrind/
launcher-aix5.c 70 we will generate and patch into the child's address space. */
88 Child;
94 Bool ptrace_READ_BLOCK ( Child* ch, Int len, void* ldst, Addr64 rsrc )
108 Bool ptrace_WRITE_BLOCK ( Child* child, Int len, Addr64 rdst, void* lsrc )
112 r = ptrace64( PT_WRITE_BLOCK, (ULong)child->pid, rdst, len, lsrc );
121 Bool ptrace_READ_GPR ( Child* child, Int reg, ULong* ldst )
126 if (child->is64) {
128 (ULong)child->pid, (ULong)reg, 8, (Int*)(&w64) )
1334 Child child; local
    [all...]
  /external/webkit/Source/WebCore/editing/
CompositeEditCommand.cpp 167 Node* child = refChild->firstChild(); local
168 for (int i = 0; child && i < offset; i++)
169 child = child->nextSibling();
170 if (child)
171 insertNodeBefore(insertChild, child);
196 Node* child = node->childNode(from); local
197 for (unsigned i = from; child && i < to; i++, child = child->nextSibling()
795 RefPtr<Node> child = item->cloneNode(isTableElement(item)); local
    [all...]
visible_units.cpp 586 Node* child = node->childNode(offset); local
587 Node* n = child ? child->nextLeafNode() : node->lastDescendant()->nextLeafNode();
    [all...]
  /external/webkit/Source/WebCore/rendering/
RenderTable.cpp 111 void RenderTable::addChild(RenderObject* child, RenderObject* beforeChild)
117 bool wrapInAnonymousSection = !child->isPositioned();
119 if (child->isRenderBlock() && child->style()->display() == TABLE_CAPTION) {
131 m_caption = toRenderBlock(child);
135 } else if (child->isTableCol()) {
138 } else if (child->isTableSection()) {
139 switch (child->style()->display()) {
143 m_head = toRenderTableSection(child);
147 m_firstBody = toRenderTableSection(child);
315 RenderObject* child = firstChild(); local
1016 RenderObject* child; local
    [all...]
  /external/webkit/Source/WebKit/android/nav/
CachedFrame.cpp 555 const CachedFrame* child = hasFrame(test); local
556 if (child != NULL) {
557 const CachedNode* childDoc = child->validDocument();
560 child->findClosest(bestData, originalDirection, direction, clip);
656 CachedFrame* child = mCachedFrames.begin(); local
657 while (child != mCachedFrames.end()) {
658 child->mParent = this;
659 child->finishInit();
660 child++;
794 testData.mNode->setCondition(CachedNode::CHILD);
1105 CachedFrame* child = mCachedFrames.begin(); local
    [all...]
  /external/webkit/Source/WebKit/gtk/tests/
testatk.c 975 AtkObject* child = atk_object_ref_accessible_child(object, 0); local
    [all...]

Completed in 1542 milliseconds

<<21222324252627