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 #include "src/base/flags.h" | 5 #include "src/base/flags.h" |
6 #include "src/bootstrapper.h" | 6 #include "src/bootstrapper.h" |
7 #include "src/compiler/graph-reducer.h" | 7 #include "src/compiler/graph-reducer.h" |
8 #include "src/compiler/js-operator.h" | 8 #include "src/compiler/js-operator.h" |
9 #include "src/compiler/node.h" | 9 #include "src/compiler/node.h" |
10 #include "src/compiler/node-properties.h" | 10 #include "src/compiler/node-properties.h" |
(...skipping 2116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2127 Bounds Typer::Visitor::TypeFloat32Max(Node* node) { | 2127 Bounds Typer::Visitor::TypeFloat32Max(Node* node) { |
2128 return Bounds(Type::Number()); | 2128 return Bounds(Type::Number()); |
2129 } | 2129 } |
2130 | 2130 |
2131 | 2131 |
2132 Bounds Typer::Visitor::TypeFloat32Min(Node* node) { | 2132 Bounds Typer::Visitor::TypeFloat32Min(Node* node) { |
2133 return Bounds(Type::Number()); | 2133 return Bounds(Type::Number()); |
2134 } | 2134 } |
2135 | 2135 |
2136 | 2136 |
| 2137 Bounds Typer::Visitor::TypeFloat32Abs(Node* node) { |
| 2138 // TODO(turbofan): We should be able to infer a better type here. |
| 2139 return Bounds(Type::Number()); |
| 2140 } |
| 2141 |
| 2142 |
2137 Bounds Typer::Visitor::TypeFloat32Sqrt(Node* node) { | 2143 Bounds Typer::Visitor::TypeFloat32Sqrt(Node* node) { |
2138 return Bounds(Type::Number()); | 2144 return Bounds(Type::Number()); |
2139 } | 2145 } |
2140 | 2146 |
2141 | 2147 |
2142 Bounds Typer::Visitor::TypeFloat32Equal(Node* node) { | 2148 Bounds Typer::Visitor::TypeFloat32Equal(Node* node) { |
2143 return Bounds(Type::Boolean()); | 2149 return Bounds(Type::Boolean()); |
2144 } | 2150 } |
2145 | 2151 |
2146 | 2152 |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2182 Bounds Typer::Visitor::TypeFloat64Max(Node* node) { | 2188 Bounds Typer::Visitor::TypeFloat64Max(Node* node) { |
2183 return Bounds(Type::Number()); | 2189 return Bounds(Type::Number()); |
2184 } | 2190 } |
2185 | 2191 |
2186 | 2192 |
2187 Bounds Typer::Visitor::TypeFloat64Min(Node* node) { | 2193 Bounds Typer::Visitor::TypeFloat64Min(Node* node) { |
2188 return Bounds(Type::Number()); | 2194 return Bounds(Type::Number()); |
2189 } | 2195 } |
2190 | 2196 |
2191 | 2197 |
| 2198 Bounds Typer::Visitor::TypeFloat64Abs(Node* node) { |
| 2199 // TODO(turbofan): We should be able to infer a better type here. |
| 2200 return Bounds(Type::Number()); |
| 2201 } |
| 2202 |
| 2203 |
2192 Bounds Typer::Visitor::TypeFloat64Sqrt(Node* node) { | 2204 Bounds Typer::Visitor::TypeFloat64Sqrt(Node* node) { |
2193 return Bounds(Type::Number()); | 2205 return Bounds(Type::Number()); |
2194 } | 2206 } |
2195 | 2207 |
2196 | 2208 |
2197 Bounds Typer::Visitor::TypeFloat64Equal(Node* node) { | 2209 Bounds Typer::Visitor::TypeFloat64Equal(Node* node) { |
2198 return Bounds(Type::Boolean()); | 2210 return Bounds(Type::Boolean()); |
2199 } | 2211 } |
2200 | 2212 |
2201 | 2213 |
(...skipping 133 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2335 TYPED_ARRAYS(TYPED_ARRAY_CASE) | 2347 TYPED_ARRAYS(TYPED_ARRAY_CASE) |
2336 #undef TYPED_ARRAY_CASE | 2348 #undef TYPED_ARRAY_CASE |
2337 } | 2349 } |
2338 } | 2350 } |
2339 return Type::Constant(value, zone()); | 2351 return Type::Constant(value, zone()); |
2340 } | 2352 } |
2341 | 2353 |
2342 } // namespace compiler | 2354 } // namespace compiler |
2343 } // namespace internal | 2355 } // namespace internal |
2344 } // namespace v8 | 2356 } // namespace v8 |
OLD | NEW |