/external/llvm/utils/TableGen/ |
DAGISelMatcherEmitter.cpp | 565 unsigned First = E->getFirstResultSlot(); 567 OS << " #" << First+i; 689 // first argument. 700 OS << ", Result[NextRes+" << i << "].first"; 720 Record *SDNode = Entry.first;
|
/prebuilts/gdb/darwin-x86/lib/python2.7/ctypes/test/ |
test_structures.py | 462 class First(Structure): 467 First._fields_ = [("second", Second)] 470 Second._fields_ = [("first", First)]
|
/prebuilts/gdb/linux-x86/lib/python2.7/ctypes/test/ |
test_structures.py | 462 class First(Structure): 467 First._fields_ = [("second", Second)] 470 Second._fields_ = [("first", First)]
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_structures.py | 462 class First(Structure): 467 First._fields_ = [("second", Second)] 470 Second._fields_ = [("first", First)]
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_structures.py | 462 class First(Structure): 467 First._fields_ = [("second", Second)] 470 Second._fields_ = [("first", First)]
|
/external/clang/lib/AST/ |
APValue.cpp | 496 bool First = true; 502 if (!First) 505 First = false; 509 if (!First) 514 First = false;
|
DeclPrinter.cpp | 1007 unsigned First = true; 1009 if (First) { 1010 First = false; 1230 bool first = true; local [all...] |
ASTDumper.cpp | 106 /// Indicates if we're handling the first child after entering a new depth. 152 // Note that the first level gets no prefix. 782 // Dump earliest decl first. 831 const T *First = D->getFirstDecl(); 832 if (First != D) 833 OS << " first " << First; [all...] |
Expr.cpp | [all...] |
/external/clang/tools/driver/ |
cc1as_main.cpp | 211 bool First = true; 214 it != ie; ++it, First = false) { 216 if (First) 425 // Close Streamer first.
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
btQuickprof.cpp | 389 void CProfileIterator::First(void) 518 profileIterator->First();
|
/external/llvm/lib/CodeGen/ |
MIRPrinter.cpp | 220 printReg(I->first, LiveIn.Register, TRI); 334 auto StackObjectInfo = StackObjectOperandMapping.find(LocalObject.first); 476 bool First = true; 478 if (!First) 480 First = false; 662 if (I.first == TF) { 677 const bool HasDirectFlags = Flags.first; 684 if (const auto *Name = getTargetFlagName(TII, Flags.first)) 698 if ((BitMask & Mask.first) == Mask.first) { [all...] |
StackColoring.cpp | 475 const AllocaInst *From = MFI->getObjectAllocation(SI.first); 714 // This is a simple greedy algorithm for merging allocas. First, sort the 715 // slots, placing the largest slots first. Next, perform an n^2 scan and look 744 LiveInterval *First = &*Intervals[FirstSlot]; 746 assert (!First->empty() && !Second->empty() && "Found an empty range"); 749 if (!First->overlaps(*Second)) { 751 First->MergeSegmentsInAsValue(*Second, First->getValNumInfo(0));
|
/external/llvm/lib/ExecutionEngine/MCJIT/ |
MCJIT.cpp | 77 // of the first (and only) module added in ExecutionEngine constructor 85 std::unique_ptr<Module> First = std::move(Modules[0]); 88 OwnedModules.addModule(std::move(First)); 313 // First, check to see if we already have this symbol. 493 // Handle some common cases first. These cases correspond to common `main' 536 // Handle cases where no arguments are passed first.
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
gdiplustypes.h | 414 INT First; 418 CharacterRange(): First(0), Length(0) {} 419 CharacterRange(INT first, INT length): First(first), Length(length) {} 422 First = rhs.First;
|
/external/clang/lib/Lex/ |
HeaderSearch.cpp | 110 if (HeaderMaps[i].first == FE) 605 bool First = true; 607 const FileEntry *Includer = IncluderAndDir.first; 628 assert(First && "only first includer can have no file"); 636 // reallocation of the underlying vector potentially making the first 657 if (First) 674 First = false; 694 // If the entry has been previously looked up, the first value will be 703 // Otherwise, this is the first query, or the previous query didn't matc [all...] |
/external/clang/lib/Format/ |
Format.cpp | 184 // When reading, read the language first, we need it for getPredefinedStyle. 363 // If the first element has no Language specified, it will be treated as the 719 // Ensures that only the first configuration can skip the Language option. 733 // find the configuration for the specific language first, and the default [all...] |
/external/clang/lib/Serialization/ |
ASTWriterDecl.cpp | 162 /// Add to the record the first declaration from each module file that 246 // We only need to associate the first local declaration of the [all...] |
/external/llvm/include/llvm/ADT/ |
ilist.h | 165 ilist_iterator<NodeTy> /*first*/, 357 /// of the first node in the list always points to the last node in the list, 367 // back to the first node in the list (to preserve assertions about going off 539 // [first, last) into position. 541 void transfer(iterator position, iplist &L2, iterator first, iterator last) { 542 assert(first != last && "Should be checked by callers"); 545 assert(position != first && 549 // Note: we have to be careful about the case when we move the first node 556 // Remove [first, last) from its old position. 557 NodeTy *First = &*first, *Prev = this->getPrev(First) [all...] |
/external/llvm/lib/Analysis/ |
LoopAccessAnalysis.cpp | 382 const auto &First = Check.first->Members, &Second = Check.second->Members; 386 OS.indent(Depth + 2) << "Comparing group (" << Check.first << "):\n"; 387 for (unsigned K = 0; K < First.size(); ++K) 388 OS.indent(Depth + 2) << *Pointers[First[K]].PointerValue << "\n"; 655 // We process the set twice: first we process read-write pointers, last we 719 // the first round (they need to be checked after we have seen all [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAGBuilder.h | 264 First(F), Last(L), SValue(SV), HeaderBB(H), Emitted(E) {} 265 APInt First; 289 : First(F), Range(R), SValue(SV), Reg(Rg), RegVT(RgVT), Emitted(E), 292 APInt First; 311 unsigned First, unsigned Last); 313 /// Build a jump table cluster from Clusters[First..Last]. Returns false if it 315 bool buildJumpTable(CaseClusterVector &Clusters, unsigned First, 331 /// Build a bit test cluster from Clusters[First..Last]. Returns false if it 333 bool buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last, 349 /// Determine the rank by weight of CC in [First,Last]. If CC has more weigh [all...] |
/external/llvm/lib/Target/ARM/ |
ARMLoadStoreOptimizer.cpp | 447 // the first non-updateable instruction (if any). 469 // If storing the base register, it needs to be reset first. 534 /// Return the first register of class \p RegClass that is not in \p Regs. 569 if (R.first == Reg) 636 NewBase = Regs[NumRegs-1].first; 645 LiveRegs.addReg(R.first); 683 // Need to insert a MOV to the new base first. 768 MIB.addReg(R.first, getDefRegState(isDef) | getKillRegState(R.second)); 785 MIB.addReg(Regs[0].first, RegState::Define) 786 .addReg(Regs[1].first, RegState::Define) [all...] |
/external/llvm/lib/Target/SystemZ/ |
SystemZInstrInfo.cpp | 66 // The address in the first (high) instruction is already correct. 72 // Clear the kill flags for the base and index registers in the first 103 // if the first operand is a low GR32 and HighOpcode if the first operand 142 // if the first operand is a low GR32 and HighOpcode if the first operand 308 // Working from the bottom, handle the first conditional branch. [all...] |
/external/pdfium/third_party/lcms2-2.6/src/ |
cmslut.c | [all...] |
/external/clang/include/clang/AST/ |
DeclTemplate.h | 122 /// The first template parameter list in a declaration will have depth 0, 432 /// first instantiated. 462 /// \brief Retrieve the first point of instantiation of this function 471 /// \brief Set the (first) point of instantiation of this function template 499 // The point at which this member was first instantiated. 531 /// \brief Retrieve the first point of instantiation of this member. 538 /// \brief Set the first point of instantiation. 858 /// The first value in the array is the number of of specializations [all...] |