/external/clang/lib/Tooling/ |
H A D | CompilationDatabase.cpp | 42 It = CompilationDatabasePluginRegistry::begin(), 44 It != Ie; ++It) { 46 std::unique_ptr<CompilationDatabasePlugin> Plugin(It->instantiate()); 50 ErrorStream << It->getName() << ": " << DatabaseErrorMessage << "\n"; 226 // It will then issue warnings via Diagnostics about un-used options that 274 // Remove the -c add above as well. It will be at the end right now.
|
/external/llvm/lib/CodeGen/GlobalISel/ |
H A D | RegBankSelect.cpp | 181 // TODO: It may be possible to actually avoid the copy. 598 MachineBasicBlock::iterator It = MI.getParent()->getFirstNonPHI(); local 599 if (It != MI.getParent()->end()) 600 addInsertPoint(*It, /*Before*/ true); 602 addInsertPoint(*(--It), /*Before*/ false); 610 MachineBasicBlock::iterator It = Pred.getLastNonDebugInstr(); local 611 for (auto Begin = Pred.begin(); It != Begin && It->isTerminator(); --It) 612 if (It 634 MachineBasicBlock::iterator It = MI; local [all...] |
/external/llvm/lib/ExecutionEngine/IntelJITEvents/ |
H A D | IntelJITEventListener.cpp | 151 for (DILineInfoTable::iterator It = Begin; It != End; ++It) { 153 DILineInfoToIntelJITFormat((uintptr_t)Addr, It->first, It->second));
|
/external/llvm/tools/dsymutil/ |
H A D | BinaryHolder.cpp | 27 for (auto It = Fat.begin_objects(), End = Fat.end_objects(); It != End; 28 ++It) { 29 StringRef ObjData = FatData.substr(It->getOffset(), It->getSize());
|
/external/clang/include/clang/Driver/ |
H A D | Compilation.h | 102 auto It = OrderedOffloadingToolchains.find(Action::OFK_Host); local 103 if (It != OrderedOffloadingToolchains.end()) 104 return It->second;
|
/external/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 86 /// Map<const MachineBasicBlock*, Map<Value*, unsigned/*VReg*/>>. It 271 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local 272 if (It == ValueMap.end()) 275 unsigned Reg = It->second;
|
/external/ltp/testcases/realtime/ |
H A D | 00_Descriptions.txt | 62 - Designed to run forever. It must manually be killed so it is 63 not suited to be part of functional validation suite of tests. It is 68 gettimeofday(). It provides the additional capability to produce graphical 85 SCHED_FIFO priority. It is bound to a single processor and its address space 86 is locked as well. It makes successive calls to the gettimeofday() function 113 - Priority inheritance under two different scenarios. It checks whether the 157 - Tests priority ordered wakeup with pthread_cond_*. It creates number of 197 at priority 89. It periodically sleeps for a specified duration (PERIOD). 208 threads that just sleep and NUMWORK threads that spend time on the CPU. It 210 of thread cpu clocks with the process that spend time on the CPU. It the [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | SmallPtrSet.h | 245 template<typename It> 246 SmallPtrSet(It I, It E) : SmallPtrSetImpl(SmallStorage, SmallSizePowTwo) {
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 193 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local 194 if (It == ValueMap.end()) 197 unsigned Reg = It->second;
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_append/ |
H A D | iterator.pass.cpp | 21 template <class S, class It> 23 test(S s, It first, It last, S expected) 31 template <class S, class It> 33 test_exceptions(S s, It first, It last)
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_assign/ |
H A D | iterator.pass.cpp | 22 template <class S, class It> 24 test(S s, It first, It last, S expected) 32 template <class S, class It> 34 test_exceptions(S s, It first, It last)
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_insert/ |
H A D | iter_iter_iter.pass.cpp | 25 template <class S, class It> 27 test(S s, typename S::difference_type pos, It first, It last, S expected) 37 template <class S, class It> 39 test_exceptions(S s, typename S::difference_type pos, It first, It last)
|
/external/ImageMagick/api_examples/ |
H A D | magick_script | 20 It could even be binary, image data or something else!
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/ |
H A D | prettify.js | 25 * XML, CSS, Javascript, and Makefiles. It works passably on Ruby, PHP and Awk 941 * escape. It does not recognize perl's qq() style strings. 942 * It has no special handling for double delimiter escapes as in basic, or 947 * It recognizes C, C++, and shell style comments. 1148 // It's necessary for IE though which seems to lose the preformattedness
|
/external/llvm/lib/Transforms/Utils/ |
H A D | MemorySSA.cpp | 165 RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It, argument 167 : DTN(D), ChildIt(It), IncomingVal(M) {} 182 auto It = PerBlockAccesses.find(BB); local 184 if (It != PerBlockAccesses.end()) { 185 AccessList *Accesses = It->second.get(); 208 auto It = PerBlockAccesses.find(S); local 210 if (It == PerBlockAccesses.end() || !isa<MemoryPhi>(It->second->front())) 212 AccessList *Accesses = It->second.get(); 270 auto It local 279 auto It = PerBlockAccesses.find(BB); local 563 auto It = PerBlockAccesses.find(CurrNode->getBlock()); local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/builderTemplate/publishingFiles/staticDropFiles/ |
H A D | download.php | 42 <p>It is very important to read the following notes in order to run this version
|
/external/libunwind/src/arm/ |
H A D | getcontext.S | 33 @ registers. It must be called in a special way, not as a regular
|
/external/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 26 // It is only safe to use this if all of the intervals are deleted by the caller 168 // interval graph. It walks through the source graph, recursively creating 237 for (typename GT::ChildIteratorType It = GT::child_begin(Node), 238 End = GT::child_end(Node); It != End; ++It) 239 ProcessNode(Int, getSourceGraphNode(OrigContainer, *It));
|
/external/llvm/lib/Target/AMDGPU/ |
H A D | R600EmitClauseMarkers.cpp | 64 for (MachineInstr::mop_iterator It = MI.operands_begin(), 66 It != E; ++It) { 67 MachineOperand &MO = *It;
|
H A D | R600Packetizer.cpp | 11 /// This pass implements instructions packetization for R600. It unsets isLast 143 const DenseMap<unsigned, unsigned>::const_iterator It = PVs.find(Src); local 144 if (It != PVs.end()) 145 MI.getOperand(OperandIdx).setReg(It->second); 315 MachineBasicBlock::iterator It = VLIWPacketizerList::addToPacket(MI); variable 317 endPacket(std::next(It)->getParent(), std::next(It)); 319 return It;
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 26 // It is only safe to use this if all of the intervals are deleted by the caller 159 // interval graph. It walks through the source graph, recursively creating 228 for (typename GT::ChildIteratorType It = GT::child_begin(Node), 229 End = GT::child_end(Node); It != End; ++It) 230 ProcessNode(Int, getSourceGraphNode(OrigContainer, *It));
|
/external/valgrind/exp-bbv/tests/amd64-linux/ |
H A D | fldcw_check.S | 13 # It is encoded as "d9 /5" which means
|
/external/valgrind/exp-bbv/tests/x86/ |
H A D | fldcw_check.S | 13 # It is encoded as "d9 /5" which means
|
/external/clang/lib/Index/ |
H A D | IndexBody.cpp | 59 auto It = StmtStack.end()-2; 60 while (isa<CastExpr>(*It) || isa<ParenExpr>(*It)) { 61 if (auto ICE = dyn_cast<ImplicitCastExpr>(*It)) { 65 if (It == StmtStack.begin()) 67 --It; 69 const Stmt *Parent = *It;
|
/external/clang/lib/Analysis/ |
H A D | ThreadSafetyCommon.cpp | 71 auto It = SMap.find(S); local 72 if (It != SMap.end()) 73 return It->second; 625 auto It = LVarIdxMap.find(VD); local 626 if (It != LVarIdxMap.end()) { 627 assert(CurrentLVarMap[It->second].first == VD); 628 return CurrentLVarMap[It->second].second; 655 auto It = LVarIdxMap.find(VD); local 656 if (It == LVarIdxMap.end()) { 662 CurrentLVarMap.elem(It 883 auto It = B->succ_begin(); local [all...] |