Searched refs:node (Results 126 - 150 of 1585) sorted by relevance

1234567891011>>

/external/webkit/Source/WebCore/html/parser/
H A DHTMLElementStack.cpp43 inline bool isNumberedHeaderElement(ContainerNode* node) argument
45 return node->hasTagName(h1Tag)
46 || node->hasTagName(h2Tag)
47 || node->hasTagName(h3Tag)
48 || node->hasTagName(h4Tag)
49 || node->hasTagName(h5Tag)
50 || node->hasTagName(h6Tag);
53 inline bool isRootNode(ContainerNode* node) argument
55 return node->nodeType() == Node::DOCUMENT_FRAGMENT_NODE
56 || node
59 isScopeMarker(ContainerNode* node) argument
80 isListItemScopeMarker(ContainerNode* node) argument
87 isTableScopeMarker(ContainerNode* node) argument
93 isTableBodyScopeMarker(ContainerNode* node) argument
101 isTableRowScopeMarker(ContainerNode* node) argument
107 isForeignContentScopeMarker(ContainerNode* node) argument
120 isButtonScopeMarker(ContainerNode* node) argument
126 isSelectScopeMarker(ContainerNode* node) argument
134 ElementRecord(PassRefPtr<ContainerNode> node, PassOwnPtr<ElementRecord> next) argument
424 ContainerNode* node = pos->node(); local
437 ContainerNode* node = record->node(); local
450 ContainerNode* node = record->node(); local
463 ContainerNode* node = pos->node(); local
552 pushCommon(PassRefPtr<ContainerNode> node) argument
[all...]
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/
H A DintermOut.cpp19 // Use this class to carry along data from node to node in
59 void OutputTreeText(TInfoSinkBase& sink, TIntermNode* node, const int depth) argument
63 sink.location(node->getLine());
78 void TOutputTraverser::visitSymbol(TIntermSymbol* node) argument
80 OutputTreeText(sink, node, depth);
82 sink << "'" << node->getSymbol() << "' ";
83 sink << "(" << node->getCompleteString() << ")\n";
86 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary* node) argument
90 OutputTreeText(out, node, dept
138 visitUnary(Visit visit, TIntermUnary* node) argument
202 visitAggregate(Visit visit, TIntermAggregate* node) argument
275 visitSelection(Visit visit, TIntermSelection* node) argument
308 visitConstantUnion(TIntermConstantUnion* node) argument
341 visitLoop(Visit visit, TIntermLoop* node) argument
379 visitBranch(Visit visit, TIntermBranch* node) argument
[all...]
H A DValidateLimitations.h41 bool validateLoopType(TIntermLoop* node);
42 bool validateForLoopHeader(TIntermLoop* node, TLoopInfo* info);
43 bool validateForLoopInit(TIntermLoop* node, TLoopInfo* info);
44 bool validateForLoopCond(TIntermLoop* node, TLoopInfo* info);
45 bool validateForLoopExpr(TIntermLoop* node, TLoopInfo* info);
48 bool validateFunctionCall(TIntermAggregate* node);
49 bool validateOperation(TIntermOperator* node, TIntermNode* operand);
53 bool isConstExpr(TIntermNode* node);
54 bool isConstIndexExpr(TIntermNode* node);
55 bool validateIndexing(TIntermBinary* node);
[all...]
H A DValidateLimitations.cpp20 // Traverses a node to check if it represents a constant index expression.
34 // Returns true if the parsed node represents a constant index expression.
75 bool ValidateLimitations::visitBinary(Visit, TIntermBinary* node) argument
78 validateOperation(node, node->getLeft());
81 switch (node->getOp()) {
84 validateIndexing(node);
91 bool ValidateLimitations::visitUnary(Visit, TIntermUnary* node) argument
94 validateOperation(node, node
104 visitAggregate(Visit, TIntermAggregate* node) argument
116 visitLoop(Visit, TIntermLoop* node) argument
161 validateLoopType(TIntermLoop* node) argument
173 validateForLoopHeader(TIntermLoop* node, TLoopInfo* info) argument
192 validateForLoopInit(TIntermLoop* node, TLoopInfo* info) argument
245 validateForLoopCond(TIntermLoop* node, TLoopInfo* info) argument
299 validateForLoopExpr(TIntermLoop* node, TLoopInfo* info) argument
371 validateFunctionCall(TIntermAggregate* node) argument
413 validateOperation(TIntermOperator* node, TIntermNode* operand) argument
428 isConstExpr(TIntermNode* node) argument
434 isConstIndexExpr(TIntermNode* node) argument
443 validateIndexing(TIntermBinary* node) argument
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/compiler/
H A DEscapingEvaluator.java23 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
24 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
25 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
26 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
27 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
28 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
30 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
31 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
32 import com.google.clearsilver.jsilver.syntax.node
134 caseAAddExpression(AAddExpression node) argument
147 caseAFunctionExpression(AFunctionExpression node) argument
234 caseAVariableExpression(AVariableExpression node) argument
255 caseAStringExpression(AStringExpression node) argument
263 caseADecimalExpression(ADecimalExpression node) argument
271 caseAHexExpression(AHexExpression node) argument
276 caseANumericExpression(ANumericExpression node) argument
281 caseANotExpression(ANotExpression node) argument
286 caseAExistsExpression(AExistsExpression node) argument
291 caseAEqExpression(AEqExpression node) argument
296 caseANumericEqExpression(ANumericEqExpression node) argument
301 caseANeExpression(ANeExpression node) argument
306 caseANumericNeExpression(ANumericNeExpression node) argument
311 caseALtExpression(ALtExpression node) argument
316 caseAGtExpression(AGtExpression node) argument
321 caseALteExpression(ALteExpression node) argument
326 caseAGteExpression(AGteExpression node) argument
331 caseAAndExpression(AAndExpression node) argument
336 caseAOrExpression(AOrExpression node) argument
341 caseANumericAddExpression(ANumericAddExpression node) argument
346 caseASubtractExpression(ASubtractExpression node) argument
351 caseAMultiplyExpression(AMultiplyExpression node) argument
356 caseADivideExpression(ADivideExpression node) argument
361 caseAModuloExpression(AModuloExpression node) argument
366 caseANegativeExpression(ANegativeExpression node) argument
[all...]
/external/clang/bindings/python/examples/cindex/
H A Dcindex-dump.py39 def get_info(node, depth=0):
44 for c in node.get_children()]
45 return { 'id' : get_cursor_id(node),
46 'kind' : node.kind,
47 'usr' : node.get_usr(),
48 'spelling' : node.spelling,
49 'location' : node.location,
50 'extent.start' : node.extent.start,
51 'extent.end' : node.extent.end,
52 'is_definition' : node
[all...]
/external/openssl/crypto/x509v3/
H A Dpcy_lib.c135 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) argument
137 if (!node)
139 return node->data->valid_policy;
143 int X509_policy_node_get_critical(const X509_POLICY_NODE *node)
145 if (node_critical(node))
152 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node)
154 if (!node)
156 return node->data->qualifier_set;
160 X509_policy_node_get0_parent(const X509_POLICY_NODE *node) argument
162 if (!node)
[all...]
H A Dpcy_node.c98 X509_POLICY_NODE *node; local
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
103 if (node->parent == parent)
105 if (!OBJ_cmp(node->data->valid_policy, id))
106 return node;
117 X509_POLICY_NODE *node; local
118 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
119 if (!node)
121 node->data = data;
122 node
165 policy_node_free(X509_POLICY_NODE *node) argument
174 policy_node_match(const X509_POLICY_LEVEL *lvl, const X509_POLICY_NODE *node, const ASN1_OBJECT *oid) argument
[all...]
/external/oprofile/libdb/
H A Ddb_insert.c24 odb_node_t * node; local
38 node = &data->node_base[new_node];
39 node->value = value;
40 node->key = key;
43 node->next = data->hash_base[index];
62 odb_node_t * node; local
68 node = &data->node_base[index];
69 if (node->key == key) {
70 if (node->value + offset != 0) {
71 node
[all...]
/external/chromium/chrome/browser/resources/sync_internals/
H A Dsync_node_browser.css7 #sync-node-main {
11 #sync-node-tree-container {
22 #sync-node-tree {
29 #sync-node-tree .leaf .tree-label {
33 #sync-node-splitter {
41 html[os=win] #sync-node-splitter {
45 #node-browser tr:nth-child(odd) {
/external/webkit/Source/WebCore/platform/graphics/gpu/
H A DPODIntervalTree.h112 // Starting from the given node, adds all overlaps with the given
115 void searchForOverlapsFrom(IntervalNode* node, const IntervalType& interval, Vector<IntervalType>& res) const argument
117 if (!node)
124 IntervalNode* left = node->left();
131 // Check for overlap with current node.
132 if (node->data().overlaps(interval))
133 res.append(node->data());
138 if (!(interval.high() < node->data().low()))
139 searchForOverlapsFrom(node->right(), interval, res);
142 virtual bool updateNode(IntervalNode* node) argument
165 checkInvariantsFromNode(IntervalNode* node, T* currentMaxValue) const argument
[all...]
/external/doclava/res/assets/templates/assets/
H A Ddoclava-developer-reference.js100 var node = new Object();
101 node.children = Array();
102 node.children_data = children_data;
103 node.depth = mom.depth + 1;
105 node.li = document.createElement("li");
106 mom.get_children_ul().appendChild(node.li);
108 node.label_div = document.createElement("div");
109 node.label_div.className = "label";
111 $(node.label_div).addClass("api");
112 $(node
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/interpreter/
H A DVariableLocator.java20 import com.google.clearsilver.jsilver.syntax.node.ADecNumberVariable;
21 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
22 import com.google.clearsilver.jsilver.syntax.node.AExpandVariable;
23 import com.google.clearsilver.jsilver.syntax.node.AHexNumberVariable;
24 import com.google.clearsilver.jsilver.syntax.node.ANameVariable;
25 import com.google.clearsilver.jsilver.syntax.node.PVariable;
29 * Walks a PVariable node from the parse tree and returns a Data path name.
31 * @see #getVariableName(com.google.clearsilver.jsilver.syntax.node.PVariable)
47 * @param variable the variable node to evaluate.
49 * node
83 caseANameVariable(ANameVariable node) argument
88 caseADecNumberVariable(ADecNumberVariable node) argument
93 caseAHexNumberVariable(AHexNumberVariable node) argument
98 caseADescendVariable(ADescendVariable node) argument
104 caseAExpandVariable(AExpandVariable node) argument
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMAxisIterNodeList.java100 * @return The node at the <code>index</code>th position in the
106 int node;
110 node = m_cachedNodes.elementAt(index);
111 return m_dtm.getNode(node);
113 while (((node = m_iter.next()) != DTMAxisIterator.END)
115 m_cachedNodes.addElement(node);
118 if (node == DTMAxisIterator.END) {
121 return m_dtm.getNode(node);
129 * The number of nodes in the list. The range of valid child node indices
134 int node;
[all...]
/external/chromium/base/debug/
H A Dleak_tracker.h85 for (LinkNode<LeakTracker<T> >* node = instances()->head();
86 node != instances()->end();
87 node = node->next()) {
88 StackTrace& allocation_stack = node->value()->allocation_stack_;
95 LOG_STREAM(ERROR) << "Leaked " << node << " which was allocated by:";
113 for (LinkNode<LeakTracker<T> >* node = instances()->head();
114 node != instances()->end();
115 node = node
[all...]
/external/e2fsprogs/lib/uuid/
H A Dunparse.c59 uuid.node[0], uuid.node[1], uuid.node[2],
60 uuid.node[3], uuid.node[4], uuid.node[5]);
/external/bluetooth/glib/gobject/
H A Dgtype.c179 static inline GTypeFundamentalInfo* type_node_fundamental_info_I (TypeNode *node);
180 static void type_add_flags_W (TypeNode *node,
182 static void type_data_make_W (TypeNode *node,
185 static inline void type_data_ref_Wm (TypeNode *node);
186 static inline void type_data_unref_WmREC (TypeNode *node,
190 static inline gpointer type_get_qdata_L (TypeNode *node,
192 static inline void type_set_qdata_W (TypeNode *node,
198 TypeNode *node);
200 TypeNode *node);
201 static gboolean type_node_is_a_L (TypeNode *node,
386 TypeNode *node; local
474 type_node_fundamental_info_I(TypeNode *node) argument
490 TypeNode *node; local
522 type_lookup_iface_entry_L(TypeNode *node, TypeNode *iface_node) argument
590 TypeNode *node = lookup_type_node_I (type); local
870 TypeNode *node = NULL; local
886 TypeNode *node = lookup_type_node_I (instance_type); local
973 type_data_make_W(TypeNode *node, const GTypeInfo *info, const GTypeValueTable *value_table) argument
1101 type_data_ref_Wm(TypeNode *node) argument
1142 type_data_unref_WmREC(TypeNode *node, gboolean uncached) argument
1166 type_node_add_iface_entry_W(TypeNode *node, GType iface_type, IFaceEntry *parent_entry) argument
1222 type_add_interface_Wm(TypeNode *node, TypeNode *iface, const GInterfaceInfo *info, GTypePlugin *plugin) argument
1426 TypeNode *node = lookup_type_node_I (prerequisite); local
1526 type_total_instance_size_I(TypeNode *node) argument
1579 InstanceRealClass key, *node; local
1597 InstanceRealClass key, *node; local
1631 TypeNode *node; local
1692 TypeNode *node; local
1756 type_iface_vtable_base_init_Wm(TypeNode *iface, TypeNode *node) argument
1807 type_iface_vtable_iface_init_Wm(TypeNode *iface, TypeNode *node) argument
1843 type_iface_vtable_finalize_Wm(TypeNode *iface, TypeNode *node, GTypeInterface *vtable) argument
1878 type_class_init_Wm(TypeNode *node, GTypeClass *pclass) argument
2028 type_data_finalize_class_ifaces_Wm(TypeNode *node) argument
2058 type_data_finalize_class_U(TypeNode *node, ClassData *cdata) argument
2084 TypeNode *node = lookup_type_node_I (type); local
2345 TypeNode *node; local
2455 TypeNode *pnode, *node; local
2510 TypeNode *pnode, *node; local
2561 TypeNode *node = lookup_type_node_I (instance_type); local
2585 TypeNode *node; local
2621 TypeNode *node; local
2680 TypeNode *node; local
2708 TypeNode *node; local
2739 TypeNode *node; local
2767 TypeNode *node; local
2803 TypeNode *node; local
2839 TypeNode *node; local
2882 TypeNode *node; local
2936 TypeNode *node; local
2985 TypeNode *node; local
3016 TypeNode *node; local
3048 TypeNode *node; local
3068 TypeNode *node; local
3117 TypeNode *node; local
3136 TypeNode *node; local
3163 TypeNode *node; local
3183 type_node_check_conformities_UorL(TypeNode *node, TypeNode *iface_node, gboolean support_interfaces, gboolean support_prerequisites, gboolean have_lock) argument
3214 type_node_is_a_L(TypeNode *node, TypeNode *iface_node) argument
3221 type_node_conforms_to_U(TypeNode *node, TypeNode *iface_node, gboolean support_interfaces, gboolean support_prerequisites) argument
3244 TypeNode *node, *iface_node; local
3268 TypeNode *node; local
3311 TypeNode *node; local
3353 type_get_qdata_L(TypeNode *node, GQuark quark) argument
3399 TypeNode *node; local
3418 type_set_qdata_W(TypeNode *node, GQuark quark, gpointer data) argument
3465 TypeNode *node; local
3481 type_add_flags_W(TypeNode *node, GTypeFlags flags) argument
3513 TypeNode *node; local
3541 TypeNode *node; local
3587 TypeNode *node; local
3611 TypeNode *node; local
3678 TypeNode *node = lookup_type_node_I (type_id); local
3687 TypeNode *node, *iface; local
3704 TypeNode *node, *iface; local
3725 TypeNode *node, *iface; local
3758 TypeNode *node, *iface; local
3802 TypeNode *node = lookup_type_node_I (type_instance->g_class->g_type); local
3823 TypeNode *node; local
3895 TypeNode *node = lookup_type_node_I (type); local
3981 TypeNode *node; local
4143 TypeNode *node = lookup_type_node_I (instance_type); local
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_bookmark_helpers.h21 DictionaryValue* GetNodeDictionary(const BookmarkNode* node,
25 // Add a JSON representation of |node| to the JSON |list|.
26 void AddNode(const BookmarkNode* node, ListValue* list, bool recurse);
28 void AddNodeFoldersOnly(const BookmarkNode* node,
/external/qemu/
H A Dnotify.c24 QTAILQ_INSERT_HEAD(&list->notifiers, notifier, node);
29 QTAILQ_REMOVE(&list->notifiers, notifier, node);
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
/external/v8/tools/
H A Dprofile_view.js52 callTree.traverse(function(node, viewParent) {
53 var totalWeight = node.totalWeight * samplingRate;
54 var selfWeight = node.selfWeight * samplingRate;
62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
78 * @param {ProfileView.Node} head View head node.
87 * Factory method for a profile view node.
96 * @return {ProfileView.Node} Profile view node.
109 * @param {ProfileView.Node} head Head (root) node.
125 this.traverse(function (node) {
126 node
[all...]
/external/webkit/Source/WebCore/dom/
H A DTraversal.cpp41 short Traversal::acceptNode(ScriptState* state, Node* node) const
45 // The bit twiddling here is done to map DOM node types, which are given as integers from
47 if (!(((1 << (node->nodeType() - 1)) & m_whatToShow)))
51 return m_filter->acceptNode(state, node);
/external/webkit/Source/WebCore/svg/
H A DSVGFEComponentTransferElement.cpp93 for (Node* node = firstChild(); node; node = node->nextSibling()) {
94 if (node->hasTagName(SVGNames::feFuncRTag))
95 red = static_cast<SVGFEFuncRElement*>(node)->transferFunction();
96 else if (node->hasTagName(SVGNames::feFuncGTag))
97 green = static_cast<SVGFEFuncGElement*>(node)->transferFunction();
98 else if (node->hasTagName(SVGNames::feFuncBTag))
99 blue = static_cast<SVGFEFuncBElement*>(node)
[all...]
/external/freetype/src/base/
H A Dftdbgmem.c277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
360 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
363 while ( node )
434 FT_MemNode *pnode, node; local
459 FT_MemSource node, *pnode; local
514 FT_MemNode *pnode, node; local
614 FT_MemNode *pnode, node; local
746 FT_MemNode node, *pnode; local
[all...]
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DTreeWalker2Result.java65 * @param pos Start node for traversal
78 * End processing of given node
81 * @param node Node we just finished processing
85 protected void endNode(int node) throws org.xml.sax.SAXException argument
87 super.endNode(node);
88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node))
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversal
102 protected void startNode(int node) throw argument
[all...]
/external/bluetooth/glib/gio/fen/
H A Dfen-node.h28 typedef struct node node_t;
30 struct node struct
36 /* the parent and children of node */
49 void (*hit) (node_t* node, gpointer user_data);
52 gboolean (*pre_del) (node_t* node, gpointer user_data);
58 void remove_node (node_t* node, node_op_t* op);
59 void pending_remove_node (node_t* node, node_op_t* op);
61 void travel_nodes (node_t* node, node_op_t* op);
68 gpointer node_get_data (node_t* node);
69 gpointer node_set_data (node_t* node, gpointe
[all...]

Completed in 1333 milliseconds

1234567891011>>