/* * Copyright (c) Facebook, Inc. and its affiliates. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include #include namespace folly { // Explicitly instantiate SharedMutex here: template class SharedMutexImpl; template class SharedMutexImpl; namespace shared_mutex_detail { std::unique_lock annotationGuard(void* ptr) { if (folly::kIsSanitizeThread) { // On TSAN builds, we have an array of mutexes and index into them based on // the address. If the array is of prime size things will work out okay // without a complicated hash function. static constexpr std::size_t kNumAnnotationMutexes = 251; static Indestructible> kAnnotationMutexes; auto index = reinterpret_cast(ptr) % kNumAnnotationMutexes; return std::unique_lock((*kAnnotationMutexes)[index]); } else { return std::unique_lock(); } } uint32_t getMaxDeferredReadersSlow(std::atomic& cache) { uint32_t maxDeferredReaders = std::min( static_cast( folly::nextPowTwo(CacheLocality::system().numCpus) << 1), shared_mutex_detail::kMaxDeferredReadersAllocated); // maxDeferredReaders must be a power of 2 assert(!(maxDeferredReaders & (maxDeferredReaders - 1))); cache.store(maxDeferredReaders, std::memory_order_release); return maxDeferredReaders; } } // namespace shared_mutex_detail } // namespace folly