代码搜索：Loop
找到约 10,000 项符合「Loop」的源代码
代码结果 10,000
www.eeworm.com/read/366702/2883041
c loop-14.c
/* A test for final value replacement. */
/* { dg-options "-O2 -fdump-tree-optimized" } */
int foo(void);
int bla(void)
{
int i, j = foo ();
for (i = 0; i < 100; i++, j++)
foo ();
/* S
www.eeworm.com/read/366702/2883074
c loop-11.c
/* A test for final value replacement and higher-order ivs,
see PR 22442. */
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-optimized" } */
void bar (unsigned);
void foo (void)
{
un
www.eeworm.com/read/366702/2883134
c loop-15.c
/* A test for # of iterations analysis (signed counter cannot wrap) and final
value replacement. */
/* { dg-options "-O2 -fdump-tree-optimized" } */
int foo(void);
int bla(void)
{
int i, n =
www.eeworm.com/read/366702/2883178
c loop-23.c
/* { dg-do compile } */
/* { dg-options "-O2 -funroll-loops -fdump-tree-cunroll-details" } */
void bla(int);
void foo(void)
{
int i;
/* This loop used to appear to be too large for unrolling.
www.eeworm.com/read/366702/2883205
c loop-2.c
/* A test for strength reduction and induction variable elimination. */
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-optimized" } */
/* { dg-require-effective-target size32plus } */
/*
www.eeworm.com/read/366702/2883244
c loop-16.c
/* A test for # of iterations estimation. We know that the loop is executed
at most 100 times, thus the (32-bit) induction variables do not overflow,
and we may use 64-bit variable to represent
www.eeworm.com/read/366702/2883255
c loop-7.c
/* PR tree-optimization/19828 */
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-lim-details" } */
int cst_fun1 (int) __attribute__((__const__));
int cst_fun2 (int) __attribute__((__const__)
www.eeworm.com/read/366702/2883267
c loop-27.c
/* PR tree-optimization/30565 */
/* { dg-do compile } */
/* { dg-options "-O1 -ftree-pre -ftree-loop-linear" } */
static double snrdef[32];
void psycho_n1(double ltmin[2][32], int stereo)
{
int i
www.eeworm.com/read/366702/2883271
c loop-24.c
/* { dg-do compile } */
/* { dg-options "-O -fstrict-overflow -fdump-tree-empty" } */
void foo(int a, int b)
{ for(;a!=b;a+=4); }
void foo2(int a, int b)
{ for(;a
www.eeworm.com/read/366702/2883333
c loop-21.c
/* PR tree-optimization/30322 */
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-final_cleanup" } */
extern void op( int, int);
void foo(int f0, int f1, int e0, int e1)
{
int i0, i1;
f