| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| Reg2Mem.cpp | 75 WorkList.push_front(&I);
87 WorkList.push_front(&Phi);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_list_test.cc | 86 l.push_front(x);
94 l.push_front(x);
95 l.push_front(y);
96 l.push_front(z);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| trie-node.h | 57 NodeStore.push_front(TrieNode<T>{
|
| xray-converter.cpp | 223 NodeStore.push_front({FuncId, Parent, {}, {(*id_counter)++, {}}});
230 NodeStore.push_front({FuncId, Parent, {}, {stack_id, std::move(siblings)}});
|
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| owning_intrusive_list.h | 75 void push_front (unique_pointer elem) noexcept
76 { this->base::push_front (*elem.release ()); }
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| owning_intrusive_list.h | 75 void push_front (unique_pointer elem) noexcept
76 { this->base::push_front (*elem.release ()); }
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| queue.h | 45 * atomic access. push_front() and pop_front() must not be called
83 push_front(const _Tp& __t) function in class:__gnu_parallel::_RestrictedBoundedConcurrentQueue
|
| balanced_quicksort.h | 342 __tl._M_leftover_parts.push_front
353 __tl._M_leftover_parts.push_front(std::make_pair
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| queue.h | 45 * atomic access. push_front() and pop_front() must not be called
83 push_front(const _Tp& __t) function in class:__gnu_parallel::_RestrictedBoundedConcurrentQueue
|
| balanced_quicksort.h | 342 __tl._M_leftover_parts.push_front
353 __tl._M_leftover_parts.push_front(std::make_pair
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_list.h | 22 // Intrusive singly-linked list with size(), push_back(), push_front()
53 void push_front(Item *x) { function in struct:__sanitizer::IntrusiveList
|
| sanitizer_allocator_primary32.h | 180 sci->free_list.push_front(b);
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_list.h | 21 // Intrusive singly-linked list with size(), push_back(), push_front()
52 void push_front(Item *x) { function in struct:__sanitizer::IntrusiveList
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_list.h | 21 // Intrusive singly-linked list with size(), push_back(), push_front()
52 void push_front(Item *x) { function in struct:__sanitizer::IntrusiveList
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| AllocatorList.h | 210 void push_front(T &&V) { insert(begin(), std::move(V)); } function in class:llvm::AllocatorList
212 void push_front(const T &V) { insert(begin(), V); } function in class:llvm::AllocatorList
|
| simple_ilist.h | 34 /// The API for adding nodes include \a push_front(), \a push_back(), and \a
144 void push_front(reference Node) { insert(begin(), Node); } function in class:llvm::simple_ilist
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 125 RQ.push_front(Cand);
220 RQ.push_front(*new (Alloc.Allocate()) Candidate(SuccSU, Priority));
|
| GCNHazardRecognizer.cpp | 252 EmittedInstrs.push_front(nullptr);
254 EmittedInstrs.push_front(CurrCycleInstr);
337 EmittedInstrs.push_front(nullptr);
344 EmittedInstrs.push_front(nullptr);
364 EmittedInstrs.push_front(CurrCycleInstr);
371 EmittedInstrs.push_front(nullptr);
|
| GCNILPSched.cpp | 285 PendingQueue.push_front(*new (Alloc.Allocate()) Candidate(PredSU));
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | 875 C.getActivePath().push_front(generateDiagForGotoOP(C, S, Start));
880 C.getActivePath().push_front(generateDiagForSwitchOP(C, Dst, Start));
889 C.getActivePath().push_front(
911 C.getActivePath().push_front(
921 C.getActivePath().push_front(generateDiagForBinaryOP(C, T, Src, Dst));
936 C.getActivePath().push_front(
945 C.getActivePath().push_front(
962 C.getActivePath().push_front(
970 C.getActivePath().push_front(
984 C.getActivePath().push_front(
[all...] |
| WorkList.cpp | 102 Queue.push_front(U);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| DIE.h | 543 void push_front(Node &N) { function in struct:llvm::IntrusiveBackListBase
561 void push_front(T &N) { IntrusiveBackListBase::push_front(N); } function in class:llvm::IntrusiveBackList
856 Children.push_front(*Child);
|
| /src/external/gpl3/gdb.old/dist/gdb/unittests/ |
| intrusive_list-selftests.c | 428 list.push_front (a);
432 list.push_front (b);
436 list.push_front (c);
1123 list.push_front (std::make_unique<item_type> ("a"));
1129 list.push_front (std::make_unique<item_type> ("b"));
1135 list.push_front (std::make_unique<item_type> ("c"));
|
| /src/external/gpl3/gdb/dist/gdb/unittests/ |
| intrusive_list-selftests.c | 428 list.push_front (a);
432 list.push_front (b);
436 list.push_front (c);
1123 list.push_front (std::make_unique<item_type> ("a"));
1129 list.push_front (std::make_unique<item_type> ("b"));
1135 list.push_front (std::make_unique<item_type> ("c"));
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| LoopPass.cpp | 82 LQ.push_front(&L);
|
