HomeSort by relevance Sort by last modified time
    Searched defs:front (Results 76 - 100 of 150) sorted by null

1 2 34 5 6

  /external/skia/src/gpu/
GrAllocator.h 117 void* front() { function in class:GrAllocator
120 return (char*)(fBlocks.front());
126 const void* front() const { function in class:GrAllocator
129 return (const char*)(fBlocks.front());
322 T& front() { function in class:GrTAllocator
323 return *(T*)fAllocator.front();
329 const T& front() const { function in class:GrTAllocator
330 return *(T*)fAllocator.front();
  /external/skia/src/gpu/ccpr/
GrCCAtlas.h 116 const GrCCAtlas& front() const { SkASSERT(!this->empty()); return fAtlases.front(); } function in class:GrCCAtlasStack
117 GrCCAtlas& front() { SkASSERT(!this->empty()); return fAtlases.front(); } function in class:GrCCAtlasStack
  /external/skqp/include/private/
SkTArray.h 353 T& front() { SkASSERT(fCount > 0); return fItemArray[0];} function
355 const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];} function
  /external/skqp/src/gpu/
GrAllocator.h 117 void* front() { function in class:GrAllocator
120 return (char*)(fBlocks.front());
126 const void* front() const { function in class:GrAllocator
129 return (const char*)(fBlocks.front());
322 T& front() { function in class:GrTAllocator
323 return *(T*)fAllocator.front();
329 const T& front() const { function in class:GrTAllocator
330 return *(T*)fAllocator.front();
  /external/skqp/src/gpu/ccpr/
GrCCAtlas.h 116 const GrCCAtlas& front() const { SkASSERT(!this->empty()); return fAtlases.front(); } function in class:GrCCAtlasStack
117 GrCCAtlas& front() { SkASSERT(!this->empty()); return fAtlases.front(); } function in class:GrCCAtlasStack
  /external/swiftshader/third_party/SPIRV-Tools/source/util/
small_vector.h 254 T& front() { return (*this)[0]; } function in class:spvtools::utils::SmallVector
256 const T& front() const { return (*this)[0]; } function in class:spvtools::utils::SmallVector
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
MachineOutliner.h 106 MachineBasicBlock::iterator &front() { return FirstInst; } function in struct:llvm::outliner::Candidate
146 std::for_each(MBB->rbegin(), (MachineBasicBlock::reverse_iterator)front(),
152 std::for_each(front(), std::next(back()),
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
BasicBlock.h 276 inline const Instruction &front() const { return InstList.front(); } function in class:llvm::final
277 inline Instruction &front() { return InstList.front(); } function in class:llvm::final
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
BitTracker.h 84 MachineInstr *front() const { function in struct:llvm::BitTracker::UseQueueType
92 Set.erase(front());
HexagonVectorLoopCarriedReuse.cpp 208 Instruction *front() const { function in class:__anon42505::DepChain
209 return Chain.front();
374 LLVM_DEBUG(dbgs() << "Processing dependence " << *(D->front()) << "\n");
382 PHINode *PN = cast<PHINode>(D->front());
604 if (D->front() == I1 && D->back() == I2 && D->iterations() == Iters)
613 if (D->front() == I1 && D->back() == I2)
  /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
ArrayRef.h 143 /// front - Get the first element.
144 const T &front() const { function in class:llvm::ArrayRef
330 /// front - Get the first element.
331 T &front() const { function in class:llvm::ArrayRef
simple_ilist.h 40 /// \li \c L.remove(L.front());
134 reference front() { return *begin(); } function in class:llvm::simple_ilist
135 const_reference front() const { return *begin(); } function in class:llvm::simple_ilist
139 /// Insert a node at the front; never copies.
145 /// Remove the node at the front; never deletes.
  /external/tensorflow/tensorflow/compiler/xla/
shape_util.h 115 // value at the front of the view.
136 int64 front() const { function in class:xla::ShapeIndexView
138 return indices_.front();
    [all...]
  /external/v8/src/zone/
zone-chunk-list.h 24 // * will mostly grow at the back, but may sometimes grow in front as well
66 T& front() const;
72 // Will push a separate chunk to the front of the chunk-list.
74 // add in front, consider using 'push_front_many'.
278 T& ZoneChunkList<T>::front() const { function in class:v8::internal::ZoneChunkList::ZoneChunkList
  /external/webrtc/webrtc/system_wrappers/include/
scoped_vector.h 82 const_reference front() const { return v_.front(); } function in class:webrtc::ScopedVector
83 reference front() { return v_.front(); } function in class:webrtc::ScopedVector
  /external/wpa_supplicant_8/src/p2p/
p2p_build.c 527 size_t front = remaining; local
528 size_t back = sizeof(u32) + sizeof(u16) + sizeof(u8) - front;
535 if (front)
536 wpabuf_put_data(buf, holder, front);
541 wpabuf_put_data(buf, &holder[front], back);
554 size_t front = remaining; local
555 size_t back = svc_len - front;
557 if (front)
558 wpabuf_put_data(buf, svc_name, front);
565 wpabuf_put_data(buf, &svc_name[front], 255 - 4)
    [all...]
  /frameworks/av/media/libnblog/
Reader.cpp 123 const uint8_t *front = snapshot->mData; local
127 const uint8_t *lastEnd = findLastValidEntry(front, back, invalidEndTypes);
129 snapshot->mEnd = snapshot->mBegin = EntryIterator(front);
136 while ((firstStartTmp = findLastValidEntry(front, firstStartTmp, invalidBeginTypes))
150 mFifoReader->release(snapshot->mEnd - front);
198 const uint8_t *Reader::findLastValidEntry(const uint8_t *front, const uint8_t *back,
200 if (front == nullptr || back == nullptr) {
203 while (back + Entry::kPreviousLengthOffset >= front) {
206 if (prev < front
  /art/compiler/utils/
intrusive_forward_list.h 179 reference front() { return *begin(); } function in class:art::IntrusiveForwardList
180 const_reference front() const { return *begin(); } function in class:art::IntrusiveForwardList
369 value_type& value = front();
  /external/mesa3d/src/gallium/drivers/vc5/
vc5_state.c 175 const struct pipe_stencil_state *front = &cso->stencil[0]; local
178 if (front->enabled) {
181 /* If !back->enabled, then the front values should be
182 * used for both front and back-facing primitives.
186 config.stencil_write_mask = front->writemask;
187 config.stencil_test_mask = front->valuemask;
189 config.stencil_test_function = front->func;
191 translate_stencil_op(front->zpass_op);
193 translate_stencil_op(front->zfail_op);
195 translate_stencil_op(front->fail_op)
    [all...]
  /external/selinux/libselinux/src/
label_file.h 200 int front, back; local
208 front = 0;
212 memcpy(&spec_copy[front++], &data->spec_arr[i], len);
219 * order. Since 'front' is now the first of the 'exact' we can run
220 * that part of the array switching the front and back element.
223 while (front < back) {
224 /* save the front */
225 memcpy(&spec, &spec_copy[front], len);
226 /* move the back to the front */
227 memcpy(&spec_copy[front], &spec_copy[back], len)
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
Trie.h 148 inline const Node* &front() const { return Children.front(); } function in class:llvm::Trie::Node
149 inline Node* &front() { return Children.front(); } function in class:llvm::Trie::Node
  /external/swiftshader/third_party/LLVM/include/llvm/Bitcode/
Archive.h 246 inline const ArchiveMember& front() const { return members.front(); } function in class:llvm::Archive
247 inline ArchiveMember& front() { return members.front(); } function in class:llvm::Archive
  /external/swiftshader/third_party/LLVM/include/llvm/
Function.h 341 const BasicBlock &getEntryBlock() const { return front(); }
342 BasicBlock &getEntryBlock() { return front(); }
363 const BasicBlock &front() const { return BasicBlocks.front(); } function in class:llvm::Function
364 BasicBlock &front() { return BasicBlocks.front(); } function in class:llvm::Function
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/
JSON.h 169 Value &front() { return V.front(); } function in class:llvm::json::Array
170 const Value &front() const { return V.front(); } function in class:llvm::json::Array
  /external/deqp/framework/delibs/decpp/
dePoolArray.hpp 89 const T& front (void) const { return at(0); } function in class:de::PoolArray
90 T& front (void) { return at(0); } function in class:de::PoolArray

Completed in 1881 milliseconds

1 2 34 5 6