/* * Copyright 2016 Facebook, Inc. * * 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. */ #pragma once #include #include namespace folly { /** * A very simple atomic single-linked list primitive. * * Usage: * * AtomicLinkedList list; * list.insert(a); * list.sweep([] (MyClass& c) { doSomething(c); } */ template class AtomicLinkedList { public: AtomicLinkedList() {} AtomicLinkedList(const AtomicLinkedList&) = delete; AtomicLinkedList& operator=(const AtomicLinkedList&) = delete; AtomicLinkedList(AtomicLinkedList&& other) noexcept = default; AtomicLinkedList& operator=(AtomicLinkedList&& other) = default; ~AtomicLinkedList() { sweep([](T&&) {}); } bool empty() const { return list_.empty(); } /** * Atomically insert t at the head of the list. * @return True if the inserted element is the only one in the list * after the call. */ bool insertHead(T t) { auto wrapper = folly::make_unique(std::move(t)); return list_.insertHead(wrapper.release()); } /** * Repeatedly pops element from head, * and calls func() on the removed elements in the order from tail to head. * Stops when the list is empty. */ template void sweep(F&& func) { list_.sweep([&](Wrapper* wrapperPtr) mutable { std::unique_ptr wrapper(wrapperPtr); func(std::move(wrapper->data)); }); } private: struct Wrapper { explicit Wrapper(T&& t) : data(std::move(t)) {} AtomicIntrusiveLinkedListHook hook; T data; }; AtomicIntrusiveLinkedList list_; }; } // namespace folly