/external/skia/src/animator/ |
H A D | SkDisplayAdd.cpp | 162 SkDisplayable* child = maker.fChildren[inner]; local 163 if (child == old || child->contains(old))
|
H A D | SkAnimateMaker.cpp | 152 SkDisplayable* child = fChildren[index]; 153 delete child; 168 SkDisplayable* child = fDelayed[index]; 169 SkASSERT(child->isApply()); 170 SkApply* apply = (SkApply*) child;
|
H A D | SkDrawExtraPathEffect.cpp | 196 bool SkDrawShapePathEffect::add(SkAnimateMaker& , SkDisplayable* child) { argument 197 path = (SkDrawPath*) child; 366 bool SkDrawComposePathEffect::add(SkAnimateMaker& , SkDisplayable* child) { argument 368 effect1 = (SkDrawPathEffect*) child; 370 effect2 = (SkDrawPathEffect*) child;
|
/external/webkit/WebCore/platform/ |
H A D | ScrollView.cpp | 64 Widget* child = prpChild.get(); local 65 ASSERT(child != this && !child->parent()); 66 child->setParent(this); 68 if (child->platformWidget()) 69 platformAddChild(child); 72 void ScrollView::removeChild(Widget* child) argument 74 ASSERT(child->parent() == this); 75 child->setParent(0); 76 m_children.remove(child); [all...] |
/external/webkit/WebCore/wml/ |
H A D | WMLTableElement.cpp | 125 Node* child = children->item(i); local 126 if (child->hasTagName(tagName)) 127 childElements.append(static_cast<WMLElement*>(child));
|
/external/webkit/WebKit/android/nav/ |
H A D | CachedFrame.cpp | 518 const CachedFrame* child = hasFrame(test); local 519 if (child != NULL) { 520 const CachedNode* childDoc = child->validDocument(); 523 child->findClosest(bestData, originalDirection, direction, clip); 602 CachedFrame* child = mCachedFrames.begin(); local 603 while (child != mCachedFrames.end()) { 604 child->mParent = this; 605 child->finishInit(); 606 child++; 1037 CachedFrame* child local [all...] |
/external/clearsilver/cgi/ |
H A D | cgi.c | 295 HDF *obj, *child; local 335 child = hdf_obj_child (obj); 336 if (child == NULL) 345 while (child != NULL) 348 child = hdf_obj_next (child); 824 HDF *obj, *child; local 849 child = hdf_get_obj (cgi->hdf, "cgiout.other"); 850 if (child) 852 child [all...] |
H A D | rfc2388.c | 361 HDF *child, *obj = NULL; local 515 child = hdf_obj_child (obj); 516 if (child == NULL) 525 while (child != NULL) 528 child = hdf_obj_next (child);
|
/external/netperf/ |
H A D | netserver.c | 55 /* will operate either stand-alone, or as a child of inetd. In this */ 268 /* child proceses raj 7/95 */ 426 are not a child of inetd or its platform-specific equivalent */ 674 /* Build cmdline for child process */ 708 /* And close the server_sock since the child will own it. */ 721 /* we are the child process */ 731 /* will call waitpid, looking for any child process, */ 763 /* We are not counting on the child address space copy_on_write */ 772 /* handles that the child should close since they shouldn't have */ 791 BOOL child local [all...] |
/external/webkit/WebCore/inspector/front-end/ |
H A D | ProfileView.js | 198 var child = this.dataGrid.children[0]; 199 while (child) { 200 child.refresh(); 201 child = child.traverseNextNode(false, null, true);
|
/external/webkit/WebCore/rendering/ |
H A D | RenderBox.h | 106 void addOverflowFromChild(RenderBox* child) { addOverflowFromChild(child, IntSize(child->x(), child->y())); } argument 107 void addOverflowFromChild(RenderBox* child, const IntSize& delta);
|
H A D | RenderBox.cpp | 237 RenderObject* child = firstChild(); local 238 if (!child) { 244 while (child) { 245 child->layoutIfNeeded(); 246 ASSERT(!child->needsLayout()); 247 child = child->nextSibling(); 542 for (RenderObject* child = lastChild(); child; child 2897 addOverflowFromChild(RenderBox* child, const IntSize& delta) argument [all...] |
/external/webkit/WebKit/chromium/src/ |
H A D | WebPageSerializerImpl.cpp | 209 // make sure the meta will in first child of head tag. 354 // Complete the open tag for element when it has child/children. 374 // Write end tag when element has child/children. 410 for (const Node *child = node->firstChild(); child; child = child->nextSibling()) 411 buildContentForNode(child, param);
|
/external/webkit/WebCore/editing/ |
H A D | CompositeEditCommand.cpp | 164 Node* child = refChild->firstChild(); local 165 for (int i = 0; child && i < offset; i++) 166 child = child->nextSibling(); 167 if (child) 168 insertNodeBefore(insertChild, child); 193 Node* child = node->childNode(from); local 194 for (unsigned i = from; child && i < to; i++, child = child 764 RefPtr<Node> child = item->cloneNode(isTableElement(item)); local [all...] |
H A D | InsertParagraphSeparatorCommand.cpp | 138 RefPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren(); local 139 appendNode(child, parent); 140 parent = child.release();
|
/external/chromium/base/ |
H A D | file_path_unittest.cc | 549 FilePath child(cases[i].inputs[1]); 551 EXPECT_EQ(parent.IsParent(child), cases[i].expected) << 552 "i: " << i << ", parent: " << parent.value() << ", child: " << 553 child.value(); 613 FilePath child(cases[i].inputs[1]); 616 bool success = parent.AppendRelativePath(child, &result); 618 "i: " << i << ", parent: " << parent.value() << ", child: " << 619 child.value(); 621 "i: " << i << ", parent: " << parent.value() << ", child: " << 622 child [all...] |
/external/kernel-headers/original/linux/ |
H A D | sched.h | 14 #define CLONE_PTRACE 0x00002000 /* set if we want to let tracing continue on the child too */ 15 #define CLONE_VFORK 0x00004000 /* set if the parent wants the child to wake it up on mm_release */ 20 #define CLONE_SETTLS 0x00080000 /* create a new TLS for the child */ 22 #define CLONE_CHILD_CLEARTID 0x00200000 /* clear the TID in the child */ 25 #define CLONE_CHILD_SETTID 0x01000000 /* set the TID in the child */ 428 * and for reaped dead child processes forked by this group. 823 * pointers to (original) parent process, youngest child, younger sibling, 1066 * child->flags of its traced child (same goes for fork, the parent 1067 * can write to the child [all...] |
/external/webkit/WebCore/bindings/v8/custom/ |
H A D | V8DOMWindowCustom.cpp | 708 Frame* child = frame->tree()->child(index); 709 if (child) 710 return toV8(child->domWindow()); 731 Frame* child = frame->tree()->child(propName); local 732 if (child) 733 return toV8(child->domWindow()); 820 if ((type == v8::ACCESS_GET || type == v8::ACCESS_HAS) && target->tree()->child(name)) 843 if ((type == v8::ACCESS_GET || type == v8::ACCESS_HAS) && target->tree()->child(inde [all...] |
/external/libxml2/ |
H A D | xmlsave.c | 1057 xmlNodePtr child = cur->children; local 1059 while (child != NULL) { 1063 xhtmlNodeDumpOutput(ctxt, child); 1066 xmlNodeDumpOutputInternal(ctxt, child); 1068 child = child->next; 1530 xmlNodePtr child = cur->children; 1532 while (child != NULL) { 1533 if (child->type == XML_TEXT_NODE) { 1534 if ((xmlStrchr(child [all...] |
H A D | schematron.c | 1294 xmlNodePtr child, node; local 1299 child = test->children; 1300 while (child != NULL) { 1301 if ((child->type == XML_TEXT_NODE) || 1302 (child->type == XML_CDATA_SECTION_NODE)) 1303 ret = xmlStrcat(ret, child->content); 1304 else if (IS_SCHEMATRON(child, "name")) { 1307 path = xmlGetNoNsProp(child, BAD_CAST "path"); 1325 child = child [all...] |
/external/qemu/distrib/sdl-1.2.12/src/video/x11/ |
H A D | SDL_x11wm.c | 339 Window child; local 365 XTranslateCoordinates( SDL_Display, WMwindow, SDL_Root, 0, 0, &xNew, &yNew, &child ); 396 Window child; local 399 XTranslateCoordinates( SDL_Display, WMwindow, SDL_Root, 0, 0, px, py, &child ); 409 Window child; local 412 XTranslateCoordinates( SDL_Display, WMwindow, SDL_Root, 0, 0, &x, &y, &child );
|
/external/libffi/src/ |
H A D | dlmalloc.c | 1750 | Pointer to left child (child[0]) | 1752 | Pointer to right child (child[1]) | 1789 the tree. Unlike a usual binary tree, where we follow left child 1790 pointers until we reach a null, here we follow the right child 1792 both child pointers null. The smallest chunk in the tree will be 1809 struct malloc_tree_chunk* child[2]; member in struct:malloc_tree_chunk 1819 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[ [all...] |
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
H A D | SDL_malloc.c | 1796 | Pointer to left child (child[0]) | 1798 | Pointer to right child (child[1]) | 1835 the tree. Unlike a usual binary tree, where we follow left child 1836 pointers until we reach a null, here we follow the right child 1838 both child pointers null. The smallest chunk in the tree will be 1855 struct malloc_tree_chunk* child[2]; member in struct:malloc_tree_chunk 1865 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[ [all...] |
/external/qemu/hw/ |
H A D | qdev.c | 353 BusState *child; local 387 QLIST_FOREACH(child, &dev->child_bus, sibling) { 388 qbus_print(mon, child, indent);
|
/external/chromium/net/disk_cache/ |
H A D | mem_entry_impl.h | 19 // types of entries, parent and child to support sparse caching. 23 // is initialized. It then manages a list of child entries and delegates the 24 // sparse API calls to the child entries. It creates and deletes child entries 27 // A child entry is used to carry partial cache content, non-sparse methods like 28 // ReadData and WriteData cannot be applied to them. The lifetime of a child 30 // can be evicted independently. A child entry does not have a key and it is not 125 // Performs the initialization of a MemEntryImpl as a child entry. 127 // the new child. 131 // child entr [all...] |