Lines Matching defs:back
2394 // * Copy inobject properties from the backing store back into the object.
2598 Object* back = result->GetBackPointer();
2599 if (back->IsUndefined()) return result;
2600 result = Map::cast(back);
3147 // back to front so that the last callback with a given name takes
3944 Object* back = transition_map->GetBackPointer();
3945 if (back->IsMap()) {
3946 MigrateToMap(object, handle(Map::cast(back)));
4927 // dictionary), store it back to the object.
5493 // Make sure that we never go back to fast case.
5636 // Make sure we never go back to the fast case
6148 // e.g. have to fall back to the slow case while adding a setter after
6389 // If the transition target was not callbacks, fall back to the slow case.
6403 // If either not the same accessor, or not the same attributes, fall back to
6791 // that the maps to which we push the new descriptor array back can rely
8131 // Put max element at the back of the array.
8517 // TODO(dcarney) Add back root optimization.
8577 // TODO(dcarney) Add back root optimization.
9356 // Clear a possible back pointer in case the transition leads to a dead map.
9357 // Return true in case a back pointer has been cleared and false otherwise.
9370 // TODO(verwaest) Should be an assert, otherwise back pointers are not
9403 // TODO(verwaest) Should be an assert, otherwise back pointers are not
11201 // If there is no back edge table, the "table start" will be at or after
11207 PrintF(out, "Back edges (size = %u)\n", back_edges.length());
11621 // MemsetPointer to investigate a crasher. Switch back to MemsetPointer.
12391 // Attempt to put this object back in fast case.
12597 // Make sure that we never go back to fast case.
13177 // If the elements are sparse, we should not go back to fast case.
13194 // dictionary, we cannot go back to fast case.
13495 // Put max element at the back of the array.
