Home
last modified time | relevance | path

Searched refs:node (Results 151 - 175 of 2502) sorted by relevance

12345678910>>...101

/third_party/skia/modules/sksg/src/
H A DSkSGNode.cpp18 ScopedFlag(Node* node, uint32_t flag) in ScopedFlag() argument
19 : fNode(node) in ScopedFlag()
21 , fWasSet(node->fFlags & flag) { in ScopedFlag()
22 node->fFlags |= flag; in ScopedFlag()
59 void Node::observeInval(const sk_sp<Node>& node) { in observeInval() argument
60 SkASSERT(node); in observeInval()
61 if (!(node->fFlags & kObserverArray_Flag)) { in observeInval()
62 if (!node->fInvalObserver) { in observeInval()
63 node->fInvalObserver = this; in observeInval()
69 observers->push_back(node in observeInval()
82 unobserveInval(const sk_sp<Node>& node) unobserveInval() argument
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dloop-analysis.cc10 #include "src/compiler/node-marker.h"
11 #include "src/compiler/node-properties.h"
12 #include "src/compiler/node.h"
30 // Temporary information for each node during marking.
32 Node* node; member
53 // either a {Loop} node or a phi. The {Loop} node itself and its accompanying
58 // 1 bit per loop per node per direction are required during the marking phase.
90 if (ni.node == nullptr) continue; in Print()
92 int index = ni.node in Print()
188 IsInLoop(Node* node, int loop_num) IsInLoop() argument
201 Node* node = queue_.front(); PropagateBackward() local
252 CreateLoopInfo(Node* node) CreateLoopInfo() argument
267 SetLoopMark(Node* node, int loop_num) SetLoopMark() argument
273 SetLoopMarkForLoopHeader(Node* node, int loop_num) SetLoopMarkForLoopHeader() argument
328 Node* node = queue_.front(); PropagateForward() local
340 IsLoopHeaderNode(Node* node) IsLoopHeaderNode() argument
344 IsLoopExitNode(Node* node) IsLoopExitNode() argument
362 LoopNum(Node* node) LoopNum() argument
364 info(Node* node) info() argument
370 Queue(Node* node) Queue() argument
568 Node* node = queue.back(); FindSmallInnermostLoopFromHeader() local
720 map(Node* node, uint32_t copy_index) map() argument
[all...]
H A Dcontrol-flow-optimizer.cc10 #include "src/compiler/node-matchers.h"
11 #include "src/compiler/node-properties.h"
34 Node* node = queue_.front(); in Optimize() local
36 if (node->IsDead()) continue; in Optimize()
37 switch (node->opcode()) { in Optimize()
39 VisitBranch(node); in Optimize()
42 VisitNode(node); in Optimize()
49 void ControlFlowOptimizer::Enqueue(Node* node) { in Enqueue() argument
50 DCHECK_NOT_NULL(node); in Enqueue()
51 if (node in Enqueue()
57 VisitNode(Node* node) VisitNode() argument
66 VisitBranch(Node* node) VisitBranch() argument
73 TryBuildSwitch(Node* node) TryBuildSwitch() argument
[all...]
H A Djs-create-lowering.cc15 #include "src/compiler/node-matchers.h"
16 #include "src/compiler/node-properties.h"
17 #include "src/compiler/node.h"
57 Reduction JSCreateLowering::Reduce(Node* node) { in Reduce() argument
58 switch (node->opcode()) { in Reduce()
60 return ReduceJSCreate(node); in Reduce()
62 return ReduceJSCreateArguments(node); in Reduce()
64 return ReduceJSCreateArray(node); in Reduce()
66 return ReduceJSCreateArrayIterator(node); in Reduce()
68 return ReduceJSCreateAsyncFunctionObject(node); in Reduce()
112 ReduceJSCreate(Node* node) ReduceJSCreate() argument
148 ReduceJSCreateArguments(Node* node) ReduceJSCreateArguments() argument
381 ReduceJSCreateGeneratorObject(Node* node) ReduceJSCreateGeneratorObject() argument
461 ReduceNewArray( Node* node, Node* length, MapRef initial_map, ElementsKind elements_kind, AllocationType allocation, const SlackTrackingPrediction& slack_tracking_prediction) ReduceNewArray() argument
517 ReduceNewArray( Node* node, Node* length, int capacity, MapRef initial_map, ElementsKind elements_kind, AllocationType allocation, const SlackTrackingPrediction& slack_tracking_prediction) ReduceNewArray() argument
566 ReduceNewArray( Node* node, std::vector<Node*> values, MapRef initial_map, ElementsKind elements_kind, AllocationType allocation, const SlackTrackingPrediction& slack_tracking_prediction) ReduceNewArray() argument
627 ReduceJSCreateArray(Node* node) ReduceJSCreateArray() argument
743 ReduceJSCreateArrayIterator(Node* node) ReduceJSCreateArrayIterator() argument
771 ReduceJSCreateAsyncFunctionObject(Node* node) ReduceJSCreateAsyncFunctionObject() argument
849 ReduceJSCreateCollectionIterator(Node* node) ReduceJSCreateCollectionIterator() argument
881 ReduceJSCreateBoundFunction(Node* node) ReduceJSCreateBoundFunction() argument
924 ReduceJSCreateClosure(Node* node) ReduceJSCreateClosure() argument
990 ReduceJSCreateIterResultObject(Node* node) ReduceJSCreateIterResultObject() argument
1014 ReduceJSCreateStringIterator(Node* node) ReduceJSCreateStringIterator() argument
1037 ReduceJSCreateKeyValueArray(Node* node) ReduceJSCreateKeyValueArray() argument
1067 ReduceJSCreatePromise(Node* node) ReduceJSCreatePromise() argument
1096 ReduceJSCreateLiteralArrayOrObject(Node* node) ReduceJSCreateLiteralArrayOrObject() argument
1122 ReduceJSCreateEmptyLiteralArray(Node* node) ReduceJSCreateEmptyLiteralArray() argument
1146 ReduceJSCreateEmptyLiteralObject(Node* node) ReduceJSCreateEmptyLiteralObject() argument
1177 ReduceJSCreateLiteralRegExp(Node* node) ReduceJSCreateLiteralRegExp() argument
1194 ReduceJSGetTemplateObject(Node* node) ReduceJSGetTemplateObject() argument
1211 ReduceJSCreateFunctionContext(Node* node) ReduceJSCreateFunctionContext() argument
1253 ReduceJSCreateWithContext(Node* node) ReduceJSCreateWithContext() argument
1274 ReduceJSCreateCatchContext(Node* node) ReduceJSCreateCatchContext() argument
1295 ReduceJSCreateBlockContext(Node* node) ReduceJSCreateBlockContext() argument
1346 ReduceJSCreateObject(Node* node) ReduceJSCreateObject() argument
[all...]
H A Dbranch-condition-duplicator.cc9 #include "src/compiler/node-properties.h"
18 bool IsBranch(Node* node) { return node->opcode() == IrOpcode::kBranch; } in IsBranch() argument
20 bool CanDuplicate(Node* node) { in CanDuplicate() argument
26 switch (node->opcode()) { in CanDuplicate()
52 for (Node* input : node->inputs()) { in CanDuplicate()
66 Node* BranchConditionDuplicator::DuplicateNode(Node* node) { in DuplicateNode() argument
67 return graph_->CloneNode(node); in DuplicateNode()
70 void BranchConditionDuplicator::DuplicateConditionIfNeeded(Node* node) { in DuplicateConditionIfNeeded() argument
71 if (!IsBranch(node)) retur in DuplicateConditionIfNeeded()
79 Enqueue(Node* node) Enqueue() argument
85 VisitNode(Node* node) VisitNode() argument
96 Node* node = to_visit_.front(); ProcessGraph() local
[all...]
H A Dsimplified-lowering-verifier.h26 void VisitNode(Node* node, OperationTyper& op_typer);
28 void RecordHint(Node* node) { in RecordHint() argument
29 DCHECK_EQ(node->opcode(), IrOpcode::kSLVerifierHint); in RecordHint()
30 hints_.push_back(node); in RecordHint()
34 base::Optional<Type> GetType(Node* node) const { in GetType()
35 if (NodeProperties::IsTyped(node)) { in GetType()
36 return NodeProperties::GetType(node); in GetType()
40 if (node->id() < data_.size()) { in GetType()
41 return data_[node->id()].type; in GetType()
47 void ResizeDataIfNecessary(Node* node) { in ResizeDataIfNecessary() argument
55 SetType(Node* node, const Type& type) SetType() argument
60 InputType(Node* node, int input_index) const InputType() argument
76 SetTruncation(Node* node, const Truncation& truncation) SetTruncation() argument
81 InputTruncation(Node* node, int input_index) const InputTruncation() argument
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_control_flow.c36 * control flow node.
100 link_non_block_to_block(nir_cf_node *node, nir_block *block) in link_non_block_to_block() argument
102 if (node->type == nir_cf_node_if) { in link_non_block_to_block()
108 nir_if *if_stmt = nir_cf_node_as_if(node); in link_non_block_to_block()
123 assert(node->type == nir_cf_node_loop); in link_non_block_to_block()
128 link_block_to_non_block(nir_block *block, nir_cf_node *node) in link_block_to_non_block() argument
130 if (node->type == nir_cf_node_if) { in link_block_to_non_block()
136 nir_if *if_stmt = nir_cf_node_as_if(node); in link_block_to_non_block()
143 } else if (node->type == nir_cf_node_loop) { in link_block_to_non_block()
150 nir_loop *loop = nir_cf_node_as_loop(node); in link_block_to_non_block()
412 insert_non_block(nir_block *before, nir_cf_node *node, nir_block *after) insert_non_block() argument
423 nearest_loop(nir_cf_node *node) nearest_loop() argument
530 update_if_uses(nir_cf_node *node) update_if_uses() argument
593 nir_cf_node_insert(nir_cursor cursor, nir_cf_node *node) nir_cf_node_insert() argument
633 cleanup_cf_node(nir_cf_node *node, nir_function_impl *impl) cleanup_cf_node() argument
748 relink_jump_halt_cf_node(nir_cf_node *node, nir_block *end_block) relink_jump_halt_cf_node() argument
[all...]
/third_party/mesa3d/src/compiler/glsl/glcpp/
H A Dglcpp-parse.y888 string_node_t *node;
890 node = linear_alloc_child(parser->linalloc, sizeof(string_node_t));
891 node->str = linear_strdup(parser->linalloc, str);
893 node->next = NULL;
896 list->head = node;
898 list->tail->next = node;
901 list->tail = node;
907 string_node_t *node;
913 for (i = 0, node = list->head; node;
[all...]
/third_party/typescript/tests/baselines/reference/
H A DintersectionsOfLargeUnions.js4 export function assertIsElement(node: Node | null): node is Element {
5 let nodeType = node === null ? null : node.nodeType;
11 U extends ElementTagNameMap[T]>(node: Node | null, tagName: T): node is U {
12 if (assertIsElement(node)) {
13 const nodeTagName = node.tagName.toLowerCase();
22 V extends HTMLElementTagNameMap[T][P]>(node: Node | null, tagName: T, prop: P, value: V) {
23 if (assertNodeTagName(node, tagNam
[all...]
H A DintersectionsOfLargeUnions2.js14 export function assertIsElement(node: Node | null): node is Element {
15 let nodeType = node === null ? null : node.nodeType;
21 U extends ElementTagNameMap[T]>(node: Node | null, tagName: T): node is U {
22 if (assertIsElement(node)) {
23 const nodeTagName = node.tagName.toLowerCase();
32 V extends HTMLElementTagNameMap[T][P]>(node: Node | null, tagName: T, prop: P, value: V) {
33 if (assertNodeTagName(node, tagNam
[all...]
H A Dparserindenter.js48 public GetIndentationEdits(token: TokenSpan, nextToken: TokenSpan, node: ParseNode, sameLineIndent: boolean): List_TextEditInfo {
56 var result = this.GetIndentationEditsWorker(token, nextToken, node, sameLineIndent);
68 public GetIndentationEditsWorker(token: TokenSpan, nextToken: TokenSpan, node: ParseNode, sameLineIndent: boolean): List_TextEditInfo {
76 // The given function's node indicates that the function starts directly after "return (".
82 this.AdjustStartOffsetIfNeeded(token, node);
95 indentationInfo = this.GetSpecialCaseIndentation(token, node);
99 // Get the indentation level only from the node that starts on the same offset as the token
101 while (!node.CanIndent() && node.Parent != null && token.Span.span.start() == node
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp18 // Traverse the intermediate representation tree, and call a node type specific visit function for
19 // each node. Traversal is done recursively through the node member function traverse(). Nodes with
23 void TIntermTraverser::traverse(T *node) in traverse() argument
25 ScopedNodeInTraversalPath addToPath(this, node); in traverse()
31 // Visit the node before children if pre-visiting. in traverse()
33 visit = node->visit(PreVisit, this); in traverse()
38 size_t childCount = node->getChildCount(); in traverse()
43 node->getChildNode(childIndex)->traverse(this); in traverse()
48 visit = node in traverse()
247 pushParentBlock(TIntermBlock *node) pushParentBlock() argument
315 traverseBinary(TIntermBinary *node) traverseBinary() argument
320 traverseBinary(TIntermBinary *node) traverseBinary() argument
379 traverseUnary(TIntermUnary *node) traverseUnary() argument
384 traverseUnary(TIntermUnary *node) traverseUnary() argument
420 traverseFunctionDefinition(TIntermFunctionDefinition *node) traverseFunctionDefinition() argument
454 traverseBlock(TIntermBlock *node) traverseBlock() argument
497 traverseAggregate(TIntermAggregate *node) traverseAggregate() argument
512 updateTree(TCompiler *compiler, TIntermNode *node) updateTree() argument
654 traverseAggregate(TIntermAggregate *node) traverseAggregate() argument
704 traverseLoop(TIntermLoop *node) traverseLoop() argument
[all...]
/third_party/ffmpeg/tools/python/
H A Dconvert_from_tensorflow.py88 node = self.name_node_dict[name]
90 dtype = node.attr['dtype'].type
92 dtype = node.attr['T'].type
94 if 'shape' in node.attr:
95 dims[0] = node.attr['shape'].shape.dim[0].size
96 dims[1] = node.attr['shape'].shape.dim[1].size
97 dims[2] = node.attr['shape'].shape.dim[2].size
98 dims[3] = node.attr['shape'].shape.dim[3].size
148 def dump_complex_conv2d_to_file(self, node, f):
149 assert(node
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/
H A DArrayReturnValueToOutParameter.cpp36 void visitFunctionPrototype(TIntermFunctionPrototype *node) override;
37 bool visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) override;
38 bool visitAggregate(Visit visit, TIntermAggregate *node) override;
39 bool visitBranch(Visit visit, TIntermBranch *node) override;
40 bool visitBinary(Visit visit, TIntermBinary *node) override;
93 TIntermFunctionDefinition *node) in visitFunctionDefinition()
95 if (node->getFunctionPrototype()->isArray() && visit == PreVisit) in visitFunctionDefinition()
98 mFunctionWithArrayReturnValue = node; in visitFunctionDefinition()
107 void ArrayReturnValueToOutParameterTraverser::visitFunctionPrototype(TIntermFunctionPrototype *node) in visitFunctionPrototype() argument
109 if (node in visitFunctionPrototype()
91 visitFunctionDefinition( Visit visit, TIntermFunctionDefinition *node) visitFunctionDefinition() argument
141 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
180 visitBranch(Visit visit, TIntermBranch *node) visitBranch() argument
209 visitBinary(Visit visit, TIntermBinary *node) visitBinary() argument
[all...]
H A DRewriteExpressionsWithShaderStorageBlock.cpp122 bool visitBinary(Visit, TIntermBinary *node) override;
123 bool visitAggregate(Visit visit, TIntermAggregate *node) override;
124 bool visitUnary(Visit visit, TIntermUnary *node) override;
126 TIntermSymbol *insertInitStatementAndReturnTempSymbol(TIntermTyped *node,
139 TIntermTyped *node, in insertInitStatementAndReturnTempSymbol()
144 DeclareTempVariable(mSymbolTable, node, EvqTemporary, &variableDeclaration); in insertInitStatementAndReturnTempSymbol()
151 TIntermBinary *node) in visitBinary()
164 bool rightSSBO = IsInShaderStorageBlock(node->getRight()); in visitBinary()
165 bool leftSSBO = IsInShaderStorageBlock(node->getLeft()); in visitBinary()
185 if (IsCompoundAssignment(node in visitBinary()
138 insertInitStatementAndReturnTempSymbol( TIntermTyped *node, TIntermSequence *insertions) insertInitStatementAndReturnTempSymbol() argument
150 visitBinary(Visit visit, TIntermBinary *node) visitBinary() argument
258 visitAggregate(Visit visit, TIntermAggregate *node) visitAggregate() argument
335 visitUnary(Visit visit, TIntermUnary *node) visitUnary() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/compiler/
H A DparseConst.cpp18 // Use this class to carry along data from node to node in
68 void TConstTraverser::visitSymbol(TIntermSymbol* node) in visitSymbol() argument
70 infoSink.info.message(EPrefixInternalError, "Symbol Node found in constant constructor", node->getLine()); in visitSymbol()
74 bool TConstTraverser::visitBinary(Visit visit, TIntermBinary* node) in visitBinary() argument
76 TQualifier qualifier = node->getType().getQualifier(); in visitBinary()
82 infoSink.info.message(EPrefixError, buf.c_str(), node->getLine()); in visitBinary()
87 infoSink.info.message(EPrefixInternalError, "Binary Node found in constant constructor", node->getLine()); in visitBinary()
92 bool TConstTraverser::visitUnary(Visit visit, TIntermUnary* node) in visitUnary() argument
97 infoSink.info.message(EPrefixError, buf.c_str(), node in visitUnary()
102 visitAggregate(Visit visit, TIntermAggregate* node) visitAggregate() argument
150 visitSelection(Visit visit, TIntermSelection* node) visitSelection() argument
157 visitConstantUnion(TIntermConstantUnion* node) visitConstantUnion() argument
220 visitLoop(Visit visit, TIntermLoop* node) visitLoop() argument
227 visitBranch(Visit visit, TIntermBranch* node) visitBranch() argument
[all...]
H A DintermOut.cpp28 // Use this class to carry along data from node to node in
68 void OutputTreeText(TInfoSinkBase& sink, TIntermNode* node, const int depth) in OutputTreeText() argument
72 sink.location(node->getLine()); in OutputTreeText()
87 void TOutputTraverser::visitSymbol(TIntermSymbol* node) in visitSymbol() argument
89 OutputTreeText(sink, node, mDepth); in visitSymbol()
91 sink << "'" << node->getSymbol() << "' "; in visitSymbol()
92 sink << "(" << node->getCompleteString() << ")\n"; in visitSymbol()
95 bool TOutputTraverser::visitBinary(Visit visit, TIntermBinary* node) in visitBinary() argument
99 OutputTreeText(out, node, mDept in visitBinary()
159 visitUnary(Visit visit, TIntermUnary* node) visitUnary() argument
245 visitAggregate(Visit visit, TIntermAggregate* node) visitAggregate() argument
337 visitSelection(Visit visit, TIntermSelection* node) visitSelection() argument
370 visitConstantUnion(TIntermConstantUnion* node) visitConstantUnion() argument
407 visitLoop(Visit visit, TIntermLoop* node) visitLoop() argument
445 visitBranch(Visit visit, TIntermBranch* node) visitBranch() argument
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dcord.cc77 // The root node depth is allowed to become twice as large to reduce rebalancing
102 static inline bool IsRootBalanced(CordRep* node) { in IsRootBalanced() argument
103 if (!node->IsConcat()) { in IsRootBalanced()
105 } else if (node->concat()->depth() <= 15) { in IsRootBalanced()
107 } else if (node->concat()->depth() > kMinLengthSize) { in IsRootBalanced()
112 return (node->length >= min_length[node->concat()->depth() / 2]); in IsRootBalanced()
116 static CordRep* Rebalance(CordRep* node);
122 static inline CordRep* VerifyTree(CordRep* node) { in VerifyTree() argument
129 assert(node in VerifyTree()
855 RemovePrefixFrom(CordRep* node, size_t n) RemovePrefixFrom() argument
896 RemoveSuffixFrom(CordRep* node, size_t n) RemoveSuffixFrom() argument
990 CordRep* node; // nullptr means concat last 2 results. global() member
995 NewSubRange(CordRep* node, size_t pos, size_t n) NewSubRange() argument
1090 CordRep* node = pending.back(); Build() local
1132 AppendNode(CordRep* node, CordRep* sum) AppendNode() argument
1136 PrependNode(CordRep* node, CordRep* sum) PrependNode() argument
1140 AddNode(CordRep* node) AddNode() argument
1185 CheckNode(CordRep* node) CheckNode() argument
1205 Rebalance(CordRep* node) Rebalance() argument
1264 CordRep* node = tree(); FindFlatStartPiece() local
1490 CordRep* node = stack_of_right_children.back(); AdvanceStack() local
1587 CordRep* node = nullptr; AdvanceAndReadBytes() local
1670 CordRep* node = nullptr; AdvanceBytesSlowPath() local
1912 ReportError(CordRep* root, CordRep* node) ReportError() argument
1914 buf << "Error at node " << node << " in:"; ReportError() local
1924 CordRep* node = worklist.back(); VerifyNode() local
1995 const CordRepBtree* node = cur_node->btree(); MemoryUsageAux() local
[all...]
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcmanag.c75 FTC_MruNodeRec node; member
88 FTC_SizeNode node = (FTC_SizeNode)ftcnode; in ftc_size_node_done() local
89 FT_Size size = node->size; in ftc_size_node_done()
102 FTC_SizeNode node = (FTC_SizeNode)ftcnode; in FT_CALLBACK_DEF() local
104 FTC_Scaler scaler0 = &node->scaler; in FT_CALLBACK_DEF()
109 FT_Activate_Size( node->size ); in FT_CALLBACK_DEF()
121 FTC_SizeNode node = (FTC_SizeNode)ftcnode; in FT_CALLBACK_DEF() local
126 node->scaler = scaler[0]; in FT_CALLBACK_DEF()
128 return ftc_scaler_lookup_size( manager, scaler, &node->size ); in FT_CALLBACK_DEF()
137 FTC_SizeNode node in FT_CALLBACK_DEF() local
167 FTC_SizeNode node = (FTC_SizeNode)ftcnode; ftc_size_node_compare_faceid() local
220 FTC_MruNodeRec node; global() member
234 FTC_FaceNode node = (FTC_FaceNode)ftcnode; FT_CALLBACK_DEF() local
261 FTC_FaceNode node = (FTC_FaceNode)ftcnode; ftc_face_node_done() local
282 FTC_FaceNode node = (FTC_FaceNode)ftcnode; FT_CALLBACK_DEF() local
473 FTC_Node node, first; FTC_Manager_Check() local
539 FTC_Node node, first; FTC_Manager_Compress() local
635 FTC_Node node; FT_LOCAL_DEF() local
693 FTC_Node_Unref( FTC_Node node, FTC_Manager manager ) FTC_Node_Unref() argument
[all...]
/third_party/libabigail/src/
H A Dabg-reader.cc88 walk_xml_node_to_map_type_ids(reader& rdr, xmlNodePtr node);
237 /// Getter of the current XML node in the corpus element sub-tree
240 /// @return the current XML node in the corpus element sub-tree that
246 /// Setter of the current XML node in the corpus element sub-tree
249 /// @param node set the current XML node in the corpus element
252 set_corpus_node(xmlNodePtr node) in set_corpus_node() argument
253 {m_corp_node = node;} in set_corpus_node()
276 map_xml_node_to_decl(xmlNodePtr node, in map_xml_node_to_decl() argument
279 if (node) in map_xml_node_to_decl()
300 map_id_and_node(const string& id, xmlNodePtr node) map_id_and_node() argument
1089 xmlNodePtr node = get_corpus_node(); read_corpus() local
1458 get_scope_for_node(xmlNodePtr node, access_specifier& access) get_scope_for_node() argument
1581 walk_xml_node_to_map_type_ids(reader& rdr, xmlNodePtr node) walk_xml_node_to_map_type_ids() argument
1600 read_translation_unit(fe_iface& iface, translation_unit& tu, xmlNodePtr node) read_translation_unit() argument
1670 get_or_read_and_add_translation_unit(reader& rdr, xmlNodePtr node) get_or_read_and_add_translation_unit() argument
1715 xmlNodePtr node = rdr.get_corpus_node(); read_translation_unit_from_input() local
1815 xmlNodePtr node = xmlTextReaderExpand(reader.get()); read_symbol_db_from_input() local
1862 build_needed(xmlNode* node, vector<string>& needed) build_needed() argument
2106 xmlNodePtr node = xmlTextReaderExpand(reader.get()); read_corpus_group_from_input() local
2236 handle_element_node(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_element_node() argument
2296 read_location(const reader& rdr, xmlNodePtr node, location& loc) read_location() argument
2335 read_artificial_location(const reader& rdr, xmlNodePtr node, location& loc) read_artificial_location() argument
2374 maybe_set_artificial_location(const reader& rdr, xmlNodePtr node, type_or_decl_base_sptr artefact) maybe_set_artificial_location() argument
2398 read_visibility(xmlNodePtr node, decl_base::visibility& vis) read_visibility() argument
2427 read_binding(xmlNodePtr node, decl_base::binding& bind) read_binding() argument
2455 read_access(xmlNodePtr node, access_specifier& access) read_access() argument
2494 read_size_and_alignment(xmlNodePtr node, size_t& size_in_bits, size_t& align_in_bits) read_size_and_alignment() argument
2524 read_static(xmlNodePtr node, bool& is_static) read_static() argument
2542 read_offset_in_bits(xmlNodePtr node, size_t& offset_in_bits) read_offset_in_bits() argument
2575 read_cdtor_const(xmlNodePtr node, bool& is_constructor, bool& is_destructor, bool& is_const) read_cdtor_const() argument
2625 read_is_declaration_only(xmlNodePtr node, bool& is_decl_only) read_is_declaration_only() argument
2649 read_is_artificial(xmlNodePtr node, bool& is_artificial) read_is_artificial() argument
2673 read_tracking_non_reachable_types(xmlNodePtr node, bool& tracking_non_reachable_types) read_tracking_non_reachable_types() argument
2700 read_is_non_reachable_type(xmlNodePtr node, bool& is_non_reachable_type) read_is_non_reachable_type() argument
2725 read_naming_typedef_id_string(xmlNodePtr node, string& naming_typedef_id) read_naming_typedef_id_string() argument
2744 read_is_virtual(xmlNodePtr node, bool& is_virtual) read_is_virtual() argument
2767 read_is_struct(xmlNodePtr node, bool& is_struct) read_is_struct() argument
2790 read_is_anonymous(xmlNodePtr node, bool& is_anonymous) read_is_anonymous() argument
2809 read_elf_symbol_type(xmlNodePtr node, elf_symbol::type& t) read_elf_symbol_type() argument
2830 read_elf_symbol_binding(xmlNodePtr node, elf_symbol::binding& b) read_elf_symbol_binding() argument
2852 read_elf_symbol_visibility(xmlNodePtr node, elf_symbol::visibility& v) read_elf_symbol_visibility() argument
2874 read_type_id_string(xmlNodePtr node, string& type_id) read_type_id_string() argument
2929 maybe_map_type_with_type_id(const type_base_sptr& t, xmlNodePtr node) maybe_map_type_with_type_id() argument
2958 maybe_set_naming_typedef(reader& rdr, xmlNodePtr node, const decl_base_sptr& decl) maybe_set_naming_typedef() argument
2989 build_namespace_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_namespace_decl() argument
3039 build_elf_symbol(reader& rdr, const xmlNodePtr node, bool drop_if_suppressed) build_elf_symbol() argument
3142 build_elf_symbol_from_reference(reader& rdr, const xmlNodePtr node) build_elf_symbol_from_reference() argument
3184 build_elf_symbol_db(reader& rdr, const xmlNodePtr node, bool function_syms) build_elf_symbol_db() argument
3266 build_function_parameter(reader& rdr, const xmlNodePtr node) build_function_parameter() argument
3332 build_function_decl(reader& rdr, const xmlNodePtr node, class_or_union_sptr as_method_decl, bool add_to_current_scope) build_function_decl() argument
3455 build_function_decl_if_not_suppressed(reader& rdr, const xmlNodePtr node, class_or_union_sptr as_method_decl, bool add_to_current_scope) build_function_decl_if_not_suppressed() argument
3485 function_is_suppressed(const reader& rdr, xmlNodePtr node) function_is_suppressed() argument
3514 type_is_suppressed(const reader& rdr, xmlNodePtr node) type_is_suppressed() argument
3546 build_var_decl_if_not_suppressed(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_var_decl_if_not_suppressed() argument
3565 variable_is_suppressed(const reader& rdr, xmlNodePtr node) variable_is_suppressed() argument
3611 build_var_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_var_decl() argument
3679 build_type_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_type_decl() argument
3761 build_qualified_type_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_qualified_type_decl() argument
3849 build_pointer_type_def(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_pointer_type_def() argument
3925 build_reference_type_def(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_reference_type_def() argument
4005 build_function_type(reader& rdr, const xmlNodePtr node, bool ) build_function_type() argument
4090 build_subrange_type(reader& rdr, const xmlNodePtr node) build_subrange_type() argument
4205 build_array_type_def(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_array_type_def() argument
4368 build_enum_type_decl_if_not_suppressed(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_enum_type_decl_if_not_suppressed() argument
4390 build_enum_type_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_enum_type_decl() argument
4502 build_typedef_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_typedef_decl() argument
4566 build_class_decl_if_not_suppressed(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_class_decl_if_not_suppressed() argument
4589 build_union_decl_if_not_suppressed(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_union_decl_if_not_suppressed() argument
4612 build_class_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_class_decl() argument
5040 build_union_decl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_union_decl() argument
5387 build_function_tdecl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_function_tdecl() argument
5453 build_class_tdecl(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_class_tdecl() argument
5523 build_type_tparameter(reader& rdr, const xmlNodePtr node, unsigned index, template_decl_sptr tdecl) build_type_tparameter() argument
5583 build_type_composition(reader& rdr, const xmlNodePtr node, unsigned index, template_decl_sptr tdecl) build_type_composition() argument
5641 build_non_type_tparameter(reader& rdr, const xmlNodePtr node, unsigned index, template_decl_sptr tdecl) build_non_type_tparameter() argument
5689 build_template_tparameter(reader& rdr, const xmlNodePtr node, unsigned index, template_decl_sptr tdecl) build_template_tparameter() argument
5763 build_template_parameter(reader& rdr, const xmlNodePtr node, unsigned index, template_decl_sptr tdecl) build_template_parameter() argument
5786 build_type(reader& rdr, const xmlNodePtr node, bool add_to_current_scope) build_type() argument
5829 handle_type_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_type_decl() argument
5846 handle_namespace_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_namespace_decl() argument
5861 handle_qualified_type_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_qualified_type_decl() argument
5880 handle_pointer_type_def(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_pointer_type_def() argument
5898 handle_reference_type_def(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_reference_type_def() argument
5916 handle_function_type(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_function_type() argument
5933 handle_array_type_def(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_array_type_def() argument
5948 handle_enum_type_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_enum_type_decl() argument
5965 handle_typedef_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_typedef_decl() argument
5986 handle_var_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_var_decl() argument
6003 handle_function_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_function_decl() argument
6018 handle_class_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_class_decl() argument
6024 MAYBE_MAP_TYPE_WITH_TYPE_ID(is_type(decl), node); handle_class_decl() local
6037 handle_union_decl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_union_decl() argument
6043 MAYBE_MAP_TYPE_WITH_TYPE_ID(is_type(decl), node); handle_union_decl() local
6056 handle_function_tdecl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_function_tdecl() argument
6071 handle_class_tdecl(reader& rdr, xmlNodePtr node, bool add_to_current_scope) handle_class_tdecl() argument
[all...]
/third_party/node/test/fixtures/snapshot/
H A Dtypescript.js178 var node = data.tail;
179 while (node !== data.head) {
180 var prev = getPrev(node);
181 node.next = data.head;
182 node.prev = undefined;
183 node = prev;
2710 function failBadSyntaxKind(node, message, stackCrawlMark) {
2711 return fail("".concat(message || "Unexpected node.", "\r\nNode ").concat(formatSyntaxKind(node.kind), " was unexpected."), stackCrawlMark || failBadSyntaxKind);
2781 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node
[all...]
/third_party/node/deps/v8/src/regexp/experimental/
H A Dexperimental-compiler.cc48 void* VisitDisjunction(RegExpDisjunction* node, void*) override {
49 for (RegExpTree* alt : *node->alternatives()) {
58 void* VisitAlternative(RegExpAlternative* node, void*) override {
59 for (RegExpTree* child : *node->nodes()) {
68 void* VisitCharacterClass(RegExpCharacterClass* node, void*) override {
72 void* VisitAssertion(RegExpAssertion* node, void*) override {
76 void* VisitAtom(RegExpAtom* node, void*) override {
80 void* VisitText(RegExpText* node, void*) override {
81 for (TextElement& el : *node->elements()) {
90 void* VisitQuantifier(RegExpQuantifier* node, voi
[all...]
/third_party/node/test/fuzzers/
H A Dfuzz_env.cc2 * A fuzzer focused on the node::LoadEnvironment() function.
8 #include "node.h"
18 using node::AliasedBufferBase;
21 using ArrayBufferUniquePtr = std::unique_ptr<node::ArrayBufferAllocator,
22 decltype(&node::FreeArrayBufferAllocator)>;
23 using TracingAgentUniquePtr = std::unique_ptr<node::tracing::Agent>;
24 using NodePlatformUniquePtr = std::unique_ptr<node::NodePlatform>;
36 node::InitializeNodeWithArgs(&node_argv, &exec_argv, &errors); in LLVMFuzzerInitialize()
38 tracing_agent = std::make_unique<node::tracing::Agent>(); in LLVMFuzzerInitialize()
39 node in LLVMFuzzerInitialize()
[all...]
/third_party/mesa3d/src/util/
H A Ddag.c43 * Adds a directed edge from the parent node to the child.
60 * Adds a directed edge from the parent node to the child.
107 dag_prune_head(struct dag *dag, struct dag_node *node) in dag_prune_head() argument
109 assert(!node->parent_count); in dag_prune_head()
111 list_delinit(&node->link); in dag_prune_head()
113 util_dynarray_foreach(&node->edges, struct dag_edge, edge) { in dag_prune_head()
119 * Initializes DAG node (probably embedded in some other datastructure in the
123 dag_init_node(struct dag *dag, struct dag_node *node) in dag_init_node() argument
125 util_dynarray_init(&node->edges, dag); in dag_init_node()
126 list_addtail(&node in dag_init_node()
135 dag_traverse_bottom_up_node(struct dag_node *node, void (*cb)(struct dag_node *node, void *data), struct dag_traverse_bottom_up_state *state) dag_traverse_bottom_up_node() argument
194 dag_traverse_bottom_up(struct dag *dag, void (*cb)(struct dag_node *node, void *data), void *data) dag_traverse_bottom_up() argument
[all...]
/third_party/jinja2/
H A Dparser.py255 node = result = nodes.If(lineno=self.stream.expect("name:if").lineno)
257 node.test = self.parse_tuple(with_condexpr=False)
258 node.body = self.parse_statements(("name:elif", "name:else", "name:endif"))
259 node.elif_ = []
260 node.else_ = []
263 node = nodes.If(lineno=self.stream.current.lineno)
264 result.elif_.append(node)
272 node = nodes.With(lineno=next(self.stream).lineno)
283 node.targets = targets
284 node
[all...]

Completed in 24 milliseconds

12345678910>>...101