Searched defs:child (Results 201 - 225 of 568) sorted by relevance

1234567891011>>

/external/skia/src/animator/
H A DSkDrawPaint.cpp93 bool SkDrawPaint::add(SkAnimateMaker* maker, SkDisplayable* child) { argument
94 SkASSERT(child && child->isPaintPart());
95 SkPaintPart* part = (SkPaintPart*) child;
H A DSkDrawPath.cpp48 bool SkDrawPath::addChild(SkAnimateMaker& maker, SkDisplayable* child) { argument
49 SkASSERT(child && child->isPathPart());
50 SkPathPart* part = (SkPathPart*) child;
H A DSkMemberInfo.h80 void setMemberData(SkDisplayable* displayable, const void* child, size_t size) const { argument
82 memcpy((char*) displayable + fOffset, child, size);
/external/skia/src/core/
H A DSkRTree.h21 * Much like a B-Tree it maintains balance by enforcing minimum and maximum child counts, and
48 * Create a new R-Tree with specified min/max child counts.
49 * The child counts are valid iff:
112 // Since we want to be able to pick min/max child counts at runtime, we assume the creator
114 Branch* child(size_t index) { function in struct:SkRTree::Node
H A DSkTSort.h35 * This version does extra work, in that it copies child to parent on the way down,
36 * then copies parent to child on the way back up. When copies are inexpensive,
80 size_t child = root << 1; local
81 while (child <= bottom) {
82 if (child < bottom && lessThan(array[child-1], array[child])) {
83 ++child;
85 if (lessThan(x, array[child-1])) {
86 array[root-1] = array[child
[all...]
/external/skia/src/utils/
H A DSkLayer.cpp101 SkLayer* SkLayer::addChild(SkLayer* child) { argument
102 SkASSERT(this != child);
103 child->ref();
104 child->detachFromParent();
105 SkASSERT(child->fParent == NULL);
106 child->fParent = this;
108 *m_children.append() = child;
109 return child;
125 SkLayer* child = m_children[i]; local
126 SkASSERT(child
[all...]
/external/valgrind/main/coregrind/m_syswrap/
H A Dsyswrap-amd64-linux.c147 // set up child stack, temporarily preserving fn and arg
162 " testq %rax, %rax\n" // child if retval == 0
231 Both parent and child return to the same place, and the code
235 The parent gets the child's new tid returned from clone, but the
236 child gets 0.
244 child. */
256 /* Start the child with its threadgroup being the same as the
258 after the child is created but before it sets its
298 VG_(printf)("clone child has SETTLS: tls at %#lx\n", tlsaddr);
337 void setup_child ( /*OUT*/ ThreadArchState *child, argument
[all...]
/external/valgrind/main/helgrind/tests/
H A Dtc17_sembar.c156 void* child ( void* argV ) function
196 res = pthread_create( &thr[i], NULL, child, (void*)(i+2) );
/external/webkit/Source/JavaScriptCore/API/tests/
H A DJSNode.c51 Node* child = JSObjectGetPrivate(JSValueToObject(context, arguments[0], NULL)); local
53 Node_appendChild(node, child);
68 Node* child = JSObjectGetPrivate(JSValueToObject(context, arguments[0], exception)); local
70 Node_removeChild(node, child);
/external/webkit/Source/WebCore/bridge/qt/
H A Dqt_class.cpp158 QObject* child = children.at(index); local
159 if (child->objectName() == name)
195 QObject* child = children.at(index); local
196 if (child->objectName() == name) {
197 f = new QtField(child);
/external/webkit/Source/WebCore/editing/
H A DInsertParagraphSeparatorCommand.cpp138 RefPtr<Element> child = ancestors[i - 1]->cloneElementWithoutChildren(); local
139 appendNode(child, parent);
140 parent = child.release();
/external/webkit/Source/WebCore/page/
H A DFrameTree.cpp38 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
39 child->setView(0);
66 bool FrameTree::transferChild(PassRefPtr<Frame> child) argument
68 Frame* oldParent = child->tree()->parent();
70 return false; // |child| is already a child of m_thisFrame.
73 oldParent->tree()->removeChild(child
85 appendChild(PassRefPtr<Frame> child) argument
92 actuallyAppendChild(PassRefPtr<Frame> child) argument
109 removeChild(Frame* child) argument
178 Frame* FrameTree::child(unsigned index) const function in class:WebCore::FrameTree
186 Frame* FrameTree::child(const AtomicString& name) const function in class:WebCore::FrameTree
258 Frame* child = firstChild(); local
[all...]
/external/webkit/Source/WebCore/platform/graphics/android/layers/
H A DLayer.cpp83 Layer* Layer::addChild(Layer* child) { argument
84 SkASSERT(this != child);
85 child->ref();
86 child->detachFromParent();
87 SkASSERT(child->fParent == NULL);
88 child->fParent = this;
90 *m_children.append() = child;
91 return child;
107 Layer* child = m_children[i]; local
108 SkASSERT(child
[all...]
/external/webkit/Source/WebCore/rendering/
H A DRenderObjectChildList.cpp68 // So that we'll get the appropriate dirty bit set (either that a normal flow child got yanked or
69 // that a positioned child got yanked). We also repaint, so that the area exposed when the child
84 // if we remove visible child from an invisible parent, we don't know the layer visibility any more
105 // Update cached boundaries in SVG renderers, if a child is removed.
117 // remove the child
166 // if the new child is visible but this object was not, tell the layer it has some visible content
185 owner->setChildNeedsLayout(true); // We may supply the static position for an absolute positioned child.
191 void RenderObjectChildList::insertChildNode(RenderObject* owner, RenderObject* child, RenderObject* beforeChild, bool fullInsert) argument
194 appendChildNode(owner, child, fullInser
323 RenderObject* child; local
[all...]
H A DRenderRuby.cpp75 RenderObject* child = ruby->firstChild(); local
76 return isRubyBeforeBlock(child) ? static_cast<RenderBlock*>(child) : 0;
81 RenderObject* child = ruby->lastChild(); local
82 return isRubyAfterBlock(child) ? static_cast<RenderBlock*>(child) : 0;
97 RenderObject* child = ruby->lastChild(); local
98 if (child && !child->isRubyRun())
99 child
104 findRubyRunParent(RenderObject* child) argument
128 addChild(RenderObject* child, RenderObject* beforeChild) argument
193 removeChild(RenderObject* child) argument
235 addChild(RenderObject* child, RenderObject* beforeChild) argument
300 removeChild(RenderObject* child) argument
[all...]
H A DRenderRubyBase.cpp51 bool RenderRubyBase::isChildAllowed(RenderObject* child, RenderStyle*) const argument
53 return child->isInline();
61 for (RenderObject* child = firstChild(); child != beforeChild; child = child->nextSibling()) {
62 if (!child->isFloatingOrPositioned() && !(child->isAnonymousBlock() && child->childrenInline()))
74 // First make sure that beforeChild (if set) is indeed a direct child o
[all...]
H A DRenderTableRow.cpp83 void RenderTableRow::addChild(RenderObject* child, RenderObject* beforeChild) argument
89 if (!child->isTableCell()) {
96 last->addChild(child, beforeChild);
102 last->parent()->addChild(child, beforeChild);
112 cell->addChild(child);
120 RenderTableCell* cell = toRenderTableCell(child);
142 for (RenderObject* child = firstChild(); child; child = child
[all...]
/external/webkit/Source/WebCore/rendering/mathml/
H A DRenderMathMLFraction.cpp101 void RenderMathMLFraction::addChild(RenderObject* child, RenderObject* beforeChild) argument
118 row->addChild(child);
H A DRenderMathMLSubSup.cpp64 void RenderMathMLSubSup::addChild(RenderObject* child, RenderObject* beforeChild) argument
89 script->addChild(child);
91 RenderMathMLBlock::addChild(child, beforeChild);
101 wrapper->addChild(child);
H A DRenderMathMLUnderOver.cpp58 void RenderMathMLUnderOver::addChild(RenderObject* child, RenderObject* beforeChild) argument
64 // look through the children for rendered elements counting the blocks so we know what child
108 row->addChild(child);
128 // For over or underover, the base is the sibling of the first child
135 // use the child of the row which is the actual base
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3basetree.c44 static void addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child);
51 static void setChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child);
144 addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child) argument
149 if (child == NULL)
154 if (child->isNilNode(child) == ANTLR3_TRUE)
156 if (child->children != NULL && child->children == tree->children)
160 ANTLR3_FPRINTF(stderr, "ANTLR3: An attempt was made to add a child list to itself!\n");
166 if (child
236 setChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child) argument
390 pANTLR3_BASE_TREE child; local
481 pANTLR3_BASE_TREE child; local
[all...]
H A Dantlr3basetreeadaptor.c49 static void addChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child);
50 static void dbgAddChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child);
54 static void addChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child);
55 static void dbgAddChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child);
166 pANTLR3_BASE_TREE child; local
181 // This will already have been included as a child of another node
187 // For each child of the current tree, define a node using the
193 // Pick up a pointer for the child
195 child = adaptor->getChild(adaptor, t, i);
199 sprintf(buff, "\tn%p[label=\"", child);
271 pANTLR3_BASE_TREE child; local
470 pANTLR3_BASE_TREE child; local
504 pANTLR3_BASE_TREE child; local
548 addChild(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child) argument
556 dbgAddChild(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child) argument
567 addChildToken(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child) argument
575 dbgAddChildToken(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child) argument
[all...]
H A Dantlr3commontreeadaptor.c60 static void setParent (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE child, pANTLR3_BASE_TREE parent);
61 static pANTLR3_BASE_TREE getParent (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE child);
62 static void setChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, ANTLR3_UINT32 i, pANTLR3_BASE_TREE child);
459 setChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, ANTLR3_UINT32 i, pANTLR3_BASE_TREE child) argument
461 t->setChild(t, i, child);
488 setParent (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE child, pANTLR3_BASE_TREE parent) argument
490 child->setParent(child, parent);
493 getParent (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE child) argument
495 return child
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DBlankDebugEventListener.cs122 public virtual void AddChild(object root, object child) { argument
H A DDebugEventHub.cs283 public virtual void AddChild(object root, object child) { argument
286 listener.AddChild(root, child);

Completed in 961 milliseconds

1234567891011>>