void HashCollection::shrink(uint32_t oldCap /* = 0 */) { assert(isCapacityTooHigh() && (oldCap == 0 || oldCap < cap())); assert(m_size <= posLimit() && posLimit() <= cap()); dropImmCopy(); uint32_t newCap; if (oldCap != 0) { // If an old capacity was specified, use that newCap = oldCap; // .. unless the old capacity is too small, in which case we use the // smallest capacity that is large enough to hold the current number // of elements. for (; newCap < m_size; newCap <<= 1) {} assert(newCap == computeMaxElms(folly::nextPowTwo<uint64_t>(newCap) - 1)); } else { if (m_size == 0 && nextKI() == 0) { decRefArr(m_arr); m_arr = staticEmptyDictArrayAsMixed(); return; } // If no old capacity was provided, we compute the largest capacity // where m_size/cap() is less than or equal to 0.5 for good hysteresis size_t doubleSz = size_t(m_size) * 2; uint32_t capThreshold = (doubleSz < size_t(MaxSize)) ? doubleSz : MaxSize; for (newCap = SmallSize * 2; newCap < capThreshold; newCap <<= 1) {} } assert(SmallSize <= newCap && newCap <= MaxSize); assert(m_size <= newCap); auto* oldAd = arrayData(); if (!oldAd->cowCheck()) { // If the buffer's refcount is 1, we can teleport the elements // to a new buffer auto oldBuf = data(); auto oldUsed = posLimit(); auto oldNextKI = nextKI(); auto arr = MixedArray::asMixed(MixedArray::MakeReserveDict(newCap)); auto data = mixedData(arr); m_arr = arr; auto table = (int32_t*)(data + size_t(newCap)); auto table_mask = tableMask(); arr->m_size = m_size; setPosLimit(m_size); setNextKI(oldNextKI); for (uint32_t frPos = 0, toPos = 0; toPos < m_size; ++toPos, ++frPos) { frPos = skipTombstonesNoBoundsCheck(frPos, oldUsed, oldBuf); copyElm(oldBuf[frPos], data[toPos]); *findForNewInsert(table, table_mask, data[toPos].probe()) = toPos; } oldAd->setZombie(); decRefArr(oldAd); } else { // For cases where the buffer's refcount is greater than 1, call // resizeHelper() resizeHelper(newCap); } assert(canMutateBuffer()); assert(m_immCopy.isNull()); assert(!isCapacityTooHigh() || newCap == oldCap); }
SortFlavor HashCollection::preSort(const AccessorT& acc, bool checkTypes) { assert(m_size > 0); if (!checkTypes && !hasTombstones()) { // No need to loop over the elements, we're done return GenericSort; } auto* start = data(); auto* end = data() + posLimit(); bool allInts UNUSED = true; bool allStrs UNUSED = true; for (;;) { if (checkTypes) { while (!isTombstone(start)) { allInts = (allInts && acc.isInt(*start)); allStrs = (allStrs && acc.isStr(*start)); ++start; if (start == end) { goto done; } } } else { while (!isTombstone(start)) { ++start; if (start == end) { goto done; } } } --end; if (start == end) { goto done; } while (isTombstone(end)) { --end; if (start == end) { goto done; } } copyElm(*end, *start); } done: setPosLimit(start - data()); // The logic above possibly moved elements and tombstones around // within the buffer, so we make sure m_pos is not pointing at // garbage by resetting it. The logic above ensures that the first // slot is not a tombstone, so it's safe to set m_pos to 0. arrayData()->m_pos = 0; assert(!hasTombstones()); if (checkTypes) { return allStrs ? StringSort : allInts ? IntegerSort : GenericSort; } else { return GenericSort; } }
typename std::enable_if< std::is_base_of<BaseSet, TSet>::value, Object>::type BaseSet::php_skip(const Variant& n) { if (!n.isInteger()) { SystemLib::throwInvalidArgumentExceptionObject( "Parameter n must be an integer"); } int64_t len = n.toInt64(); if (len <= 0) { // We know the resulting Set will simply be a copy of this Set, // so we can just call Clone() and return early here. return Object::attach(TSet::Clone(this)); } auto set = req::make<TSet>(); if (len >= m_size) { // We know the resulting Set will be empty, so we can return // early here. return Object{std::move(set)}; } size_t sz = size_t(m_size) - size_t(len); assert(sz); set->reserve(sz); set->setSize(sz); set->setPosLimit(sz); uint32_t frPos = nthElmPos(len); auto table = set->hashTab(); auto mask = set->tableMask(); for (uint32_t toPos = 0; toPos < sz; ++toPos, ++frPos) { while (isTombstone(frPos)) { assert(frPos + 1 < posLimit()); ++frPos; } auto& toE = set->data()[toPos]; dupElm(data()[frPos], toE); *findForNewInsert(table, mask, toE.probe()) = toPos; if (toE.hasIntKey()) { set->updateNextKI(toE.ikey); } else { assert(toE.hasStrKey()); set->updateIntLikeStrKeys(toE.skey); } } return Object{std::move(set)}; }
ALWAYS_INLINE typename std::enable_if< std::is_base_of<BaseMap, TMap>::value, Object>::type BaseMap::php_take(const Variant& n) { if (!n.isInteger()) { SystemLib::throwInvalidArgumentExceptionObject( "Parameter n must be an integer"); } int64_t len = n.toInt64(); if (len >= int64_t(m_size)) { // We know the resulting Map will simply be a copy of this Map, // so we can just call Clone() and return early here. return Object::attach(TMap::Clone(this)); } auto map = req::make<TMap>(); if (len <= 0) { // We know the resulting Map will be empty, so we can return // early here. return Object{std::move(map)}; } size_t sz = size_t(len); map->reserve(sz); map->setSize(sz); map->setPosLimit(sz); auto table = map->hashTab(); auto mask = map->tableMask(); for (uint32_t frPos = 0, toPos = 0; toPos < sz; ++toPos, ++frPos) { frPos = skipTombstonesNoBoundsCheck(frPos); auto& toE = map->data()[toPos]; dupElm(data()[frPos], toE); *findForNewInsert(table, mask, toE.probe()) = toPos; if (toE.hasIntKey()) { map->updateNextKI(toE.ikey); } else { assert(toE.hasStrKey()); map->updateIntLikeStrKeys(toE.skey); } } return Object{std::move(map)}; }
ALWAYS_INLINE typename std::enable_if< std::is_base_of<BaseMap, TMap>::value, Object>::type BaseMap::php_slice(const Variant& start, const Variant& len) { int64_t istart; int64_t ilen; if (!start.isInteger() || (istart = start.toInt64()) < 0) { SystemLib::throwInvalidArgumentExceptionObject( "Parameter start must be a non-negative integer"); } if (!len.isInteger() || (ilen = len.toInt64()) < 0) { SystemLib::throwInvalidArgumentExceptionObject( "Parameter len must be a non-negative integer"); } size_t skipAmt = std::min<size_t>(istart, m_size); size_t sz = std::min<size_t>(ilen, size_t(m_size) - skipAmt); auto map = req::make<TMap>(); map->reserve(sz); map->setSize(sz); map->setPosLimit(sz); uint32_t frPos = nthElmPos(skipAmt); auto table = map->hashTab(); auto mask = map->tableMask(); for (uint32_t toPos = 0; toPos < sz; ++toPos, ++frPos) { frPos = skipTombstonesNoBoundsCheck(frPos); auto& toE = map->data()[toPos]; dupElm(data()[frPos], toE); *findForNewInsert(table, mask, toE.probe()) = toPos; if (toE.hasIntKey()) { map->updateNextKI(toE.ikey); } else { assert(toE.hasStrKey()); map->updateIntLikeStrKeys(toE.skey); } } return Object{std::move(map)}; }
ALWAYS_INLINE typename std::enable_if< std::is_base_of<BaseMap, TMap>::value, Object>::type BaseMap::php_map(const Variant& callback) const { VMRegGuard _; CallCtx ctx; vm_decode_function(callback, nullptr, false, ctx); if (!ctx.func) { SystemLib::throwInvalidArgumentExceptionObject( "Parameter must be a valid callback"); } auto map = req::make<TMap>(); if (!m_size) return Object{std::move(map)}; assert(posLimit() != 0); assert(hashSize() > 0); assert(map->arrayData() == staticEmptyMixedArray()); map->m_arr = MixedArray::asMixed(MixedArray::MakeReserveMixed(cap())); map->setIntLikeStrKeys(intLikeStrKeys()); wordcpy(map->hashTab(), hashTab(), hashSize()); { uint32_t used = posLimit(); int32_t version = m_version; uint32_t i = 0; // When the loop below finishes or when an exception is thrown, // make sure that posLimit() get set to the correct value and // that m_pos gets set to point to the first element. SCOPE_EXIT { map->setPosLimit(i); map->arrayData()->m_pos = map->nthElmPos(0); }; constexpr int64_t argc = useKey ? 2 : 1; TypedValue argv[argc]; for (; i < used; ++i) { const Elm& e = data()[i]; Elm& ne = map->data()[i]; if (isTombstone(i)) { ne.data.m_type = e.data.m_type; continue; } TypedValue* tv = &ne.data; if (useKey) { if (e.hasIntKey()) { argv[0].m_type = KindOfInt64; argv[0].m_data.num = e.ikey; } else { argv[0].m_type = KindOfString; argv[0].m_data.pstr = e.skey; } } argv[argc-1] = e.data; g_context->invokeFuncFew(tv, ctx, argc, argv); if (UNLIKELY(version != m_version)) { tvRefcountedDecRef(tv); throw_collection_modified(); } if (e.hasStrKey()) { e.skey->incRefCount(); } ne.ikey = e.ikey; ne.data.hash() = e.data.hash(); map->incSize(); // Needed so that the new elements are accounted for when GC scanning. map->incPosLimit(); } } return Object{std::move(map)}; }