Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 121 V(Number, kSigned32 | kUnsigned32 | kDouble) \ | 121 V(Number, kSigned32 | kUnsigned32 | kDouble) \ |
| 122 V(String, kInternalizedString | kOtherString) \ | 122 V(String, kInternalizedString | kOtherString) \ |
| 123 V(UniqueName, kSymbol | kInternalizedString) \ | 123 V(UniqueName, kSymbol | kInternalizedString) \ |
| 124 V(Name, kSymbol | kString) \ | 124 V(Name, kSymbol | kString) \ |
| 125 V(NumberOrString, kNumber | kString) \ | 125 V(NumberOrString, kNumber | kString) \ |
| 126 V(Object, kUndetectable | kArray | kFunction | \ | 126 V(Object, kUndetectable | kArray | kFunction | \ |
| 127 kRegExp | kOtherObject) \ | 127 kRegExp | kOtherObject) \ |
| 128 V(Receiver, kObject | kProxy) \ | 128 V(Receiver, kObject | kProxy) \ |
| 129 V(Allocated, kDouble | kName | kReceiver) \ | 129 V(Allocated, kDouble | kName | kReceiver) \ |
| 130 V(Any, kOddball | kNumber | kAllocated | kInternal) \ | 130 V(Any, kOddball | kNumber | kAllocated | kInternal) \ |
| 131 V(NonSmi, kAny - kSmi) \ | |
|
Jakob Kummerow
2013/07/18 11:56:15
I'm not sure this is what you want. Type::Smi deno
| |
| 131 V(Detectable, kAllocated - kUndetectable) | 132 V(Detectable, kAllocated - kUndetectable) |
| 132 | 133 |
| 133 #define TYPE_LIST(V) \ | 134 #define TYPE_LIST(V) \ |
| 134 PRIMITIVE_TYPE_LIST(V) \ | 135 PRIMITIVE_TYPE_LIST(V) \ |
| 135 COMPOSED_TYPE_LIST(V) | 136 COMPOSED_TYPE_LIST(V) |
| 136 | 137 |
| 137 | 138 |
| 138 | 139 |
| 139 class Type : public Object { | 140 class Type : public Object { |
| 140 public: | 141 public: |
| (...skipping 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 321 return Bounds(handle(Type::Union(b.lower, t), isl), b.upper); | 322 return Bounds(handle(Type::Union(b.lower, t), isl), b.upper); |
| 322 } | 323 } |
| 323 static Bounds NarrowUpper(Bounds b, Handle<Type> t, Isolate* isl) { | 324 static Bounds NarrowUpper(Bounds b, Handle<Type> t, Isolate* isl) { |
| 324 return Bounds(b.lower, handle(Type::Intersect(b.upper, t), isl)); | 325 return Bounds(b.lower, handle(Type::Intersect(b.upper, t), isl)); |
| 325 } | 326 } |
| 326 }; | 327 }; |
| 327 | 328 |
| 328 } } // namespace v8::internal | 329 } } // namespace v8::internal |
| 329 | 330 |
| 330 #endif // V8_TYPES_H_ | 331 #endif // V8_TYPES_H_ |
| OLD | NEW |