OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_COMPILER_CODE_STUB_ASSEMBLER_H_ | 5 #ifndef V8_COMPILER_CODE_STUB_ASSEMBLER_H_ |
6 #define V8_COMPILER_CODE_STUB_ASSEMBLER_H_ | 6 #define V8_COMPILER_CODE_STUB_ASSEMBLER_H_ |
7 | 7 |
8 #include <map> | 8 #include <map> |
9 | 9 |
10 // Clients of this interface shouldn't depend on lots of compiler internals. | 10 // Clients of this interface shouldn't depend on lots of compiler internals. |
(...skipping 16 matching lines...) Expand all Loading... |
27 | 27 |
28 class CallDescriptor; | 28 class CallDescriptor; |
29 class Graph; | 29 class Graph; |
30 class Node; | 30 class Node; |
31 class Operator; | 31 class Operator; |
32 class RawMachineAssembler; | 32 class RawMachineAssembler; |
33 class RawMachineLabel; | 33 class RawMachineLabel; |
34 class Schedule; | 34 class Schedule; |
35 | 35 |
36 #define CODE_STUB_ASSEMBLER_BINARY_OP_LIST(V) \ | 36 #define CODE_STUB_ASSEMBLER_BINARY_OP_LIST(V) \ |
| 37 V(Float64Equal) \ |
| 38 V(Float64LessThan) \ |
| 39 V(Float64LessThanOrEqual) \ |
37 V(IntPtrAdd) \ | 40 V(IntPtrAdd) \ |
38 V(IntPtrSub) \ | 41 V(IntPtrSub) \ |
39 V(Int32Add) \ | 42 V(Int32Add) \ |
40 V(Int32Sub) \ | 43 V(Int32Sub) \ |
41 V(Int32Mul) \ | 44 V(Int32Mul) \ |
42 V(Int32GreaterThanOrEqual) \ | 45 V(Int32GreaterThanOrEqual) \ |
43 V(WordEqual) \ | 46 V(WordEqual) \ |
44 V(WordNotEqual) \ | 47 V(WordNotEqual) \ |
45 V(WordOr) \ | 48 V(WordOr) \ |
46 V(WordAnd) \ | 49 V(WordAnd) \ |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
100 // =========================================================================== | 103 // =========================================================================== |
101 | 104 |
102 // Constants. | 105 // Constants. |
103 Node* Int32Constant(int value); | 106 Node* Int32Constant(int value); |
104 Node* IntPtrConstant(intptr_t value); | 107 Node* IntPtrConstant(intptr_t value); |
105 Node* NumberConstant(double value); | 108 Node* NumberConstant(double value); |
106 Node* SmiConstant(Smi* value); | 109 Node* SmiConstant(Smi* value); |
107 Node* HeapConstant(Handle<HeapObject> object); | 110 Node* HeapConstant(Handle<HeapObject> object); |
108 Node* BooleanConstant(bool value); | 111 Node* BooleanConstant(bool value); |
109 Node* ExternalConstant(ExternalReference address); | 112 Node* ExternalConstant(ExternalReference address); |
| 113 Node* Float64Constant(double value); |
110 | 114 |
111 Node* Parameter(int value); | 115 Node* Parameter(int value); |
112 void Return(Node* value); | 116 void Return(Node* value); |
113 | 117 |
114 void Bind(Label* label); | 118 void Bind(Label* label); |
115 void Goto(Label* label); | 119 void Goto(Label* label); |
116 void Branch(Node* condition, Label* true_label, Label* false_label); | 120 void Branch(Node* condition, Label* true_label, Label* false_label); |
117 | 121 |
118 void Switch(Node* index, Label* default_label, int32_t* case_values, | 122 void Switch(Node* index, Label* default_label, int32_t* case_values, |
119 Label** case_labels, size_t case_count); | 123 Label** case_labels, size_t case_count); |
(...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
190 | 194 |
191 // =========================================================================== | 195 // =========================================================================== |
192 // Macros | 196 // Macros |
193 // =========================================================================== | 197 // =========================================================================== |
194 | 198 |
195 // Tag and untag Smi values. | 199 // Tag and untag Smi values. |
196 Node* SmiTag(Node* value); | 200 Node* SmiTag(Node* value); |
197 Node* SmiUntag(Node* value); | 201 Node* SmiUntag(Node* value); |
198 | 202 |
199 // Smi operations. | 203 // Smi operations. |
200 Node* SmiAdd(Node* lhs, Node* rhs); | 204 Node* SmiAdd(Node* a, Node* b); |
| 205 Node* SmiEqual(Node* a, Node* b); |
201 | 206 |
202 // Load a value from the root array. | 207 // Load a value from the root array. |
203 Node* LoadRoot(Heap::RootListIndex root_index); | 208 Node* LoadRoot(Heap::RootListIndex root_index); |
204 | 209 |
205 // Check a value for smi-ness | 210 // Check a value for smi-ness |
206 Node* WordIsSmi(Node* a); | 211 Node* WordIsSmi(Node* a); |
207 | 212 |
208 // Load an object pointer from a buffer that isn't in the heap. | 213 // Load an object pointer from a buffer that isn't in the heap. |
209 Node* LoadBufferObject(Node* buffer, int offset); | 214 Node* LoadBufferObject(Node* buffer, int offset); |
210 // Load a field from an object on the heap. | 215 // Load a field from an object on the heap. |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
267 // Map of variables to the list of value nodes that have been added from each | 272 // Map of variables to the list of value nodes that have been added from each |
268 // merge path in their order of merging. | 273 // merge path in their order of merging. |
269 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; | 274 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; |
270 }; | 275 }; |
271 | 276 |
272 } // namespace compiler | 277 } // namespace compiler |
273 } // namespace internal | 278 } // namespace internal |
274 } // namespace v8 | 279 } // namespace v8 |
275 | 280 |
276 #endif // V8_COMPILER_CODE_STUB_ASSEMBLER_H_ | 281 #endif // V8_COMPILER_CODE_STUB_ASSEMBLER_H_ |
OLD | NEW |