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 53 matching lines...) Loading... |
64 compiler::Node* SmiEqual(compiler::Node* a, compiler::Node* b); | 64 compiler::Node* SmiEqual(compiler::Node* a, compiler::Node* b); |
65 compiler::Node* SmiAboveOrEqual(compiler::Node* a, compiler::Node* b); | 65 compiler::Node* SmiAboveOrEqual(compiler::Node* a, compiler::Node* b); |
66 compiler::Node* SmiLessThan(compiler::Node* a, compiler::Node* b); | 66 compiler::Node* SmiLessThan(compiler::Node* a, compiler::Node* b); |
67 compiler::Node* SmiLessThanOrEqual(compiler::Node* a, compiler::Node* b); | 67 compiler::Node* SmiLessThanOrEqual(compiler::Node* a, compiler::Node* b); |
68 compiler::Node* SmiMin(compiler::Node* a, compiler::Node* b); | 68 compiler::Node* SmiMin(compiler::Node* a, compiler::Node* b); |
69 | 69 |
70 // Allocate an object of the given size. | 70 // Allocate an object of the given size. |
71 compiler::Node* Allocate(compiler::Node* size, AllocationFlags flags = kNone); | 71 compiler::Node* Allocate(compiler::Node* size, AllocationFlags flags = kNone); |
72 compiler::Node* Allocate(int size, AllocationFlags flags = kNone); | 72 compiler::Node* Allocate(int size, AllocationFlags flags = kNone); |
73 compiler::Node* InnerAllocate(compiler::Node* previous, int offset); | 73 compiler::Node* InnerAllocate(compiler::Node* previous, int offset); |
| 74 compiler::Node* InnerAllocate(compiler::Node* previous, |
| 75 compiler::Node* offset); |
74 | 76 |
75 // Check a value for smi-ness | 77 // Check a value for smi-ness |
76 compiler::Node* WordIsSmi(compiler::Node* a); | 78 compiler::Node* WordIsSmi(compiler::Node* a); |
77 // Check that the value is a positive smi. | 79 // Check that the value is a positive smi. |
78 compiler::Node* WordIsPositiveSmi(compiler::Node* a); | 80 compiler::Node* WordIsPositiveSmi(compiler::Node* a); |
79 | 81 |
80 void BranchIfSmiLessThan(compiler::Node* a, compiler::Node* b, Label* if_true, | 82 void BranchIfSmiLessThan(compiler::Node* a, compiler::Node* b, Label* if_true, |
81 Label* if_false) { | 83 Label* if_false) { |
82 BranchIf(SmiLessThan(a, b), if_true, if_false); | 84 BranchIf(SmiLessThan(a, b), if_true, if_false); |
83 } | 85 } |
(...skipping 123 matching lines...) Loading... |
207 compiler::Node* AllocateRawUnaligned(compiler::Node* size_in_bytes, | 209 compiler::Node* AllocateRawUnaligned(compiler::Node* size_in_bytes, |
208 AllocationFlags flags, | 210 AllocationFlags flags, |
209 compiler::Node* top_adddress, | 211 compiler::Node* top_adddress, |
210 compiler::Node* limit_address); | 212 compiler::Node* limit_address); |
211 }; | 213 }; |
212 | 214 |
213 } // namespace internal | 215 } // namespace internal |
214 } // namespace v8 | 216 } // namespace v8 |
215 | 217 |
216 #endif // V8_CODE_STUB_ASSEMBLER_H_ | 218 #endif // V8_CODE_STUB_ASSEMBLER_H_ |
OLD | NEW |