| /src/external/mit/isl/dist/ |
| isl_tab.c | 37 struct isl_tab *tab; local
40 tab = isl_calloc_type(ctx, struct isl_tab);
41 if (!tab)
43 tab->mat = isl_mat_alloc(ctx, n_row, off + n_var);
44 if (!tab->mat)
46 tab->var = isl_alloc_array(ctx, struct isl_tab_var, n_var);
47 if (n_var && !tab->var)
49 tab->con = isl_alloc_array(ctx, struct isl_tab_var, n_row);
50 if (n_row && !tab->con)
52 tab->col_var = isl_alloc_array(ctx, int, n_var)
2388 struct isl_tab *tab; local
2437 struct isl_tab *tab; local
3128 struct isl_tab *tab = user; local
3143 struct isl_tab *tab = user; local
[all...] |
| isl_tab_pip.c | 69 /* detect nonnegative parameters in context and mark them in tab */
71 struct isl_context *context, struct isl_tab *tab);
94 int (*get_div)(struct isl_context *context, struct isl_tab *tab,
100 struct isl_tab *tab);
102 int (*best_split)(struct isl_context *context, struct isl_tab *tab);
131 struct isl_tab *tab; member in struct:isl_context_lex
627 struct isl_tab *tab; local
633 tab = sol->context->op->peek_tab(sol->context);
634 if (isl_tab_push_callback(tab, &sol->dec_level.callback) < 0)
652 * tab->n_var is equal to the total number of variables in the inpu
2330 struct isl_tab *tab; local
2858 struct isl_tab *tab; local
2908 struct isl_tab *tab; member in struct:isl_context_gbr
4451 struct isl_tab *tab; local
5085 struct isl_tab *tab; member in struct:isl_lexmin_data
5582 struct isl_tab *tab; member in struct:isl_tab_lexmin
[all...] |
| isl_tab.h | 186 void isl_tab_free(struct isl_tab *tab);
188 isl_ctx *isl_tab_get_ctx(struct isl_tab *tab);
196 isl_bool isl_tab_cone_is_bounded(struct isl_tab *tab);
198 __isl_take isl_basic_map *bmap, struct isl_tab *tab);
200 __isl_take isl_basic_set *bset, struct isl_tab *tab);
201 int isl_tab_detect_implicit_equalities(struct isl_tab *tab) WARN_UNUSED;
202 __isl_give isl_basic_map *isl_tab_make_equalities_explicit(struct isl_tab *tab,
204 int isl_tab_detect_redundant(struct isl_tab *tab) WARN_UNUSED;
205 isl_stat isl_tab_restore_redundant(struct isl_tab *tab);
207 enum isl_lp_result isl_tab_min(struct isl_tab *tab,
[all...] |
| isl_basis_reduction.h | 21 struct isl_tab *isl_tab_compute_reduced_basis(struct isl_tab *tab);
|
| basis_reduction_templ.c | 28 /* Compute a reduced basis for the set represented by the tableau "tab".
29 * tab->basis, which must be initialized by the calling function to an affine
31 * The first tab->n_zero rows of the basis (ignoring the constant row)
33 * tab->n_zero is updated to reflect any additional equalities that
35 * The final tab->n_unbounded rows of the basis are assumed to correspond
49 struct isl_tab *isl_tab_compute_reduced_basis(struct isl_tab *tab)
76 if (!tab)
79 if (tab->empty)
80 return tab;
82 ctx = tab->mat->ctx
319 struct isl_tab *tab; local
[all...] |
| /src/usr.bin/xlint/lint1/ |
| makeman | 33 tab=' '
37 -e 's|^'"$tab"'"(.+)",.*// '"$2"'([0-9]+)$|\2'"$tab"'\1|p' \
38 -e 's|^'"$tab"'"",.*// '"$2"'[0-9]+$|---'"$tab"'(no longer used)|p' \
|
| /src/external/gpl3/binutils/dist/bfd/ |
| elf-strtab.c | 132 _bfd_elf_strtab_free (struct elf_strtab_hash *tab)
134 bfd_hash_table_free (&tab->table);
135 free (tab->array);
136 free (tab);
143 _bfd_elf_strtab_add (struct elf_strtab_hash *tab,
154 BFD_ASSERT (tab->sec_size == 0);
156 bfd_hash_lookup (&tab->table, str, true, copy);
167 if (tab->size == tab->alloced)
170 tab->alloced *= 2
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| elf-strtab.c | 132 _bfd_elf_strtab_free (struct elf_strtab_hash *tab)
134 bfd_hash_table_free (&tab->table);
135 free (tab->array);
136 free (tab);
143 _bfd_elf_strtab_add (struct elf_strtab_hash *tab,
154 BFD_ASSERT (tab->sec_size == 0);
156 bfd_hash_lookup (&tab->table, str, true, copy);
167 if (tab->size == tab->alloced)
170 tab->alloced *= 2
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| elf-strtab.c | 132 _bfd_elf_strtab_free (struct elf_strtab_hash *tab)
134 bfd_hash_table_free (&tab->table);
135 free (tab->array);
136 free (tab);
143 _bfd_elf_strtab_add (struct elf_strtab_hash *tab,
154 BFD_ASSERT (tab->sec_size == 0);
156 bfd_hash_lookup (&tab->table, str, true, copy);
167 if (tab->size == tab->alloced)
170 tab->alloced *= 2
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| elf-strtab.c | 132 _bfd_elf_strtab_free (struct elf_strtab_hash *tab)
134 bfd_hash_table_free (&tab->table);
135 free (tab->array);
136 free (tab);
143 _bfd_elf_strtab_add (struct elf_strtab_hash *tab,
154 BFD_ASSERT (tab->sec_size == 0);
156 bfd_hash_lookup (&tab->table, str, true, copy);
167 if (tab->size == tab->alloced)
170 tab->alloced *= 2
[all...] |
| /src/tests/usr.bin/indent/ |
| opt_di.c | 10 int tab; variable
18 int tab; variable
62 * default configuration, the next tab stop would be at indentation 8.
68 /* The indentation consists of a single tab. */
73 /* The indentation consists of a tab and a space. */
85 * which in the default configuration amounts to a single tab.
89 int tab; variable
96 int tab; variable
|
| /src/external/lgpl3/mpfr/dist/tests/ |
| tdot.c | 28 mpfr_t tab[3], r; local
35 mpfr_init2 (tab[i], 16);
36 mpfr_set_ui (tab[i], 1, MPFR_RNDN);
37 tabp[i] = tab[i];
47 mpfr_clears (tab[0], tab[1], tab[2], r, (mpfr_ptr) 0);
53 mpfr_t tab[3], r; local
58 mpfr_inits2 (53, tab[0], tab[1], tab[2], r, (mpfr_ptr) 0)
[all...] |
| /src/sys/arch/hpc/stand/hpcboot/sh3/ |
| sh_console.cpp | 53 const struct console_info *tab = _console_info; local
60 for (; tab->cpu; tab++) {
61 entry.dw.dw0 = tab->cpu;
62 entry.dw.dw1 = tab->machine;
66 cons.setBootConsole(tab->serial_console);
67 return tab;
69 cons.setBootConsole(tab->video_console);
70 return tab;
96 const struct console_info *tab = selectBootConsole(*this, SERIAL) local
[all...] |
| /src/sys/arch/powerpc/booke/ |
| e500_autoconf.c | 95 const struct e500_truthtab *tab, size_t ntab, u_int default_value)
99 for (u_int i = ntab; i-- > 0; tab++) {
102 __func__, i, tab->tt_svrhi, svr,
103 tab->tt_instance, instance,
104 data, tab->tt_mask, data & tab->tt_mask, tab->tt_value);
106 if (tab->tt_svrhi == svr
107 && tab->tt_instance == instance
108 && (data & tab->tt_mask) == tab->tt_value
[all...] |
| /src/tests/lib/libc/string/ |
| t_strrchr.c | 29 struct tab { struct
36 const struct tab tab[] = { local
220 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
221 strcpy(&buf[a], tab[t].val);
224 if (tab[t].match == 0) {
230 } else if (tab[t].match == 1) {
231 if (tab[t].l_off != (off - &buf[a])) {
|
| t_strcat.c | 30 struct tab { struct
35 const struct tab tab[] = { local
88 for (t0 = 0; t0 < __arraycount(tab); ++t0) {
89 for (t1 = 0; t1 < __arraycount(tab); ++t1) {
91 memcpy(&buf0[a0], tab[t0].val,
92 tab[t0].len + 1);
93 memcpy(&buf1[a1], tab[t1].val,
94 tab[t1].len + 1);
111 if (memcmp(&buf0[a0] + tab[t0].len
[all...] |
| t_strcmp.c | 30 struct tab { struct
36 const struct tab tab[] = { local
78 for (t = 0; t < __arraycount(tab); ++t) {
79 memcpy(&buf0[a0], tab[t].val0,
80 strlen(tab[t].val0) + 1);
81 memcpy(&buf1[a1], tab[t].val1,
82 strlen(tab[t].val1) + 1);
86 if ((ret == 0 && tab[t].ret != 0) ||
87 (ret < 0 && tab[t].ret >= 0) |
[all...] |
| t_strcpy.c | 30 struct tab { struct
35 const struct tab tab[] = { local
88 for (t = 0; t < (sizeof(tab) / sizeof(tab[0])); ++t) {
90 memcpy(&buf1[a1], tab[t].val, tab[t].len + 1);
108 tab[t].len + 1) != 0) {
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| iptable.c | 34 dns_iptable_t *tab; local
36 tab = isc_mem_get(mctx, sizeof(*tab));
37 tab->mctx = NULL;
38 isc_mem_attach(mctx, &tab->mctx);
39 isc_refcount_init(&tab->refcount, 1);
40 tab->radix = NULL;
41 tab->magic = DNS_IPTABLE_MAGIC;
43 result = isc_radix_create(mctx, &tab->radix, RADIX_MAXBITS);
48 *target = tab;
156 dns_iptable_t *tab = *tabp; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/container/ |
| hashtab.d | 232 HashTab!(int, int) tab;
235 tab[i] = 100 - i;
238 assert(tab[i] == 100 - i);
240 foreach (k, v; tab)
244 tab.remove(2 * i);
246 assert(tab.length == 50);
249 assert(tab[2 * i + 1] == 100 - 2 * i - 1);
251 assert(tab.length == 50);
253 tab.reset();
254 assert(tab.empty)
[all...] |
| /src/sys/arch/hpc/stand/hpcboot/ |
| framebuffer.cpp | 45 struct framebuffer_info *tab = _table; local
57 for (; tab->cpu; tab++) {
58 entry.dw.dw0 = tab->cpu;
59 entry.dw.dw1 = tab->machine;
61 if (tab->bpp == bpp) {
62 _fb = tab;
65 alt = tab;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-ter.cc | 259 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
262 version_to_be_replaced_p (temp_expr_table *tab, int version)
264 if (!tab->replaceable_expressions)
266 return bitmap_bit_p (tab->replaceable_expressions, version);
270 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
274 make_dependent_on_partition (temp_expr_table *tab, int version, int p)
276 if (!tab->partition_dependencies[version])
277 tab->partition_dependencies[version] = BITMAP_ALLOC (&ter_bitmap_obstack);
279 bitmap_set_bit (tab->partition_dependencies[version], p);
283 /* Add VER to the kill list for P. TAB is the expression table *
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-ter.cc | 259 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
262 version_to_be_replaced_p (temp_expr_table *tab, int version)
264 if (!tab->replaceable_expressions)
266 return bitmap_bit_p (tab->replaceable_expressions, version);
270 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
274 make_dependent_on_partition (temp_expr_table *tab, int version, int p)
276 if (!tab->partition_dependencies[version])
277 tab->partition_dependencies[version] = BITMAP_ALLOC (&ter_bitmap_obstack);
279 bitmap_set_bit (tab->partition_dependencies[version], p);
283 /* Add VER to the kill list for P. TAB is the expression table *
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| gmon_symtab.cc | 104 symtab_finalize (Sym_Table *tab)
109 if (!tab->len)
113 qsort (tab->base, tab->len, sizeof (Sym), cmp_addr);
117 prev_addr = tab->base[0].addr - 1;
119 for (src = dst = tab->base; src < tab->limit; ++src)
162 if (dst > tab->base && dst[-1].end_addr == 0)
175 if (tab->len > 0 && dst > tab->base && dst[-1].end_addr == 0
[all...] |
| /src/external/bsd/libevent/dist/test/ |
| regress_testutils.c | 155 struct regress_dns_server_table *tab = data; local
164 while (tab->q && evutil_ascii_strcasecmp(question, tab->q) &&
165 strcmp("*", tab->q))
166 ++tab;
167 if (tab->q == NULL)
170 ++tab->seen;
172 if (tab->lower)
175 if (!strcmp(tab->anstype, "err")) {
176 int err = atoi(tab->ans)
[all...] |
