代码搜索:Loop

找到约 10,000 项符合「Loop」的源代码

代码结果 10,000
www.eeworm.com/read/240162/4588978

c test-loop.c

main () { int i; for (i = 100; i >= -1; i--) foo (); }
www.eeworm.com/read/233448/4670977

c loop2.c

// Test that breaking out of a handler works. // { dg-do run } int main () { while (1) { try { throw 1; } catch (...) { break; } } }
www.eeworm.com/read/233448/4671007

c loop1.c

// Verify that loop optimization takes into account the exception edge // and does not increment I before the call. // { dg-do run } // { dg-options "-O2" } extern "C" void abort(); static void bar(c
www.eeworm.com/read/233448/4671989

c loop1.c

// PR rtl-optimization/16590 // { dg-do run } // { dg-options "-O2" } extern "C" void abort(); struct iterator { char * p; int *dummy; }; static iterator pend(char * start) { iterator
www.eeworm.com/read/233448/4673232

c loop2.c

// { dg-do assemble } // { dg-options "-O" } class foo { public: operator const char*() const { return a; } char *a; }; class bar { public: ~bar(); void operator++(int); bool b() const; p
www.eeworm.com/read/233448/4673501

c loop1.c

// { dg-do run } // { dg-options "-O2" } // Test for bad loop optimization of goto fixups. typedef bool (*ftype) (); int c, d; struct A { A() { ++c; } A(const A&) { ++c; } ~A() { ++d; } }; v
www.eeworm.com/read/233448/4681740

c loop-8.c

double a[3] = { 0.0, 1.0, 2.0 }; void bar (int x, double *y) { if (x || *y != 1.0) abort (); } int main () { double c; int d; for (d = 0; d < 3; d++) { c = a[d]; if (c > 0.0) g
www.eeworm.com/read/233448/4681817

c loop-1.c

main () { int i, j, k[3]; j = 0; for (i=0; i < 3; i++) { k[i] = j++; } for (i=2; i >= 0; i--) { if (k[i] != i) abort (); } exit (0); }
www.eeworm.com/read/233448/4681866

c loop-9.c

/* Source: Neil Booth, from PR # 115. */ int false() { return 0; } extern void abort (void); int main (int argc,char *argv[]) { int count = 0; while (false() || count < -123) ++count;
www.eeworm.com/read/233448/4681987

c loop-5.c

static int ap(int i); static void testit(void){ int ir[4] = {0,1,2,3}; int ix,n,m; n=1; m=3; for (ix=1;ix