| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| (...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 47 // Allocate a new fixed array with non-existing entries (the hole). | 47 // Allocate a new fixed array with non-existing entries (the hole). |
| 48 Handle<FixedArray> NewFixedArrayWithHoles( | 48 Handle<FixedArray> NewFixedArrayWithHoles( |
| 49 int size, | 49 int size, |
| 50 PretenureFlag pretenure = NOT_TENURED); | 50 PretenureFlag pretenure = NOT_TENURED); |
| 51 | 51 |
| 52 Handle<NumberDictionary> NewNumberDictionary(int at_least_space_for); | 52 Handle<NumberDictionary> NewNumberDictionary(int at_least_space_for); |
| 53 | 53 |
| 54 Handle<StringDictionary> NewStringDictionary(int at_least_space_for); | 54 Handle<StringDictionary> NewStringDictionary(int at_least_space_for); |
| 55 | 55 |
| 56 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors); | 56 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors); |
| 57 Handle<DeoptimizationInputData> NewDeoptimizationInputData( |
| 58 int deopt_entry_count, |
| 59 PretenureFlag pretenure); |
| 60 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( |
| 61 int deopt_entry_count, |
| 62 PretenureFlag pretenure); |
| 57 | 63 |
| 58 Handle<String> LookupSymbol(Vector<const char> str); | 64 Handle<String> LookupSymbol(Vector<const char> str); |
| 59 Handle<String> LookupAsciiSymbol(const char* str) { | 65 Handle<String> LookupAsciiSymbol(const char* str) { |
| 60 return LookupSymbol(CStrVector(str)); | 66 return LookupSymbol(CStrVector(str)); |
| 61 } | 67 } |
| 62 | 68 |
| 63 | 69 |
| 64 // String creation functions. Most of the string creation functions take | 70 // String creation functions. Most of the string creation functions take |
| 65 // a Heap::PretenureFlag argument to optionally request that they be | 71 // a Heap::PretenureFlag argument to optionally request that they be |
| 66 // allocated in the old generation. The pretenure flag defaults to | 72 // allocated in the old generation. The pretenure flag defaults to |
| (...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 163 int length, | 169 int length, |
| 164 uint8_t* external_pointer, | 170 uint8_t* external_pointer, |
| 165 PretenureFlag pretenure = NOT_TENURED); | 171 PretenureFlag pretenure = NOT_TENURED); |
| 166 | 172 |
| 167 Handle<ExternalArray> NewExternalArray( | 173 Handle<ExternalArray> NewExternalArray( |
| 168 int length, | 174 int length, |
| 169 ExternalArrayType array_type, | 175 ExternalArrayType array_type, |
| 170 void* external_pointer, | 176 void* external_pointer, |
| 171 PretenureFlag pretenure = NOT_TENURED); | 177 PretenureFlag pretenure = NOT_TENURED); |
| 172 | 178 |
| 179 Handle<JSGlobalPropertyCell> NewJSGlobalPropertyCell( |
| 180 Handle<Object> value); |
| 181 |
| 173 Handle<Map> NewMap(InstanceType type, int instance_size); | 182 Handle<Map> NewMap(InstanceType type, int instance_size); |
| 174 | 183 |
| 175 Handle<JSObject> NewFunctionPrototype(Handle<JSFunction> function); | 184 Handle<JSObject> NewFunctionPrototype(Handle<JSFunction> function); |
| 176 | 185 |
| 177 Handle<Map> CopyMapDropDescriptors(Handle<Map> map); | 186 Handle<Map> CopyMapDropDescriptors(Handle<Map> map); |
| 178 | 187 |
| 179 // Copy the map adding more inobject properties if possible without | 188 // Copy the map adding more inobject properties if possible without |
| 180 // overflowing the instance size. | 189 // overflowing the instance size. |
| 181 Handle<Map> CopyMap(Handle<Map> map, int extra_inobject_props); | 190 Handle<Map> CopyMap(Handle<Map> map, int extra_inobject_props); |
| 182 | 191 |
| (...skipping 221 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 404 // Update the map cache in the global context with (keys, map) | 413 // Update the map cache in the global context with (keys, map) |
| 405 Handle<MapCache> AddToMapCache(Handle<Context> context, | 414 Handle<MapCache> AddToMapCache(Handle<Context> context, |
| 406 Handle<FixedArray> keys, | 415 Handle<FixedArray> keys, |
| 407 Handle<Map> map); | 416 Handle<Map> map); |
| 408 }; | 417 }; |
| 409 | 418 |
| 410 | 419 |
| 411 } } // namespace v8::internal | 420 } } // namespace v8::internal |
| 412 | 421 |
| 413 #endif // V8_FACTORY_H_ | 422 #endif // V8_FACTORY_H_ |
| OLD | NEW |