/* * 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. */ #pragma once #include namespace folly { namespace fibers { template void Fiber::setFunction(F&& func, TaskOptions taskOptions) { assert(state_ == INVALID); func_ = std::forward(func); state_ = NOT_STARTED; taskOptions_ = std::move(taskOptions); } template void Fiber::setFunctionFinally(F&& resultFunc, G&& finallyFunc) { assert(state_ == INVALID); resultFunc_ = std::forward(resultFunc); finallyFunc_ = std::forward(finallyFunc); state_ = NOT_STARTED; taskOptions_ = TaskOptions(); } inline void* Fiber::getUserBuffer() { return &userBuffer_; } template T& Fiber::LocalData::getSlow() { dataSize_ = sizeof(T); dataType_ = &typeid(T); if (sizeof(T) <= kBufferSize) { dataDestructor_ = dataBufferDestructor; data_ = &buffer_; } else { dataDestructor_ = dataHeapDestructor; data_ = allocateHeapBuffer(dataSize_); } dataCopyConstructor_ = dataCopyConstructor; new (reinterpret_cast(data_)) T(); return *reinterpret_cast(data_); } template void Fiber::LocalData::dataCopyConstructor(void* ptr, const void* other) { new (reinterpret_cast(ptr)) T(*reinterpret_cast(other)); } template void Fiber::LocalData::dataBufferDestructor(void* ptr) { reinterpret_cast(ptr)->~T(); } template void Fiber::LocalData::dataHeapDestructor(void* ptr) { reinterpret_cast(ptr)->~T(); freeHeapBuffer(ptr); } } // namespace fibers } // namespace folly