| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | ssa.c | 202 struct instruction *node = insert_phi_node(bb, var); in ssa_convert_one_var() local
306 struct instruction *node; in mark_phi_used() local
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | common-operator-reducer.cc | 39 Reduction CommonOperatorReducer::Reduce(Node* node) { in Reduce() argument
92 ReduceBranch(Node* node) ReduceBranch() argument
143 ReduceDeoptimizeConditional(Node* node) ReduceDeoptimizeConditional() argument
178 ReduceMerge(Node* node) ReduceMerge() argument
214 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument
239 ReducePhi(Node* node) ReducePhi() argument
305 ReduceReturn(Node* node) ReduceReturn() argument
389 ReduceSelect(Node* node) ReduceSelect() argument
432 ReduceSwitch(Node* node) ReduceSwitch() argument
469 ReduceStaticAssert(Node* node) ReduceStaticAssert() argument
505 Change(Node* node, Operator const* op, Node* a) Change() argument
514 Change(Node* node, Operator const* op, Node* a, Node* b) Change() argument
[all...] |
| H A D | state-values-utils.cc | 50 bool StateValuesCache::IsKeysEqualToNode(StateValuesKey* key, Node* node) { in IsKeysEqualToNode() argument
125 Node* node; GetValuesNodeFromCache() local
305 iterator(Node* node) iterator() argument
317 Push(Node* node) Push() argument
380 Node* StateValuesAccess::iterator::node() { node() function in v8::internal::compiler::StateValuesAccess::iterator
[all...] |
| H A D | graph-reducer.cc | 32 Reduction Reducer::Reduce(Node* node, in Reduce() argument
36 observe_node_manager->OnNodeChanged(reducer_name(), node, in Reduce() local
67 void GraphReducer::ReduceNode(Node* node) { in ReduceNode() argument
100 Reduce(Node* const node) Reduce() argument
150 Node* node = entry.node; ReduceTop() local
212 Replace(Node* node, Node* replacement) Replace() argument
217 Replace(Node* node, Node* replacement, NodeId max_id) Replace() argument
251 ReplaceWithValue(Node* node, Node* value, Node* effect, Node* control) ReplaceWithValue() argument
290 Node* node = stack_.top().node; Pop() local
296 Push(Node* const node) Push() argument
303 Recurse(Node* node) Recurse() argument
310 Revisit(Node* node) Revisit() argument
[all...] |
| H A D | graph-reducer.h | 71 static Reduction Replace(Node* node) { return Reduction(node); } in Replace() argument
72 static Reduction Changed(Node* node) { retur in Replace() argument
103 Replace(Node* node) Replace() argument
106 Replace(Node* node, Node* replacement) Replace() argument
110 Revisit(Node* node) Revisit() argument
114 ReplaceWithValue(Node* node, Node* value, Node* effect = nullptr, Node* control = nullptr) ReplaceWithValue() argument
123 RelaxEffectsAndControls(Node* node) RelaxEffectsAndControls() argument
129 RelaxControls(Node* node) RelaxControls() argument
162 Node* node; global() member in v8::internal::compiler::GraphReducer::State
[all...] |
| H A D | loop-variable-optimizer.cc | 40 Node* node = queue.front(); in Run() local
120 VisitNode(Node* node) VisitNode() argument
139 VisitMerge(Node* node) VisitMerge() argument
148 VisitLoop(Node* node) VisitLoop() argument
154 VisitIf(Node* node, bool polarity) VisitIf() argument
182 AddCmpToLimits( VariableLimits* limits, Node* node, InductionVariable::ConstraintKind kind, bool polarity) AddCmpToLimits() argument
199 VisitStart(Node* node) VisitStart() argument
201 VisitLoopExit(Node* node) VisitLoopExit() argument
205 VisitOtherControl(Node* node) VisitOtherControl() argument
210 TakeConditionsFromFirstControl(Node* node) TakeConditionsFromFirstControl() argument
214 FindInductionVariable( Node* node) FindInductionVariable() argument
[all...] |
| H A D | node-origin-table.h | 73 Scope(NodeOriginTable* origins, const char* reducer_name, Node* node) in Scope() argument
|
| H A D | redundancy-elimination.cc | 19 Reduction RedundancyElimination::Reduce(Node* node) { in Reduce() argument
213 TypeSubsumes(Node* node, Node* replacement) TypeSubsumes() argument
256 Set( Node* node, EffectPathChecks const* checks) Set() argument
263 ReduceCheckNode(Node* node) ReduceCheckNode() argument
279 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument
307 ReduceSpeculativeNumberComparison(Node* node) ReduceSpeculativeNumberComparison() argument
365 ReduceSpeculativeNumberOperation(Node* node) ReduceSpeculativeNumberOperation() argument
398 ReduceStart(Node* node) ReduceStart() argument
402 ReduceOtherNode(Node* node) ReduceOtherNode() argument
416 TakeChecksFromFirstEffect(Node* node) TakeChecksFromFirstEffect() argument
428 UpdateChecks(Node* node, EffectPathChecks const* checks) UpdateChecks() argument
[all...] |
| H A D | control-equivalence.h | 52 size_t ClassOf(Node* node) { in ClassOf() argument
77 Node* node; // Node that this stack entry belongs to. member
131 GetData(Node* node) GetData() argument
136 AllocateData(Node* node) AllocateData() argument
145 Participates(Node* node) Participates() argument
148 GetClass(Node* node) GetClass() argument
149 SetClass(Node* node, size_t number) SetClass() argument
155 GetBracketList(Node* node) GetBracketList() argument
159 SetBracketList(Node* node, BracketList& list) SetBracketList() argument
[all...] |
| H A D | escape-analysis-reducer.cc | 78 Node* node = jsgraph()->graph()->NewNode(jsgraph()->common()->ObjectId(id)); in ObjectIdNode() local
85 Reduction EscapeAnalysisReducer::Reduce(Node* node) { in Reduce() argument
144 ReduceFrameStateInputs(Node* node) ReduceFrameStateInputs() argument
157 ReduceDeoptState(Node* node, Node* effect, Deduplicator* deduplicator) ReduceDeoptState() argument
363 Query(Node* node) Query() argument
399 Node* node; Get() local
[all...] |
| H A D | dead-code-elimination.cc | 32 bool NoReturn(Node* node) { in NoReturn() argument
39 Node* FindDeadInput(Node* node) { in FindDeadInput() argument
48 Reduction DeadCodeElimination::Reduce(Node* node) { in Reduce() argument
80 PropagateDeadControl(Node* node) PropagateDeadControl() argument
87 ReduceEnd(Node* node) ReduceEnd() argument
111 ReduceLoopOrMerge(Node* node) ReduceLoopOrMerge() argument
182 RemoveLoopExit(Node* node) RemoveLoopExit() argument
195 ReduceNode(Node* node) ReduceNode() argument
214 ReducePhi(Node* node) ReducePhi() argument
234 ReduceEffectPhi(Node* node) ReduceEffectPhi() argument
262 ReducePureNode(Node* node) ReducePureNode() argument
271 ReduceUnreachableOrIfException(Node* node) ReduceUnreachableOrIfException() argument
286 ReduceEffectNode(Node* node) ReduceEffectNode() argument
311 ReduceDeoptimizeOrReturnOrTerminateOrTailCall( Node* node) ReduceDeoptimizeOrReturnOrTerminateOrTailCall() argument
338 ReduceLoopExit(Node* node) ReduceLoopExit() argument
348 ReduceBranchOrSwitch(Node* node) ReduceBranchOrSwitch() argument
369 TrimMergeOrPhi(Node* node, int size) TrimMergeOrPhi() argument
375 DeadValue(Node* node, MachineRepresentation rep) DeadValue() argument
[all...] |
| H A D | js-inlining-heuristic.h | 66 Node* node = nullptr; // The call site at which to inline. member
|
| H A D | loop-analysis.h | 76 Loop* ContainingLoop(Node* node) { in ContainingLoop() argument
84 Contains(const Loop* loop, Node* node) Contains() argument
214 map(Node* node) map() argument
251 Marked(Node* node) Marked() argument
[all...] |
| H A D | memory-optimizer.cc | 23 bool CanAllocate(const Node* node) { in CanAllocate() argument
145 void WriteBarrierAssertFailed(Node* node, Node* object, const char* name, in WriteBarrierAssertFailed() argument
207 VisitNode(Node* node, AllocationState const* state) VisitNode() argument
245 AllocationTypeNeedsUpdateToOld(Node* const node, const Edge edge) AllocationTypeNeedsUpdateToOld() argument
259 ReplaceUsesAndKillNode(Node* node, Node* replacement) ReplaceUsesAndKillNode() argument
268 VisitAllocateRaw(Node* node, AllocationState const* state) VisitAllocateRaw() argument
310 VisitLoadFromObject(Node* node, AllocationState const* state) VisitLoadFromObject() argument
321 VisitStoreToObject(Node* node, AllocationState const* state) VisitStoreToObject() argument
329 VisitLoadElement(Node* node, AllocationState const* state) VisitLoadElement() argument
336 VisitLoadField(Node* node, AllocationState const* state) VisitLoadField() argument
356 VisitStoreElement(Node* node, AllocationState const* state) VisitStoreElement() argument
363 VisitStoreField(Node* node, AllocationState const* state) VisitStoreField() argument
369 VisitStore(Node* node, AllocationState const* state) VisitStore() argument
375 VisitCall(Node* node, AllocationState const* state) VisitCall() argument
384 VisitOtherEffect(Node* node, AllocationState const* state) VisitOtherEffect() argument
415 EnqueueMerge(Node* node, int index, AllocationState const* state) EnqueueMerge() argument
458 EnqueueUses(Node* node, AllocationState const* state) EnqueueUses() argument
466 EnqueueUse(Node* node, int index, AllocationState const* state) EnqueueUse() argument
[all...] |
| H A D | wasm-inlining.h | 67 Node* node; member
|
| /third_party/node/deps/v8/include/v8-include/cppgc/ |
| H A D | persistent.h | 32 void SetNode(PersistentNode* node) { node_ = node; } in SetNode() argument
|
| /third_party/node/deps/v8/src/codegen/ |
| H A D | tnode.h | 374 static TNode UncheckedCast(compiler::Node* node) { return TNode(node); } in UncheckedCast() argument
377 explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); } in TNode() argument
|
| /third_party/node/deps/v8/include/cppgc/ |
| H A D | persistent.h | 35 void SetNode(PersistentNode* node) { node_ = node; } in SetNode() argument
|
| /third_party/node/deps/v8/src/heap/ |
| H A D | free-list.cc | 32 FreeSpace node = top(); in PickNodeFromList() local
133 FreeSpace node; SearchForNodeInList() local
215 FreeSpace node; Allocate() local
310 FreeSpace node; Allocate() local
349 FreeSpace node; Allocate() local
[all...] |
| /third_party/node/deps/v8/src/interpreter/ |
| H A D | control-flow-builders.h | 40 BreakableControlFlowBuilder(BytecodeArrayBuilder* builder, BlockCoverageBuilder* block_coverage_builder, AstNode* node) BreakableControlFlowBuilder() argument
100 LoopBuilder(BytecodeArrayBuilder* builder, BlockCoverageBuilder* block_coverage_builder, AstNode* node) LoopBuilder() argument
267 ConditionalControlFlowBuilder(BytecodeArrayBuilder* builder, BlockCoverageBuilder* block_coverage_builder, AstNode* node) ConditionalControlFlowBuilder() argument
[all...] |
| /third_party/node/deps/v8/src/profiler/ |
| H A D | allocation-tracker.cc | 80 AllocationTraceNode* node = root(); in AddPathFromEnd() local
[all...] |
| H A D | sampling-heap-profiler.cc | 86 AllocationNode* node = AddStack(); in SampleObject() local
98 AllocationNode* node = sample->owner; in OnWeakCallback() local
132 AllocationNode* node = &profile_root_; AddStack() local
210 TranslateAllocationNode( AllocationProfile* profile, SamplingHeapProfiler::AllocationNode* node, const std::map<int, Handle<Script>>& scripts) TranslateAllocationNode() argument
[all...] |
| H A D | sampling-heap-profiler.h | 66 AddChildNode(FunctionId id, std::unique_ptr<AllocationNode> node) AddChildNode() argument
|
| /third_party/node/deps/v8/src/regexp/ |
| H A D | regexp-ast.cc | 80 RegExpTree* node = nodes->at(i); in IsAnchoredAtStart() local
95 RegExpTree* node = nodes->at(i); in IsAnchoredAtEnd() local
337 RegExpTree* node = nodes->at(i); in RegExpAlternative() local
|
| H A D | regexp.h | 32 RegExpNode* node = nullptr; member
|