Searched refs:It (Results 351 - 375 of 448) sorted by relevance

<<1112131415161718

/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/
H A DModuleMap.cpp664 auto It = Headers.find(File); local
665 if (It == Headers.end())
667 return It->second;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DConstantFolding.cpp1090 auto It = FoldedOps.find(NewC); local
1091 if (It == FoldedOps.end()) {
1100 NewC = It->second;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DModuloSchedule.cpp1003 auto It = InstrChanges.find(OldMI); local
1004 if (It != InstrChanges.end()) {
1005 std::pair<unsigned, int64_t> RegAndOffset = It->second;
1266 // If InitReg is not given it is chosen arbitrarily. It will either be undef
1404 // consider it illegal. It will only exist during the rewrite process; it
1729 // all prologs and epilogs). It will only contain PHIs, in the same order as
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86SpeculativeLoadHardening.cpp322 /// FIXME: It's really frustrating that we have to do this, but SSA-form in MIR
348 // FIXME: It is really frustrating that we have to use a quadratic
2006 auto It = AddrRegToHardenedReg.find(Op->getReg());
2007 if (It == AddrRegToHardenedReg.end())
2012 Op->setReg(It->second);
2252 // instructions. It would be better to fix that code to handle this situation
2278 /// The new, hardened virtual register is returned. It will have the same
2377 /// priority. It is possible that some code from the caller will be executed
2488 // FIXME: It isn't clear that this is reliable in the face of
2493 // FIXME: It i
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreISelLowering.cpp775 // It takes one operand, the index of the frame address to return.
791 // It takes one operand, the index of the return address to return.
1536 MachineFunction::iterator It = ++BB->getIterator(); local
1548 F->insert(It, copy0MBB);
1549 F->insert(It, sinkMBB);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSimpleLoopUnswitch.cpp238 // FIXME: This is really, really gross. It would be much cleaner if LLVM
359 /// (splitting the exit block as necessary). It simplifies the branch within
577 /// and points the default at the preheader. It preserves loop simplified form
578 /// (splitting the exit blocks as necessary). It simplifies the switch within
705 // FIXME: It'd be great if we could merge this with the loop below but LLVM's
976 /// It also correctly creates the unconditional branch in the cloned
982 /// updates. This also doesn't fully update `DominatorTree`. It adds the cloned
984 /// instead the caller must recompute an accurate DT. It *does* correctly
1014 auto It = DominatingSucc.find(BB);
1015 return It !
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstructions.h1155 /// to the constructor. It only operates on integers or pointers. The operands
1297 /// to the constructor. It only operates on floating point values or packed
3168 /// A handle to a particular switch case. It exposes a convenient interface
3446 /// including the case_end() iterator. It returns an iterator for the next
4321 op_iterator It = op_begin() + 1;
4323 ++It;
4324 return handler_iterator(It, DerefFnTy(handler_helper));
4330 const_op_iterator It = op_begin() + 1;
4332 ++It;
4333 return const_handler_iterator(It, ConstDerefFnT
[all...]
/freebsd-11-stable/share/mk/
H A Dbsd.cpu.mk326 # armv6 is a hybrid. It can use the softfp ABI, but doesn't emulate
H A Ddirdeps.mk70 # It is best to use "no", but this can require fixing some
81 # It is important that MACHINE be included in and actually be
/freebsd-11-stable/stand/lua/
H A Dmenu.lua450 -- autoboot_key should return the key pressed. It will only
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSTLExtras.h132 // delete on something. It is used like this:
273 std::reverse_iterator<IteratorTy> make_reverse_iterator(IteratorTy It) { argument
274 return std::reverse_iterator<IteratorTy>(It);
439 /// This is *not a normal iterator* and should almost never be used directly. It
447 /// dereferencable. It is *not* incrementable.
545 // inner iterators have the same difference_type. It would fail if, for
810 /// `ValueT &` and `ValueT *` respectively. It doesn't support more
846 /// It is an error to call this with all iterators at the end.
875 /// It is an error to call this with all iterators at the end.
1462 // Don't compare indices here, only iterators. It'
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DAttributor.h700 for (auto &It : ArgumentReplacementMap)
701 DeleteContainerPointers(It.second);
721 /// argument (readnone, readonly, ...). It should use `getAAFor` to get the
756 /// Note that ownership of the attribute is given to the Attributor. It will
1206 /// It is sufficient to be able to query if a state is (1) valid or invalid, (2)
1738 /// have been identified. It can and shall be used for task like:
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp411 unsigned idx(iterator It) const { return It-begin(); }
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Linker/
H A DIRMover.cpp905 auto It = remove_if(SrcElements, [this](Constant *E) { local
913 SrcElements.erase(It, SrcElements.end());
1037 // done. It is not safe to do it now, since ValueMapper may be holding
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/Unix/
H A DPath.inc414 // check ensures that what we're trying to erase is a regular file. It
552 // Use ftruncate as a fallback. It may or may not allocate space. At least on
877 std::error_code detail::directory_iterator_increment(detail::DirIterState &It) {
879 dirent *CurDir = ::readdir(reinterpret_cast<DIR *>(It.IterationHandle));
886 return directory_iterator_increment(It);
887 It.CurrentEntry.replace_filename(Name, direntType(CurDir));
889 return directory_iterator_destruct(It);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp5744 // It is because getRegisterType(MVT::i1) => MVT::i1,
6157 // FIXME: It would be preferable to use the slot in the
10681 MachineFunction::iterator It = ++BB->getIterator(); local
10693 F->insert(It, loopMBB);
10695 F->insert(It, loop2MBB);
10696 F->insert(It, exitMBB);
10785 MachineFunction::iterator It = ++BB->getIterator(); local
10797 F->insert(It, loopMBB);
10799 F->insert(It, loop2MBB);
10800 F->insert(It, exitMB
11232 MachineFunction::iterator It = ++BB->getIterator(); local
[all...]
/freebsd-11-stable/contrib/bmake/mk/
H A Ddirdeps.mk72 # It is best to use "no", but this can require fixing some
83 # It is important that MACHINE be included in and actually be
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DTargetInstrInfo.h164 /// indices: (CommutableOpIdx1, CommutableOpIdx2). It is assumed here that
203 /// to the frame setup instruction. It occurs in the calls that involve
647 /// This is only invoked in cases where AnalyzeBranch returns success. It
658 /// This is only invoked in cases where AnalyzeBranch returns success. It
662 /// It is also invoked by tail merging to add unconditional branches in
876 /// it cannot be understood. It is assumed that MI->isSelect() is true.
1048 /// Return true when a code sequence can improve throughput. It
1204 /// specified opcode. It returns zero if the specified unfolding is not
1215 /// loading from the same base address. It should only return true if the base
1217 /// are the offset. It als
1783 insertOutlinedCall(Module &M, MachineBasicBlock &MBB, MachineBasicBlock::iterator &It, MachineFunction &MF, const outliner::Candidate &C) const argument
[all...]
/freebsd-11-stable/contrib/llvm-project/libunwind/src/
H A DUnwindRegistersSave.S788 @ It is safe to use here though because we are about to return, and cpsr is
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaType.cpp290 for (auto It = std::partition_point(
293 It != AttrsForTypes.end() && It->first == AT; ++It) {
294 if (It->second) {
295 const Attr *Result = It->second;
296 It->second = nullptr;
1866 // It's not specified what happens when the _Atomic qualifier is applied to
4075 /// It is legal to pass the result of Declarator::getNumTypeObjects() as the
5042 // FIXME: It'
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/
H A DASTContext.cpp1167 auto It = MergedDefModules.find(cast<NamedDecl>(ND->getCanonicalDecl())); local
1168 if (It == MergedDefModules.end())
1171 auto &Merged = It->second;
1200 auto It = ModuleInitializers.find(ID->getImportedModule()); local
1203 if (It == ModuleInitializers.end())
1207 auto &Imported = *It->second;
1231 auto It = ModuleInitializers.find(M); local
1232 if (It == ModuleInitializers.end())
1235 auto *Inits = It->second;
1731 // It i
[all...]
/freebsd-11-stable/contrib/binutils/
H A DMakefile.def464 // built newlib on some targets (e.g. Cygwin). It still needs
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp224 /// Does *NOT* update the topological ordering! It just queues an update.
486 /// TODO: It would be better to give CALLSEQ_END an explicit operand to point
746 // FIXME: Do not modify node height. It may interfere with
1967 for (auto It : WorkList)
1968 assert(It.SU != PredSU && "Trying to push an element twice?");
2377 /// it has no other use. It should be scheduled closer to the terminator.
2651 // stalls highest priority and allows hoisting across calls. It should also
/freebsd-11-stable/crypto/openssl/util/
H A Dpod2man.pl112 Long drawn out discussion of the program. It's a good idea to break this
427 next if /^=pod\b/; # It is OK to have =pod before NAME
428 next if /^=(for|begin|end)\s+comment\b/; # It is OK to have =for =begin or =end comment before NAME
/freebsd-11-stable/contrib/bmake/
H A Dconfigure1964 It was created by bmake $as_me 20171126, which was
2722 # It will help us diagnose broken compilers, and finding out an intuition
3080 /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has
3085 array size at least. It's necessary to write '\x00'==0 to get something
4080 /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has
4085 array size at least. It's necessary to write '\x00'==0 to get something
4250 # AIX install. It has an incompatible calling convention.
4296 # It thinks the first close brace ends the variable substitution.
4774 # Check for potential -arch flags. It is not universal unless
4818 # It doe
[all...]

Completed in 432 milliseconds

<<1112131415161718