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 #include "src/compiler/code-stub-assembler.h" | 5 #include "src/compiler/code-stub-assembler.h" |
6 | 6 |
7 #include <ostream> | 7 #include <ostream> |
8 | 8 |
9 #include "src/code-factory.h" | 9 #include "src/code-factory.h" |
10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
(...skipping 157 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
168 } | 168 } |
169 return result; | 169 return result; |
170 } | 170 } |
171 | 171 |
172 Node* CodeStubAssembler::SmiToFloat64(Node* value) { | 172 Node* CodeStubAssembler::SmiToFloat64(Node* value) { |
173 return ChangeInt32ToFloat64(SmiUntag(value)); | 173 return ChangeInt32ToFloat64(SmiUntag(value)); |
174 } | 174 } |
175 | 175 |
176 Node* CodeStubAssembler::SmiAdd(Node* a, Node* b) { return IntPtrAdd(a, b); } | 176 Node* CodeStubAssembler::SmiAdd(Node* a, Node* b) { return IntPtrAdd(a, b); } |
177 | 177 |
| 178 Node* CodeStubAssembler::SmiAddWithOverflow(Node* a, Node* b) { |
| 179 return IntPtrAddWithOverflow(a, b); |
| 180 } |
| 181 |
| 182 Node* CodeStubAssembler::SmiSub(Node* a, Node* b) { return IntPtrSub(a, b); } |
| 183 |
| 184 Node* CodeStubAssembler::SmiSubWithOverflow(Node* a, Node* b) { |
| 185 return IntPtrSubWithOverflow(a, b); |
| 186 } |
| 187 |
178 Node* CodeStubAssembler::SmiEqual(Node* a, Node* b) { return WordEqual(a, b); } | 188 Node* CodeStubAssembler::SmiEqual(Node* a, Node* b) { return WordEqual(a, b); } |
179 | 189 |
180 Node* CodeStubAssembler::SmiLessThan(Node* a, Node* b) { | 190 Node* CodeStubAssembler::SmiLessThan(Node* a, Node* b) { |
181 return IntPtrLessThan(a, b); | 191 return IntPtrLessThan(a, b); |
182 } | 192 } |
183 | 193 |
184 Node* CodeStubAssembler::SmiLessThanOrEqual(Node* a, Node* b) { | 194 Node* CodeStubAssembler::SmiLessThanOrEqual(Node* a, Node* b) { |
185 return IntPtrLessThanOrEqual(a, b); | 195 return IntPtrLessThanOrEqual(a, b); |
186 } | 196 } |
187 | 197 |
(...skipping 705 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
893 } | 903 } |
894 } | 904 } |
895 } | 905 } |
896 | 906 |
897 bound_ = true; | 907 bound_ = true; |
898 } | 908 } |
899 | 909 |
900 } // namespace compiler | 910 } // namespace compiler |
901 } // namespace internal | 911 } // namespace internal |
902 } // namespace v8 | 912 } // namespace v8 |
OLD | NEW |