and there seems to be no reason not to.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@112812
91177308-0d34-0410-b5e6-
96231b3b80d8
if (F->hasGC())
Out << " gc \"" << F->getGC() << '"';
if (F->isDeclaration()) {
- Out << "\n";
+ Out << " ; [#uses=" << F->getNumUses() << "]\n"; // Output # uses
} else {
- Out << " {";
+ Out << " { ; [#uses=" << F->getNumUses() << ']'; // Output # uses
// Output all of its basic blocks... for the function
for (Function::const_iterator I = F->begin(), E = F->end(); I != E; ++I)
; The induction variable canonicalization pass shouldn't leave dead
; instructions laying around!
;
-; RUN: opt < %s -indvars -S | \
-; RUN: not grep {#uses=0}
+; RUN: opt < %s -indvars -S | grep {#uses=0} | count 1
define i32 @mul(i32 %x, i32 %y) {
entry: