diff options
Diffstat (limited to 'gcc/doc')
| -rw-r--r-- | gcc/doc/cfg.texi | 12 | ||||
| -rw-r--r-- | gcc/doc/extend.texi | 14 | ||||
| -rw-r--r-- | gcc/doc/md.texi | 8 | ||||
| -rw-r--r-- | gcc/doc/tree-ssa.texi | 8 | ||||
| -rw-r--r-- | gcc/doc/trouble.texi | 8 |
5 files changed, 25 insertions, 25 deletions
diff --git a/gcc/doc/cfg.texi b/gcc/doc/cfg.texi index ddd225159a0..2b3aec61630 100644 --- a/gcc/doc/cfg.texi +++ b/gcc/doc/cfg.texi @@ -120,7 +120,7 @@ in the various @file{tree-*} files. The following snippet will pretty-print all the statements of the program in the GIMPLE representation. -@example +@smallexample FOR_EACH_BB (bb) @{ block_stmt_iterator si; @@ -131,7 +131,7 @@ FOR_EACH_BB (bb) print_generic_stmt (stderr, stmt, 0); @} @} -@end example +@end smallexample @node Edges @@ -231,7 +231,7 @@ stages of the compilation process, GCC tries to avoid such dense flow graphs by factoring computed jumps. For example, given the following series of jumps, -@example +@smallexample goto *x; [ ... ] @@ -240,13 +240,13 @@ series of jumps, goto *x; [ ... ] -@end example +@end smallexample @noindent factoring the computed jumps results in the following code sequence which has a much simpler flow graph: -@example +@smallexample goto y; [ ... ] @@ -258,7 +258,7 @@ which has a much simpler flow graph: y: goto *x; -@end example +@end smallexample However, the classic problem with this transformation is that it has a runtime cost in there resulting code: An extra jump. Therefore, the diff --git a/gcc/doc/extend.texi b/gcc/doc/extend.texi index 6b70565b325..3724e6b5a58 100644 --- a/gcc/doc/extend.texi +++ b/gcc/doc/extend.texi @@ -3610,13 +3610,13 @@ it as input or output but if this is not known, you should add @samp{memory}. As an example, if you access ten bytes of a string, you can use a memory input like: -@example +@smallexample @{"m"( (@{ struct @{ char x[10]; @} *p = (void *)ptr ; *p; @}) )@}. -@end example +@end smallexample Note that in the following example the memory input is necessary, otherwise GCC might optimize the store to @code{x} away: -@example +@smallexample int foo () @{ int x = 42; @@ -3626,7 +3626,7 @@ int foo () "=&d" (r) : "a" (y), "m" (*y)); return result; @} -@end example +@end smallexample You can put multiple assembler instructions together in a single @code{asm} template, separated by the characters normally used in assembly @@ -9246,14 +9246,14 @@ namespace std @{ template <class T> struct A @{ @}; @} using namespace debug __attribute ((__strong__)); - template <> struct A<int> @{ @}; // ok to specialize + template <> struct A<int> @{ @}; // @r{ok to specialize} template <class T> void f (A<T>); @} int main() @{ - f (std::A<float>()); // lookup finds std::f + f (std::A<float>()); // @r{lookup finds} std::f f (std::A<int>()); @} @end smallexample @@ -9270,7 +9270,7 @@ Sample problematic code is: @smallexample struct S @{ ~S(); @}; - extern void bar(); // is written in Java, and may throw exceptions + extern void bar(); // @r{is written in Java, and may throw exceptions} void foo() @{ S s; diff --git a/gcc/doc/md.texi b/gcc/doc/md.texi index 447538ed691..02bc0a6c3b2 100644 --- a/gcc/doc/md.texi +++ b/gcc/doc/md.texi @@ -771,16 +771,16 @@ instruction operands on a RISC machine. This is a slight variant on @code{register_operand} which works around a limitation in the machine-description reader. -@example +@smallexample (match_operand @var{n} "pmode_register_operand" @var{constraint}) -@end example +@end smallexample @noindent means exactly what -@example +@smallexample (match_operand:P @var{n} "register_operand" @var{constraint}) -@end example +@end smallexample @noindent would mean, if the machine-description reader accepted @samp{:P} diff --git a/gcc/doc/tree-ssa.texi b/gcc/doc/tree-ssa.texi index f4c981f3e28..311006d4c0f 100644 --- a/gcc/doc/tree-ssa.texi +++ b/gcc/doc/tree-ssa.texi @@ -1193,7 +1193,7 @@ marked as an alias tag and added to the alias set of TMT@. For instance, consider the following function: -@example +@smallexample foo (int i) @{ int *p, *q, a, b; @@ -1208,7 +1208,7 @@ foo (int i) a = b + 2; return *p; @} -@end example +@end smallexample After aliasing analysis has finished, the type memory tag for pointer @code{p} will have two aliases, namely variables @code{a} and @@ -1216,7 +1216,7 @@ pointer @code{p} will have two aliases, namely variables @code{a} and Every time pointer @code{p} is dereferenced, we want to mark the operation as a potential reference to @code{a} and @code{b}. -@example +@smallexample foo (int i) @{ int *p, a, b; @@ -1239,7 +1239,7 @@ foo (int i) # VUSE <b_8>; return *p_1; @} -@end example +@end smallexample In certain cases, the list of may aliases for a pointer may grow too large. This may cause an explosion in the number of virtual diff --git a/gcc/doc/trouble.texi b/gcc/doc/trouble.texi index 8ce6afc01ee..90c4daacc5d 100644 --- a/gcc/doc/trouble.texi +++ b/gcc/doc/trouble.texi @@ -910,11 +910,11 @@ of instantiation. For example, consider struct A @{ template <typename T> void f () @{ - foo (1); // 1 - int i = N; // 2 + foo (1); // @r{1} + int i = N; // @r{2} T t; - t.bar(); // 3 - foo (t); // 4 + t.bar(); // @r{3} + foo (t); // @r{4} @} static const int N; |