Searched refs:node (Results 76 - 100 of 3060) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DStyleSheetCandidate.cpp45 return isElement() ? toElement(node()).fastGetAttribute(titleAttr) : nullAtom;
50 return !node().document().isHTMLDocument() && m_type == Pi && toProcessingInstruction(node()).isXSL();
55 return m_type == HTMLLink && toHTMLLinkElement(node()).isImport();
61 return toHTMLLinkElement(node()).import();
68 return toElement(node()).getAttribute(relAttr).contains("alternate");
73 return isHTMLLink() && toHTMLLinkElement(node()).isEnabledViaScript();
78 return isHTMLLink() && !toHTMLLinkElement(node()).isDisabled() && toHTMLLinkElement(node()).styleSheetIsLoading();
101 StyleSheetCandidate::Type StyleSheetCandidate::typeOf(Node& node) argument
[all...]
H A DNodeRenderingTraversal.cpp41 if (!renderer->node()->isElementNode())
43 if (toElement(renderer->node())->isInTopLayer())
55 ContainerNode* parent(const Node* node, ParentDetails* details) argument
57 ASSERT(node);
58 ASSERT(!node->document().childNeedsDistributionRecalc());
59 if (isActiveInsertionPoint(*node))
61 ComposedTreeWalker walker(node, ComposedTreeWalker::CanStartFromShadowBoundary);
65 bool contains(const ContainerNode* container, const Node* node) argument
67 while (node) {
68 if (node
75 nextSibling(const Node* node) argument
94 previousSibling(const Node* node) argument
113 lastChild(const Node* node) argument
120 pseudoAwarePreviousSibling(const Node* node) argument
136 pseudoAwareLastChild(const Node* node) argument
153 previous(const Node* node, const Node* stayWithin) argument
166 firstChild(const Node* node) argument
173 pseudoAwareNextSibling(const Node* node) argument
189 pseudoAwareFirstChild(const Node* node) argument
205 next(const Node* node, const Node* stayWithin) argument
222 nextSiblingRenderer(const Node* node) argument
232 previousSiblingRenderer(const Node* node) argument
[all...]
H A DWeakNodeMap.cpp31 bool NodeToWeakNodeMaps::addedToMap(Node* node, WeakNodeMap* map) argument
33 NodeToMapList::AddResult result = m_nodeToMapList.add(node, nullptr);
40 bool NodeToWeakNodeMaps::removedFromMap(Node* node, WeakNodeMap* map) argument
42 NodeToMapList::iterator it = m_nodeToMapList.find(node);
55 void NodeToWeakNodeMaps::nodeDestroyed(Node* node) argument
57 OwnPtr<NodeToWeakNodeMaps::MapList> maps = m_nodeToMapList.take(node);
59 (*maps)[i]->nodeDestroyed(node);
66 Node* node = it->key; local
67 if (allMaps.removedFromMap(node, this))
68 node
72 put(Node* node, int value) argument
83 value(Node* node) argument
88 Node* WeakNodeMap::node(int value) function in class:blink::WeakNodeMap
93 nodeDestroyed(Node* node) argument
100 notifyNodeDestroyed(Node* node) argument
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMDefaultBaseIterators.java39 * Construct a DTMDefaultBaseTraversers object from a DOM node.
61 * Construct a DTMDefaultBaseTraversers object from a DOM node.
72 * @param usePrevsib true if we want to build the previous sibling node array.
92 * with a start node (using iterator.setStartNode()).
174 * with a start node (using iterator.setStartNode()).
257 * returned (starting point for the next() search); for single-node
258 * iterators it may instead be initialized to point to that single node.
263 * Remembers the current node for the next call to gotoMark().
273 * Restores the current node remembered by setMark().
285 * Iterator that returns all immediate children of a given node
302 setStartNode(int node) argument
356 setStartNode(int node) argument
447 setStartNode(int node) argument
538 setStartNode(int node) argument
604 setStartNode(int node) argument
709 setStartNode(int node) argument
828 setStartNode(int node) argument
875 setStartNode(int node) argument
981 setStartNode(int node) argument
1046 setStartNode(int node) argument
1107 setStartNode(int node) argument
1300 setStartNode(int node) argument
1501 setStartNode(int node) argument
1652 setStartNode(int node) argument
1761 setStartNode(int node) argument
1827 setStartNode(int node) argument
2053 SingletonIterator(int node) argument
2065 SingletonIterator(int node, boolean constant) argument
2079 setStartNode(int node) argument
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/
H A DTokenIndex.java5 import com.google.clearsilver.jsilver.syntax.node.*;
13 public void caseTData(@SuppressWarnings("unused") TData node) argument
19 public void caseTComment(@SuppressWarnings("unused") TComment node) argument
25 public void caseTVar(@SuppressWarnings("unused") TVar node) argument
31 public void caseTLvar(@SuppressWarnings("unused") TLvar node) argument
37 public void caseTEvar(@SuppressWarnings("unused") TEvar node) argument
43 public void caseTUvar(@SuppressWarnings("unused") TUvar node) argument
49 public void caseTSet(@SuppressWarnings("unused") TSet node) argument
55 public void caseTIf(@SuppressWarnings("unused") TIf node) argument
61 public void caseTElseIf(@SuppressWarnings("unused") TElseIf node) argument
67 caseTElse(@uppressWarnings�) TElse node) argument
73 caseTWith(@uppressWarnings�) TWith node) argument
79 caseTEscape(@uppressWarnings�) TEscape node) argument
85 caseTAutoescape(@uppressWarnings�) TAutoescape node) argument
91 caseTLoop(@uppressWarnings�) TLoop node) argument
97 caseTEach(@uppressWarnings�) TEach node) argument
103 caseTAlt(@uppressWarnings�) TAlt node) argument
109 caseTName(@uppressWarnings�) TName node) argument
115 caseTDef(@uppressWarnings�) TDef node) argument
121 caseTCall(@uppressWarnings�) TCall node) argument
127 caseTInclude(@uppressWarnings�) TInclude node) argument
133 caseTLinclude(@uppressWarnings�) TLinclude node) argument
139 caseTContentType(@uppressWarnings�) TContentType node) argument
145 caseTInline(@uppressWarnings�) TInline node) argument
151 caseTComma(@uppressWarnings�) TComma node) argument
157 caseTBang(@uppressWarnings�) TBang node) argument
163 caseTAssignment(@uppressWarnings�) TAssignment node) argument
169 caseTEq(@uppressWarnings�) TEq node) argument
175 caseTNe(@uppressWarnings�) TNe node) argument
181 caseTLt(@uppressWarnings�) TLt node) argument
187 caseTGt(@uppressWarnings�) TGt node) argument
193 caseTLte(@uppressWarnings�) TLte node) argument
199 caseTGte(@uppressWarnings�) TGte node) argument
205 caseTAnd(@uppressWarnings�) TAnd node) argument
211 caseTOr(@uppressWarnings�) TOr node) argument
217 caseTString(@uppressWarnings�) TString node) argument
223 caseTHash(@uppressWarnings�) THash node) argument
229 caseTPlus(@uppressWarnings�) TPlus node) argument
235 caseTMinus(@uppressWarnings�) TMinus node) argument
241 caseTStar(@uppressWarnings�) TStar node) argument
247 caseTPercent(@uppressWarnings�) TPercent node) argument
253 caseTBracketOpen(@uppressWarnings�) TBracketOpen node) argument
259 caseTBracketClose(@uppressWarnings�) TBracketClose node) argument
265 caseTParenOpen(@uppressWarnings�) TParenOpen node) argument
271 caseTParenClose(@uppressWarnings�) TParenClose node) argument
277 caseTDot(@uppressWarnings�) TDot node) argument
283 caseTDollar(@uppressWarnings�) TDollar node) argument
289 caseTQuestion(@uppressWarnings�) TQuestion node) argument
295 caseTDecNumber(@uppressWarnings�) TDecNumber node) argument
301 caseTHexNumber(@uppressWarnings�) THexNumber node) argument
307 caseTWord(@uppressWarnings�) TWord node) argument
313 caseTSlash(@uppressWarnings�) TSlash node) argument
319 caseTCsOpen(@uppressWarnings�) TCsOpen node) argument
325 caseTCommentStart(@uppressWarnings�) TCommentStart node) argument
331 caseTCommandDelimiter(@uppressWarnings�) TCommandDelimiter node) argument
337 caseTHardDelimiter(@uppressWarnings�) THardDelimiter node) argument
343 caseTCsClose(@uppressWarnings�) TCsClose node) argument
349 caseEOF(@uppressWarnings�) EOF node) argument
[all...]
/external/chromium_org/chrome/browser/extensions/api/bookmarks/
H A Dbookmark_api_helpers.cc28 const BookmarkNode* node,
32 if (node->IsVisible()) {
34 node,
44 const BookmarkNode* node,
49 bookmark_tree_node->id = base::Int64ToString(node->id());
51 const BookmarkNode* parent = node->parent();
55 bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node)));
58 if (!node->is_folder()) {
59 bookmark_tree_node->url.reset(new std::string(node->url().spec()));
62 base::Time t = node
27 AddNodeHelper(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse, bool only_folders) argument
43 GetBookmarkTreeNode(ChromeBookmarkClient* client, const BookmarkNode* node, bool recurse, bool only_folders) argument
95 AddNode(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument
102 AddNodeFoldersOnly(ChromeBookmarkClient* client, const BookmarkNode* node, std::vector<linked_ptr<BookmarkTreeNode> >* nodes, bool recurse) argument
114 const BookmarkNode* node = bookmarks::GetBookmarkNodeByID(model, id); local
137 GetMetaInfo(const BookmarkNode& node, base::DictionaryValue* id_to_meta_info_map) argument
[all...]
/external/chromium_org/tools/metrics/histograms/
H A Dhistogram_ownership.py21 for node in root_children:
22 if node.tag == 'histograms':
23 histograms = node
34 for node in histogram.getchildren():
35 if node.tag == 'obsolete':
38 if node.tag != 'owner':
40 if node.text == DUMMY_OWNER:
42 assert '@' in node.text
43 owners.append(node.text)
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DALoopCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
62 public void setPosition(PPosition node) argument
69 if(node != null)
71 if(node.parent() != null)
73 node.parent().removeChild(node);
76 node.parent(this);
79 this._position_ = node;
87 public void setVariable(PVariable node) argument
94 if(node !
112 setStart(PExpression node) argument
137 setEnd(PExpression node) argument
162 setCommand(PCommand node) argument
[all...]
/external/smack/src/org/jivesoftware/smackx/entitycaps/packet/
H A DCapsExtension.java25 private String node, ver, hash; field in class:CapsExtension
30 public CapsExtension(String node, String version, String hash) { argument
31 this.node = node;
45 return node;
48 public void setNode(String node) { argument
49 this.node = node;
71 * node='http://code.google.com/p/exodus'
78 "node
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Ducharstrie.cpp35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...]
H A Dbytestrie.cpp72 int32_t node; local
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos; local
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node
140 int32_t node=*pos; local
151 int32_t node=*pos++; local
395 int32_t node=*pos++; local
[all...]
/external/icu/icu4c/source/common/
H A Ducharstrie.cpp35 int32_t node; local
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
37 valueResult(node) : USTRINGTRIE_NO_VALUE;
83 int32_t node=*pos; local
84 if(node&kValueIsFinal) {
90 // int32_t delta=readValue(pos, node);
92 if(node<kMinTwoUnitValueLead) {
93 delta=node;
94 } else if(node<kThreeUnitValueLead) {
95 delta=((node
113 int32_t node=*pos; local
123 int32_t node=*pos++; local
164 int32_t node; local
195 int32_t node; local
215 int32_t node; local
233 int32_t node=*pos++; local
296 int32_t node=*pos++; local
322 int32_t node=*pos++; local
373 int32_t node=*pos++; local
[all...]
H A Dbytestrie.cpp72 int32_t node; local
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos; local
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node
140 int32_t node=*pos; local
151 int32_t node=*pos++; local
395 int32_t node=*pos++; local
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/compiler/
H A DExpressionTranslator.java28 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
30 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
31 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
32 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
33 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
34 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
35 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
36 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
37 import com.google.clearsilver.jsilver.syntax.node
155 caseAVariableExpression(AVariableExpression node) argument
164 caseAStringExpression(AStringExpression node) argument
174 caseADecimalExpression(ADecimalExpression node) argument
183 caseAHexExpression(AHexExpression node) argument
196 caseANumericExpression(ANumericExpression node) argument
201 caseANotExpression(ANotExpression node) argument
206 caseAExistsExpression(AExistsExpression node) argument
225 caseAEqExpression(AEqExpression node) argument
232 caseANumericEqExpression(ANumericEqExpression node) argument
237 caseANeExpression(ANeExpression node) argument
244 caseANumericNeExpression(ANumericNeExpression node) argument
249 caseALtExpression(ALtExpression node) argument
254 caseAGtExpression(AGtExpression node) argument
259 caseALteExpression(ALteExpression node) argument
264 caseAGteExpression(AGteExpression node) argument
269 caseAAndExpression(AAndExpression node) argument
274 caseAOrExpression(AOrExpression node) argument
279 caseAAddExpression(AAddExpression node) argument
284 caseANumericAddExpression(ANumericAddExpression node) argument
289 caseASubtractExpression(ASubtractExpression node) argument
294 caseAMultiplyExpression(AMultiplyExpression node) argument
299 caseADivideExpression(ADivideExpression node) argument
304 caseAModuloExpression(AModuloExpression node) argument
309 caseANegativeExpression(ANegativeExpression node) argument
317 caseAFunctionExpression(AFunctionExpression node) argument
363 prefix(Type destType, Type srcType, String prefix, PExpression node) argument
367 cast(Type type, PExpression node) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/
H A DDOMExtension.js51 var node = this;
52 while (node) {
53 if (node === stayWithinNode) {
59 if (node.nodeType === Node.TEXT_NODE) {
60 var start = (node === this ? (offset - 1) : (node.nodeValue.length - 1));
62 if (stopCharacters.indexOf(node.nodeValue[i]) !== -1) {
63 startNode = node;
73 node = node
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DTypeInference.py68 def visit_WithTargetAssignmentStatNode(self, node):
69 self.mark_assignment(node.lhs, node.rhs)
70 self.visitchildren(node)
71 return node
73 def visit_SingleAssignmentNode(self, node):
74 self.mark_assignment(node.lhs, node.rhs)
75 self.visitchildren(node)
76 return node
[all...]
/external/chromium_org/third_party/bintrees/bintrees/
H A Dwalker.py61 """ get a leaf node """
95 node = self._tree.root
97 while node is not None:
98 if key == node.key:
100 elif less_than(key, node.key):
101 if (succ is None) or less_than(node.key, succ.key):
102 succ = node
103 node = left(node)
105 node
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dhash_table.c35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...]
/external/mesa3d/src/mesa/program/
H A Dhash_table.c35 struct node { struct
36 struct node *next;
37 struct node *prev;
45 struct node buckets[1];
50 struct node link;
95 struct node *node; local
96 struct node *temp;
101 foreach_s(node, temp, & ht->buckets[i]) {
102 remove_from_list(node);
116 struct node *node; local
142 struct hash_node *node; local
157 struct node *node; local
181 struct node *node = (struct node *) get_node(ht, key); local
199 struct node *node, *temp; local
[all...]
/external/chromium_org/tools/json_schema_compiler/
H A Didl_schema.py48 comment: The string from a Comment node.
92 Given a Callspec node representing an IDL function declaration, converts into
97 self.node = callspec_node
103 if self.node.GetProperty('TYPEREF') not in ('void', None):
104 return_type = Typeref(self.node.GetProperty('TYPEREF'),
105 self.node.parent,
106 {'name': self.node.GetName()}).process(callbacks)
112 for node in self.node.GetChildren():
113 parameter = Param(node)
[all...]
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DQualifierAlive.cpp33 bool QualifierWritten(TIntermNode* node, TQualifier qualifier) argument
37 if (node)
38 node->traverse(&it);
43 void TAliveTraverser::visitSymbol(TIntermSymbol* node) argument
48 if (node->getQualifier() == qualifier)
52 bool TAliveTraverser::visitSelection(Visit preVisit, TIntermSelection* node) argument
/external/chromium_org/third_party/skia/src/views/
H A DSkParsePaint.cpp14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node) argument
16 if ((node = dom.getFirstChild(node, "shader")) == NULL)
21 if (dom.hasAttr(node, "type", "linear-gradient"))
27 if ((str = dom.findAttr(node, "c0")) != NULL &&
29 (str = dom.findAttr(node, "c1")) != NULL &&
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0)
42 else if (dom.hasAttr(node, "typ
63 SkPaint_Inflate(SkPaint* paint, const SkDOM& dom, const SkDOM::Node* node) argument
[all...]
/external/chromium_org/third_party/skia/src/xml/
H A DSkDOM.cpp16 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) argument
18 const char* elemName = dom.getName(node);
23 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != NULL)
32 if (!this->parse(dom, node))
34 } while ((node = dom.getNextSibling(node)) != NULL);
81 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const argument
83 SkASSERT(node);
95 getNextSibling(const Node* node, const char name[]) const argument
120 findAttr(const Node* node, const char name[]) const argument
142 getNextAttr(const Node* node, const Attr* attr) const argument
150 getAttrName(const Node* node, const Attr* attr) const argument
157 getAttrValue(const Node* node, const Attr* attr) const argument
166 AttrIter(const SkDOM&, const SkDOM::Node* node) argument
217 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
310 walk_dom(const SkDOM& dom, const SkDOM::Node* node, SkXMLParser* parser) argument
332 copy(const SkDOM& dom, const SkDOM::Node* node) argument
345 countChildren(const Node* node, const char elem[]) const argument
362 findS32(const Node* node, const char name[], int32_t* value) const argument
368 findScalars(const Node* node, const char name[], SkScalar value[], int count) const argument
374 findHex(const Node* node, const char name[], uint32_t* value) const argument
380 findBool(const Node* node, const char name[], bool* value) const argument
386 findList(const Node* node, const char name[], const char list[]) const argument
392 hasAttr(const Node* node, const char name[], const char value[]) const argument
398 hasS32(const Node* node, const char name[], int32_t target) const argument
405 hasScalar(const Node* node, const char name[], SkScalar target) const argument
412 hasHex(const Node* node, const char name[], uint32_t target) const argument
419 hasBool(const Node* node, const char name[], bool target) const argument
436 dump(const Node* node, int level) const argument
[all...]
/external/skia/src/views/
H A DSkParsePaint.cpp14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node) argument
16 if ((node = dom.getFirstChild(node, "shader")) == NULL)
21 if (dom.hasAttr(node, "type", "linear-gradient"))
27 if ((str = dom.findAttr(node, "c0")) != NULL &&
29 (str = dom.findAttr(node, "c1")) != NULL &&
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0)
42 else if (dom.hasAttr(node, "typ
63 SkPaint_Inflate(SkPaint* paint, const SkDOM& dom, const SkDOM::Node* node) argument
[all...]
/external/skia/src/xml/
H A DSkDOM.cpp16 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) argument
18 const char* elemName = dom.getName(node);
23 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != NULL)
32 if (!this->parse(dom, node))
34 } while ((node = dom.getNextSibling(node)) != NULL);
81 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const argument
83 SkASSERT(node);
95 getNextSibling(const Node* node, const char name[]) const argument
120 findAttr(const Node* node, const char name[]) const argument
142 getNextAttr(const Node* node, const Attr* attr) const argument
150 getAttrName(const Node* node, const Attr* attr) const argument
157 getAttrValue(const Node* node, const Attr* attr) const argument
166 AttrIter(const SkDOM&, const SkDOM::Node* node) argument
217 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
310 walk_dom(const SkDOM& dom, const SkDOM::Node* node, SkXMLParser* parser) argument
332 copy(const SkDOM& dom, const SkDOM::Node* node) argument
345 countChildren(const Node* node, const char elem[]) const argument
362 findS32(const Node* node, const char name[], int32_t* value) const argument
368 findScalars(const Node* node, const char name[], SkScalar value[], int count) const argument
374 findHex(const Node* node, const char name[], uint32_t* value) const argument
380 findBool(const Node* node, const char name[], bool* value) const argument
386 findList(const Node* node, const char name[], const char list[]) const argument
392 hasAttr(const Node* node, const char name[], const char value[]) const argument
398 hasS32(const Node* node, const char name[], int32_t target) const argument
405 hasScalar(const Node* node, const char name[], SkScalar target) const argument
412 hasHex(const Node* node, const char name[], uint32_t target) const argument
419 hasBool(const Node* node, const char name[], bool target) const argument
436 dump(const Node* node, int level) const argument
[all...]

Completed in 1710 milliseconds

1234567891011>>