| OLD | NEW |
| 1 // Copyright 2010 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 |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 42 // Allocate a new fixed array with undefined entries. | 42 // Allocate a new fixed array with undefined entries. |
| 43 Handle<FixedArray> NewFixedArray( | 43 Handle<FixedArray> NewFixedArray( |
| 44 int size, | 44 int size, |
| 45 PretenureFlag pretenure = NOT_TENURED); | 45 PretenureFlag pretenure = NOT_TENURED); |
| 46 | 46 |
| 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 // Allocate a new fixed array with undefined entries. |
| 53 Handle<FixedArray> NewFixedDoubleArray( |
| 54 int size, |
| 55 PretenureFlag pretenure = NOT_TENURED); |
| 56 |
| 52 Handle<NumberDictionary> NewNumberDictionary(int at_least_space_for); | 57 Handle<NumberDictionary> NewNumberDictionary(int at_least_space_for); |
| 53 | 58 |
| 54 Handle<StringDictionary> NewStringDictionary(int at_least_space_for); | 59 Handle<StringDictionary> NewStringDictionary(int at_least_space_for); |
| 55 | 60 |
| 56 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors); | 61 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors); |
| 57 Handle<DeoptimizationInputData> NewDeoptimizationInputData( | 62 Handle<DeoptimizationInputData> NewDeoptimizationInputData( |
| 58 int deopt_entry_count, | 63 int deopt_entry_count, |
| 59 PretenureFlag pretenure); | 64 PretenureFlag pretenure); |
| 60 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( | 65 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( |
| 61 int deopt_entry_count, | 66 int deopt_entry_count, |
| (...skipping 371 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 433 // Update the map cache in the global context with (keys, map) | 438 // Update the map cache in the global context with (keys, map) |
| 434 Handle<MapCache> AddToMapCache(Handle<Context> context, | 439 Handle<MapCache> AddToMapCache(Handle<Context> context, |
| 435 Handle<FixedArray> keys, | 440 Handle<FixedArray> keys, |
| 436 Handle<Map> map); | 441 Handle<Map> map); |
| 437 }; | 442 }; |
| 438 | 443 |
| 439 | 444 |
| 440 } } // namespace v8::internal | 445 } } // namespace v8::internal |
| 441 | 446 |
| 442 #endif // V8_FACTORY_H_ | 447 #endif // V8_FACTORY_H_ |
| OLD | NEW |