/haiku-buildtools/isl/ |
H A D | polytope_scan.c | 27 struct isl_mat *samples; member in struct:scan_samples 35 ss->samples = isl_mat_extend(ss->samples, ss->samples->n_row + 1, 36 ss->samples->n_col); 37 if (!ss->samples) 40 isl_seq_cpy(ss->samples->row[ss->samples->n_row - 1], 59 ss.samples = isl_mat_alloc(ctx, 0, 1 + dim); 60 if (!ss.samples) 77 struct isl_mat *samples; local 94 struct isl_mat *samples; local [all...] |
H A D | isl_tab.c | 218 isl_mat_free(tab->samples); 268 if (tab->samples) { 269 dup->samples = isl_mat_dup(tab->samples); 270 if (!dup->samples) 273 tab->samples->n_row); 274 if (tab->samples->n_row && !dup->sample_index) 530 prod->samples = NULL; 860 tab->samples = isl_mat_alloc(tab->mat->ctx, 1, 1 + tab->n_var); 861 if (!tab->samples) [all...] |
H A D | isl_tab_pip.c | 1715 /* Check whether all the currently active samples also satisfy the inequality 1717 * Remove those samples that do not. 1728 isl_assert(tab->mat->ctx, tab->samples, goto error); 1729 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); 1734 isl_seq_inner_product(ineq, tab->samples->row[i], 1826 isl_assert(tab->mat->ctx, tab->samples, return -1); 1827 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, return -1); 1832 isl_seq_inner_product(ineq, tab->samples->row[i], 1851 struct isl_mat *samples; local 1860 samples [all...] |
H A D | isl_tab.h | 116 * The samples matrix contains "n_sample" integer points that have at some 120 * out is removed. These samples are only maintained for the context 162 struct isl_mat *samples; member in struct:isl_tab
|
H A D | isl_affine_hull.c | 476 if (tab->samples) 825 isl_assert(tab->mat->ctx, tab->samples, goto error); 826 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); 836 isl_seq_cpy(sample->el, tab->samples->row[tab->n_outside], sample->size); 847 isl_seq_cpy(sample->el, tab->samples->row[j], sample->size);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr48596.c | 6 typedef struct { const NrrdKernel *kernel[10]; int samples[10]; } Info; member in struct:__anon901 10 const int *samples, const double *scalings) 17 if (samples) 18 info->samples[d] = samples[d]; 23 info->samples[d] = nin->axis[d].size*scalings[d]; 25 info->samples[d] = (nin->axis[d].size - 1)*scalings[d] + 1; 9 foo(Nrrd *nout, Nrrd *nin, const NrrdKernel *kernel, const double *parm, const int *samples, const double *scalings) argument
|
H A D | 990523-1.c | 6 short *samples = (short *) (out+*pnt); local 15 for (j=15;j;j--,b0-=0x20,window-=0x10,samples+=step) 27 if( ( sum ) > 32767.0) *( samples ) = 0x7fff; ( clip )++; ;
|
H A D | pr26255.c | 19 void foo(int *dither_state, int *samples) argument 30 *samples = round_sample(&sum);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/ |
H A D | pr60276.c | 5 foo (int *out, const int *lp, unsigned samples) argument 8 for (x = 0, target = 0; x < (int)samples; x += 2, target++) 16 foo_novec (int *out, const int *lp, unsigned samples) argument 19 for (x = 0, target = 0; x < (int)samples; x += 2, target++)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/spu/ |
H A D | intrinsics-2.c | 16 static int samples = 10; variable 55 for (i=0; i<samples; i++) { 93 for (i=0; i<samples; i++) { 130 for (i=0; i<samples; i++) { 169 for (i=0; i<samples; i++) { 213 } samples[] = { local 252 unsigned char cnt = sizeof(samples)/sizeof(struct _samples); 256 a.ull[0] = samples[e0].v; 260 exp = (SPU_SV_NEG_DENORM & samples[e0].sv) ? 0xFFFFFFFFFFFFFFFFULL : 0ULL; 264 exp = (SPU_SV_POS_DENORM & samples[e [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr36066.c | 23 static void get_wasted_bits_(FLAC__int32 signal[], unsigned samples) argument 27 for(i = 0; i < samples && !(x&1); i++)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | ldist-17.c | 10 mad_fixed_t samples[2][1152]; member in struct:mad_pcm
|
/haiku-buildtools/gcc/gmp/tests/mpz/ |
H A D | t-bin.c | 70 samples (void) function 213 samples ();
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ |
H A D | pr65240.h | 4747 double *samples, unsigned short *xform_distrib,
|