summaryrefslogtreecommitdiff
path: root/utils/findmisopt
diff options
context:
space:
mode:
authorDuncan Sands <baldrick@free.fr>2010-09-29 20:09:55 +0000
committerDuncan Sands <baldrick@free.fr>2010-09-29 20:09:55 +0000
commit18d52f2fb551c295bbce4c7d7357f4050b06e926 (patch)
tree40cb3c83836fe7978b80dd40219dca19c88f6ba9 /utils/findmisopt
parentf513ab8b77cd5e7dcd41a8700ff0d1a08c76b059 (diff)
downloadllvm-18d52f2fb551c295bbce4c7d7357f4050b06e926.tar.gz
llvm-18d52f2fb551c295bbce4c7d7357f4050b06e926.tar.bz2
llvm-18d52f2fb551c295bbce4c7d7357f4050b06e926.tar.xz
Convert a bunch of uses of 'bytecode' into 'bitcode'. This
is not everything, but the remaining cases are less trivial. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@115080 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils/findmisopt')
-rwxr-xr-xutils/findmisopt4
1 files changed, 2 insertions, 2 deletions
diff --git a/utils/findmisopt b/utils/findmisopt
index b7ffbd9947..f2a872c6dc 100755
--- a/utils/findmisopt
+++ b/utils/findmisopt
@@ -7,7 +7,7 @@
# it from finding a problem unless the set of failing optimizations are
# known and given to it on the command line.
#
-# Given a bytecode file that produces correct output (or return code),
+# Given a bitcode file that produces correct output (or return code),
# this script will run through all the optimizations passes that gccas
# uses (in the same order) and will narrow down which optimizations
# cause the program either generate different output or return a
@@ -21,7 +21,7 @@
#
# Where:
# bcfile
-# is the bytecode file input (the unoptimized working case)
+# is the bitcode file input (the unoptimized working case)
# outdir
# is a directory into which intermediate results are placed
# progargs