Lines Matching defs:butterfly
53 Butterfly* butterfly = Butterfly::create(
55 ArrayStorage* storage = butterfly->arrayStorage();
61 return butterfly;
240 Butterfly* butterfly = storage->butterfly();
276 newAllocBase = butterfly->base(structure(vm));
300 ASSERT(newAllocBase != butterfly->base(structure(vm)) || postCapacity < storage->vectorLength() - length);
311 memmove(newButterfly->propertyStorage() - propertySize, butterfly->propertyStorage() - propertySize, sizeof(JSValue) * propertySize + sizeof(IndexingHeader) + ArrayStorage::sizeFor(0));
312 } else if ((newAllocBase != butterfly->base(structure(vm))) || (newIndexBias != storage->m_indexBias)) {
313 memmove(newButterfly->propertyStorage() - propertySize, butterfly->propertyStorage() - propertySize, sizeof(JSValue) * propertySize + sizeof(IndexingHeader) + ArrayStorage::sizeFor(0));
887 Butterfly* newButterfly = storage->butterfly()->unshift(structure(), count);
893 storage = storage->butterfly()->arrayStorage();
1447 ASSERT(i < butterfly()->vectorLength());
1449 butterfly()->contiguousDouble()[i] = tree.abstractor().m_nodes[*iter].value.asNumber();
1463 ASSERT(i < butterfly()->vectorLength());
1470 ASSERT(i < butterfly()->vectorLength());
1472 butterfly()->contiguousDouble()[i] = PNaN;
1538 double v = butterfly()->contiguousDouble()[i];
1600 ASSERT(i < butterfly()->vectorLength());