| 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 20 matching lines...) Expand all  Loading... | 
|  31   void DoAllocate(Node* node); |  31   void DoAllocate(Node* node); | 
|  32   void DoLoadField(Node* node); |  32   void DoLoadField(Node* node); | 
|  33   void DoStoreField(Node* node); |  33   void DoStoreField(Node* node); | 
|  34   // TODO(turbofan): The output_type can be removed once the result of the |  34   // TODO(turbofan): The output_type can be removed once the result of the | 
|  35   // representation analysis is stored in the node bounds. |  35   // representation analysis is stored in the node bounds. | 
|  36   void DoLoadBuffer(Node* node, MachineType output_type, |  36   void DoLoadBuffer(Node* node, MachineType output_type, | 
|  37                     RepresentationChanger* changer); |  37                     RepresentationChanger* changer); | 
|  38   void DoStoreBuffer(Node* node); |  38   void DoStoreBuffer(Node* node); | 
|  39   void DoLoadElement(Node* node); |  39   void DoLoadElement(Node* node); | 
|  40   void DoStoreElement(Node* node); |  40   void DoStoreElement(Node* node); | 
|  41   void DoStringAdd(Node* node); |  | 
|  42   void DoStringEqual(Node* node); |  41   void DoStringEqual(Node* node); | 
|  43   void DoStringLessThan(Node* node); |  42   void DoStringLessThan(Node* node); | 
|  44   void DoStringLessThanOrEqual(Node* node); |  43   void DoStringLessThanOrEqual(Node* node); | 
|  45  |  44  | 
|  46  private: |  45  private: | 
|  47   JSGraph* const jsgraph_; |  46   JSGraph* const jsgraph_; | 
|  48   Zone* const zone_; |  47   Zone* const zone_; | 
|  49  |  48  | 
|  50   // TODO(danno): SimplifiedLowering shouldn't know anything about the source |  49   // TODO(danno): SimplifiedLowering shouldn't know anything about the source | 
|  51   // positions table, but must for now since there currently is no other way to |  50   // positions table, but must for now since there currently is no other way to | 
| (...skipping 20 matching lines...) Expand all  Loading... | 
|  72   Graph* graph() { return jsgraph()->graph(); } |  71   Graph* graph() { return jsgraph()->graph(); } | 
|  73   CommonOperatorBuilder* common() { return jsgraph()->common(); } |  72   CommonOperatorBuilder* common() { return jsgraph()->common(); } | 
|  74   MachineOperatorBuilder* machine() { return jsgraph()->machine(); } |  73   MachineOperatorBuilder* machine() { return jsgraph()->machine(); } | 
|  75 }; |  74 }; | 
|  76  |  75  | 
|  77 }  // namespace compiler |  76 }  // namespace compiler | 
|  78 }  // namespace internal |  77 }  // namespace internal | 
|  79 }  // namespace v8 |  78 }  // namespace v8 | 
|  80  |  79  | 
|  81 #endif  // V8_COMPILER_SIMPLIFIED_LOWERING_H_ |  80 #endif  // V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 
| OLD | NEW |