Home
last modified time | relevance | path

Searched refs:n_in (Results 1 – 25 of 28) sorted by relevance

12

/external/libgsm/tls/
Dsour.c55 int n_in = 0; variable
74 n_in += sp->varsize;
76 while (n_in >= BYTE_BITS) {
78 WORD_BITS - n_in);
79 n_in -= BYTE_BITS;
83 while (n_in >= BYTE_BITS) {
84 printf("*c++ = sr >> %d;\n", WORD_BITS - n_in);
85 n_in -= BYTE_BITS;
88 if (n_in > 0) {
89 fprintf(stderr, "warning: %d bits left over\n", n_in);
Dginger.c33 int n_in = 0; variable
39 while (n_in < sp->varsize) {
40 if (n_in) printf("sr |= (uword)*c++ << %d;\n", n_in);
42 n_in += BYTE_BITS;
48 n_in -= sp->varsize;
51 if (n_in > 0) {
52 fprintf(stderr, "%d bits left over\n", n_in);
/external/llvm-project/polly/lib/External/isl/
Disl_tab_lexopt_templ.c56 unsigned n_in, n_out, n_div; in SF() local
70 n_in = bmap_param + bmap_in; in SF()
71 n_out = bmap_all - n_in; in SF()
81 isl_seq_cpy(var->el, bmap->ineq[first] + 1 + n_in, n_out); in SF()
83 if (isl_seq_eq(var->el, bmap->ineq[i] + 1 + n_in, n_out) && in SF()
84 all_single_occurrence(bmap, i, n_in)) in SF()
88 cst = isl_mat_alloc(ctx, n, 1 + n_in); in SF()
93 isl_seq_cpy(cst->row[i], bmap->ineq[list[i]], 1 + n_in); in SF()
107 isl_seq_clr(bmap->ineq[k], 1 + n_in); in SF()
108 isl_int_set_si(bmap->ineq[k][1 + n_in], 1); in SF()
[all …]
Disl_domain_factor_templ.c53 isl_size n, n_in; in FN() local
60 n_in = isl_space_dim(space, isl_dim_set); in FN()
61 if (n < 0 || n_in < 0) in FN()
64 obj = FN(TYPE,drop_domain)(obj, n_in, n - n_in); in FN()
Disl_space.c29 unsigned nparam, unsigned n_in, unsigned n_out) in isl_space_alloc() argument
41 space->n_in = n_in; in isl_space_alloc()
74 if (space->n_in != 0 || space->nested[0]) in isl_space_is_set()
167 if (space->n_in != 0 || space->nested[0] || in isl_space_is_params()
206 return pos + space->nparam + space->n_in; in global_pos()
307 case isl_dim_out: return space->nparam + space->n_in; in offset()
316 case isl_dim_in: return space->n_in; in n()
319 return space->nparam + space->n_in + space->n_out; in n()
383 space->nparam, space->n_in, space->n_out); in isl_space_dup()
1056 unsigned nparam, unsigned n_in, unsigned n_out) in space_extend() argument
[all …]
Disl_multi_identity_templ.c21 isl_size n_in, n_out; in MULTI() local
32 n_in = isl_space_dim(space, isl_dim_in); in MULTI()
34 if (n_in < 0 || n_out < 0) in MULTI()
36 if (n_in != n_out) in MULTI()
Disl_bound.c116 isl_size n_in; in guarded_poly_bound() local
123 n_in = isl_space_dim(bound->dim, isl_dim_in); in guarded_poly_bound()
124 if (nparam < 0 || n_in < 0) in guarded_poly_bound()
128 isl_dim_set, 0, n_in); in guarded_poly_bound()
130 isl_dim_in, 0, n_in); in guarded_poly_bound()
Disl_stride.c377 isl_size n_in; in isl_map_get_range_stride_info() local
379 n_in = isl_map_dim(map, isl_dim_in); in isl_map_get_range_stride_info()
380 if (n_in < 0) in isl_map_get_range_stride_info()
385 si = isl_set_get_stride_info(set, n_in); in isl_map_get_range_stride_info()
Disl_map.c75 case isl_dim_out: return 1 + space->nparam + space->n_in; in pos()
1302 isl_assert(space->ctx, space->n_in == 0, goto error); in isl_basic_set_alloc_space()
1893 isl_size total, n_param, n_in, n_out, n_div; in add_constraints() local
1905 n_in = isl_basic_map_dim(bmap2, isl_dim_in); in add_constraints()
1910 if (total < 0 || n_param < 0 || n_in < 0 || n_out < 0 || n_div < 0) in add_constraints()
1915 isl_dim_map_dim_range(dim_map, space, isl_dim_in, 0, n_in, o_in); in add_constraints()
3344 bmap->dim->nparam, bmap->dim->n_in, bmap->dim->n_out, in isl_basic_map_print_internal()
3481 map->ref, map->n, map->dim->nparam, map->dim->n_in, in isl_map_print_internal()
4680 isl_size n_in, n_out, n, nparam; in isl_basic_map_apply_range() local
4689 n_in = isl_basic_map_dim(bmap1, isl_dim_in); in isl_basic_map_apply_range()
[all …]
Disl_aff.c3973 isl_size n_in; in isl_multi_aff_domain_map() local
3983 n_in = isl_space_dim(space, isl_dim_in); in isl_multi_aff_domain_map()
3984 if (n_in < 0) in isl_multi_aff_domain_map()
3989 if (n_in == 0) { in isl_multi_aff_domain_map()
3996 for (i = 0; i < n_in; ++i) { in isl_multi_aff_domain_map()
4016 isl_size n_in, n_out; in isl_multi_aff_range_map() local
4026 n_in = isl_space_dim(space, isl_dim_in); in isl_multi_aff_range_map()
4028 if (n_in < 0 || n_out < 0) in isl_multi_aff_range_map()
4044 isl_dim_set, n_in + i); in isl_multi_aff_range_map()
4935 isl_size n_in; in pw_multi_aff_from_map_div() local
[all …]
Disl_bernstein.c267 isl_size n_in; in bernstein_coefficients_cell() local
275 n_in = isl_qpolynomial_dim(poly, isl_dim_in); in bernstein_coefficients_cell()
276 if (n_in < 0) in bernstein_coefficients_cell()
279 nvar = n_in - 1; in bernstein_coefficients_cell()
Disl_tab_pip.c4560 unsigned n_in; member
4574 eq = isl_seq_eq((*row) + 1 + info->n_in, info->val, info->n_out); in constraint_equal()
4597 isl_size nparam, n_in, n_out, n_div; in parallel_constraints() local
4605 n_in = isl_basic_map_dim(bmap, isl_dim_in); in parallel_constraints()
4608 if (nparam < 0 || n_in < 0 || n_out < 0 || n_div < 0) in parallel_constraints()
4610 info.n_in = nparam + n_in; in parallel_constraints()
4611 occurrences = count_occurrences(bmap, info.n_in); in parallel_constraints()
4612 if (info.n_in && !occurrences) in parallel_constraints()
4618 info.val = bmap->ineq[i] + 1 + info.n_in; in parallel_constraints()
4623 if (!single_occurrence(info.n_in, bmap->ineq[i] + 1, in parallel_constraints()
[all …]
Disl_output.c67 isl_size n_in = isl_basic_map_dim(bmap, isl_dim_in); in print_constraint_polylib() local
72 if (n_in < 0 || n_out < 0 || nparam < 0) in print_constraint_polylib()
79 p = isl_printer_print_isl_int(p, c[1+nparam+n_in+i]); in print_constraint_polylib()
81 for (i = 0; i < n_in; ++i) { in print_constraint_polylib()
87 p = isl_printer_print_isl_int(p, c[1+nparam+n_in+n_out+i]); in print_constraint_polylib()
133 isl_size n_in = isl_basic_map_dim(bmap, isl_dim_in); in isl_basic_map_print_polylib() local
138 if (n_in < 0 || n_out < 0 || n_div < 0 || nparam < 0) in isl_basic_map_print_polylib()
144 p = isl_printer_print_int(p, n_in); in isl_basic_map_print_polylib()
243 isl_size n_in = isl_space_dim(space, isl_dim_in); in pos2type() local
247 if (n_in < 0 || n_out < 0 || nparam < 0) in pos2type()
[all …]
Disl_local_space.c268 case isl_dim_out: return 1 + space->nparam + space->n_in; in isl_local_space_offset()
270 return 1 + space->nparam + space->n_in + space->n_out; in isl_local_space_offset()
922 isl_size n_in; in isl_local_space_range() local
924 n_in = isl_local_space_dim(ls, isl_dim_in); in isl_local_space_range()
925 if (n_in < 0) in isl_local_space_range()
927 ls = isl_local_space_drop_dims(ls, isl_dim_in, 0, n_in); in isl_local_space_range()
Disl_space_private.h15 unsigned n_in; /* zero for sets */ member
Disl_flow.c735 isl_size n_in = isl_map_dim(acc->source[j].map, isl_dim_in); in intermediate_sources() local
736 int depth = 2 * n_in + 1; in intermediate_sources()
738 if (n_in < 0) in intermediate_sources()
852 isl_size n_in = isl_map_dim(acc->source[acc->n_must + j].map, in all_intermediate_sources() local
854 int depth = 2 * n_in + 1; in all_intermediate_sources()
856 if (n_in < 0) in all_intermediate_sources()
1157 isl_size n_in; in compute_val_based_dependences() local
1170 n_in = isl_map_dim(acc->sink.map, isl_dim_in); in compute_val_based_dependences()
1171 if (n_in < 0) in compute_val_based_dependences()
1173 depth = 2 * n_in + 1; in compute_val_based_dependences()
Disl_fold.c1554 isl_size n_in; in isl_map_apply_pw_qpolynomial_fold() local
1572 n_in = isl_map_dim(map, isl_dim_in); in isl_map_apply_pw_qpolynomial_fold()
1573 if (n_in < 0) in isl_map_apply_pw_qpolynomial_fold()
1575 pwf = isl_pw_qpolynomial_fold_insert_dims(pwf, isl_dim_in, 0, n_in); in isl_map_apply_pw_qpolynomial_fold()
Disl_input.c2129 isl_size n_out, n_in, n_param, n_div; in polylib_pos_to_isl_pos() local
2132 n_in = isl_basic_map_dim(bmap, isl_dim_in); in polylib_pos_to_isl_pos()
2135 if (n_param < 0 || n_in < 0 || n_out < 0 || n_div < 0) in polylib_pos_to_isl_pos()
2139 return 1 + n_param + n_in + pos; in polylib_pos_to_isl_pos()
2142 if (pos < n_in) in polylib_pos_to_isl_pos()
2144 pos -= n_in; in polylib_pos_to_isl_pos()
2147 return 1 + n_param + n_in + n_out + pos; in polylib_pos_to_isl_pos()
Disl_convex_hull.c832 isl_size n_in = isl_basic_map_dim(bmap, isl_dim_in); in isl_basic_map_image_is_bounded() local
835 if (nparam < 0 || n_in < 0) in isl_basic_map_image_is_bounded()
841 isl_dim_in, 0, n_in); in isl_basic_map_image_is_bounded()
Disl_scheduler.c7328 isl_size n_in, n_out, n; in compute_weights() local
7352 n_in = isl_basic_map_dim(hull, isl_dim_in); in compute_weights()
7354 if (n_in < 0 || n_out < 0) in compute_weights()
7357 isl_dim_in, 0, n_in); in compute_weights()
/external/libwebsockets/lib/roles/http/compression/brotli/
Dbrotli.c52 const uint8_t *n_in; in lcs_process_brotli() local
56 n_in = (void *)in; in lcs_process_brotli()
74 if (BrotliEncoderCompressStream(ctx->u.br_en, n, &a_in, &n_in, in lcs_process_brotli()
85 n = BrotliDecoderDecompressStream(ctx->u.br_de, &a_in, &n_in, in lcs_process_brotli()
/external/tensorflow/tensorflow/core/kernels/
Dnth_element_op.cc42 const auto& n_in = context->input(1); in Compute() local
44 context, TensorShapeUtils::IsScalar(n_in.shape()), in Compute()
45 errors::InvalidArgument("N must be scalar but has rank ", n_in.dims())); in Compute()
46 int n = n_in.scalar<int32>()(); in Compute()
/external/libaom/libaom/test/
Dfft_test.cc81 FFTTestArg(int n_in, tform_fun_t fft_in) : n(n_in), fft(fft_in) {} in FFTTestArg()
165 IFFTTestArg(int n_in, tform_fun_t ifft_in) : n(n_in), ifft(ifft_in) {} in IFFTTestArg()
/external/llvm-project/polly/lib/External/isl/include/isl/
Dspace.h26 unsigned nparam, unsigned n_in, unsigned n_out);
78 unsigned nparam, unsigned n_in, unsigned n_out);
/external/libxml2/
Dtestapi.c1308 int n_in; in test_UTF8ToHtml() local
1314 for (n_in = 0;n_in < gen_nb_const_unsigned_char_ptr;n_in++) { in test_UTF8ToHtml()
1319 in = gen_const_unsigned_char_ptr(n_in, 2); in test_UTF8ToHtml()
1327 des_const_unsigned_char_ptr(n_in, (const unsigned char *)in, 2); in test_UTF8ToHtml()
1336 printf(" %d", n_in); in test_UTF8ToHtml()
1937 int n_in; in test_htmlEncodeEntities() local
1945 for (n_in = 0;n_in < gen_nb_const_unsigned_char_ptr;n_in++) { in test_htmlEncodeEntities()
1951 in = gen_const_unsigned_char_ptr(n_in, 2); in test_htmlEncodeEntities()
1960 des_const_unsigned_char_ptr(n_in, (const unsigned char *)in, 2); in test_htmlEncodeEntities()
1970 printf(" %d", n_in); in test_htmlEncodeEntities()
[all …]

12