| /dports/graphics/piglit/piglit-136a7f5fa0703603be1ffb338abe4865e76a8058/tests/spec/gl-3.0/ |
| H A D | bound-resource-limits.c | 70 #define NUM_PRIMES 512 macro
127 static const GLfloat g_primes[NUM_PRIMES] = {
467 if ((i + 1) * MAX_COMPONENTS < NUM_PRIMES) { in setup_vertex_element_buffers()
1156 if ((g_maxColorAttachments * MAX_COMPONENTS > NUM_PRIMES) || in piglit_init()
1157 (g_maxVaryingFloats > NUM_PRIMES) || in piglit_init()
1158 (g_maxVertexAttribs * MAX_COMPONENTS > NUM_PRIMES) || in piglit_init()
1159 (g_maxVertexTextureImageUnits * MAX_COMPONENTS > NUM_PRIMES) || in piglit_init()
1160 (g_maxTextureImageUnits * MAX_COMPONENTS > NUM_PRIMES)) { in piglit_init()
1285 (i < NUM_PRIMES)) { in piglit_init()
1297 if (i < NUM_PRIMES) { in piglit_init()
[all …]
|
| /dports/math/sympow/sympow-7fd4d97cabc07951200b98ee841afc4151c2c287/ |
| H A D | compute.c | 106 llint NEXT,pi,multpi,*auxp,PMAX,PSIZE=1000000,NUM_PRIMES; in go() local
115 NUM_PRIMES=(llint) Floor((double) SQBND/Log((double) SQBND)* in go()
118 malloc_arrays(SQBND,NUM_PRIMES); NEXT=BOUND/4; QD_copy(wmax,QD_zero,LAST); in go()
123 for (s=0;s<NUM_PRIMES;s++) make_primep_coeffs(s,PRIMES[s],BOUND); in go()
125 for (s=0;s<NUM_PRIMES;s++) in go()
177 free_arrays(SQBND,NUM_PRIMES); return f;} in go()
|
| /dports/net/mpich2/mpich2-1.5/src/mpi/topo/ |
| H A D | dims_create.c | 42 #define NUM_PRIMES 168 macro
43 static int primes[NUM_PRIMES] =
81 for (i=0; i<NUM_PRIMES; i++) { in MPIR_Factor()
|
| /dports/games/alienarena-data/alienarena-7.66/source/unix/odesrc/ |
| H A D | collision_space.cpp | 298 #define NUM_PRIMES 31 macro
299 static const long int prime[NUM_PRIMES] = {1L,2L,3L,7L,13L,31L,61L,127L,251L,509L,
487 for (i=0; i<NUM_PRIMES; i++) { in collide()
490 if (i >= NUM_PRIMES) i = NUM_PRIMES-1; // probably pointless in collide()
|
| /dports/games/alienarena/alienarena-7.66/source/unix/odesrc/ |
| H A D | collision_space.cpp | 298 #define NUM_PRIMES 31 macro
299 static const long int prime[NUM_PRIMES] = {1L,2L,3L,7L,13L,31L,61L,127L,251L,509L,
487 for (i=0; i<NUM_PRIMES; i++) { in collide()
490 if (i >= NUM_PRIMES) i = NUM_PRIMES-1; // probably pointless in collide()
|
| /dports/devel/ode/ode-0.13/ode/src/ |
| H A D | collision_space.cpp | 300 #define NUM_PRIMES 31 macro
301 static const long int prime[NUM_PRIMES] = {1L,2L,3L,7L,13L,31L,61L,127L,251L,509L,
485 for (i=0; i<NUM_PRIMES; i++) { in collide()
488 if (i >= NUM_PRIMES) in collide()
489 i = NUM_PRIMES-1; // probably pointless in collide()
|
| /dports/net/beanstalkd/beanstalkd-1.10/ |
| H A D | dat.h | 38 #define NUM_PRIMES 48 macro
40 #define NUM_PRIMES 19 macro
|
| H A D | job.c | 46 if (cur_prime >= NUM_PRIMES) return; in rehash()
|
| /dports/math/z3/z3-z3-4.8.13/src/test/ |
| H A D | mpz.cpp | 321 #define NUM_PRIMES 168 macro
322 unsigned g_primes[NUM_PRIMES] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 6…
330 for (unsigned i = 0; i < NUM_PRIMES; i++) { in mk_big_num()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/test/ |
| H A D | mpz.cpp | 321 #define NUM_PRIMES 168 macro
322 unsigned g_primes[NUM_PRIMES] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 6…
330 for (unsigned i = 0; i < NUM_PRIMES; i++) { in mk_big_num()
|