/freebsd-11.0-release/contrib/llvm/lib/MC/ |
H A D | MCLinkerOptimizationHint.cpp | 30 for (LOHArgs::const_iterator It = Args.begin(), EndIt = Args.end(); 31 It != EndIt; ++It) 32 encodeULEB128(ObjWriter.getSymbolAddress(**It, Layout), OutStream);
|
/freebsd-11.0-release/contrib/dialog/samples/ |
H A D | editbox | 12 Hi, this is an edit box. It can be used to edit text from a file. 14 It's like a simple text editor, with these keys implemented: 33 It supports the mouse - but only for positioning in the editbox,
|
H A D | editbox2 | 10 Hi, this is an edit box. It can be used to edit text from a file. 12 It's like a simple text editor, with these keys implemented: 31 It supports the mouse - but only for positioning in the editbox,
|
H A D | editbox4 | 12 Hi, this is an edit box. It can be used to edit text from a file. 14 It's like a simple text editor, with these keys implemented: 33 It supports the mouse - but only for positioning in the editbox,
|
H A D | checklist12 | 18 Apple:It's an apple.:off
|
H A D | textbox | 9 Hi, this is a text dialog box. It can be used to display text from a file. 13 It's like a simple text file viewer, with these keys implemented:
|
H A D | textbox2 | 9 Hi, this is a text dialog box. It can be used to display text from a file. 13 It's like a simple text file viewer, with these keys implemented:
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | DeclLookups.h | 27 StoredDeclsMap::iterator It, End; member in class:clang::DeclContext::all_lookups_iterator 36 all_lookups_iterator(StoredDeclsMap::iterator It, argument 38 : It(It), End(End) {} 40 DeclarationName getLookupName() const { return It->first; } 42 reference operator*() const { return It->second.getLookupResult(); } 43 pointer operator->() const { return It->second.getLookupResult(); } 50 ++It; 51 } while (It != End && 52 It [all...] |
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | R600OptimizeVectorRegisters.cpp | 51 for (MachineRegisterInfo::def_instr_iterator It = MRI.def_instr_begin(Reg), 52 E = MRI.def_instr_end(); It != E; ++It) { 53 return (*It).isImplicitDef(); 149 for (DenseMap<unsigned, unsigned>::iterator It = ToMerge->RegToChan.begin(), 150 E = ToMerge->RegToChan.end(); It != E; ++It) { 152 Untouched->RegToChan.find((*It).first); 155 ((*It).second, (*PosInUntouched).second)); 161 ((*It) [all...] |
H A D | AMDILCFGStructurizer.cpp | 221 int countActiveBlock(MBBVector::const_iterator It, 357 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 358 if (It == BlockInfoMap.end()) 360 return (*It).second->SccNum; 365 LoopLandInfoMap::const_iterator It = LLInfoMap.find(LoopRep); local 366 if (It == LLInfoMap.end()) 368 return (*It).second; 384 MBBInfoMap::const_iterator It = BlockInfoMap.find(MBB); local 385 if (It == BlockInfoMap.end()) 387 return (*It) 420 countActiveBlock(MBBVector::const_iterator It, MBBVector::const_iterator E) const argument 592 MachineBasicBlock::succ_iterator It = MBB->succ_begin(); local 634 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 658 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 668 MachineBasicBlock::reverse_iterator It = MBB->rbegin(); local 726 MachineBasicBlock::iterator It = Pre; local 818 SmallVectorImpl<MachineBasicBlock *>::const_iterator It = local 951 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); local 1153 GTIM::ChildIteratorType It = GTIM::child_begin(LoopHeader), local 1863 std::set<MachineBasicBlock *>::const_iterator It = MBBs.begin(); local [all...] |
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/ |
H A D | assoc_container.hpp | 39 // purpose. It is provided "as is" without express or implied 217 template<typename It> 218 cc_hash_table(It first, It last) 224 template<typename It> 225 cc_hash_table(It first, It last, const hash_fn& h) 235 template<typename It> 236 cc_hash_table(It first, It las [all...] |
H A D | priority_queue.hpp | 39 // purpose. It is provided "as is" without express or implied 95 template<typename It> 96 priority_queue(It first_it, It last_it) 103 template<typename It> 104 priority_queue(It first_it, It last_it, const cmp_fn& r_cmp_fn)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 48 template<typename It> 51 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | constructor_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 65 template<typename It> 68 copy_from_range(It first_it, It last_it) 80 template<typename It> 82 PB_DS_CLASS_NAME(It first_it, It last_it) : m_p_l(NULL)
|
/freebsd-11.0-release/contrib/llvm/lib/Target/X86/ |
H A D | X86CallingConv.h | 91 for (auto &It : PendingMembers) { 93 It.convertToReg(State.AllocateReg(RegList[FirstFree++])); 95 It.convertToMem(State.AllocateStack(4, 4)); 96 State.addLoc(It);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | BlotMapVector.h | 74 typename MapTy::iterator It = Map.find(Key); local 75 if (It == Map.end()) 77 return Vector.begin() + It->second; 81 typename MapTy::const_iterator It = Map.find(Key); local 82 if (It == Map.end()) 84 return Vector.begin() + It->second; 91 typename MapTy::iterator It = Map.find(Key); local 92 if (It == Map.end()) 94 Vector[It->second].first = KeyT(); 95 Map.erase(It); [all...] |
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 106 template<typename It> 109 copy_from_range(It first_it, It last_it) 135 template<typename It> 138 copy_from_ordered_range(It first_it, It last_it) 146 It source_it = first_it; 147 It source_end_it = last_it; 177 template<typename It> [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | SetVector.h | 56 template<typename It> 57 SetVector(It Start, It End) { 135 template<typename It> 136 void insert(It Start, It End) { 246 template<typename It> 247 SmallSetVector(It Start, It End) {
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | CFG.h | 35 USE_iterator It; member in class:llvm::PredIterator 39 while (!It.atEnd() && !isa<TerminatorInst>(*It)) 40 ++It; 48 explicit inline PredIterator(Ptr *bb) : It(bb->user_begin()) { 51 inline PredIterator(Ptr *bb, bool) : It(bb->user_end()) {} 53 inline bool operator==(const Self& x) const { return It == x.It; } 57 assert(!It.atEnd() && "pred_iterator out of range!"); 58 return cast<TerminatorInst>(*It) [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 77 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local 78 if (It == WorklistMap.end()) return; // Not in worklist. 81 Worklist[It->second] = nullptr; 83 WorklistMap.erase(It);
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); 49 It != End; ++It) 50 IntervalMap.insert(std::make_pair(*It, I));
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/ |
H A D | Options.h | 112 auto It = Options.find(&detail::OptionKey<ValT, Base, Mem>::ID); local 113 assert(It != Options.end() && "Option not in OptionRegistry"); 114 return *(cl::opt<ValT> *)It->second;
|