/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | ilist_node.h | 28 NodeTy *Prev; member in class:llvm::ilist_half_node 30 NodeTy *getPrev() { return Prev; } 31 const NodeTy *getPrev() const { return Prev; } 32 void setPrev(NodeTy *P) { Prev = P; } 33 ilist_half_node() : Prev(0) {} 59 NodeTy *Prev = this->getPrev(); local 62 if (!Prev->getNext()) 65 return Prev; 70 const NodeTy *Prev = this->getPrev(); local 73 if (!Prev [all...] |
H A D | SparseMultiSet.h | 81 /// circular in Prev indices, and INVALID-terminated in Next indices. This 89 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode 92 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 101 return Prev == INVALID; 104 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 105 /// Prev. 106 bool isValid() const { return Prev != INVALID; } 140 return Dense[D.Prev].isTail(); 148 return &Dense[N.Prev] == &N; 153 unsigned addValue(const ValueT& V, unsigned Prev, unsigne argument 235 unsigned Prev() const { return SMS->Dense[Idx].Prev; } function in class:llvm::SparseMultiSet::iterator_base [all...] |
H A D | ilist.h | 32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize 62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); } argument 502 NodeTy *First = &*first, *Prev = this->getPrev(First); local 504 if (Prev) 505 this->setNext(Prev, Next); 508 this->setPrev(Next, Prev);
|
/freebsd-9.3-release/contrib/llvm/include/llvm/Support/ |
H A D | UnicodeCharRanges.h | 66 uint32_t Prev = 0; local 69 if (I != Ranges.begin() && Prev >= I->Lower) { 71 DEBUG(llvm::dbgs().write_hex(Prev)); 83 Prev = I->Upper;
|
H A D | Registry.h | 139 listener *Prev, *Next; member in class:llvm::Registry::listener 156 listener() : Prev(ListenerTail), Next(0) { 157 if (Prev) 158 Prev->Next = this; 166 Next->Prev = Prev; 168 ListenerTail = Prev; 169 if (Prev) 170 Prev->Next = Next;
|
H A D | Recycler.h | 36 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct 42 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; } 44 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
H A D | Timer.h | 86 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer 166 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
|
/freebsd-9.3-release/sys/contrib/dev/acpica/disassembler/ |
H A D | dmnames.c | 295 ACPI_PARSE_OBJECT *Prev; local 333 Prev = NULL; /* Start with Root Node */ 335 while (Prev != Op) 342 if (Search->Common.Parent == Prev) 352 if (Prev) 392 Prev = Search;
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineRegisterInfo.cpp | 187 // Prev pointers are circular, so Head->Prev == Last. 191 MO->Contents.Reg.Prev = MO; 198 // Insert MO between Last and Head in the circular Prev chain. 199 MachineOperand *Last = Head->Contents.Reg.Prev; 202 Head->Contents.Reg.Prev = MO; 203 MO->Contents.Reg.Prev = Last; 227 MachineOperand *Prev = MO->Contents.Reg.Prev; local 229 // Prev link 268 MachineOperand *Prev = Src->Contents.Reg.Prev; local [all...] |
/freebsd-9.3-release/contrib/llvm/tools/lli/ |
H A D | RemoteTarget.cpp | 56 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : NULL; local 57 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
/freebsd-9.3-release/sys/contrib/dev/acpica/executer/ |
H A D | exmutex.c | 91 (ObjDesc->Mutex.Next)->Mutex.Prev = ObjDesc->Mutex.Prev; 94 if (ObjDesc->Mutex.Prev) 96 (ObjDesc->Mutex.Prev)->Mutex.Next = ObjDesc->Mutex.Next; 104 (ObjDesc->Mutex.Prev)->Mutex.OriginalSyncLevel = 139 ObjDesc->Mutex.Prev = NULL; 146 ListHead->Mutex.Prev = ObjDesc; 528 ObjDesc->Mutex.Prev = NULL;
|
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | Timer.cpp | 259 TimerGroupList->Prev = &Next; 261 Prev = &TimerGroupList; 273 *Prev = Next; 275 Next->Prev = Prev; 289 *T.Prev = T.Next; 291 T.Next->Prev = T.Prev; 308 FirstTimer->Prev = &T.Next; 310 T.Prev [all...] |
/freebsd-9.3-release/contrib/llvm/lib/Option/ |
H A D | Option.cpp | 143 const char *Prev = Str; local 148 if (Prev != Str) { 149 char *Value = new char[Str - Prev + 1]; 150 memcpy(Value, Prev, Str - Prev); 151 Value[Str - Prev] = '\0'; 158 Prev = Str + 1;
|
H A D | OptTable.cpp | 198 unsigned Prev = Index; local 242 if (Prev != Index) 274 unsigned Prev = Index; local 276 assert(Index > Prev && "Parser failed to consume argument."); 281 assert(Index - Prev - 1 && "No missing arguments!"); 282 MissingArgIndex = Prev; 283 MissingArgCount = Index - Prev - 1;
|
/freebsd-9.3-release/sys/contrib/dev/acpica/parser/ |
H A D | psparse.c | 148 ACPI_PARSE_OBJECT *Prev; local 177 Prev = Op->Common.Parent->Common.Value.Arg; 178 if (!Prev) 260 if (Prev == Op) 280 else while (Prev) 284 Next = Prev->Common.Next; 292 Prev->Common.Next = ReplacementOp; 298 Prev->Common.Next = Op->Common.Next; 302 Prev = Next;
|
H A D | psargs.c | 649 ACPI_PARSE_OBJECT *Prev = NULL; local 700 if (Prev) 702 Prev->Common.Next = Field; 708 Prev = Field;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/IR/ |
H A D | Use.h | 17 // operands, and the low bits of one of the fields (Prev) of the Use 85 Prev.setInt(tag); 130 PointerIntPair<Use**, 2, PrevPtrTag> Prev; member in class:llvm::Use 133 Prev.setPointer(NewPrev); 142 Use **StrippedPrev = Prev.getPointer();
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | Use.cpp | 56 unsigned Tag = (Current++)->Prev.getInt(); 66 unsigned Tag = Current->Prev.getInt();
|
/freebsd-9.3-release/sys/contrib/dev/acpica/compiler/ |
H A D | aslerror.c | 97 ASL_ERROR_MSG *Prev; local 112 Prev = NULL; 118 Prev = Next; 126 if (Prev) 128 Prev->Next = Enode;
|
H A D | dtio.c | 201 DT_FIELD *Prev; local 205 Prev = Next = Gbl_FieldList; 209 Prev = Next; 213 if (Prev) 215 Prev->Next = Field;
|
/freebsd-9.3-release/sys/contrib/dev/acpica/namespace/ |
H A D | nseval.c | 316 ACPI_OPERAND_OBJECT *Prev; local 345 Prev = Next; 350 Prev->Method.Mutex = NULL; 351 AcpiNsExecModuleCode (Prev, Info); 356 AcpiUtRemoveReference (Prev);
|
/freebsd-9.3-release/contrib/llvm/lib/ExecutionEngine/JIT/ |
H A D | JITMemoryManager.cpp | 106 FreeRangeHeader *Prev; member in struct:__anon2226::FreeRangeHeader 123 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!"); 124 Next->Prev = Prev; 125 return Prev->Next = Next; 130 Prev = FreeList->Prev; 131 Prev->Next = this; 132 Next->Prev [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | ExternalASTSource.h | 426 iterator Prev(*this); 428 return Prev; 437 iterator Prev(*this); 439 return Prev;
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowSolver.h | 80 static BlockEdge PrevEdge(const CFGBlock *B, const CFGBlock *Prev) { argument 81 return BlockEdge(Prev, B, 0); 103 static BlockEdge PrevEdge(const CFGBlock *B, const CFGBlock *Prev) { argument 104 return BlockEdge(B, Prev, 0);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
H A D | BugReporterVisitor.h | 198 const ExplodedNode *Prev, 203 const ExplodedNode *Prev, 265 const ExplodedNode *Prev, 264 VisitNode(const ExplodedNode *N, const ExplodedNode *Prev, BugReporterContext &BRC, BugReport &BR) argument
|