| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 1957 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1968 // Returns the number of enumerable elements in the dictionary. | 1968 // Returns the number of enumerable elements in the dictionary. |
| 1969 int NumberOfEnumElements(); | 1969 int NumberOfEnumElements(); |
| 1970 | 1970 |
| 1971 // Copies keys to preallocated fixed array. | 1971 // Copies keys to preallocated fixed array. |
| 1972 void CopyKeysTo(FixedArray* storage, PropertyAttributes filter); | 1972 void CopyKeysTo(FixedArray* storage, PropertyAttributes filter); |
| 1973 // Copies enumerable keys to preallocated fixed array. | 1973 // Copies enumerable keys to preallocated fixed array. |
| 1974 void CopyEnumKeysTo(FixedArray* storage, FixedArray* sort_array); | 1974 void CopyEnumKeysTo(FixedArray* storage, FixedArray* sort_array); |
| 1975 // Fill in details for properties into storage. | 1975 // Fill in details for properties into storage. |
| 1976 void CopyKeysTo(FixedArray* storage); | 1976 void CopyKeysTo(FixedArray* storage); |
| 1977 | 1977 |
| 1978 // Returns the value at entry. | |
| 1979 static int ValueIndexFor(int entry) { return EntryToIndex(entry)+1; } | |
| 1980 | |
| 1981 // For transforming properties of a JSObject. | 1978 // For transforming properties of a JSObject. |
| 1982 Object* TransformPropertiesToFastFor(JSObject* obj, | 1979 Object* TransformPropertiesToFastFor(JSObject* obj, |
| 1983 int unused_property_fields); | 1980 int unused_property_fields); |
| 1984 | 1981 |
| 1985 // If slow elements are required we will never go back to fast-case | 1982 // If slow elements are required we will never go back to fast-case |
| 1986 // for the elements kept in this dictionary. We require slow | 1983 // for the elements kept in this dictionary. We require slow |
| 1987 // elements if an element has been added at an index larger than | 1984 // elements if an element has been added at an index larger than |
| 1988 // kRequiresSlowElementsLimit. | 1985 // kRequiresSlowElementsLimit. |
| 1989 inline bool requires_slow_elements(); | 1986 inline bool requires_slow_elements(); |
| 1990 | 1987 |
| (...skipping 2130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4121 } else { | 4118 } else { |
| 4122 value &= ~(1 << bit_position); | 4119 value &= ~(1 << bit_position); |
| 4123 } | 4120 } |
| 4124 return value; | 4121 return value; |
| 4125 } | 4122 } |
| 4126 }; | 4123 }; |
| 4127 | 4124 |
| 4128 } } // namespace v8::internal | 4125 } } // namespace v8::internal |
| 4129 | 4126 |
| 4130 #endif // V8_OBJECTS_H_ | 4127 #endif // V8_OBJECTS_H_ |
| OLD | NEW |