| 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_PHI_REDUCER_H_ | 5 #ifndef V8_COMPILER_PHI_REDUCER_H_ |
| 6 #define V8_COMPILER_PHI_REDUCER_H_ | 6 #define V8_COMPILER_PHI_REDUCER_H_ |
| 7 | 7 |
| 8 #include "src/compiler/graph-reducer.h" | 8 #include "src/compiler/graph-reducer.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 | 24 |
| 25 Node* replacement = NULL; | 25 Node* replacement = NULL; |
| 26 Node::Inputs inputs = node->inputs(); | 26 Node::Inputs inputs = node->inputs(); |
| 27 for (InputIter it = inputs.begin(); n > 0; --n, ++it) { | 27 for (InputIter it = inputs.begin(); n > 0; --n, ++it) { |
| 28 Node* input = *it; | 28 Node* input = *it; |
| 29 if (input != node && input != replacement) { | 29 if (input != node && input != replacement) { |
| 30 if (replacement != NULL) return NoChange(); | 30 if (replacement != NULL) return NoChange(); |
| 31 replacement = input; | 31 replacement = input; |
| 32 } | 32 } |
| 33 } | 33 } |
| 34 ASSERT_NE(node, replacement); | 34 DCHECK_NE(node, replacement); |
| 35 return Replace(replacement); | 35 return Replace(replacement); |
| 36 } | 36 } |
| 37 }; | 37 }; |
| 38 } | 38 } |
| 39 } | 39 } |
| 40 } // namespace v8::internal::compiler | 40 } // namespace v8::internal::compiler |
| 41 | 41 |
| 42 #endif // V8_COMPILER_PHI_REDUCER_H_ | 42 #endif // V8_COMPILER_PHI_REDUCER_H_ |
| OLD | NEW |