// Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved. // // 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 "lite/core/kernel.h" #include "lite/core/op_registry.h" #include "lite/fluid/eigen.h" namespace paddle { namespace lite { namespace kernels { namespace x86 { template class LookupTableCompute : public KernelLite { public: using param_t = operators::LookupTableParam; void Run() override { auto ¶m = *param_.get_mutable(); auto *ids_t = param.Ids; auto *output_t = param.Out; int64_t padding_idx = param.padding_idx; const int64_t *ids = ids_t->data(); int64_t ids_numel = ids_t->dims().production(); auto *table_t = param.W; int64_t row_number = table_t->dims()[0]; int64_t row_width = table_t->dims()[1]; const T *table = table_t->data(); T *output = output_t->mutable_data(); memset(output, 0, output_t->dims().production() * sizeof(T)); for (int64_t i = 0; i < ids_numel; ++i) { if (padding_idx != -1 && ids[i] == padding_idx) { memset(output + i * row_width, 0, row_width * sizeof(T)); } else { CHECK_LT(ids[i], row_number); CHECK_GE(ids[i], 0); memcpy(output + i * row_width, table + ids[i] * row_width, row_width * sizeof(T)); } } } virtual ~LookupTableCompute() = default; }; } // namespace x86 } // namespace kernels } // namespace lite } // namespace paddle