| 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 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 54 int size, | 54 int size, |
| 55 PretenureFlag pretenure = NOT_TENURED); | 55 PretenureFlag pretenure = NOT_TENURED); |
| 56 | 56 |
| 57 // Allocate a new uninitialized fixed double array. | 57 // Allocate a new uninitialized fixed double array. |
| 58 Handle<FixedDoubleArray> NewFixedDoubleArray( | 58 Handle<FixedDoubleArray> NewFixedDoubleArray( |
| 59 int size, | 59 int size, |
| 60 PretenureFlag pretenure = NOT_TENURED); | 60 PretenureFlag pretenure = NOT_TENURED); |
| 61 | 61 |
| 62 Handle<ConstantPoolArray> NewConstantPoolArray( | 62 Handle<ConstantPoolArray> NewConstantPoolArray( |
| 63 int number_of_int64_entries, | 63 int number_of_int64_entries, |
| 64 int number_of_ptr_entries, | 64 int number_of_code_ptr_entries, |
| 65 int number_of_heap_ptr_entries, |
| 65 int number_of_int32_entries); | 66 int number_of_int32_entries); |
| 66 | 67 |
| 67 Handle<SeededNumberDictionary> NewSeededNumberDictionary( | 68 Handle<SeededNumberDictionary> NewSeededNumberDictionary( |
| 68 int at_least_space_for); | 69 int at_least_space_for); |
| 69 | 70 |
| 70 Handle<UnseededNumberDictionary> NewUnseededNumberDictionary( | 71 Handle<UnseededNumberDictionary> NewUnseededNumberDictionary( |
| 71 int at_least_space_for); | 72 int at_least_space_for); |
| 72 | 73 |
| 73 Handle<NameDictionary> NewNameDictionary(int at_least_space_for); | 74 Handle<NameDictionary> NewNameDictionary(int at_least_space_for); |
| 74 | 75 |
| (...skipping 522 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 597 isolate()); | 598 isolate()); |
| 598 } else { | 599 } else { |
| 599 return NewNumber(static_cast<double>(value), pretenure); | 600 return NewNumber(static_cast<double>(value), pretenure); |
| 600 } | 601 } |
| 601 } | 602 } |
| 602 | 603 |
| 603 | 604 |
| 604 } } // namespace v8::internal | 605 } } // namespace v8::internal |
| 605 | 606 |
| 606 #endif // V8_FACTORY_H_ | 607 #endif // V8_FACTORY_H_ |
| OLD | NEW |