| /external/skia/include/private/ |
| SkTHash.h | 66 if (s.empty()) {
86 SkASSERT(!s.empty());
99 // Look for an element that can be moved into the empty slot.
100 // If the empty slot is in between where an element landed, and its native slot, then
101 // move it to the empty slot. Don't move it if its native slot is in between where
102 // the element landed and the empty slot.
103 // [native] <= [empty] < [candidate] == GOOD, can move candidate to empty slot
104 // [empty] < [native] < [candidate] == BAD, need to leave candidate where it is
108 if (s.empty()) {
209 bool empty() const { return this->hash == 0; } function in struct:SkTHashTable::Slot
[all...] |
| /external/skia/src/core/ |
| SkRasterClipStack.h | 19 while (!fDeque.empty()) {
25 bool empty() const { return fDeque.empty(); } function in class:SkTStack
54 fTop = fDeque.empty() ? nullptr : (T*)fDeque.back();
|
| /external/skia/tests/ |
| PointTest.cpp | 110 const SkPoint empty = { 0, 0 }; local
113 REPORTER_ASSERT(reporter, pt == empty);
116 REPORTER_ASSERT(reporter, pt == empty);
|
| /external/skqp/include/private/ |
| SkTHash.h | 66 if (s.empty()) {
86 SkASSERT(!s.empty());
99 // Look for an element that can be moved into the empty slot.
100 // If the empty slot is in between where an element landed, and its native slot, then
101 // move it to the empty slot. Don't move it if its native slot is in between where
102 // the element landed and the empty slot.
103 // [native] <= [empty] < [candidate] == GOOD, can move candidate to empty slot
104 // [empty] < [native] < [candidate] == BAD, need to leave candidate where it is
108 if (s.empty()) {
209 bool empty() const { return this->hash == 0; } function in struct:SkTHashTable::Slot
[all...] |
| /external/skqp/src/core/ |
| SkRasterClipStack.h | 19 while (!fDeque.empty()) {
25 bool empty() const { return fDeque.empty(); } function in class:SkTStack
54 fTop = fDeque.empty() ? nullptr : (T*)fDeque.back();
|
| /external/skqp/tests/ |
| PointTest.cpp | 110 const SkPoint empty = { 0, 0 }; local
113 REPORTER_ASSERT(reporter, pt == empty);
116 REPORTER_ASSERT(reporter, pt == empty);
|
| /external/squashfs-tools/squashfs-tools/ |
| caches-queues-lists.c | 57 pthread_cond_init(&queue->empty, NULL);
76 pthread_cond_signal(&queue->empty);
89 pthread_cond_wait(&queue->empty, &queue->mutex);
102 int empty; local
107 empty = queue->readp == queue->writep;
111 return empty;
134 queue->readp == queue->writep ? " (EMPTY)" :
259 size == 0 ? " (EMPTY)" : "");
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| BitVector.h | 72 /// BitVector default ctor - Creates an empty bitvector.
104 /// empty - Tests whether there are no bits in this bitvector.
105 bool empty() const { return Size == 0; } function in class:llvm::BitVector
|
| DenseSet.h | 33 bool empty() const { return TheMap.empty(); } function in class:llvm::DenseSet
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| IVUsers.h | 167 bool empty() const { return IVUses.empty(); } function in class:llvm::IVUsers
|
| /external/swiftshader/third_party/LLVM/include/llvm/ |
| BasicBlock.h | 201 inline bool empty() const { return InstList.empty(); } function in class:llvm::BasicBlock
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LiveIntervalUnion.h | 78 bool empty() const { return Segments.empty(); } function in class:llvm::LiveIntervalUnion
|
| LiveRangeEdit.h | 93 /// empty initially, any existing registers are ignored.
114 bool empty() const { return size() == 0; } function in class:llvm::LiveRangeEdit
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| StringRef.h | 73 /// Construct an empty string ref.
127 /// empty - Check if the string is empty.
130 bool empty() const { return Length == 0; } function in class:llvm::StringRef
140 assert(!empty());
147 assert(!empty());
155 if (empty())
320 while (!S.empty()) {
491 /// erroneous if empty or if it overflows T.
523 /// erroneous if empty or if it overflows T
[all...] |
| ilist_node.h | 235 bool empty() const { return this == this->getPrev(); } function in class:llvm::ilist_sentinel
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
| BasicBlock.h | 239 inline bool empty() const { return InstList.empty(); } function in class:llvm::BasicBlock
|
| /external/swiftshader/third_party/subzero/src/ |
| IceThreading.h | 32 /// the queue is empty (it never returns nullptr if the queue contained any
49 /// fields. Front==Back indicates an empty queue.
75 GrewOrEnded.wait(L, [this] { return IsEnded || !empty() || Sequential; });
76 if (!empty()) {
108 /// consumers are waiting for a non-empty queue.
112 /// by the producers, and read by all via size() and empty().
122 /// written by the consumers, and read by all via size() and empty().
134 bool empty() const { return Front == Back; } function in class:Ice::BoundedProducerConsumerQueue
141 assert(!empty());
|
| /external/tensorflow/tensorflow/compiler/xla/service/cpu/ |
| cpu_transfer_manager.cc | 217 auto empty = Literal::CreateFromDimensions( local
220 buffer_data.push_back({empty->untyped_data(), size});
221 elements.push_back(std::move(empty));
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| shape_util.h | 52 // For indexing into array shapes, the index is always trivially empty, ie {}.
61 bool empty() const { return indices_.empty(); } function in class:xla::ShapeIndex
119 bool empty() const { return begin_ == end_; } function in class:xla::ShapeIndexView
121 CHECK(!empty());
125 CHECK(!empty());
315 // Returns an empty tuple shape. Can be used to indicate side-effects.
404 // Returns true if shape is an empty tuple.
407 // Returns true if shape is an empty tuple, or is an array with no elements.
579 // once with the proper empty indexes
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| placer_test.cc | 887 DeviceSet empty; local
[all...] |
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| tensor_coding.cc | 64 TensorProto empty; local
65 meta_.mutable_tensor()->Swap(&empty);
94 TensorProto empty; local
95 meta_.mutable_tensor()->Swap(&empty);
286 TensorProto empty; local
287 meta_.mutable_tensor()->Swap(&empty);
|
| /external/tensorflow/tensorflow/core/graph/ |
| edgeset.h | 44 bool empty() const;
128 inline bool EdgeSet::empty() const { return size() == 0; } function in class:tensorflow::EdgeSet
|
| /external/tensorflow/tensorflow/core/kernels/ |
| list_kernels.cc | 107 while (!iter.empty()) {
151 TensorList empty; variable
152 empty.element_dtype = element_dtype_;
155 empty.element_shape = element_shape;
156 result->scalar<Variant>()() = std::move(empty);
321 OP_REQUIRES(c, !l->tensors.empty(),
322 errors::InvalidArgument("Trying to pop from an empty list."));
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| array_slice.h | 174 bool empty() const { return size() == 0; } function in class:tensorflow::gtl::ArraySlice
273 bool empty() const { return size() == 0; } function in class:tensorflow::gtl::MutableArraySlice
|
| compactptrset.h | 115 bool empty() const { return isbig() ? big()->empty() : (rep_ == 0); } function in class:tensorflow::gtl::CompactPointerSet
|
