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 2488 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2499 | 2499 |
2500 // Copy the descriptor array, insert a new descriptor and optionally | 2500 // Copy the descriptor array, insert a new descriptor and optionally |
2501 // remove map transitions. If the descriptor is already present, it is | 2501 // remove map transitions. If the descriptor is already present, it is |
2502 // replaced. If a replaced descriptor is a real property (not a transition | 2502 // replaced. If a replaced descriptor is a real property (not a transition |
2503 // or null), its enumeration index is kept as is. | 2503 // or null), its enumeration index is kept as is. |
2504 // If adding a real property, map transitions must be removed. If adding | 2504 // If adding a real property, map transitions must be removed. If adding |
2505 // a transition, they must not be removed. All null descriptors are removed. | 2505 // a transition, they must not be removed. All null descriptors are removed. |
2506 MUST_USE_RESULT MaybeObject* CopyInsert(Descriptor* descriptor, | 2506 MUST_USE_RESULT MaybeObject* CopyInsert(Descriptor* descriptor, |
2507 TransitionFlag transition_flag); | 2507 TransitionFlag transition_flag); |
2508 | 2508 |
2509 // Remove all transitions. Return a copy of the array with all transitions | 2509 // Return a copy of the array with all transitions and null descriptors |
2510 // removed, or a Failure object if the new array could not be allocated. | 2510 // removed. Return a Failure object in case of an allocation failure. |
2511 MUST_USE_RESULT MaybeObject* RemoveTransitions(); | 2511 MUST_USE_RESULT MaybeObject* RemoveTransitions(); |
2512 | 2512 |
2513 // Sort the instance descriptors by the hash codes of their keys. | 2513 // Sort the instance descriptors by the hash codes of their keys. |
2514 // Does not check for duplicates. | 2514 // Does not check for duplicates. |
2515 void SortUnchecked(const WhitenessWitness&); | 2515 void SortUnchecked(const WhitenessWitness&); |
2516 | 2516 |
2517 // Sort the instance descriptors by the hash codes of their keys. | 2517 // Sort the instance descriptors by the hash codes of their keys. |
2518 // Checks the result for duplicates. | 2518 // Checks the result for duplicates. |
2519 void Sort(const WhitenessWitness&); | 2519 void Sort(const WhitenessWitness&); |
2520 | 2520 |
(...skipping 5940 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
8461 } else { | 8461 } else { |
8462 value &= ~(1 << bit_position); | 8462 value &= ~(1 << bit_position); |
8463 } | 8463 } |
8464 return value; | 8464 return value; |
8465 } | 8465 } |
8466 }; | 8466 }; |
8467 | 8467 |
8468 } } // namespace v8::internal | 8468 } } // namespace v8::internal |
8469 | 8469 |
8470 #endif // V8_OBJECTS_H_ | 8470 #endif // V8_OBJECTS_H_ |
OLD | NEW |