| /external/swiftshader/third_party/subzero/src/ |
| IceThreading.h | 48 /// MaxStaticSize, where the queue boundaries are denoted by the Front and Back
49 /// fields. Front==Back indicates an empty queue.
102 /// Lock guards access to WorkItems, Front, Back, and IsEnded.
120 /// Front is the index into WorkItems[] of the oldest element, i.e. the next
121 /// to be popped. (More precisely Front&MaxStaticSize is the index.) It is
123 size_t Front = 0;
134 bool empty() const { return Front == Back; }
135 size_t size() const { return Back - Front; }
142 return std::move(WorkItems[Front++ & MaxStaticSizeMask]);
|
| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/ |
| ring_buffer.h | 13 // or erase() from the front which is inefficient.
62 const T& Front() const { return Get(0); }
64 T& Front() { return Get(0); }
|
| /prebuilts/go/darwin-x86/src/container/list/ |
| example_test.go | 21 for e := l.Front(); e != nil; e = e.Next() {
|
| list_test.go | 99 l.MoveToBack(e3) // move from front
104 e2 = l.InsertBefore(2, e1) // insert before front
114 e2 = l.InsertAfter(2, e1) // insert after front
126 for e := l.Front(); e != nil; e = e.Next() {
137 for e := l.Front(); e != nil; e = next {
150 for e := l.Front(); e != nil; e = e.Next() {
209 e := l.Front()
225 e := l1.Front()
242 e := l.Front()
|
| list.go | 8 // for e := l.Front(); e != nil; e = e.Next() {
20 // element (l.Front()).
68 // Front returns the first element of list l or nil if the list is empty.
69 func (l *List) Front() *Element {
131 // PushFront inserts a new element e with value v at the front of list l and returns e.
165 // MoveToFront moves element e to the front of list l.
211 for i, e := other.Len(), other.Front(); i > 0; i, e = i-1, e.Next() {
216 // PushFrontList inserts a copy of an other list at the front of list l.
|
| /prebuilts/go/linux-x86/src/container/list/ |
| example_test.go | 21 for e := l.Front(); e != nil; e = e.Next() {
|
| list_test.go | 99 l.MoveToBack(e3) // move from front
104 e2 = l.InsertBefore(2, e1) // insert before front
114 e2 = l.InsertAfter(2, e1) // insert after front
126 for e := l.Front(); e != nil; e = e.Next() {
137 for e := l.Front(); e != nil; e = next {
150 for e := l.Front(); e != nil; e = e.Next() {
209 e := l.Front()
225 e := l1.Front()
242 e := l.Front()
|
| list.go | 8 // for e := l.Front(); e != nil; e = e.Next() {
20 // element (l.Front()).
68 // Front returns the first element of list l or nil if the list is empty.
69 func (l *List) Front() *Element {
131 // PushFront inserts a new element e with value v at the front of list l and returns e.
165 // MoveToFront moves element e to the front of list l.
211 for i, e := other.Len(), other.Front(); i > 0; i, e = i-1, e.Next() {
216 // PushFrontList inserts a copy of an other list at the front of list l.
|
| /external/llvm/lib/Target/ARM/ |
| A15SDOptimizer.cpp | 182 SmallVector<MachineInstr *, 8> Front;
186 Front.push_back(MI);
188 while (Front.size() != 0) {
189 MI = Front.back();
190 Front.pop_back();
367 SmallVector<MachineInstr *, 8> Front;
368 Front.push_back(MI);
369 while (Front.size() != 0) {
370 MI = Front.back();
371 Front.pop_back()
[all...] |
| /external/lzma/CPP/7zip/UI/Common/ |
| SetProperties.cpp | 71 RINOK(setProperties->SetProperties(&names.Front(), values, names.Size()));
|
| /device/linaro/bootloader/edk2/Nt32Pkg/WinNtGopDxe/ |
| WinNtGopInput.c | 50 Queue->Front = 0;
70 Queue->Front = 0;
96 if ((Queue->Rear + 1) % MAX_Q == Queue->Front) {
128 if (Queue->Front == Queue->Rear) {
133 CopyMem (Key, &Queue->Q[Queue->Front], sizeof (EFI_KEY_DATA));
134 Queue->Front = (Queue->Front + 1) % MAX_Q;
165 if (Queue->Front == Queue->Rear) {
659 if (Private->QueueForRead.Q[Private->QueueForRead.Front].Key.ScanCode == SCAN_NULL &&
660 Private->QueueForRead.Q[Private->QueueForRead.Front].Key.UnicodeChar == CHAR_NULL) {
[all...] |
| WinNtGop.h | 65 UINTN Front;
|
| /external/lzma/CPP/Common/ |
| MyVector.h | 231 const T& Front() const { return _items[0]; }
232 T& Front() { return _items[0]; }
348 T* p = (&Front()) - 1;
388 T* p = (&Front()) - 1;
454 const T& Front() const { return operator[](0); }
455 T& Front() { return operator[](0); }
|
| Wildcard.cpp | 185 return ForFile && ForDir && WildcardMatching && PathParts.Size() == 1 && PathParts.Front() == L"*";
260 return IncludeItems.Front().AreAllAllowed();
285 if (!DoesNameContainWildcard(item.PathParts.Front()))
291 const UString &front = item.PathParts.Front();
local
296 && DoesNameContainWildcard(front))
301 int index = FindSubNode(front);
303 index = SubNodes.Add(CCensorNode(front, this));
360 int index = FindSubNode(pathParts.Front());
593 const UString &front = pathParts.Front(); local
[all...] |
| Wildcard.h | 128 { return (Pairs.Size() == 1 && Pairs.Front().Prefix.IsEmpty()); }
|
| /external/webrtc/webrtc/modules/video_coding/ |
| jitter_buffer.cc | 68 VCMFrameBuffer* FrameList::Front() const {
98 VCMFrameBuffer* oldest_frame = Front();
464 if (decodable_frames_.Front()->GetState() == kStateComplete) {
486 decodable_frames_.Front()->GetState() != kStateComplete) {
504 decodable_frames_.Front()->GetState() != kStateComplete) {
515 decodable_frames_.Front()->GetState() != kStateComplete) {
519 *timestamp = decodable_frames_.Front()->TimeStamp();
541 oldest_frame = incomplete_frames_.Front();
547 oldest_frame = decodable_frames_.Front();
976 uint32_t start_timestamp = incomplete_frames_.Front()->TimeStamp()
[all...] |
| /device/linaro/bootloader/OpenPlatformPkg/Drivers/Keyboard/VirtualKeyboardDxe/ |
| VirtualKeyboard.c | 129 VirtualKeyboardPrivate->Queue.Front = 0;
131 VirtualKeyboardPrivate->QueueForNotify.Front = 0;
320 if ((Queue->Rear + 1) % QUEUE_MAX_COUNT == Queue->Front) {
346 if (Queue->Front == Queue->Rear) {
350 CopyMem (KeyData, &Queue->Buffer[Queue->Front], sizeof (EFI_KEY_DATA));
351 Queue->Front = (Queue->Front + 1) % QUEUE_MAX_COUNT;
370 if (Queue->Front == Queue->Rear) {
[all...] |
| VirtualKeyboard.h | 73 UINTN Front;
|
| /external/lzma/CPP/Windows/Control/ |
| PropertyPage.cpp | 122 sheet.ppsp = &pagesA.Front();
137 sheet.ppsp = &pagesW.Front();
|
| /external/webrtc/talk/app/webrtc/ |
| datachannel.cc | 93 DataBuffer* DataChannel::PacketQueue::Front() {
94 return packets_.front();
102 byte_count_ -= packets_.front()->size();
113 delete packets_.front();
514 rtc::scoped_ptr<DataBuffer> buffer(queued_received_data_.Front());
529 DataBuffer* buffer = queued_send_data_.Front();
609 rtc::scoped_ptr<DataBuffer> buf(control_packets.Front());
|
| /frameworks/native/libs/vr/libvrflinger/ |
| display_surface.cpp | 399 AcquiredBuffer buffer = std::move(acquired_buffers_.Front());
418 acquired_buffers_.Front().IsAvailable()) {
424 buffer = std::move(acquired_buffers_.Front());
440 acquired_buffers_.Front().IsAvailable();
|
| /external/lzma/CPP/7zip/Archive/Common/ |
| CoderMixer2.cpp | 707 const UInt64 * const *isSizes2 = EncodeMode ? &mainCoder.UnpackSizePointer : &mainCoder.PackSizePointers.Front();
708 const UInt64 * const *outSizes2 = EncodeMode ? &mainCoder.PackSizePointers.Front() : &mainCoder.UnpackSizePointer;
721 &seqInStreamsSpec.Front(), isSizes2, numInStreams,
722 &seqOutStreamsSpec.Front(), outSizes2, numOutStreams,
838 &InStreamPointers.Front(), EncodeMode ? &UnpackSizePointer : &PackSizePointers.Front(), numInStreams,
839 &OutStreamPointers.Front(), EncodeMode ? &PackSizePointers.Front(): &UnpackSizePointer, numOutStreams,
|
| /external/lzma/CPP/7zip/Bundles/SFXCon/ |
| SfxCon.cpp | 279 UString arcPath = commandStrings.Front();
373 wildcardCensor.Pairs.Front().Head;
|
| /device/linaro/bootloader/edk2/EmulatorPkg/EmuGopDxe/ |
| Gop.h | 42 UINTN Front;
|
| /external/llvm/lib/DebugInfo/Symbolize/ |
| Symbolize.cpp | 435 char Front = SymbolName.empty() ? '\0' : SymbolName[0];
436 if (Front == '_' || Front == '@')
440 if (Front != '?') {
479 if (!Name.empty() && Name.front() == '?') {
|
