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 352 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
363 return BitFieldDecode(word32, T::kShift, T::kMask); | 363 return BitFieldDecode(word32, T::kShift, T::kMask); |
364 } | 364 } |
365 | 365 |
366 Node* BitFieldDecode(Node* word32, uint32_t shift, uint32_t mask); | 366 Node* BitFieldDecode(Node* word32, uint32_t shift, uint32_t mask); |
367 | 367 |
368 // Conversions. | 368 // Conversions. |
369 Node* ChangeFloat64ToTagged(Node* value); | 369 Node* ChangeFloat64ToTagged(Node* value); |
370 Node* ChangeInt32ToTagged(Node* value); | 370 Node* ChangeInt32ToTagged(Node* value); |
371 Node* TruncateTaggedToFloat64(Node* context, Node* value); | 371 Node* TruncateTaggedToFloat64(Node* context, Node* value); |
372 Node* TruncateTaggedToWord32(Node* context, Node* value); | 372 Node* TruncateTaggedToWord32(Node* context, Node* value); |
| 373 // Truncate to int32 using JavaScript truncation mode. |
| 374 Node* TruncateFloat64ToInt32(Node* value); |
373 | 375 |
374 // Branching helpers. | 376 // Branching helpers. |
375 // TODO(danno): Can we be more cleverish wrt. edge-split? | 377 // TODO(danno): Can we be more cleverish wrt. edge-split? |
376 void BranchIf(Node* condition, Label* if_true, Label* if_false); | 378 void BranchIf(Node* condition, Label* if_true, Label* if_false); |
377 | 379 |
378 #define BRANCH_HELPER(name) \ | 380 #define BRANCH_HELPER(name) \ |
379 void BranchIf##name(Node* a, Node* b, Label* if_true, Label* if_false) { \ | 381 void BranchIf##name(Node* a, Node* b, Label* if_true, Label* if_false) { \ |
380 BranchIf(name(a, b), if_true, if_false); \ | 382 BranchIf(name(a, b), if_true, if_false); \ |
381 } | 383 } |
382 CODE_STUB_ASSEMBLER_COMPARE_BINARY_OP_LIST(BRANCH_HELPER) | 384 CODE_STUB_ASSEMBLER_COMPARE_BINARY_OP_LIST(BRANCH_HELPER) |
(...skipping 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
471 // Map of variables to the list of value nodes that have been added from each | 473 // Map of variables to the list of value nodes that have been added from each |
472 // merge path in their order of merging. | 474 // merge path in their order of merging. |
473 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; | 475 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; |
474 }; | 476 }; |
475 | 477 |
476 } // namespace compiler | 478 } // namespace compiler |
477 } // namespace internal | 479 } // namespace internal |
478 } // namespace v8 | 480 } // namespace v8 |
479 | 481 |
480 #endif // V8_COMPILER_CODE_STUB_ASSEMBLER_H_ | 482 #endif // V8_COMPILER_CODE_STUB_ASSEMBLER_H_ |
OLD | NEW |