Mercurial > hg > CbC > CbC_gcc

comparison gcc/doc/tree-ssa.texi @ 131:84e7813d76e9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
gcc-8.2
author mir3636
date Thu, 25 Oct 2018 07:37:49 +0900
parents 04ced10e8804
children 1830386684a0
comparison
equal deleted inserted replaced
111:04ced10e8804 131:84e7813d76e9
1 @c Copyright (C) 2004-2017 Free Software Foundation, Inc. 1 @c Copyright (C) 2004-2018 Free Software Foundation, Inc.
2 @c This is part of the GCC manual. 2 @c This is part of the GCC manual.
3 @c For copying conditions, see the file gcc.texi. 3 @c For copying conditions, see the file gcc.texi.
4 4
5 @c --------------------------------------------------------------------- 5 @c ---------------------------------------------------------------------
6 @c Tree SSA 6 @c Tree SSA
23 constant propagation, tail call elimination, redundancy elimination, 23 constant propagation, tail call elimination, redundancy elimination,
24 etc). Much like GENERIC, GIMPLE is a language independent, tree based 24 etc). Much like GENERIC, GIMPLE is a language independent, tree based
25 representation. However, it differs from GENERIC in that the GIMPLE 25 representation. However, it differs from GENERIC in that the GIMPLE
26 grammar is more restrictive: expressions contain no more than 3 26 grammar is more restrictive: expressions contain no more than 3
27 operands (except function calls), it has no control flow structures 27 operands (except function calls), it has no control flow structures
28 and expressions with side-effects are only allowed on the right hand 28 and expressions with side effects are only allowed on the right hand
29 side of assignments. See the chapter describing GENERIC and GIMPLE 29 side of assignments. See the chapter describing GENERIC and GIMPLE
30 for more details. 30 for more details.
31 31
32 This chapter describes the data structures and functions used in the 32 This chapter describes the data structures and functions used in the
33 GIMPLE optimizers (also known as ``tree optimizers'' or ``middle 33 GIMPLE optimizers (also known as ``tree optimizers'' or ``middle