Home
last modified time | relevance | path

Searched refs:tab (Results 1 – 25 of 101) sorted by relevance

12345

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_tab.c88 tab->top = &tab->bottom; in isl_tab_alloc()
127 tab->mat = isl_mat_extend(tab->mat, in isl_tab_extend_cons()
162 tab->max_var = tab->n_var + n_new; in isl_tab_extend_vars()
168 tab->mat = isl_mat_extend(tab->mat, in isl_tab_extend_vars()
904 tab->sample_index[tab->n_sample] = tab->n_sample; in isl_tab_add_sample()
917 tab->sample_index[tab->n_outside] = tab->sample_index[s]; in isl_tab_drop_sample()
1778 tab->col_var[tab->n_col] = r; in isl_tab_insert_var()
1847 if (tab->M && i >= tab->n_param && i < tab->n_var - tab->n_div) in isl_tab_add_row()
3039 p = tab->con[i].is_row ? tab->row_var : tab->col_var; in update_con_after_move()
3386 tab->dual = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_con); in isl_tab_min()
[all …]
H A Disl_tab_pip.c738 if (tab->var[tab->n_var - tab->n_div+j].is_row) in sol_add()
740 col = tab->var[tab->n_var - tab->n_div+j].index; in sol_add()
857 if (tab->var[tab->n_var - tab->n_div + i].is_row) in get_row_parameter_line()
887 tab->n_var - tab->n_div + i - tab->n_param; in identical_parameter_line()
1047 tab->mat->row[row][0], 1 + tab->M + tab->n_col); in set_row_cst_to_div()
1109 if (tab->var[tab->n_var - tab->n_div + i].is_row) in is_obviously_neg()
1111 col = tab->var[tab->n_var - tab->n_div + i].index; in is_obviously_neg()
1158 if (tab->var[tab->n_var - tab->n_div + i].is_row) in is_obviously_nonneg()
2341 n_var = tab->n_var - tab->n_param - tab->n_div; in tab_for_lexmin()
3348 tab->n_var - tab->n_param - tab->n_div); in propagate_equalities()
[all …]
H A Disl_tab.h185 void isl_tab_free(struct isl_tab *tab);
187 isl_ctx *isl_tab_get_ctx(struct isl_tab *tab);
206 enum isl_lp_result isl_tab_min(struct isl_tab *tab,
225 int isl_tab_sample_is_integer(struct isl_tab *tab);
241 isl_bool isl_tab_need_undo(struct isl_tab *tab);
242 void isl_tab_clear_undo(struct isl_tab *tab);
248 void isl_tab_dump(__isl_keep struct isl_tab *tab);
297 struct isl_tab *isl_tab_dup(struct isl_tab *tab);
312 isl_stat isl_tab_push_var(struct isl_tab *tab,
317 int isl_tab_add_sample(struct isl_tab *tab,
[all …]
H A Disl_sample.c162 n_eq = tab->n_var - tab->n_col + tab->n_dead; in tab_equalities()
174 if (tab->con[i].index >= 0 && tab->con[i].index >= tab->n_dead) in tab_equalities()
204 tab->n_zero = n_eq = tab->n_var - tab->n_col + tab->n_dead; in initial_basis()
398 tab->basis = initial_basis(tab); in isl_tab_sample()
401 isl_assert(tab->mat->ctx, tab->basis->n_row == tab->n_var + 1, in isl_tab_sample()
403 isl_assert(tab->mat->ctx, tab->basis->n_col == tab->n_var + 1, in isl_tab_sample()
410 if (tab->n_unbounded == tab->n_var) { in isl_tab_sample()
475 if (!tab || !tab->basis) in isl_tab_sample()
655 if (tab && tab->empty) { in sample_bounded()
1096 tab->basis = initial_basis(tab); in isl_tab_set_initial_basis_with_cone()
[all …]
H A Dbasis_reduction_templ.c76 if (!tab) in isl_tab_compute_reduced_basis()
79 if (tab->empty) in isl_tab_compute_reduced_basis()
80 return tab; in isl_tab_compute_reduced_basis()
85 B = tab->basis; in isl_tab_compute_reduced_basis()
87 return tab; in isl_tab_compute_reduced_basis()
91 return tab; in isl_tab_compute_reduced_basis()
305 return tab; in isl_tab_compute_reduced_basis()
327 if (!tab) in isl_basic_set_reduced_basis()
340 tab->basis = isl_mat_lin_to_aff(tab->basis); in isl_basic_set_reduced_basis()
344 tab = isl_tab_compute_reduced_basis(tab); in isl_basic_set_reduced_basis()
[all …]
H A Disl_vertices.c460 if (!tab) in isl_basic_set_compute_vertices()
675 for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i) in add_chamber()
750 for (i = 0; i < tab->n_con && tab->con[i].frozen; ++i) in create_todo()
774 todo->tab = isl_tab_dup(tab); in create_todo()
945 if (!tab) in compute_chambers()
985 if (isl_tab_freeze_constraint(tab, tab->n_con - 1) < 0) in compute_chambers()
1035 if (!tab) in compute_chambers()
1189 if (!tab) in tab_for_shifted_cone()
1195 return tab; in tab_for_shifted_cone()
1216 return tab; in tab_for_shifted_cone()
[all …]
H A Disl_affine_hull.c52 isl_tab_free(tab); in isl_basic_map_implicit_equalities()
274 if (!tab) in outside_point()
528 if (!tab) in uset_affine_hull_bounded()
640 isl_assert(tab->mat->ctx, tab->bmap, goto error); in isl_tab_detect_equalities()
641 isl_assert(tab->mat->ctx, tab->samples, goto error); in isl_tab_detect_equalities()
642 isl_assert(tab->mat->ctx, tab->samples->n_col == 1 + tab->n_var, goto error); in isl_tab_detect_equalities()
643 isl_assert(tab->mat->ctx, tab->n_sample > tab->n_outside, goto error); in isl_tab_detect_equalities()
648 sample = isl_vec_alloc(tab->mat->ctx, 1 + tab->n_var); in isl_tab_detect_equalities()
662 for (j = tab->n_outside + 1; j < tab->n_sample; ++j) { in isl_tab_detect_equalities()
676 return tab; in isl_tab_detect_equalities()
[all …]
H A Disl_map_subtract.c59 if (!tab || !bmap) in tab_add_constraints()
85 if (tab->empty) in tab_add_constraints()
93 if (tab->empty) in tab_add_constraints()
123 if (!tab || !bmap) in tab_add_constraint()
317 struct isl_tab *tab = NULL; in basic_map_collect_diff() local
350 if (!tab) in basic_map_collect_diff()
385 snap2 = isl_tab_snap(tab); in basic_map_collect_diff()
389 offset = tab->n_con; in basic_map_collect_diff()
398 if (tab->empty) { in basic_map_collect_diff()
444 isl_tab_free(tab); in basic_map_collect_diff()
[all …]
H A Dbasis_reduction_tab.c20 struct isl_tab *tab; member
123 if (!tab || !row) in gbr_tab()
126 dim = tab->n_var; in gbr_tab()
127 prod = isl_tab_product(tab, tab); in gbr_tab()
139 if (!tab) in init_lp()
151 lp->dim = tab->n_var; in init_lp()
153 lp->ctx = tab->mat->ctx; in init_lp()
161 lp->tab = gbr_tab(tab, lp->row); in init_lp()
162 if (!lp->tab) in init_lp()
243 return lp->tab->empty; in cut_lp_to_hyperplane()
[all …]
H A Disl_scan.c59 if (!tab) in add_solution()
61 sample = isl_tab_get_sample_value(tab); in add_solution()
107 struct isl_tab *tab = NULL; in isl_basic_set_scan() local
132 if (!tab) in isl_basic_set_scan()
139 tab = isl_tab_compute_reduced_basis(tab); in isl_basic_set_scan()
140 if (!tab) in isl_basic_set_scan()
142 B = isl_mat_copy(tab->basis); in isl_basic_set_scan()
169 snap[level] = isl_tab_snap(tab); in isl_basic_set_scan()
201 if (add_solution(tab, callback) < 0) in isl_basic_set_scan()
208 isl_tab_free(tab); in isl_basic_set_scan()
[all …]
H A Disl_coalesce.c199 struct isl_tab *tab; member
360 info->tab = NULL; in clear()
1473 struct isl_tab *tab) in set_from_updated_bmap() argument
2379 struct isl_tab *tab) in set_eq_status_in() argument
2391 struct isl_tab *tab) in set_ineq_status_in() argument
2395 info->ineq = ineq_status_in(info->bmap, info->tab, tab); in set_ineq_status_in()
3010 n_ineq = tab->n_con - tab->n_eq; in copy_ineq()
3090 isl_tab_select_facet(info->tab, info->tab->n_con - 1) < 0) in fix_constant_divs()
3159 n_ineq = info->tab->n_con - info->tab->n_eq; in tab_insert_divs()
4145 info[i].tab); in update_basic_maps()
[all …]
/llvm-project-15.0.7/lldb/test/Shell/Settings/
H A DTestSettingsSet.test11 settings set tab-size 16
12 settings show tab-size
13 # CHECK: tab-size (unsigned) = 16
15 settings set -f tab-size
16 settings show tab-size
17 # CHECK: tab-size (unsigned) = 4
19 settings set tab-size
/llvm-project-15.0.7/libc/AOR_v20.02/math/
H A Dv_math.h232 v_lookup_f32 (const f32_t *tab, v_u32_t idx) in v_lookup_f32() argument
234 return tab[idx]; in v_lookup_f32()
237 v_lookup_u32 (const u32_t *tab, v_u32_t idx) in v_lookup_u32() argument
239 return tab[idx]; in v_lookup_u32()
352 v_lookup_f64 (const f64_t *tab, v_u64_t idx) in v_lookup_f64() argument
354 return tab[idx]; in v_lookup_f64()
359 return tab[idx]; in v_lookup_u64()
503 return (v_f32_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]]}; in v_lookup_f32()
508 return (v_u32_t){tab[idx[0]], tab[idx[1]], tab[idx[2]], tab[idx[3]]}; in v_lookup_u32()
627 return (v_f64_t){tab[idx[0]], tab[idx[1]]}; in v_lookup_f64()
[all …]
H A Dmath_config.h308 uint64_t tab[1 << EXP2F_TABLE_BITS]; member
323 } tab[1 << LOGF_TABLE_BITS]; member
335 } tab[1 << LOG2F_TABLE_BITS]; member
352 } tab[1 << POWF_LOG2_TABLE_BITS]; member
376 uint64_t tab[2*(1 << EXP_TABLE_BITS)]; member
388 struct {double invc, logc;} tab[1 << LOG_TABLE_BITS]; member
403 struct {double invc, logc;} tab[1 << LOG2_TABLE_BITS]; member
417 struct {double invc, pad, logc, logctail;} tab[1 << POW_LOG_TABLE_BITS]; member
H A Dv_powf.c16 #define Tlog v__powf_log2_data.tab
17 #define Texp v__exp2f_data.tab
36 uint64_t tab[1 << V_EXP2F_TABLE_BITS]; member
48 } tab[1 << V_POWF_LOG2_TABLE_BITS]; member
54 .tab = {
79 .tab = {
124 .tab = {
/llvm-project-15.0.7/flang/test/Semantics/
H A Dresolve99.f9025 integer, dimension(4) :: tab local
27 FORALL (modVar=1:4) tab(modVar) = 343
40 integer, dimension(4) :: tab local
42 FORALL (iCommonName=1:4) tab(iCommonName) = 343
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/
H A Dtsan_fd.cpp34 atomic_uintptr_t tab[kTableSizeL1]; member
76 atomic_uintptr_t *pl1 = &fdctx.tab[fd / kTableSizeL2]; in fddesc()
133 FdDesc *tab = (FdDesc*)atomic_load(&fdctx.tab[l1], memory_order_relaxed); in FdOnFork() local
134 if (tab == 0) in FdOnFork()
137 FdDesc *d = &tab[l2]; in FdOnFork()
145 FdDesc *tab = (FdDesc*)atomic_load(&fdctx.tab[l1], memory_order_relaxed); in FdLocation() local
146 if (tab == 0) in FdLocation()
148 if (addr >= (uptr)tab && addr < (uptr)(tab + kTableSizeL2)) { in FdLocation()
149 int l2 = (addr - (uptr)tab) / sizeof(FdDesc); in FdLocation()
150 FdDesc *d = &tab[l2]; in FdLocation()
/llvm-project-15.0.7/llvm/test/Analysis/BasicAA/
H A D2010-09-15-GEP-SignedArithmetic.ll8 define i32 @test(i32* %tab, i32 %indvar) nounwind {
11 %t.5 = getelementptr i32, i32* %tab, i32 %tmp32
12 %loada = load i32, i32* %tab
14 %loadb = load i32, i32* %tab
H A Drecphi.ll39 ; CHECK: MustAlias: i8* %0, [2 x i32]* %tab
42 ; CHECK: MustAlias: i32* %arrayidx1, [2 x i32]* %tab
49 ; CHECK: MayAlias: i32* %p.addr.05.i, [2 x i32]* %tab
56 %tab = alloca [2 x i32], align 4
57 %ignore1 = load [2 x i32], [2 x i32]* %tab
58 %0 = bitcast [2 x i32]* %tab to i8*
95 ; CHECK: MustAlias: i8* %0, [10 x i32]* %tab
96 ; CHECK: MustAlias: i32* %arrayidx, [10 x i32]* %tab
112 %tab = alloca [10 x i32], align 4
113 %ignore1 = load [10 x i32], [10 x i32]* %tab
[all …]
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/
H A Dtsan_fd.cpp40 atomic_uintptr_t tab[kTableSizeL1]; member
82 atomic_uintptr_t *pl1 = &fdctx.tab[fd / kTableSizeL2]; in fddesc()
148 FdDesc *tab = (FdDesc*)atomic_load(&fdctx.tab[l1], memory_order_relaxed); in FdOnFork() local
149 if (tab == 0) in FdOnFork()
152 FdDesc *d = &tab[l2]; in FdOnFork()
160 FdDesc *tab = (FdDesc*)atomic_load(&fdctx.tab[l1], memory_order_relaxed); in FdLocation() local
161 if (tab == 0) in FdLocation()
163 if (addr >= (uptr)tab && addr < (uptr)(tab + kTableSizeL2)) { in FdLocation()
164 int l2 = (addr - (uptr)tab) / sizeof(FdDesc); in FdLocation()
165 FdDesc *d = &tab[l2]; in FdLocation()
/llvm-project-15.0.7/llvm/test/Analysis/CFLAliasAnalysis/Steensgaard/
H A Dgep-signed-arithmetic.ll10 %tab = alloca i32, align 4
13 %t.5 = getelementptr i32, i32* %tab, i32 %tmp32
14 %loada = load i32, i32* %tab
16 %loadb = load i32, i32* %tab
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dinit-expr-crash.cpp7 static T tab[]; member
20 static T tab[]; member
23 const int N = sizeof(B<char>::tab) / sizeof(char);
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/modernize/
H A Draw-string-literal.rst44 An escaped horizontal tab, form feed, or vertical tab prevents the string
45 literal from being converted. The presence of a horizontal tab, form feed or
46 vertical tab in source code is not visually obvious.
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dtripcount.ll8 @tab = common global [32 x i8] zeroinitializer, align 1
21 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
46 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
76 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
101 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
125 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
149 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
173 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
197 %arrayidx = getelementptr inbounds [32 x i8], [32 x i8]* @tab, i32 0, i32 %i.08
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stackdepotbase.h69 atomic_uint32_t tab[kTabSize]; // Hash table of Node's. variable
122 atomic_uint32_t *p = &tab[h % kTabSize]; in Put()
165 lock(&tab[i]); in LockAll()
172 atomic_uint32_t *p = &tab[i]; in UnlockAll()
181 atomic_uint32_t *p = &tab[i]; in PrintAll()

12345