/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_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/include/llvm/IR/ |
H A D | GetElementPtrTypeIterator.h | 36 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { argument 39 I.OpIt = It; 43 ItTy It) { 48 I.OpIt = It; 51 static generic_gep_type_iterator end(ItTy It) { argument 53 I.OpIt = It; 77 // This is a non-standard operator->. It allows you to call methods on the 42 begin(Type *Ty, unsigned AddrSpace, ItTy It) argument
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64CallingConvention.h | 52 for (auto &It : PendingMembers) { 53 It.convertToMem(State.AllocateStack(Size, std::max(Align, SlotAlign))); 54 State.addLoc(It); 117 for (auto &It : PendingMembers) { 118 It.convertToReg(RegResult); 119 State.addLoc(It);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/ |
H A D | ARMCallingConv.h | 236 for (SmallVectorImpl<CCValAssign>::iterator It = PendingMembers.begin(); 237 It != PendingMembers.end(); ++It) { 238 It->convertToReg(RegResult); 239 State.addLoc(*It); 252 for (auto &It : PendingMembers) { 254 It.convertToMem(State.AllocateStack(Size, Size)); 256 It.convertToReg(State.AllocateReg(RegList[RegIdx++])); 258 State.addLoc(It); 269 for (auto &It [all...] |
H A D | ARMMachineFunctionInfo.h | 43 /// we need to insert gap before parameter start address. It allows to 224 auto It = CoalescedWeights.find(MBB); local 225 if (It == CoalescedWeights.end()) { 226 It = CoalescedWeights.insert(std::make_pair(MBB, 0)).first; 228 return It;
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | erase_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 130 template<typename It> 131 It 133 erase_imp(It it) 185 return It(ret_it);
|
H A D | ov_tree_map_.hpp | 39 // purpose. It is provided "as is" without express or implied 220 template<typename It> 222 copy_from_range(It, It); 399 template<typename It> 401 copy_from_ordered_range(It, It); 406 template<typename It> 408 copy_from_ordered_range(It, It, I [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 146 It = Children.begin(), E = Children.end(); 147 It != E; ++It) { 148 if (It == Except) 150 It->getValue().getAll(Results, Children.end());
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | R600MachineScheduler.cpp | 163 for (MachineInstr::mop_iterator It = SU->getInstr()->operands_begin(), 164 E = SU->getInstr()->operands_end(); It != E; ++It) { 165 MachineOperand &MO = *It; 323 for (std::vector<SUnit *>::reverse_iterator It = Q.rbegin(), E = Q.rend(); 324 It != E; ++It) { 325 SUnit *SU = *It; 331 Q.erase((It + 1).base()); 367 for (MachineInstr::mop_iterator It [all...] |
H A D | R600EmitClauseMarkers.cpp | 65 for (MachineInstr::mop_iterator It = MI->operands_begin(), 66 E = MI->operands_end(); It != E; ++It) { 67 MachineOperand &MO = *It;
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 60 template<typename It> 63 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | pairing_heap_.hpp | 39 // purpose. It is provided "as is" without express or implied 182 template<typename It> 184 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 | lu_map_.hpp | 39 // purpose. It is provided "as is" without express or implied 207 template<typename It> 208 PB_DS_CLASS_NAME(It first_it, It last_it); 287 template<typename It> 289 copy_from_range(It, It);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | InstrProfiling.cpp | 11 // It also builds the data structures and initialization code needed for 193 auto It = ProfileDataMap.find(Name); local 194 if (It == ProfileDataMap.end()) { 198 } else if (It->second.NumValueSites[ValueKind] <= Index) 199 It->second.NumValueSites[ValueKind] = Index + 1; 205 auto It = ProfileDataMap.find(Name); local 206 assert(It != ProfileDataMap.end() && It->second.DataVar && 209 GlobalVariable *DataVar = It->second.DataVar; 213 Index += It 283 auto It = ProfileDataMap.find(NamePtr); local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 10 // This file implements some loop unrolling utilities. It does not define any 53 ValueToValueMapTy::iterator It = VMap.find(Op); local 54 if (It != VMap.end()) 55 I->setOperand(op, It->second); 60 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i)); local 61 if (It != VMap.end()) 62 PN->setIncomingBlock(i, cast<BasicBlock>(It->second)); 156 /// This utility preserves LoopInfo. It will also preserve ScalarEvolution and 311 for (unsigned It = 1; It ! 376 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming); local [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Serialization/ |
H A D | MultiOnDiskHashTable.h | 225 auto It = M->Data.find(Key); local 226 if (It != M->Data.end()) 227 Result = It->second; 234 auto It = HT.find_hashed(Key, KeyHash); local 235 if (It != HT.end()) 236 HT.getInfoObj().ReadDataInto(Key, It.getDataPtr(), It.getDataLen(),
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 250 for (auto &It : make_range(SeenInsts.rbegin(), SeenInsts.rend())) { 251 if (It.second != unknownRange()) 254 Instruction *I = It.first; 364 for (auto It = ECs.begin(), E = ECs.end(); It != E; ++It) { 370 for (auto MI = ECs.member_begin(It), ME = ECs.member_end(); 401 if (ECs.member_begin(It) == ECs.member_end() || Fail || 433 for (auto MI = ECs.member_begin(It), ME = ECs.member_end();
|
/freebsd-11.0-release/contrib/llvm/lib/ExecutionEngine/IntelJITEvents/ |
H A D | IntelJITEventListener.cpp | 138 for (DILineInfoTable::iterator It = Begin; It != End; ++It) { 140 DILineInfoToIntelJITFormat((uintptr_t)Addr, It->first, It->second));
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | binomial_heap_base_.hpp | 39 // purpose. It is provided "as is" without express or implied 187 template<typename It> 189 copy_from_range(It first_it, It last_it);
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | constructor_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 57 template<typename It> 60 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | constructors_destructor_fn_imps.hpp | 39 // purpose. It is provided "as is" without express or implied 159 template<typename It> 162 copy_from_range(It first_it, It last_it)
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 219 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local 220 if (It == ValueMap.end()) 223 unsigned Reg = It->second;
|
/freebsd-11.0-release/contrib/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));
|
/freebsd-11.0-release/cddl/usr.sbin/dtrace/tests/tools/ |
H A D | genmakefiles.sh | 8 This script regenerates the DTrace test suite makefiles. It should be run
|
/freebsd-11.0-release/tools/build/options/ |
H A D | makeman | 239 echo ".It Va ${opt}" 243 echo 'It is a default setting on' 279 echo '.It' 293 echo ".It Va ${opt2}" 318 .It Pa /etc/src.conf 319 .It Pa /etc/src-env.conf 320 .It Pa /usr/share/mk/bsd.own.mk
|