| /external/v8/test/unittests/compiler/ |
| D | node-test-utils.h | 34 class Node; variable
40 Matcher<Node*> IsDead();
41 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher);
42 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
43 const Matcher<Node*>& control1_matcher);
44 Matcher<Node*> IsEnd(const Matcher<Node*>& control0_matcher,
45 const Matcher<Node*>& control1_matcher,
46 const Matcher<Node*>& control2_matcher);
47 Matcher<Node*> IsBranch(const Matcher<Node*>& value_matcher,
48 const Matcher<Node*>& control_matcher);
[all …]
|
| D | node-test-utils.cc | 50 class NodeMatcher : public MatcherInterface<Node*> {
58 bool MatchAndExplain(Node* node, in MatchAndExplain()
79 IsBranchMatcher(const Matcher<Node*>& value_matcher, in IsBranchMatcher()
80 const Matcher<Node*>& control_matcher) in IsBranchMatcher()
94 bool MatchAndExplain(Node* node, MatchResultListener* listener) const final { in MatchAndExplain()
103 const Matcher<Node*> value_matcher_;
104 const Matcher<Node*> control_matcher_;
110 IsSwitchMatcher(const Matcher<Node*>& value_matcher, in IsSwitchMatcher()
111 const Matcher<Node*>& control_matcher) in IsSwitchMatcher()
125 bool MatchAndExplain(Node* node, MatchResultListener* listener) const final { in MatchAndExplain()
[all …]
|
| D | control-equivalence-unittest.cc | 19 Node* __n[] = {__VA_ARGS__}; \
30 void ComputeEquivalence(Node* node) { in ComputeEquivalence()
40 for (Node* node : all_nodes_) { in ComputeEquivalence()
45 bool IsEquivalenceClass(size_t length, Node** nodes) { in IsEquivalenceClass()
51 for (Node* node : all_nodes_) { in IsEquivalenceClass()
61 Node* Value() { return NumberConstant(0.0); } in Value()
63 Node* Branch(Node* control) { in Branch()
67 Node* IfTrue(Node* control) { in IfTrue()
71 Node* IfFalse(Node* control) { in IfFalse()
75 Node* Merge1(Node* control) { in Merge1()
[all …]
|
| D | escape-analysis-unittest.cc | 46 Node* BeginRegion(Node* effect = nullptr) { in BeginRegion()
54 Node* FinishRegion(Node* value, Node* effect = nullptr) { in FinishRegion()
61 Node* Allocate(Node* size, Node* effect = nullptr, Node* control = nullptr) { in Allocate()
72 Node* Constant(int num) { in Constant()
76 Node* Store(const FieldAccess& access, Node* allocation, Node* value, in Store()
77 Node* effect = nullptr, Node* control = nullptr) { in Store()
88 Node* Load(const FieldAccess& access, Node* from, Node* effect = nullptr, in Load()
89 Node* control = nullptr) { in Load()
100 Node* Return(Node* value, Node* effect = nullptr, Node* control = nullptr) { in Return()
119 Node* Branch() { in Branch()
[all …]
|
| D | js-context-relaxation-unittest.cc | 20 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags = in Reduce()
32 Node* EmptyFrameState() { in EmptyFrameState()
39 Node* ShallowFrameStateChain(Node* outer_context, in ShallowFrameStateChain()
53 Node* DeepFrameStateChain(Node* outer_context, in DeepFrameStateChain()
62 Node* shallow_frame_state = in DeepFrameStateChain()
78 Node* const input0 = Parameter(0); in TEST_F()
79 Node* const input1 = Parameter(1); in TEST_F()
80 Node* const context = Parameter(2); in TEST_F()
81 Node* const outer_context = Parameter(3); in TEST_F()
82 Node* const frame_state = in TEST_F()
[all …]
|
| /external/v8/src/compiler/ |
| D | raw-machine-assembler.h | 62 Node* NullConstant() { in NullConstant()
66 Node* UndefinedConstant() { in UndefinedConstant()
71 Node* PointerConstant(void* value) { in PointerConstant()
74 Node* IntPtrConstant(intptr_t value) { in IntPtrConstant()
79 Node* Int32Constant(int32_t value) { in Int32Constant()
82 Node* Int64Constant(int64_t value) { in Int64Constant()
85 Node* NumberConstant(double value) { in NumberConstant()
88 Node* Float32Constant(float value) { in Float32Constant()
91 Node* Float64Constant(double value) { in Float64Constant()
94 Node* HeapConstant(Handle<HeapObject> object) { in HeapConstant()
[all …]
|
| D | interpreter-assembler.h | 28 class Node; variable
43 Node* BytecodeOperandCount(int operand_index);
46 Node* BytecodeOperandIdx(int operand_index);
49 Node* BytecodeOperandImm(int operand_index);
52 Node* BytecodeOperandReg(int operand_index);
55 Node* GetAccumulator();
56 void SetAccumulator(Node* value);
59 Node* GetContext();
60 void SetContext(Node* value);
63 Node* LoadRegister(int offset);
[all …]
|
| D | wasm-compiler.h | 18 class Node; variable
30 typedef compiler::Node TFNode;
58 Node** Buffer(size_t count) { in Buffer()
62 reinterpret_cast<Node**>(zone_->New(new_size * sizeof(Node*))); in Buffer()
71 Node* Error();
72 Node* Start(unsigned params);
73 Node* Param(unsigned index, wasm::LocalType type);
74 Node* Loop(Node* entry);
75 Node* Terminate(Node* effect, Node* control);
76 Node* Merge(unsigned count, Node** controls);
[all …]
|
| D | ast-graph-builder.h | 27 class Node; variable
45 Node* NewIfTrue() { return NewNode(common()->IfTrue()); } in NewIfTrue()
46 Node* NewIfFalse() { return NewNode(common()->IfFalse()); } in NewIfFalse()
47 Node* NewMerge() { return NewNode(common()->Merge(1), true); } in NewMerge()
48 Node* NewLoop() { return NewNode(common()->Loop(1), true); } in NewLoop()
49 Node* NewBranch(Node* condition, BranchHint hint = BranchHint::kNone) {
94 SetOncePointer<Node> function_closure_;
95 SetOncePointer<Node> function_context_;
96 SetOncePointer<Node> new_target_;
104 Node** input_buffer_;
[all …]
|
| D | graph.h | 17 class Node; variable
37 Node* NewNodeUnchecked(const Operator* op, int input_count, Node** inputs,
41 Node* NewNode(const Operator* op, int input_count, Node** inputs,
45 Node* NewNode(const Operator* op) { in NewNode()
46 return NewNode(op, 0, static_cast<Node**>(nullptr)); in NewNode()
48 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode()
49 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode()
50 Node* nodes[] = {n1, n2}; in NewNode()
53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode()
54 Node* nodes[] = {n1, n2, n3}; in NewNode()
[all …]
|
| D | node-properties.h | 27 static int FirstValueIndex(Node* node) { return 0; } in FirstValueIndex()
28 static int FirstContextIndex(Node* node) { return PastValueIndex(node); } in FirstContextIndex()
29 static int FirstFrameStateIndex(Node* node) { return PastContextIndex(node); } in FirstFrameStateIndex()
30 static int FirstEffectIndex(Node* node) { return PastFrameStateIndex(node); } in FirstEffectIndex()
31 static int FirstControlIndex(Node* node) { return PastEffectIndex(node); } in FirstControlIndex()
32 static int PastValueIndex(Node* node);
33 static int PastContextIndex(Node* node);
34 static int PastFrameStateIndex(Node* node);
35 static int PastEffectIndex(Node* node);
36 static int PastControlIndex(Node* node);
[all …]
|
| D | js-typed-lowering.h | 46 Reduction Reduce(Node* node) final;
51 Reduction ReduceJSAdd(Node* node);
52 Reduction ReduceJSModulus(Node* node);
53 Reduction ReduceJSBitwiseOr(Node* node);
54 Reduction ReduceJSMultiply(Node* node);
55 Reduction ReduceJSComparison(Node* node);
56 Reduction ReduceJSLoadNamed(Node* node);
57 Reduction ReduceJSLoadProperty(Node* node);
58 Reduction ReduceJSStoreProperty(Node* node);
59 Reduction ReduceJSInstanceOf(Node* node);
[all …]
|
| D | change-lowering.h | 27 Reduction Reduce(Node* node) final;
30 Node* HeapNumberValueIndexConstant();
31 Node* SmiMaxValueConstant();
32 Node* SmiShiftBitsConstant();
34 Node* AllocateHeapNumberWithValue(Node* value, Node* control);
35 Node* ChangeInt32ToFloat64(Node* value);
36 Node* ChangeInt32ToSmi(Node* value);
37 Node* ChangeSmiToFloat64(Node* value);
38 Node* ChangeSmiToInt32(Node* value);
39 Node* ChangeUint32ToFloat64(Node* value);
[all …]
|
| D | escape-analysis.h | 38 bool IsVirtual(Node* node);
39 bool IsEscaped(Node* node);
40 bool IsAllocation(Node* node);
49 void Process(Node* node);
50 void ProcessAllocate(Node* node);
51 void ProcessFinishRegion(Node* node);
52 void ProcessStoreField(Node* node);
53 void ProcessStoreElement(Node* node);
54 bool CheckUsesForEscape(Node* node, bool phi_escaping = false) {
57 bool CheckUsesForEscape(Node* node, Node* rep, bool phi_escaping = false);
[all …]
|
| D | interpreter-assembler.cc | 73 Node* InterpreterAssembler::GetAccumulator() { return accumulator_; } in GetAccumulator()
76 void InterpreterAssembler::SetAccumulator(Node* value) { accumulator_ = value; } in SetAccumulator()
79 Node* InterpreterAssembler::GetContext() { return context_; } in GetContext()
82 void InterpreterAssembler::SetContext(Node* value) { context_ = value; } in SetContext()
85 Node* InterpreterAssembler::BytecodeOffset() { return bytecode_offset_; } in BytecodeOffset()
88 Node* InterpreterAssembler::RegisterFileRawPointer() { in RegisterFileRawPointer()
93 Node* InterpreterAssembler::BytecodeArrayTaggedPointer() { in BytecodeArrayTaggedPointer()
98 Node* InterpreterAssembler::DispatchTableRawPointer() { in DispatchTableRawPointer()
103 Node* InterpreterAssembler::RegisterLocation(Node* reg_index) { in RegisterLocation()
108 Node* InterpreterAssembler::LoadRegister(int offset) { in LoadRegister()
[all …]
|
| D | bytecode-graph-builder.h | 37 Node* LoadAccumulator(Node* value);
40 Node* GetFunctionClosure();
43 Node* GetFunctionContext();
46 Node* GetNewTarget();
49 Node* BuildLoadObjectField(Node* object, int offset);
50 Node* BuildLoadImmutableObjectField(Node* object, int offset);
53 Node* BuildLoadFeedbackVector();
56 Node* BuildLoadNativeContextField(int index);
67 Node* NewNode(const Operator* op, bool incomplete = false) {
68 return MakeNode(op, 0, static_cast<Node**>(nullptr), incomplete);
[all …]
|
| D | code-stub-assembler.h | 25 class Node; variable
40 Node* Int32Constant(int value);
41 Node* IntPtrConstant(intptr_t value);
42 Node* NumberConstant(double value);
43 Node* HeapConstant(Handle<HeapObject> object);
44 Node* BooleanConstant(bool value);
46 Node* Parameter(int value);
47 void Return(Node* value);
50 Node* SmiTag(Node* value);
51 Node* SmiUntag(Node* value);
[all …]
|
| D | js-intrinsic-lowering.h | 38 Reduction Reduce(Node* node) final;
41 Reduction ReduceConstructDouble(Node* node);
42 Reduction ReduceCreateIterResultObject(Node* node);
43 Reduction ReduceDeoptimizeNow(Node* node);
44 Reduction ReduceDoubleHi(Node* node);
45 Reduction ReduceDoubleLo(Node* node);
46 Reduction ReduceIncrementStatsCounter(Node* node);
47 Reduction ReduceIsMinusZero(Node* node);
48 Reduction ReduceIsInstanceType(Node* node, InstanceType instance_type);
49 Reduction ReduceIsFunction(Node* node);
[all …]
|
| D | machine-operator-reducer.h | 27 Reduction Reduce(Node* node) override;
30 Node* Float32Constant(volatile float value);
31 Node* Float64Constant(volatile double value);
32 Node* Int32Constant(int32_t value);
33 Node* Int64Constant(int64_t value);
34 Node* Uint32Constant(uint32_t value) { in Uint32Constant()
37 Node* Word32And(Node* lhs, Node* rhs);
38 Node* Word32And(Node* lhs, uint32_t rhs) { in Word32And()
41 Node* Word32Sar(Node* lhs, uint32_t rhs);
42 Node* Word32Shr(Node* lhs, uint32_t rhs);
[all …]
|
| D | node.h | 42 class Node final {
44 static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count,
45 Node* const* inputs, bool has_extensible_inputs);
46 static Node* Clone(Zone* zone, NodeId id, const Node* node);
82 Node* InputAt(int index) const { in InputAt()
87 void ReplaceInput(int index, Node* new_to) { in ReplaceInput()
89 Node** input_ptr = GetInputPtr(index); in ReplaceInput()
90 Node* old_to = *input_ptr; in ReplaceInput()
101 void AppendInput(Zone* zone, Node* new_to);
102 void InsertInput(Zone* zone, int index, Node* new_to);
[all …]
|
| D | graph-reducer.h | 17 class Node; variable
28 explicit Reduction(Node* replacement = nullptr) : replacement_(replacement) {} in replacement_()
30 Node* replacement() const { return replacement_; } in replacement()
34 Node* replacement_;
48 virtual Reduction Reduce(Node* node) = 0;
57 static Reduction Replace(Node* node) { return Reduction(node); } in Replace()
58 static Reduction Changed(Node* node) { return Reduction(node); } in Changed()
72 virtual void Replace(Node* node, Node* replacement) = 0;
74 virtual void Revisit(Node* node) = 0;
79 virtual void ReplaceWithValue(Node* node, Node* value, Node* effect,
[all …]
|
| /external/clang/lib/AST/ |
| D | StmtPrinter.cpp | 95 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt() argument
98 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr() argument
101 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node);
105 void Visit##CLASS(CLASS *Node);
116 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt() argument
118 for (auto *I : Node->body()) in PrintRawCompoundStmt()
133 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt() argument
137 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt() argument
139 PrintRawDeclStmt(Node); in VisitDeclStmt()
143 void StmtPrinter::VisitCompoundStmt(CompoundStmt *Node) { in VisitCompoundStmt() argument
[all …]
|
| /external/v8/test/cctest/compiler/ |
| D | graph-builder-tester.h | 63 parameters_(main_zone()->template NewArray<Node*>(parameter_count())) { in GraphAndBuilders()
70 Node* Parameter(size_t index) { in Parameter()
81 Node* start = graph()->NewNode(common()->Start(num_parameters + 3)); in Begin()
86 void Return(Node* value) { in Return()
94 Node* end = graph()->NewNode(common()->End(1), return_); in End()
98 Node* PointerConstant(void* value) { in PointerConstant()
103 Node* Int32Constant(int32_t value) { in Int32Constant()
106 Node* HeapConstant(Handle<HeapObject> object) { in HeapConstant()
110 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } in BooleanNot()
112 Node* NumberEqual(Node* a, Node* b) { in NumberEqual()
[all …]
|
| /external/libxml2/result/pattern/ |
| D | multiple | 1 Node /c/b[1]/a[1] matches pattern a
2 Node /c/b[1]/a[2] matches pattern a
3 Node /c/c/b/a[1] matches pattern a
4 Node /c/c/b/a[2] matches pattern a
5 Node /c/b[2]/a[1] matches pattern a
6 Node /c/b[2]/a[2] matches pattern a
7 Node /c/b[1] matches pattern b
8 Node /c/c/b matches pattern b
9 Node /c/b[2] matches pattern b
10 Node /c matches pattern c
[all …]
|
| /external/skia/include/xml/ |
| D | SkDOM.h | 28 typedef SkDOMNode Node; typedef
33 const Node* build(const char doc[], size_t len);
34 const Node* copy(const SkDOM& dom, const Node* node);
36 const Node* getRootNode() const;
39 const Node* finishParsing();
45 Type getType(const Node*) const;
47 const char* getName(const Node*) const;
48 const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
49 const Node* getNextSibling(const Node*, const char elem[] = NULL) const;
51 const char* findAttr(const Node*, const char attrName[]) const;
[all …]
|