OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
201 Type* Function2(Type* result, Type* arg1, Type* arg2) { | 201 Type* Function2(Type* result, Type* arg1, Type* arg2) { |
202 return Type::Function(result, arg1, arg2, zone_); | 202 return Type::Function(result, arg1, arg2, zone_); |
203 } | 203 } |
204 | 204 |
205 Type* Union(Type* t1, Type* t2) { return Type::Union(t1, t2, zone_); } | 205 Type* Union(Type* t1, Type* t2) { return Type::Union(t1, t2, zone_); } |
206 | 206 |
207 Type* Intersect(Type* t1, Type* t2) { return Type::Intersect(t1, t2, zone_); } | 207 Type* Intersect(Type* t1, Type* t2) { return Type::Intersect(t1, t2, zone_); } |
208 | 208 |
209 Type* Representation(Type* t) { return Type::Representation(t, zone_); } | 209 Type* Representation(Type* t) { return Type::Representation(t, zone_); } |
210 | 210 |
211 // Type* Semantic(Type* t) { return Intersect(t, | |
212 // MaskSemanticForTesting); } | |
213 Type* Semantic(Type* t) { return Type::Semantic(t, zone_); } | 211 Type* Semantic(Type* t) { return Type::Semantic(t, zone_); } |
214 | 212 |
215 Type* Random() { | 213 Type* Random() { |
216 return types[rng_->NextInt(static_cast<int>(types.size()))]; | 214 return types[rng_->NextInt(static_cast<int>(types.size()))]; |
217 } | 215 } |
218 | 216 |
219 Type* Fuzz(int depth = 4) { | 217 Type* Fuzz(int depth = 4) { |
220 switch (rng_->NextInt(depth == 0 ? 3 : 20)) { | 218 switch (rng_->NextInt(depth == 0 ? 3 : 20)) { |
221 case 0: { // bitset | 219 case 0: { // bitset |
222 #define COUNT_BITSET_TYPES(type, value) + 1 | 220 #define COUNT_BITSET_TYPES(type, value) + 1 |
(...skipping 89 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
312 Zone* zone_; | 310 Zone* zone_; |
313 Isolate* isolate_; | 311 Isolate* isolate_; |
314 v8::base::RandomNumberGenerator* rng_; | 312 v8::base::RandomNumberGenerator* rng_; |
315 }; | 313 }; |
316 | 314 |
317 | 315 |
318 } // namespace internal | 316 } // namespace internal |
319 } // namespace v8 | 317 } // namespace v8 |
320 | 318 |
321 #endif | 319 #endif |
OLD | NEW |