OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
141 bool IsNone() const { return kind_ == kNone; } | 141 bool IsNone() const { return kind_ == kNone; } |
142 bool IsTagged() const { return kind_ == kTagged; } | 142 bool IsTagged() const { return kind_ == kTagged; } |
143 bool IsSmi() const { return kind_ == kSmi; } | 143 bool IsSmi() const { return kind_ == kSmi; } |
144 bool IsSmiOrTagged() const { return IsSmi() || IsTagged(); } | 144 bool IsSmiOrTagged() const { return IsSmi() || IsTagged(); } |
145 bool IsInteger32() const { return kind_ == kInteger32; } | 145 bool IsInteger32() const { return kind_ == kInteger32; } |
146 bool IsSmiOrInteger32() const { return IsSmi() || IsInteger32(); } | 146 bool IsSmiOrInteger32() const { return IsSmi() || IsInteger32(); } |
147 bool IsDouble() const { return kind_ == kDouble; } | 147 bool IsDouble() const { return kind_ == kDouble; } |
148 bool IsHeapObject() const { return kind_ == kHeapObject; } | 148 bool IsHeapObject() const { return kind_ == kHeapObject; } |
149 bool IsExternal() const { return kind_ == kExternal; } | 149 bool IsExternal() const { return kind_ == kExternal; } |
150 bool IsSpecialization() const { | 150 bool IsSpecialization() const { |
151 return kind_ == kInteger32 || kind_ == kDouble; | 151 return kind_ == kInteger32 || kind_ == kDouble || kind_ == kSmi; |
152 } | 152 } |
153 const char* Mnemonic() const; | 153 const char* Mnemonic() const; |
154 | 154 |
155 private: | 155 private: |
156 explicit Representation(Kind k) : kind_(k) { } | 156 explicit Representation(Kind k) : kind_(k) { } |
157 | 157 |
158 // Make sure kind fits in int8. | 158 // Make sure kind fits in int8. |
159 STATIC_ASSERT(kNumRepresentations <= (1 << kBitsPerByte)); | 159 STATIC_ASSERT(kNumRepresentations <= (1 << kBitsPerByte)); |
160 | 160 |
161 int8_t kind_; | 161 int8_t kind_; |
(...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
269 PropertyDetails(int value, PropertyAttributes attributes) { | 269 PropertyDetails(int value, PropertyAttributes attributes) { |
270 value_ = AttributesField::update(value, attributes); | 270 value_ = AttributesField::update(value, attributes); |
271 } | 271 } |
272 | 272 |
273 uint32_t value_; | 273 uint32_t value_; |
274 }; | 274 }; |
275 | 275 |
276 } } // namespace v8::internal | 276 } } // namespace v8::internal |
277 | 277 |
278 #endif // V8_PROPERTY_DETAILS_H_ | 278 #endif // V8_PROPERTY_DETAILS_H_ |
OLD | NEW |