blob: edfa8ee7306fd485d2f3d120b81b7231b00135bd [file] [log] [blame]
Brian Gaekef36e2d52004-06-02 19:12:38 +00001
2=pod
3
4=head1 NAME
5
6gccas - optimizing LLVM assembler
7
8=head1 SYNOPSIS
9
10gccas [options] filename
11
12=head1 DESCRIPTION
13
14The B<gccas> utility takes an LLVM assembly file generated by the
15L<llvm-gcc|llvm-gcc> or L<llvm-g++|llvm-g++> front-ends and converts
16it into an LLVM bytecode file. It is primarily used by the GCC
17front end, and as such, attempts to mimic the interface provided
18by the default system assembler so that it can act as a "drop-in"
19replacement.
20
21B<gccas> performs a number of optimizations on the input program,
22including but not limited to: promotion of stack values to SSA
23registers; elimination of dead globals, function arguments, code,
24and types; tail-call elimination; loop-invariant code motion; global
25common-subexpression elimination; and sparse conditional constant
26propagation.
27
28=head1 OPTIONS
29
30=over
31
32=item B<--help>
33
34Print a summary of command line options.
35
36=item B<-o> F<filename>
37
38Specify the name of the output file which will hold the assembled bytecode.
39
40=item B<--disable-inlining>
41
42Disable the inlining pass. By default, it is enabled.
43
44=item B<--disable-opt>
45
46Disable all assembler-time optimization passes.
47
48=item B<--enable-correct-eh-support>
49
50Instruct the B<-lowerinvoke> pass to insert code for correct exception handling
51support. This is expensive and is by default omitted for efficiency.
52
53=item B<--stats>
54
55Print statistics.
56
57=item B<--time-passes>
58
59Record the amount of time needed for each pass and print it to standard
60error.
61
62=item B<--verify>
63
64Verify each pass result.
65
66=back
67
68=head1 EXIT STATUS
69
70If B<gccas> succeeds, it will exit with an exit status of 0.
71Otherwise, if an error occurs, it will exit with a non-zero exit
72status.
73
74=head1 SEE ALSO
75
76L<llvm-as>, L<gccld>
77
78=head1 AUTHORS
79
80Maintained by the LLVM Team (L<http://llvm.cs.uiuc.edu>).
81
82=cut
83