/external/v8/src/compiler/ |
H A D | simplified-operator-reducer.cc | 9 #include "src/compiler/node-matchers.h" 42 Reduction SimplifiedOperatorReducer::Reduce(Node* node) { argument 43 switch (node->opcode()) { 45 HeapObjectMatcher m(node->InputAt(0)); 52 Int32Matcher m(node->InputAt(0)); 59 HeapObjectMatcher m(node->InputAt(0)); 65 Float64Matcher m(node->InputAt(0)); 67 if (m.IsChangeTaggedToFloat64()) return Replace(m.node()->InputAt(0)); 72 Int32Matcher m(node->InputAt(0)); 81 NumberMatcher m(node 214 Change(Node* node, const Operator* op, Node* a) argument [all...] |
H A D | representation-change.cc | 113 Node* node, MachineRepresentation output_rep, Type* output_type, 119 return TypeError(node, output_rep, output_type, use_info.representation()); 127 return node; 134 return node; 142 return GetTaggedSignedRepresentationFor(node, output_rep, output_type, 147 return GetTaggedPointerRepresentationFor(node, output_rep, output_type, 151 return GetTaggedRepresentationFor(node, output_rep, output_type, 155 return GetFloat32RepresentationFor(node, output_rep, output_type, 158 return GetFloat64RepresentationFor(node, output_rep, output_type, 162 return GetBitRepresentationFor(node, output_re 112 GetRepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Node* use_node, UseInfo use_info) argument 181 GetTaggedSignedRepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Node* use_node, UseInfo use_info) argument 289 GetTaggedPointerRepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Node* use_node, UseInfo use_info) argument 345 GetTaggedRepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Truncation truncation) argument 420 GetFloat32RepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Truncation truncation) argument 480 GetFloat64RepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Node* use_node, UseInfo use_info) argument 552 GetWord32RepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type, Node* use_node, UseInfo use_info) argument 672 InsertConversion(Node* node, const Operator* op, Node* use_node) argument 687 GetBitRepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type) argument 737 GetWord64RepresentationFor( Node* node, MachineRepresentation output_rep, Type* output_type) argument 952 TypeError(Node* node, MachineRepresentation output_rep, Type* output_type, MachineRepresentation use) argument 975 InsertChangeBitToTagged(Node* node) argument 979 InsertChangeFloat32ToFloat64(Node* node) argument 983 InsertChangeFloat64ToUint32(Node* node) argument 987 InsertChangeFloat64ToInt32(Node* node) argument 991 InsertChangeInt32ToFloat64(Node* node) argument 995 InsertChangeTaggedSignedToInt32(Node* node) argument 1000 InsertChangeTaggedToFloat64(Node* node) argument 1005 InsertChangeUint32ToFloat64(Node* node) argument [all...] |
H A D | graph.cc | 11 #include "src/compiler/node-properties.h" 12 #include "src/compiler/node.h" 28 void Graph::Decorate(Node* node) { argument 30 decorator->Decorate(node); 48 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); local 49 Verifier::VerifyNode(node); 50 return node; 55 Node* const node = local 57 Decorate(node); 58 return node; 62 CloneNode(const Node* node) argument [all...] |
H A D | int64-lowering.h | 11 #include "src/compiler/node-marker.h" 47 void PrepareReplacements(Node* node); 48 void PushNode(Node* node); 49 void LowerNode(Node* node); 50 bool DefaultLowering(Node* node); 51 void LowerComparison(Node* node, const Operator* signed_op, 53 void PrepareProjectionReplacements(Node* node); 56 bool HasReplacementLow(Node* node); 57 Node* GetReplacementLow(Node* node); 58 bool HasReplacementHigh(Node* node); 64 Node* node; member in struct:v8::internal::compiler::Int64Lowering::NodeState [all...] |
H A D | scheduler.cc | 14 #include "src/compiler/node-marker.h" 15 #include "src/compiler/node-properties.h" 16 #include "src/compiler/node.h" 64 Scheduler::SchedulerData* Scheduler::GetData(Node* node) { argument 65 return &node_data_[node->id()]; 69 Scheduler::Placement Scheduler::GetPlacement(Node* node) { argument 70 SchedulerData* data = GetData(node); 72 switch (node->opcode()) { 81 // otherwise they are coupled to a floating control node. 82 Placement p = GetPlacement(NodeProperties::GetControlInput(node)); 103 UpdatePlacement(Node* node, Placement placement) argument 150 IsCoupledControlEdge(Node* node, int index) argument 156 IncrementUnscheduledUseCount(Node* node, int index, Node* from) argument 179 DecrementUnscheduledUseCount(Node* node, int index, Node* from) argument 236 Node* node = queue_.front(); local 261 Node* node = queue_.front(); local 289 FixNode(BasicBlock* block, Node* node) argument 294 Queue(Node* node) argument 304 BuildBlocks(Node* node) argument 341 ConnectBlocks(Node* node) argument 386 BuildBlockForNode(Node* node) argument 397 BuildBlocksForSuccessors(Node* node) argument 406 CollectSuccessorBlocks(Node* node, BasicBlock** successor_blocks, size_t successor_cnt) argument 415 FindPredecessorBlock(Node* node) argument 537 TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) argument 548 IsFinalMerge(Node* node) argument 1154 Pre(Node* node) argument 1199 Node* node = graph_->end(); local 1205 Node* node = edge.to(); local 1241 VisitNode(Node* node) argument 1266 PropagateMinimumPositionToNode(BasicBlock* block, Node* node) argument 1355 Node* const node = queue->front(); local 1365 VisitNode(Node* node) argument 1426 SplitNode(BasicBlock* block, Node* node) argument 1531 GetCommonDominatorOfUses(Node* node) argument 1544 FindPredecessorBlock(Node* node) argument 1588 ScheduleFloatingControl(BasicBlock* block, Node* node) argument 1602 Node* node = NodeProperties::GetEffectInput(region_end); local 1620 ScheduleNode(BasicBlock* block, Node* node) argument 1626 CloneNode(Node* node) argument 1690 FuseFloatingControl(BasicBlock* block, Node* node) argument [all...] |
/external/jemalloc/include/jemalloc/internal/ |
H A D | rb.h | 6 * bit of right-child pointers (if RB_COMPACT is defined), thus making node 84 /* Bookkeeping bit cannot be used by node pointer. */ \ 173 a_prefix##next(a_rbt_type *rbtree, a_type *node); \ 175 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \ 183 a_prefix##insert(a_rbt_type *rbtree, a_type *node); \ 185 a_prefix##remove(a_rbt_type *rbtree, a_type *node); \ 205 * a_type : Type for red-black tree node data structure (ex: ex_node_t). 206 * a_field : Name of red-black tree node linkage (ex: ex_link). 248 * Description: Get the first/last node in tree. 251 * Ret: First/last node i [all...] |
/external/swiftshader/src/OpenGL/compiler/ |
H A D | parseConst.cpp | 18 // Use this class to carry along data from node to node in 68 void TConstTraverser::visitSymbol(TIntermSymbol* node) argument 70 infoSink.info.message(EPrefixInternalError, "Symbol Node found in constant constructor", node->getLine()); 74 bool TConstTraverser::visitBinary(Visit visit, TIntermBinary* node) argument 76 TQualifier qualifier = node->getType().getQualifier(); 82 infoSink.info.message(EPrefixError, buf.c_str(), node->getLine()); 87 infoSink.info.message(EPrefixInternalError, "Binary Node found in constant constructor", node->getLine()); 92 bool TConstTraverser::visitUnary(Visit visit, TIntermUnary* node) argument 97 infoSink.info.message(EPrefixError, buf.c_str(), node 102 visitAggregate(Visit visit, TIntermAggregate* node) argument 150 visitSelection(Visit visit, TIntermSelection* node) argument 157 visitConstantUnion(TIntermConstantUnion* node) argument 220 visitLoop(Visit visit, TIntermLoop* node) argument 227 visitBranch(Visit visit, TIntermBranch* node) argument [all...] |
H A D | intermOut.cpp | 28 // Use this class to carry along data from node to node in 68 void OutputTreeText(TInfoSinkBase& sink, TIntermNode* node, const int depth) argument 72 sink.location(node->getLine()); 87 void TOutputTraverser::visitSymbol(TIntermSymbol* node) argument 89 OutputTreeText(sink, node, mDepth); 91 sink << "'" << node->getSymbol() << "' "; 92 sink << "(" << node->getCompleteString() << ")\n"; 95 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary* node) argument 99 OutputTreeText(out, node, mDept 159 visitUnary(Visit visit, TIntermUnary* node) argument 245 visitAggregate(Visit visit, TIntermAggregate* node) argument 324 visitSelection(Visit visit, TIntermSelection* node) argument 357 visitConstantUnion(TIntermConstantUnion* node) argument 394 visitLoop(Visit visit, TIntermLoop* node) argument 432 visitBranch(Visit visit, TIntermBranch* node) argument [all...] |
/external/bison/src/ |
H A D | symlist.c | 136 symbol_list_prepend (symbol_list *list, symbol_list *node) argument 138 node->next = list; 139 return node; 150 symbol_list *node, *next; local 151 for (node = list; node; node = next) 153 next = node->next; 154 named_ref_free (node->named_ref); 155 free (node); 219 symbol_list_null(symbol_list *node) argument 226 symbol_list_destructor_set(symbol_list *node, code_props const *destructor) argument 247 symbol_list_printer_set(symbol_list *node, code_props const *printer) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | xml-utils.h | 18 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, 20 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, 22 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node); 23 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node); 26 xml_node_t *node); 27 char * xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node); 28 void xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node); 42 void xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, 44 int xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, 46 char * xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, [all...] |
H A D | xml_libxml2.c | 53 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, argument 70 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 115 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, argument 131 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 167 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node) argument 169 xmlFreeNode((xmlNodePtr) node); 173 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node) argument 175 return (xml_node_t *) ((xmlNodePtr) node)->parent; 182 xmlNodePtr node; local 187 node 195 xml_node_get_localname(struct xml_node_ctx *ctx, xml_node_t *node) argument 202 xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node) argument 245 xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node) argument 262 xmlNodePtr node; local 284 xmlNodePtr node; local 295 xmlNodePtr node; local 306 xmlNodePtr node; local 317 xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, const char *value) argument 325 xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, xml_namespace_t *ns, const char *name, const char *value) argument 343 xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, char *name) argument 351 xml_node_get_attr_value_ns(struct xml_node_ctx *ctx, xml_node_t *node, const char *ns_uri, char *name) argument 373 xml_node_next_sibling(struct xml_node_ctx *ctx, xml_node_t *node) argument 380 xml_node_is_element(struct xml_node_ctx *ctx, xml_node_t *node) argument 386 xml_node_get_text(struct xml_node_ctx *ctx, xml_node_t *node) argument 401 xml_node_get_base64_text(struct xml_node_ctx *ctx, xml_node_t *node, int *ret_len) argument 429 xml_node_copy(struct xml_node_ctx *ctx, xml_node_t *node) argument [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | xml-utils.h | 18 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, 20 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, 22 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node); 23 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node); 26 xml_node_t *node); 27 char * xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node); 28 void xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node); 42 void xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, 44 int xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, 46 char * xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, [all...] |
H A D | xml_libxml2.c | 53 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, argument 70 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 115 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, argument 131 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 167 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node) argument 169 xmlFreeNode((xmlNodePtr) node); 173 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node) argument 175 return (xml_node_t *) ((xmlNodePtr) node)->parent; 182 xmlNodePtr node; local 187 node 195 xml_node_get_localname(struct xml_node_ctx *ctx, xml_node_t *node) argument 202 xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node) argument 245 xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node) argument 262 xmlNodePtr node; local 284 xmlNodePtr node; local 295 xmlNodePtr node; local 306 xmlNodePtr node; local 317 xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, const char *value) argument 325 xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, xml_namespace_t *ns, const char *name, const char *value) argument 343 xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, char *name) argument 351 xml_node_get_attr_value_ns(struct xml_node_ctx *ctx, xml_node_t *node, const char *ns_uri, char *name) argument 373 xml_node_next_sibling(struct xml_node_ctx *ctx, xml_node_t *node) argument 380 xml_node_is_element(struct xml_node_ctx *ctx, xml_node_t *node) argument 386 xml_node_get_text(struct xml_node_ctx *ctx, xml_node_t *node) argument 401 xml_node_get_base64_text(struct xml_node_ctx *ctx, xml_node_t *node, int *ret_len) argument 429 xml_node_copy(struct xml_node_ctx *ctx, xml_node_t *node) argument [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | xml-utils.h | 18 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, 20 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, 22 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node); 23 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node); 26 xml_node_t *node); 27 char * xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node); 28 void xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node); 42 void xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, 44 int xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, 46 char * xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, [all...] |
H A D | xml_libxml2.c | 53 int xml_validate(struct xml_node_ctx *ctx, xml_node_t *node, argument 70 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 115 int xml_validate_dtd(struct xml_node_ctx *ctx, xml_node_t *node, argument 131 n = xmlDocCopyNode((xmlNodePtr) node, doc, 1); 167 void xml_node_free(struct xml_node_ctx *ctx, xml_node_t *node) argument 169 xmlFreeNode((xmlNodePtr) node); 173 xml_node_t * xml_node_get_parent(struct xml_node_ctx *ctx, xml_node_t *node) argument 175 return (xml_node_t *) ((xmlNodePtr) node)->parent; 182 xmlNodePtr node; local 187 node 195 xml_node_get_localname(struct xml_node_ctx *ctx, xml_node_t *node) argument 202 xml_node_to_str(struct xml_node_ctx *ctx, xml_node_t *node) argument 245 xml_node_detach(struct xml_node_ctx *ctx, xml_node_t *node) argument 262 xmlNodePtr node; local 284 xmlNodePtr node; local 295 xmlNodePtr node; local 306 xmlNodePtr node; local 317 xml_node_set_text(struct xml_node_ctx *ctx, xml_node_t *node, const char *value) argument 325 xml_node_add_attr(struct xml_node_ctx *ctx, xml_node_t *node, xml_namespace_t *ns, const char *name, const char *value) argument 343 xml_node_get_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, char *name) argument 351 xml_node_get_attr_value_ns(struct xml_node_ctx *ctx, xml_node_t *node, const char *ns_uri, char *name) argument 373 xml_node_next_sibling(struct xml_node_ctx *ctx, xml_node_t *node) argument 380 xml_node_is_element(struct xml_node_ctx *ctx, xml_node_t *node) argument 386 xml_node_get_text(struct xml_node_ctx *ctx, xml_node_t *node) argument 401 xml_node_get_base64_text(struct xml_node_ctx *ctx, xml_node_t *node, int *ret_len) argument 429 xml_node_copy(struct xml_node_ctx *ctx, xml_node_t *node) argument [all...] |
/external/mesa3d/src/gallium/tools/trace/ |
H A D | model.py | 126 def visit_literal(self, node): 129 def visit_named_constant(self, node): 132 def visit_array(self, node): 135 def visit_struct(self, node): 138 def visit_pointer(self, node): 141 def visit_call(self, node): 144 def visit_trace(self, node): 153 def visit_literal(self, node): 154 if node.value is None: 158 if isinstance(node [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | rbtree.h | 56 struct rb_node * node) 75 rb_link_node(node, parent, p); 82 struct rb_node * node) 85 if ((ret = __rb_insert_page_cache(inode, offset, node))) 87 rb_insert_color(node, &inode->i_rb_page_cache); 151 static inline int ext2fs_rb_empty_node(struct rb_node *node) argument 153 return ext2fs_rb_parent(node) == node; 156 static inline void ext2fs_rb_clear_node(struct rb_node *node) argument 158 ext2fs_rb_set_parent(node, nod 182 ext2fs_rb_link_node(struct rb_node * node, struct rb_node * parent, struct rb_node ** rb_link) argument [all...] |
/external/mesa3d/src/mesa/vbo/ |
H A D | vbo_save_draw.c | 51 const struct vbo_save_vertex_list *node) 58 if (node->current_size == 0) 61 if (node->current_data) { 62 data = node->current_data; 67 if (node->count) 68 offset = (node->buffer_offset + 69 (node->count-1) * node->vertex_size * sizeof(GLfloat)); 71 offset = node->buffer_offset; 74 node 50 _playback_copy_to_current(struct gl_context *ctx, const struct vbo_save_vertex_list *node) argument 134 vbo_bind_vertex_list(struct gl_context *ctx, const struct vbo_save_vertex_list *node) argument 259 const struct vbo_save_vertex_list *node = local [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | CharsTrie.java | 132 int node; 133 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? 134 valueResults_[node>>15] : Result.NO_VALUE; 176 // Remaining part of a linear-match node. 180 int node; 181 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? 182 valueResults_[node>>15] : Result.NO_VALUE; 232 // Continue a linear-match node. 238 int node; 239 return (length<0 && (node [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | CharsTrie.java | 139 int node; 140 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? 141 valueResults_[node>>15] : Result.NO_VALUE; 186 // Remaining part of a linear-match node. 190 int node; 191 return (length<0 && (node=chars_.charAt(pos))>=kMinValueLead) ? 192 valueResults_[node>>15] : Result.NO_VALUE; 244 // Continue a linear-match node. 250 int node; 251 return (length<0 && (node [all...] |
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
H A D | BaseConstructor.java | 44 * It maps the node kind to the the Construct implementation. When the 54 * node has the Object.class) 104 Node node = composer.getNode(); 106 node.setTag(rootTag); 108 return constructDocument(node); 120 Node node = composer.getSingleNode(); 121 if (node != null) { 123 node.setTag(new Tag(type)); 125 node.setTag(rootTag); 127 return constructDocument(node); 140 constructDocument(Node node) argument 172 constructObject(Node node) argument 200 getConstructor(Node node) argument 217 constructScalar(ScalarNode node) argument 234 constructSequence(SequenceNode node) argument 252 constructSet(SequenceNode node) argument 269 constructArray(SequenceNode node) argument 273 constructSequenceStep2(SequenceNode node, Collection<Object> collection) argument 279 constructArrayStep2(SequenceNode node, Object array) argument 346 constructSet(MappingNode node) argument 352 constructMapping(MappingNode node) argument 358 constructMapping2ndStep(MappingNode node, Map<Object, Object> mapping) argument 390 constructSet2ndStep(MappingNode node, Set<Object> set) argument [all...] |
/external/droiddriver/src/io/appium/droiddriver/uiautomation/ |
H A D | UiAutomationElement.java | 54 private final AccessibilityNodeInfo node; field in class:UiAutomationElement 69 protected UiAutomationElement(UiAutomationContext context, AccessibilityNodeInfo node, argument 71 this.node = Preconditions.checkNotNull(node); 76 put(attribs, Attribute.PACKAGE, charSequenceToString(node.getPackageName())); 77 put(attribs, Attribute.CLASS, charSequenceToString(node.getClassName())); 78 put(attribs, Attribute.TEXT, charSequenceToString(node.getText())); 79 put(attribs, Attribute.CONTENT_DESC, charSequenceToString(node.getContentDescription())); 80 put(attribs, Attribute.RESOURCE_ID, charSequenceToString(node.getViewIdResourceName())); 81 put(attribs, Attribute.CHECKABLE, node 112 buildChildren(AccessibilityNodeInfo node) argument 129 getBounds(AccessibilityNodeInfo node) argument [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
H A D | TemplateTranslator.java | 39 import com.google.clearsilver.jsilver.syntax.node.AAltCommand; 40 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand; 41 import com.google.clearsilver.jsilver.syntax.node.ACallCommand; 42 import com.google.clearsilver.jsilver.syntax.node.ADataCommand; 43 import com.google.clearsilver.jsilver.syntax.node.ADefCommand; 44 import com.google.clearsilver.jsilver.syntax.node.AEachCommand; 45 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand; 46 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand; 47 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand; 48 import com.google.clearsilver.jsilver.syntax.node 190 caseStart(Start node) argument 224 caseADataCommand(ADataCommand node) argument 233 caseAVarCommand(AVarCommand node) argument 250 caseAUvarCommand(AUvarCommand node) argument 260 caseASetCommand(ASetCommand node) argument 284 caseANameCommand(ANameCommand node) argument 295 caseAIfCommand(AIfCommand node) argument 312 caseAEachCommand(AEachCommand node) argument 324 caseAWithCommand(AWithCommand node) argument 373 caseALoopToCommand(ALoopToCommand node) argument 386 caseALoopCommand(ALoopCommand node) argument 400 caseALoopIncCommand(ALoopIncCommand node) argument 481 caseAAltCommand(AAltCommand node) argument 531 caseAEscapeCommand(AEscapeCommand node) argument 547 caseAAutoescapeCommand(AAutoescapeCommand node) argument 562 caseAHardLincludeCommand(AHardLincludeCommand node) argument 573 caseALincludeCommand(ALincludeCommand node) argument 583 caseAHardIncludeCommand(AHardIncludeCommand node) argument 594 caseAIncludeCommand(AIncludeCommand node) argument 604 caseALvarCommand(ALvarCommand node) argument 613 caseAEvarCommand(AEvarCommand node) argument 629 caseADefCommand(ADefCommand node) argument 656 parseDefNode(JavaExpression macroName, ADefCommand node) argument 717 caseACallCommand(ACallCommand node) argument 818 caseTCsOpen(TCsOpen node) argument [all...] |
/external/c-ares/ |
H A D | ares_llist.h | 30 void ares__init_list_node(struct list_node* node, void* d); 37 void ares__remove_from_list(struct list_node* node);
|
/external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/ |
H A D | test_explicit_packages.py | 27 node = mf.findNode('pkg') 28 self.assertIsInstance(node, modulegraph.Package) 30 node = mf.findNode('pkg.sub3') 31 self.assertIsInstance(node, modulegraph.SourceModule) 44 node = mf.findNode('pkg') 45 self.assertIsInstance(node, modulegraph.Package) 47 node = mf.findNode('pkg.sub3') 48 self.assertIsInstance(node, modulegraph.ExcludedModule)
|