1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/* Copyright 2015 The TensorFlow 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.
==============================================================================*/
#include "tensorflow/core/kernels/initializable_lookup_table.h"
#include "tensorflow/core/lib/core/errors.h"
namespace tensorflow {
namespace lookup {
Status InitializableLookupTable::Find(OpKernelContext* ctx, const Tensor& keys,
Tensor* values,
const Tensor& default_value) {
if (!is_initialized()) {
return errors::FailedPrecondition("Table not initialized.");
}
// Do not let the use migrate before the check; table is used without
// a lock by the readers.
std::atomic_thread_fence(std::memory_order_acquire);
return DoFind(keys, values, default_value);
}
Status InitializableLookupTable::ImportValues(OpKernelContext* ctx,
const Tensor& keys,
const Tensor& values) {
lookup::KeyValueTensorIterator iter(&keys, &values);
return Initialize(iter);
}
Status InitializableLookupTable::Initialize(InitTableIterator& iter) {
if (!iter.Valid()) {
return iter.status();
}
TF_RETURN_IF_ERROR(
CheckKeyAndValueTensorsForInsert(iter.keys(), iter.values()));
mutex_lock l(mu_);
if (is_initialized()) {
return errors::FailedPrecondition("Table already initialized.");
}
TF_RETURN_IF_ERROR(DoLazyPrepare([&iter]() { return iter.total_size(); }));
while (iter.Valid()) {
TF_RETURN_IF_ERROR(DoInsert(iter.keys(), iter.values()));
iter.Next();
}
if (!errors::IsOutOfRange(iter.status())) {
return iter.status();
}
// Prevent compiler/memory reordering of is_initialized and
// the initialization itself.
std::atomic_thread_fence(std::memory_order_release);
is_initialized_ = true;
return Status::OK();
}
} // namespace lookup
} // namespace tensorflow
|
