代码搜索：Loop
找到约 10,000 项符合「Loop」的源代码
代码结果 10,000
www.eeworm.com/read/366702/2872752
ads loop_optimization1.ads
package Loop_Optimization1 is
type Number is range 0 .. 127;
type Group_List is array (Positive range ) of Number;
subtype Index is Natural range 1 .. 5;
function Groups (T : Integer
www.eeworm.com/read/366702/2872762
adb loop_optimization3.adb
-- { dg-do run }
-- { dg-options "-O" }
with Loop_Optimization3_Pkg; use Loop_Optimization3_Pkg;
procedure Loop_Optimization3 is
type Arr is array (Integer range -3 .. 3) of Integer;
C : consta
www.eeworm.com/read/366702/2877888
c loop-3b.c
#include
int n = 0;
g (i)
{
n++;
}
f (m)
{
int i;
i = m;
do
{
g (i * 4);
i -= INT_MAX / 8;
}
while (i > 0);
}
main ()
{
f (INT_MAX/8*4);
if (n != 4)
www.eeworm.com/read/366702/2877948
c loop-ivopts-1.c
/* From PR 18977. */
void foo(float * x);
int main()
{
float x[4];
foo (x);
return 0;
}
void foo (float *x)
{
int i,j,k;
float temp;
static float t16[16]={1.,2.,3.,4.,5.,6.,7.,8.,
www.eeworm.com/read/366702/2878190
c loop-3c.c
#include
void * a[255];
f (m)
{
int i;
int sh = 0x100;
i = m;
do
{
a[sh >>= 1] = ((unsigned)i
www.eeworm.com/read/366702/2878224
c loop-2d.c
int a[2];
f (b)
{
unsigned int i;
int *p;
for (p = &a[b], i = b; --i < ~0; )
*--p = i * 3 + (int)a;
}
main ()
{
a[0] = a[1] = 0;
f (2);
if (a[0] != (int)a || a[1] != (int)a + 3)
www.eeworm.com/read/366702/2878477
c loop-2c.c
int a[2];
__inline__ f (b, o)
{
unsigned int i;
int *p;
for (p = &a[b], i = b; --i < ~0; )
*--p = i * 3 + o;
}
g(int b)
{
f (b, (int)a);
}
main ()
{
a[0] = a[1] = 0;
g (2);
if (a[
www.eeworm.com/read/366702/2878515
c loop-2f.c
#include
#ifdef __unix__ /* ??? Is that good enough? */
#include
#include
#include
#include
#ifndef MAP_ANON
#ifdef MAP_ANONYMOUS
#define
www.eeworm.com/read/366702/2878519
c loop-ivopts-2.c
/* PR rtl-optimization/20290 */
/* We used to mis-optimize the second loop in main on at least ppc and
arm, because tree loop would change the loop to something like:
ivtmp.65 = &l[i];
iv