/haiku-buildtools/isl/ |
H A D | polyhedron_sample.c | 19 struct isl_vec *sample; local 23 sample = isl_basic_set_sample_vec(isl_basic_set_copy(bset)); 25 p = isl_printer_print_vec(p, sample); 28 assert(sample); 29 if (sample->size > 0) 30 assert(isl_basic_set_contains(bset, sample)); 32 isl_vec_free(sample);
|
H A D | isl_sample.c | 33 /* Construct a zero sample of the same dimension as bset. 35 * function creates a zero-dimensional sample point. 40 struct isl_vec *sample; local 43 sample = isl_vec_alloc(bset->ctx, 1 + dim); 44 if (sample) { 45 isl_int_set_si(sample->el[0], 1); 46 isl_seq_clr(sample->el + 1, dim); 49 return sample; 56 struct isl_vec *sample; local 66 sample 263 struct isl_vec *sample; local 509 struct isl_vec *sample; local 667 isl_vec *sample = NULL; local 739 struct isl_vec *sample; local 809 plug_in(struct isl_basic_set *bset, struct isl_vec *sample) argument 848 struct isl_vec *sample; local 1059 struct isl_vec *sample; local 1261 struct isl_vec *sample; local 1298 struct isl_vec *sample = isl_vec_copy(bset->sample); local 1383 struct isl_basic_map *sample; local 1404 isl_basic_map *sample = NULL; local [all...] |
H A D | isl_affine_hull.c | 266 struct isl_vec *sample = NULL; local 275 sample = isl_vec_alloc(ctx, 1 + dim); 276 if (!sample) 278 isl_int_set_si(sample->el[0], 1); 279 isl_seq_combine(sample->el + 1, 280 ctx->one, tab->bmap->sample->el + 1, 282 if (isl_basic_map_contains(tab->bmap, sample)) 283 return sample; 284 isl_vec_free(sample); 285 sample 364 adjacent_point(__isl_keep isl_vec *sample, int pos, int up) argument 379 add_adjacent_points( __isl_take isl_basic_set *hull, __isl_take isl_vec *sample, __isl_keep isl_basic_set *bset) argument 455 struct isl_vec *sample; local 666 initialize_hull(__isl_keep isl_basic_set *bset, __isl_take isl_vec *sample) argument 688 struct isl_vec *sample = NULL; local 812 struct isl_vec *sample; local 953 struct isl_vec *sample = isl_vec_copy(hull->sample); local 1057 struct isl_vec *sample = isl_vec_copy(hull->sample); local [all...] |
H A D | isl_scan.h | 17 int (*add)(struct isl_scan_callback *cb, __isl_take isl_vec *sample);
|
H A D | polytope_scan.c | 31 __isl_take isl_vec *sample) 41 sample->el, sample->size); 43 isl_vec_free(sample); 46 isl_vec_free(sample); 30 scan_samples_add_sample(struct isl_scan_callback *cb, __isl_take isl_vec *sample) argument
|
H A D | isl_scan.c | 25 __isl_take isl_vec *sample) 31 isl_vec_free(sample); 52 /* Call callback->add with the current sample value of the tableau "tab". 56 struct isl_vec *sample; local 60 sample = isl_tab_get_sample_value(tab); 61 if (!sample) 64 return callback->add(callback, sample); 70 struct isl_vec *sample; local 72 sample = isl_vec_alloc(bset->ctx, 1); 75 if (!sample) 24 increment_counter(struct isl_scan_callback *cb, __isl_take isl_vec *sample) argument [all...] |
H A D | basis_reduction_tab.c | 148 struct isl_vec *sample = isl_tab_get_sample_value(lp->tab); local 149 if (!sample) 151 isl_seq_inner_product(lp->obj, sample->el + 1, lp->dim, &lp->tmp); 152 isl_seq_inner_product(lp->obj, sample->el + 1 + lp->dim, lp->dim, &lp->tmp2); 153 isl_int_cdiv_q(lp->tmp, lp->tmp, sample->el[0]); 154 isl_int_fdiv_q(lp->tmp2, lp->tmp2, sample->el[0]); 157 isl_vec_free(sample);
|
H A D | pip.c | 193 /* Check if the "manually" computed optimum of bset at the "sample" 202 __isl_take isl_vec *sample) 209 opt = opt_at(isl_basic_set_copy(sp->bset), isl_vec_copy(sample), sp->max); 214 sample_pnt = isl_point_alloc(isl_set_get_space(sp->empty), sample); 222 sol = set_plug_in_parameters(isl_set_copy(sp->sol), sample); 201 scan_one(struct isl_scan_callback *callback, __isl_take isl_vec *sample) argument
|
H A D | isl_ilp.c | 153 struct isl_vec *sample; local 163 sample = isl_basic_set_sample_vec(slice); 164 if (!sample) { 169 if (sample->size > 0) { 171 sol = sample; 176 isl_vec_free(sample);
|
H A D | isl_tab_pip.c | 33 * constraint, making sure the sample solution remains feasible 37 * increment to the sample solution. 39 * By starting out from a sample value that is lexicographically 41 * feasible integer sample point we find will also be the lexicographically 43 * then the initial sample value may be chosen equal to zero. 49 * Taking as initial sample value x' = 0 corresponds to x = -M, 1025 * lead to the lexicographically smallest increment in the sample 1027 * Pivoting with column c will increment the sample value by a non-negative 1085 * in the sample point. 1244 * smallest increment in the sample poin 1798 struct isl_vec *sample; local 2699 struct isl_vec *sample; local 2746 struct isl_vec *sample; local 2768 struct isl_vec *sample; local 2808 struct isl_vec *sample; local [all...] |
H A D | isl_convex_hull.c | 1162 struct isl_vec *sample = NULL; local 1173 sample = isl_tab_get_sample_value(tab); 1176 if (!sample) 1185 isl_int_set(dir->block.data[0], sample->block.data[n]); n++; 1187 isl_int_sub(sample->block.data[n], 1188 sample->block.data[n], sample->block.data[n+1]); 1191 sample->block.data[n], bset1->eq[i], 1 + d); 1198 sample->block.data[n++], bset1->ineq[i], 1 + d); 1199 isl_vec_free(sample); [all...] |
H A D | isl_tab.h | 79 * The sample value of the tableau is the value that assigns zero 82 * The operations on the tableau maintain the property that the sample 291 __isl_take isl_vec *sample) WARN_UNUSED;
|
H A D | isl_union_map.c | 1957 isl_basic_map **sample = (isl_basic_map **)user; local 1960 *sample = isl_map_sample(isl_map_copy(map)); 1961 if (!*sample) 1963 if (!isl_basic_map_plain_is_empty(*sample)) 1970 isl_basic_map *sample = NULL; local 1976 &sample_entry, &sample) < 0 && 1977 !sample) 1980 if (!sample) 1981 sample = isl_basic_map_empty(isl_union_map_get_space(umap)); 1985 return sample; [all...] |
H A D | isl_vertices.c | 863 isl_vec *sample = NULL; local 891 sample = isl_tab_get_sample_value(tab); 894 selection[i] = isl_basic_set_contains(vertices->v[i].dom, sample); 953 isl_vec_free(sample); 969 isl_vec_free(sample);
|
H A D | isl_point.c | 304 static int foreach_point(struct isl_scan_callback *cb, __isl_take isl_vec *sample) argument 309 pnt = isl_point_alloc(isl_space_copy(fp->dim), sample);
|
H A D | isl_map.c | 845 bmap->sample = NULL; 950 dup->sample = isl_vec_copy(bmap->sample); 1020 isl_vec_free(bmap->sample); 1466 ext->sample = isl_vec_copy(base->sample); 1670 isl_vec_free(bmap->sample); 1671 bmap->sample = NULL; 2769 struct isl_vec *sample = NULL; local 2787 if (bmap1->sample 7900 struct isl_vec *sample = NULL; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | crash1.C | 10 extern Sample sample; 28 sample << "hello";
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | volatile5.f90 | 11 subroutine sample subroutine in module:volmod 20 end subroutine sample
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | cvt5.C | 5 void sample(const unsigned long (&an_array)[3]); 11 static void sample(const Array &an_array); 25 sample(a.array); 26 Sample::sample(a.array);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr38554.c | 1 typedef unsigned long sample; typedef 4 sample maxval; 6 typedef sample *tuple; 31 sample const inSample = inputRow[col][plane]; 32 sample outSample;
|
/haiku-buildtools/binutils/gprof/ |
H A D | hist.h | 31 int *sample; /* Histogram samples (shorts in the file!). */ 38 each sample covers HIST_SCALE bytes. */ 30 int *sample; /* Histogram samples (shorts in the file!). */ member in struct:histogram
|
H A D | hist.c | 210 record->sample = (int *) xmalloc (record->num_bins 211 * sizeof (record->sample[0])); 212 memset (record->sample, 0, record->num_bins * sizeof (record->sample[0])); 234 record->sample[i] += bfd_get_16 (core_bfd, (bfd_byte *) & count[0]); 240 record->sample[i])); 274 bfd_put_16 (core_bfd, (bfd_vma) record->sample[i], (bfd_byte *) &count[0]); 335 sample that is to be credited to the symbol which starts at 357 addresses, this should allow us to have only one sample for every 373 /* Iterate over all sample bin [all...] |
H A D | gmon_io.c | 502 histograms->sample = (int *) xmalloc (hist_num_bins * sizeof (int)); 503 memset (histograms->sample, 0, 536 histograms->sample[i] 718 bfd_put_16 (core_bfd, (bfd_vma) histograms->sample[i],
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/algorithm/ |
H A D | sample.cc | 29 using std::experimental::sample; 39 // population smaller than desired sample size 40 auto it = sample(pop, pop + 2, samp, 10, rng); 51 auto it = sample(pop, std::end(pop), samp, 10, rng); 66 auto it = sample(istream_iterator<int>{pop}, {}, samp, 5, rng); 81 sample(pop.begin(), pop.end(), ostream_iterator<int>{samp, " "}, 5, rng);
|
/haiku-buildtools/gcc/contrib/ |
H A D | compare_two_ftime_report_sets | 34 version constitutes a sample. The ouput of the script is a description 235 # expressed as a multiple of the standard deviation of the sample 368 """ A description of a sample using an arithmetic mean. """ 426 message = "The " + self.larger + " sample appears to be " 451 # each containing a whole sample consisting of single number per line. 465 # text = "\nArithmetic sample for data file\n\"" + filename + "\"" 469 # sample = sample_from_values(values, alpha) 470 # print sample 471 # return sample 506 # files. Each set is a sample, wher [all...] |