| OLD | NEW |
| 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 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 3631 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3642 // Number of captures in the compiled regexp. | 3642 // Number of captures in the compiled regexp. |
| 3643 static const int kIrregexpCaptureCountIndex = kDataIndex + 3; | 3643 static const int kIrregexpCaptureCountIndex = kDataIndex + 3; |
| 3644 | 3644 |
| 3645 static const int kIrregexpDataSize = kIrregexpCaptureCountIndex + 1; | 3645 static const int kIrregexpDataSize = kIrregexpCaptureCountIndex + 1; |
| 3646 | 3646 |
| 3647 // Offsets directly into the data fixed array. | 3647 // Offsets directly into the data fixed array. |
| 3648 static const int kDataTagOffset = | 3648 static const int kDataTagOffset = |
| 3649 FixedArray::kHeaderSize + kTagIndex * kPointerSize; | 3649 FixedArray::kHeaderSize + kTagIndex * kPointerSize; |
| 3650 static const int kDataAsciiCodeOffset = | 3650 static const int kDataAsciiCodeOffset = |
| 3651 FixedArray::kHeaderSize + kIrregexpASCIICodeIndex * kPointerSize; | 3651 FixedArray::kHeaderSize + kIrregexpASCIICodeIndex * kPointerSize; |
| 3652 static const int kDataUC16CodeOffset = |
| 3653 FixedArray::kHeaderSize + kIrregexpUC16CodeIndex * kPointerSize; |
| 3652 static const int kIrregexpCaptureCountOffset = | 3654 static const int kIrregexpCaptureCountOffset = |
| 3653 FixedArray::kHeaderSize + kIrregexpCaptureCountIndex * kPointerSize; | 3655 FixedArray::kHeaderSize + kIrregexpCaptureCountIndex * kPointerSize; |
| 3654 }; | 3656 }; |
| 3655 | 3657 |
| 3656 | 3658 |
| 3657 class CompilationCacheShape { | 3659 class CompilationCacheShape { |
| 3658 public: | 3660 public: |
| 3659 static inline bool IsMatch(HashTableKey* key, Object* value) { | 3661 static inline bool IsMatch(HashTableKey* key, Object* value) { |
| 3660 return key->IsMatch(value); | 3662 return key->IsMatch(value); |
| 3661 } | 3663 } |
| (...skipping 1298 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4960 } else { | 4962 } else { |
| 4961 value &= ~(1 << bit_position); | 4963 value &= ~(1 << bit_position); |
| 4962 } | 4964 } |
| 4963 return value; | 4965 return value; |
| 4964 } | 4966 } |
| 4965 }; | 4967 }; |
| 4966 | 4968 |
| 4967 } } // namespace v8::internal | 4969 } } // namespace v8::internal |
| 4968 | 4970 |
| 4969 #endif // V8_OBJECTS_H_ | 4971 #endif // V8_OBJECTS_H_ |
| OLD | NEW |