/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 407 /// that uses the value within the basic block, and return the predecessor 410 for (Use &U : Used->uses()) { 599 // have already rewritten uses of the value to uses of the reload.
|
H A D | Local.cpp | 381 /// areAllUsesEqual - Check whether the uses of a value are all the same. 383 /// true when there are no uses or multiple uses that all refer to the same 516 /// Unlike the removePredecessor method, this attempts to simplify uses of PHI 817 // has uses which will not disappear when the PHI nodes are merged. It is 831 for (Use &U : BBI->uses()) { 869 // We explicitly check for such uses in CanPropagatePredecessorsForPHIs. 870 assert(PN->use_empty() && "There shouldn't be any uses here!");
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGNodes.h | 228 /// which link together all the uses of an SDNode. 235 /// Prev, Next - Pointers to the uses list of the SDNode referred by 418 /// List of uses for this SDNode. 497 /// Return true if there are no uses of this node. 505 /// Return the number of uses of this node. This method takes 506 /// time proportional to the number of uses. 552 /// Return true if this iterator is at the end of uses list. 583 /// Provide iteration support to walk over all uses of an SDNode. 590 inline iterator_range<use_iterator> uses() { function in class:llvm::SDNode 593 inline iterator_range<use_iterator> uses() cons function in class:llvm::SDNode [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/ |
H A D | ARMLoadStoreOptimizer.cpp | 437 /// Update future uses of the base register with the offset introduced 445 assert(isThumb1 && "Can only update base register uses for Thumb1!"); 899 for (MachineOperand &MO : MI.uses()) { 1840 for (auto Use : Prev->uses()) 2177 // uses addrmode2, so we need an explicit offset reg. It should 2191 // uses addrmode2, so we need an explicit offset reg. It should
|
/freebsd-11.0-release/contrib/binutils/ |
H A D | Makefile.def | 389 // program on installation which uses the Tcl libraries.
|
/freebsd-11.0-release/contrib/bmake/mk/ |
H A D | lib.mk | 182 # Linux uses GNU ld, which is a multi-pass linker
|
H A D | dirdeps.mk | 47 # The _DIRDEP_USE target uses the suffix to set TARGET_SPEC
|
/freebsd-11.0-release/crypto/openssl/util/ |
H A D | pod2man.pl | 133 Give some example uses of the program.
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | MemoryDependenceAnalysis.cpp | 92 /// getAnalysisUsage - Does not modify anything. It uses Alias Analysis. 425 for (Use &Us : Ptr->uses()) { 679 // the malloced memory between the malloc call and its bitcast uses, and we
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | WinEHPrepare.cpp | 350 // Everything in the __try block uses TryState as its parent state. 699 // There may be lingering uses on other EH PHIs being removed 781 // references as we go. This uses VMap to do all the hard work. 883 // then we now have to update all uses of the value to use either the 893 // Scan all uses of this instruction to see if it is used outside of its 895 for (Use &U : OldI->uses()) { 905 // If there are no uses outside the block, we're done with this 910 // We found a use of OldI outside of the funclet. Rename all uses of OldI 911 // that are outside its funclet to be uses of the appropriate PHI node 1059 // dominates uses (need [all...] |
H A D | CodeGenPrepare.cpp | 59 STATISTIC(NumCmpUses, "Number of uses of Cmp expressions replaced with uses of " 61 STATISTIC(NumCastUses, "Number of uses of Cast expressions replaced with uses " 66 STATISTIC(NumExtUses, "Number of uses of [s|z]ext instructions optimized"); 69 STATISTIC(NumAndUses, "Number of uses of and mask instructions optimized"); 758 // If we removed all uses, nuke the cast. 819 // We don't want to move around uses of condition values this late, so we we 899 // If we removed all uses, nuke the cmp. 1009 /// Sink the shift *right* instruction into user blocks if the uses coul [all...] |
H A D | MachineVerifier.cpp | 1112 for (const MachineOperand &MOP : MI->uses()) { 1364 report("Virtual register def doesn't dominate all uses.", 1411 errs() << PrintReg(Reg, TRI) << " still has defs or uses\n";
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelDAGToDAG.cpp | 605 for (auto Use : N->uses()) { 825 for (SDNode *UI : Node->uses()) { 909 for (SDNode *UI : Node->uses()) { 1170 // Update uses of write back register 1173 // Update uses of vector list 1328 // Update uses of the write back register 1331 // Update uses of the vector list 1706 // Look for bits that will be useful for later uses. 1869 for (SDNode *Node : Op.getNode()->uses()) {
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopRerollPass.cpp | 583 for (Use &U : I->uses()) { 586 // Ignore "wrap-around" uses to PHIs of this loop's header. 1016 // instructions are treated as 'final' (their uses are not considered). 1039 << *KV.first << " (#uses=" << KV.second.count() << ")\n"); 1237 " vs. " << *RootInst << " (uses outside loop)\n"); 1377 // iteration (and the PHI). Replace outside uses of the reduced value with uses
|
H A D | IndVarSimplify.cpp | 216 /// loop. For PHI nodes, there may be multiple uses, so compute the nearest 243 assert(DT->dominates(DefI, InsertPt) && "def does not dominate all uses"); 304 // Check Incr uses. One user is PN and the other user is an exit condition 460 // If the FP induction variable still has uses, this is because something else 461 // in the loop uses its value. In order to canonicalize the induction 770 // IV Widening - Extend the width of an IV to cover its widest uses. 1285 // Now that the extend is gone, we want to expose it's uses for potential 1289 // push the uses of WideDef here. 1369 /// It would be simpler to delete uses as they are processed, but we must avoid 1408 // SCEVExpander. Henceforth, we produce 1-to-1 narrow to wide uses [all...] |
H A D | SCCP.cpp | 664 // TODO: We could do a lot better than this if code actually uses this. 827 // TODO: We could do a lot better than this if code actually uses this. 1538 /// SCCP Class - This class uses the SCCPSolver to implement a per-function 1653 // Replaces all of the uses of a variable with uses of the constant. 1705 for (const Use &U : GV->uses()) { 1817 // Replaces all of the uses of a variable with uses of the 1860 // Replaces all of the uses of a variable with uses o [all...] |
/freebsd-11.0-release/contrib/ncurses/progs/ |
H A D | tic.c | 988 dump_uses(qp->uses[j].name, !capdump); 1704 _nc_warning("%s uses %d parameters, expected %d", name,
|
/freebsd-11.0-release/contrib/gdb/gdb/ |
H A D | gdbarch.sh | 1385 /* The default architecture uses host values (for want of a better
|
/freebsd-11.0-release/contrib/gdb/ |
H A D | ltconfig | 56 # DJGPP uses `;' like DOS. 333 --with-gnu-ld assume that the C compiler uses the GNU linker 2787 # By default, configure uses ./config.cache as the cache file,
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | df-problems.c | 299 phase, all of the uses are sorted. All of the uses for the reg 0 300 are first, followed by all uses for reg 1 and so on. 302 2) There are two kill sets, one if the number of uses is less or 324 bitmap *use_sites; /* Bitmap of uses for each pseudo. */ 478 because the only values in it are the uses from here 489 bitmap uses 492 bitmap_ior_into (bb_info->kill, uses); 525 block BB. USE_INFO->REGS[R] caches the set of uses for register R. */ 774 fprintf (file, "Reaching uses 487 bitmap uses local [all...] |
/freebsd-11.0-release/contrib/gcclibs/libssp/ |
H A D | configure | 159 # work. The second script uses 'N' to pair each line-number line 857 --with-gnu-ld assume the C compiler uses GNU ld default=no 2776 # in C++ we need to declare it. In case someone uses the same compiler 4641 *** Warning: the command libtool uses to detect shared libraries, 4705 *** Warning: the command libtool uses to detect shared libraries, 5562 # work. The second script uses 'N' to pair each line-number line
|
/freebsd-11.0-release/crypto/openssl/crypto/bn/asm/ |
H A D | pa-risc2.s | 34 ; "Callee save" means if a function uses the register, it must save
|
H A D | pa-risc2W.s | 28 ; "Callee save" means if a function uses the register, it must save
|
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | HexagonBitSimplify.cpp | 581 // uses in a register in operand OpN. This only calculates the set of used 1282 for (auto &Op : MI->uses()) { 1463 // Eliminate register copies RD = RS, by replacing the uses of RD with 1464 // with uses of RS. 2040 for (auto &Op : MI->uses()) { 2628 // not checked here yet). It also uses a single register as its input,
|
/freebsd-11.0-release/contrib/gcc/config/arm/ |
H A D | lib1funcs.asm | 1200 uses r11 instead of r7. It is useful if the caller does not really
|