| OLD | NEW | 
|   1 // Copyright 2014 the V8 project authors. All rights reserved. |   1 // Copyright 2014 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_SIMPLIFIED_LOWERING_H_ |   5 #ifndef V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 
|   6 #define V8_COMPILER_SIMPLIFIED_LOWERING_H_ |   6 #define V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 
|   7  |   7  | 
|   8 #include "src/compiler/js-graph.h" |   8 #include "src/compiler/js-graph.h" | 
|   9 #include "src/compiler/machine-operator.h" |   9 #include "src/compiler/machine-operator.h" | 
|  10 #include "src/compiler/node.h" |  10 #include "src/compiler/node.h" | 
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  52   // pass down source position information to nodes created during |  52   // pass down source position information to nodes created during | 
|  53   // lowering. Once this phase becomes a vanilla reducer, it should get source |  53   // lowering. Once this phase becomes a vanilla reducer, it should get source | 
|  54   // position information via the SourcePositionWrapper like all other reducers. |  54   // position information via the SourcePositionWrapper like all other reducers. | 
|  55   SourcePositionTable* source_positions_; |  55   SourcePositionTable* source_positions_; | 
|  56  |  56  | 
|  57   Node* SmiTag(Node* node); |  57   Node* SmiTag(Node* node); | 
|  58   Node* IsTagged(Node* node); |  58   Node* IsTagged(Node* node); | 
|  59   Node* Untag(Node* node); |  59   Node* Untag(Node* node); | 
|  60   Node* OffsetMinusTagConstant(int32_t offset); |  60   Node* OffsetMinusTagConstant(int32_t offset); | 
|  61   Node* ComputeIndex(const ElementAccess& access, Node* const key); |  61   Node* ComputeIndex(const ElementAccess& access, Node* const key); | 
|  62   Node* StringComparison(Node* node, bool requires_ordering); |  62   Node* StringComparison(Node* node); | 
|  63   Node* Int32Div(Node* const node); |  63   Node* Int32Div(Node* const node); | 
|  64   Node* Int32Mod(Node* const node); |  64   Node* Int32Mod(Node* const node); | 
|  65   Node* Uint32Div(Node* const node); |  65   Node* Uint32Div(Node* const node); | 
|  66   Node* Uint32Mod(Node* const node); |  66   Node* Uint32Mod(Node* const node); | 
|  67  |  67  | 
|  68   friend class RepresentationSelector; |  68   friend class RepresentationSelector; | 
|  69  |  69  | 
 |  70   Isolate* isolate() { return jsgraph_->isolate(); } | 
|  70   Zone* zone() { return jsgraph_->zone(); } |  71   Zone* zone() { return jsgraph_->zone(); } | 
|  71   JSGraph* jsgraph() { return jsgraph_; } |  72   JSGraph* jsgraph() { return jsgraph_; } | 
|  72   Graph* graph() { return jsgraph()->graph(); } |  73   Graph* graph() { return jsgraph()->graph(); } | 
|  73   CommonOperatorBuilder* common() { return jsgraph()->common(); } |  74   CommonOperatorBuilder* common() { return jsgraph()->common(); } | 
|  74   MachineOperatorBuilder* machine() { return jsgraph()->machine(); } |  75   MachineOperatorBuilder* machine() { return jsgraph()->machine(); } | 
|  75 }; |  76 }; | 
|  76  |  77  | 
|  77 }  // namespace compiler |  78 }  // namespace compiler | 
|  78 }  // namespace internal |  79 }  // namespace internal | 
|  79 }  // namespace v8 |  80 }  // namespace v8 | 
|  80  |  81  | 
|  81 #endif  // V8_COMPILER_SIMPLIFIED_LOWERING_H_ |  82 #endif  // V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 
| OLD | NEW |