OLD | NEW |
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 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_CODE_STUB_ASSEMBLER_H_ | 5 #ifndef V8_CODE_STUB_ASSEMBLER_H_ |
6 #define V8_CODE_STUB_ASSEMBLER_H_ | 6 #define V8_CODE_STUB_ASSEMBLER_H_ |
7 | 7 |
8 #include "src/compiler/code-assembler.h" | 8 #include "src/compiler/code-assembler.h" |
9 #include "src/objects.h" | 9 #include "src/objects.h" |
10 | 10 |
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 compiler::Node* SmiLessThanOrEqual(compiler::Node* a, compiler::Node* b); | 68 compiler::Node* SmiLessThanOrEqual(compiler::Node* a, compiler::Node* b); |
69 compiler::Node* SmiMin(compiler::Node* a, compiler::Node* b); | 69 compiler::Node* SmiMin(compiler::Node* a, compiler::Node* b); |
70 | 70 |
71 // Allocate an object of the given size. | 71 // Allocate an object of the given size. |
72 compiler::Node* Allocate(compiler::Node* size, AllocationFlags flags = kNone); | 72 compiler::Node* Allocate(compiler::Node* size, AllocationFlags flags = kNone); |
73 compiler::Node* Allocate(int size, AllocationFlags flags = kNone); | 73 compiler::Node* Allocate(int size, AllocationFlags flags = kNone); |
74 compiler::Node* InnerAllocate(compiler::Node* previous, int offset); | 74 compiler::Node* InnerAllocate(compiler::Node* previous, int offset); |
75 compiler::Node* InnerAllocate(compiler::Node* previous, | 75 compiler::Node* InnerAllocate(compiler::Node* previous, |
76 compiler::Node* offset); | 76 compiler::Node* offset); |
77 | 77 |
| 78 void Assert(compiler::Node* condition); |
| 79 |
78 // Check a value for smi-ness | 80 // Check a value for smi-ness |
79 compiler::Node* WordIsSmi(compiler::Node* a); | 81 compiler::Node* WordIsSmi(compiler::Node* a); |
80 // Check that the value is a positive smi. | 82 // Check that the value is a positive smi. |
81 compiler::Node* WordIsPositiveSmi(compiler::Node* a); | 83 compiler::Node* WordIsPositiveSmi(compiler::Node* a); |
82 | 84 |
83 void BranchIfSmiLessThan(compiler::Node* a, compiler::Node* b, Label* if_true, | 85 void BranchIfSmiLessThan(compiler::Node* a, compiler::Node* b, Label* if_true, |
84 Label* if_false) { | 86 Label* if_false) { |
85 BranchIf(SmiLessThan(a, b), if_true, if_false); | 87 BranchIf(SmiLessThan(a, b), if_true, if_false); |
86 } | 88 } |
87 | 89 |
(...skipping 173 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
261 compiler::Node* top_adddress, | 263 compiler::Node* top_adddress, |
262 compiler::Node* limit_address); | 264 compiler::Node* limit_address); |
263 | 265 |
264 static const int kElementLoopUnrollThreshold = 8; | 266 static const int kElementLoopUnrollThreshold = 8; |
265 }; | 267 }; |
266 | 268 |
267 } // namespace internal | 269 } // namespace internal |
268 } // namespace v8 | 270 } // namespace v8 |
269 | 271 |
270 #endif // V8_CODE_STUB_ASSEMBLER_H_ | 272 #endif // V8_CODE_STUB_ASSEMBLER_H_ |
OLD | NEW |