| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_segmented_array.h | 167 Segment *Tail;
265 DCHECK_EQ(Tail, &SentinelSegment);
273 Tail = S;
274 DCHECK_EQ(Head, Tail);
275 DCHECK_EQ(Tail->Next, &SentinelSegment);
276 DCHECK_EQ(Tail->Prev, &SentinelSegment);
284 DCHECK_NE(Tail, &SentinelSegment);
285 DCHECK_EQ(Tail->Next, &SentinelSegment);
288 S->Prev = Tail;
289 Tail->Next = S
[all...] |
| /src/external/apache2/mDNSResponder/dist/mDNSShared/ |
| GenLinkedList.c | 33 pList->Tail = NULL;
39 /* Add a linked list element to the tail of the list. */
41 if ( pList->Tail) {
42 ASSIGNLINK( pList->Tail, elem, pList->LinkOffset);
47 pList->Tail = elem;
55 if ( pList->Tail == NULL)
56 pList->Tail = elem;
75 if ( pList->Tail == elem)
76 pList->Tail = lastElem ? lastElem : NULL;
108 if ( pList->Tail == elemInList
[all...] |
| GenLinkedList.h | 28 *Tail;
48 *Tail;
70 Tail;
|
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| Encoding.h | 64 StringRef Tail = Text;
66 StringRef::size_type TabPos = Tail.find('\t');
68 return TotalWidth + columnWidth(Tail, Encoding);
69 TotalWidth += columnWidth(Tail.substr(0, TabPos), Encoding);
72 Tail = Tail.substr(TabPos + 1);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/ |
| RISCVMergeBaseOffset.cpp | 46 void foldOffset(MachineInstr &HiLUI, MachineInstr &LoADDI, MachineInstr &Tail,
100 // Delete the tail instruction and update all the uses to use the
104 MachineInstr &Tail, int64_t Offset) {
108 // Delete the tail instruction.
109 DeadInstrs.insert(&Tail);
110 MRI->replaceRegWith(Tail.getOperand(0).getReg(),
184 MachineInstr &Tail = *MRI->use_begin(DestReg)->getParent();
185 switch (Tail.getOpcode()) {
188 << Tail);
192 int64_t Offset = Tail.getOperand(2).getImm()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| EarlyIfConversion.cpp | 77 // Tail Tail
80 // Head block, and phis in the Tail block are converted to select instructions.
93 MachineBasicBlock *Tail;
102 /// equal to Tail.
103 bool isTriangle() const { return TBB == Tail || FBB == Tail; }
105 /// Returns the Tail predecessor for the True side.
106 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; }
108 /// Returns the Tail predecessor for the False side
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Registry.h | 56 static node *Head, *Tail;
131 /// This provides template definitions of add_node, begin, and the Head and Tail
140 template<typename T> typename Registry<T>::node *Registry<T>::Tail = nullptr;\
143 if (Tail) \
144 Tail->Next = N; \
147 Tail = N; \
153 template REGISTRY_CLASS::node *Registry<REGISTRY_CLASS::type>::Tail; \
|
| Automaton.h | 66 /// A simple linked-list of traversed states that can have a shared tail. The
71 PathSegment *Tail;
85 PathSegment *makePathSegment(uint64_t State, PathSegment *Tail) {
87 *P = {State, Tail};
147 Head = Head->Tail;
|
| YAMLTraits.h | 555 StringRef Tail = (S.front() == '-' || S.front() == '+') ? S.drop_front() : S;
559 if (Tail.equals(".inf") || Tail.equals(".Inf") || Tail.equals(".INF"))
564 // [-+], so S should be used instead of Tail.
574 S = Tail;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| ImmutableList.h | 31 const ImmutableListImpl* Tail;
34 ImmutableListImpl(ElemT &&head, const ImmutableListImpl *tail = nullptr)
35 : Head(std::forward<ElemT>(head)), Tail(tail) {}
42 const ImmutableListImpl* getTail() const { return Tail; }
51 Profile(ID, Head, Tail);
137 /// getTail - Returns the tail of the list, which is another (possibly empty)
176 LLVM_NODISCARD ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail) {
181 const ListTy* TailImpl = Tail.getInternalPointer();
204 LLVM_NODISCARD ImmutableList<T> emplace(ImmutableList<T> Tail,
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| MustExecute.h | 286 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {}
290 CurInst(Other.CurInst), Head(Other.Head), Tail(Other.Tail) {}
297 std::swap(Tail, Other.Tail);
321 return CurInst == Other.CurInst && Head == Other.Head && Tail == Other.Tail;
352 /// Try to advance one of the underlying positions (Head or Tail).
372 /// one pointed to by Head, Tail, or both
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| CallingConv.h | 78 /// Tail - This calling convention attemps to make calls as fast as
79 /// possible while guaranteeing that tail call optimization can always
81 Tail = 18,
90 /// are passed but guarantees tail calls will be made by making the callee
178 /// HHVM calling convention supports tail/sibling call elimination.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64ConditionalCompares.cpp | 88 // | / | Tail |
90 // Tail | | |
95 // contains compare + br.cond. Tail must be a successor of both.
111 // b.eq Tail
114 // b.eq Tail
116 // Tail:
124 // b.eq Tail
126 // Tail:
133 // between Head and Tail, just like if-converting a diamond.
135 // FIXME: Handle PHIs in Tail by turning them into selects (if-conversion)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclContextInternals.h | 198 DeclListNode::Decls *Tail = &Head;
199 while (DeclListNode *Node = Tail->dyn_cast<DeclListNode *>())
200 Tail = &Node->Rest;
203 DeclListNode *Node = C.AllocateDeclListNode(Tail->get<NamedDecl *>());
205 *Tail = Node;
|
| /src/external/gpl3/gcc/dist/libgcc/config/rs6000/ |
| sol-cn.S | 57 # Tail of _init used for static constructors
65 # Tail of _fini used for static destructors
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/rs6000/ |
| sol-cn.S | 57 # Tail of _init used for static constructors
65 # Tail of _fini used for static destructors
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| Thumb2InstrInfo.h | 35 void ReplaceTailWithBranchTo(MachineBasicBlock::iterator Tail,
|
| Thumb2InstrInfo.cpp | 62 Thumb2InstrInfo::ReplaceTailWithBranchTo(MachineBasicBlock::iterator Tail,
64 MachineBasicBlock *MBB = Tail->getParent();
66 if (!AFI->hasITBlocks() || Tail->isBranch()) {
67 TargetInstrInfo::ReplaceTailWithBranchTo(Tail, NewDest);
71 // If the first instruction of Tail is predicated, we may have to update
74 ARMCC::CondCodes CC = getInstrPredicate(*Tail, PredReg);
75 MachineBasicBlock::iterator MBBI = Tail;
80 // Actually replace the tail.
81 TargetInstrInfo::ReplaceTailWithBranchTo(Tail, NewDest);
|
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGRecordLayoutBuilder.cpp | 58 /// code to access fields. Bitfields in tail position with tail padding may
60 /// that the tail padding is not used in the complete class.) However,
62 /// if we do not clip the tail padding off of the bitfield in the complete
197 /// Lowers bitfield storage types to I8 arrays for bitfields with tail
265 // 3) Clip bitfield storages members if their tail padding is or might be
275 // order to understand if explicit tail padding is needed.
401 // Tail is the offset of the first bit off the end of the current run. It's
404 uint64_t StartBitOffset, Tail = 0;
417 if (Run == FieldEnd || BitOffset >= Tail) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 1356 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator());
1358 SmallPtrSet<BasicBlock *, 8> UniqueSuccessorsOfHead(succ_begin(Tail),
1359 succ_end(Tail));
1360 Updates.push_back({DominatorTree::Insert, Head, Tail});
1363 Updates.push_back({DominatorTree::Insert, Tail, UniqueSuccessorOfHead});
1372 ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail);
1376 CheckTerm = BranchInst::Create(Tail, ThenBlock);
1378 Updates.push_back({DominatorTree::Insert, ThenBlock, Tail});
1384 BranchInst::Create(/*ifTrue*/ ThenBlock, /*ifFalse*/ Tail, Cond);
1396 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| MustExecute.cpp | 816 Head = Tail = nullptr;
822 Tail = I;
832 Tail = Explorer.getMustBeExecutedPrevInstruction(*this, Tail);
833 if (Tail && Visited.insert({Tail, ExplorationDirection ::BACKWARD}).second)
834 return Tail;
835 Tail = nullptr;
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/X86/ |
| X86Counter.cpp | 54 static void copyDataBuffer(void *MMappedBuffer, char *Buf, uint64_t Tail,
60 uint64_t Offset = Tail % kDataBufferSize;
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/sys/windows/ |
| mswsock.d | 83 PVOID Tail;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyLowerEmscriptenEHSjLj.cpp | 996 // The tail is everything right after the call, and will be reached once
998 BasicBlock *Tail = SplitBlock(BB, CI->getNextNode());
999 // Add a phi to the tail, which will be the output of setjmp, which
1002 IRB.SetInsertPoint(Tail->getFirstNonPHI());
1057 BasicBlock *Tail;
1090 Tail = SplitBlock(BB, ThrewResetSI->getNextNode());
1096 Tail = SplitBlock(BB, CI->getNextNode());
1099 // We need to replace the terminator in Tail - SplitBlock makes BB go
1100 // straight to Tail, we need to check if a longjmp occurred, and go to the
1101 // right setjmp-tail if s
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-type-util.h | 118 // Head for the first type in the list, and Tail for the rest of the
129 typedef Types0 Tail;
134 typedef Types1<T2> Tail;
140 typedef Types2<T2, T3> Tail;
146 typedef Types3<T2, T3, T4> Tail;
152 typedef Types4<T2, T3, T4, T5> Tail;
159 typedef Types5<T2, T3, T4, T5, T6> Tail;
166 typedef Types6<T2, T3, T4, T5, T6, T7> Tail;
173 typedef Types7<T2, T3, T4, T5, T6, T7, T8> Tail;
180 typedef Types8<T2, T3, T4, T5, T6, T7, T8, T9> Tail;
[all...] |
