Searched refs:TREE_CODE_LENGTH (Results 1 - 25 of 26) sorted by relevance

12

/freebsd-11.0-release/contrib/gcc/
H A Dc-semantics.c122 length = TREE_CODE_LENGTH (code);
H A Dtree-chrec.c854 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
883 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
918 switch (TREE_CODE_LENGTH (TREE_CODE (expr)))
961 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
H A Dtree-gimple.c470 int len = TREE_CODE_LENGTH (code);
H A Dtree-browser.c742 switch (TREE_CODE_LENGTH (TREE_CODE (node)))
798 switch (TREE_CODE_LENGTH (TREE_CODE (parent)))
H A Dtree.c363 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
2245 switch (TREE_CODE_LENGTH (code))
2410 switch (TREE_CODE_LENGTH (code))
2544 switch (TREE_CODE_LENGTH (code))
2871 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2906 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2992 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3031 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3077 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3104 gcc_assert (TREE_CODE_LENGTH (cod
[all...]
H A Dtree-ssa-loop-im.c348 nops = TREE_CODE_LENGTH (TREE_CODE (expr));
842 nops = TREE_CODE_LENGTH (TREE_CODE (expr));
H A Dtree-ssa-reassoc.c288 if (TREE_CODE_LENGTH (TREE_CODE (rhs)) == 0)
293 i < TREE_CODE_LENGTH (TREE_CODE (rhs))
H A Dtree-vect-transform.c798 op_type = TREE_CODE_LENGTH (TREE_CODE (operation));
1196 op_type = TREE_CODE_LENGTH (code);
1519 op_type = TREE_CODE_LENGTH (code);
2001 op_type = TREE_CODE_LENGTH (code);
H A Dtree-scalar-evolution.c390 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
2345 switch (TREE_CODE_LENGTH (TREE_CODE (chrec)))
H A Dtree-ssa-loop-niter.c690 n = TREE_CODE_LENGTH (TREE_CODE (expr));
726 n = TREE_CODE_LENGTH (code);
H A Dprint-tree.c672 len = TREE_CODE_LENGTH (TREE_CODE (node));
H A Dtree.h192 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] macro
768 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
778 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
789 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
H A Dtree-vectorizer.c1862 op_type = TREE_CODE_LENGTH (code);
H A Dfold-const.c3985 if (TREE_CODE_LENGTH (code) > 0)
3994 && TREE_CODE_LENGTH (code) > 1))
7466 && TREE_CODE_LENGTH (code) == 1);
8520 && TREE_CODE_LENGTH (code) == 2
11497 && TREE_CODE_LENGTH (code) == 3);
11835 switch (TREE_CODE_LENGTH (code))
12022 len = TREE_CODE_LENGTH (code);
H A Dstmt.c1495 if (EXPRESSION_CLASS_P (exp) && TREE_CODE_LENGTH (TREE_CODE (exp)) == 0)
H A Dtree-pretty-print.c76 len = TREE_CODE_LENGTH (TREE_CODE (node));
H A Dtree-ssa-pre.c2951 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
H A Dtree-ssa-structalias.c3545 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (rhsop)); i++)
H A Dc-common.c1548 int max = TREE_CODE_LENGTH (TREE_CODE (x));
H A Doptabs.c383 int nops = TREE_CODE_LENGTH (TREE_CODE (exp));
H A Dtree-ssa-loop-ivopts.c1320 len = TREE_CODE_LENGTH (TREE_CODE (expr));
H A Dexpr.c6300 nops = TREE_CODE_LENGTH (TREE_CODE (exp));
/freebsd-11.0-release/contrib/gcc/cp/
H A Dtree.c1302 length = TREE_CODE_LENGTH (code);
1327 length = TREE_CODE_LENGTH (code);
1357 length = TREE_CODE_LENGTH (code);
1620 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i)
H A Dmangle.c2234 for (i = 0; i < TREE_CODE_LENGTH (code); ++i)
H A Ddecl.c2050 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *));
2057 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *));

Completed in 324 milliseconds

12