| /dports/mail/dovecot/dovecot-2.3.17/src/lib-mail/ |
| H A D | message-header-encode.c | 94 n_in = 1; in message_header_encode_q()
100 n_in = 1; in message_header_encode_q()
107 n_in = 1; in message_header_encode_q()
120 n_in = nch; in message_header_encode_q()
125 n_in = 1; in message_header_encode_q()
130 n_in = 1; in message_header_encode_q()
168 len -= n_in; in message_header_encode_q()
213 for (n_in = 0; n_in < max;) { in message_header_encode_b()
265 n_in = 0; in message_header_encode_b()
273 n_in = 1; in message_header_encode_b()
[all …]
|
| /dports/audio/wav2cdr/wav2cdr/ |
| H A D | process.c | 109 assert ((pinfo->n_in BITAND 0x1) == 0); in process_swap_bytes()
112 for (i = 0; i < (pinfo->n_in / 2); i++) in process_swap_bytes()
133 assert ((pinfo->n_in BITAND 0x3) == 0); in process_swap_words()
136 for (i = 0; i < (pinfo->n_in / 4); i++) in process_swap_words()
157 assert ((pinfo->n_in BITAND 0x1) == 0); in process_swap_tolocal()
182 assert ((pinfo->n_in BITAND 0x1) == 0); in process_swap_totarget()
214 pinfo->n_returned = pinfo->n_in / 2; in process_tomono()
248 pinfo->n_returned = pinfo->n_in * 2; in process_tostereo()
496 if ((pinfo->n_in / 2) == 0) { in is_silent_sector()
631 if ((pinfo->n_in / 2) > 0U) { in process_silencecuts()
[all …]
|
| /dports/audio/gsm/gsm-1.0-pl19/tls/ |
| H A D | sour.c | 55 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);
|
| H A D | ginger.c | 33 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);
|
| /dports/net/pjsip/pjproject-2.11.1/third_party/gsm/tls/ |
| H A D | sour.c | 55 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);
|
| H A D | ginger.c | 33 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);
|
| /dports/audio/codec2/codec2-1.0.3/src/ |
| H A D | varicode.c | 51 while(n_in && (n_out < max_out)) { in varicode_encode1()
86 n_in--; in varicode_encode1()
105 while(n_in && (n_out < max_out)) { in varicode_encode2()
144 n_in--; in varicode_encode2()
157 assert(max_out >= 1 && n_in == 1); in varicode_encode3()
185 dec_states->n_in = 0; in varicode_decode_init()
324 n_in--; in varicode_decode1()
350 dec_states->n_in++; in varicode_decode2()
352 n_in--; in varicode_decode2()
354 if (dec_states->n_in == 2) { in varicode_decode2()
[all …]
|
| /dports/devel/serd/serd-0.30.10/src/ |
| H A D | base64.c | 52 encode_chunk(uint8_t out[4], const uint8_t in[3], size_t n_in) in encode_chunk() argument
57 out[2] = (n_in > 1) ? (b64_map[((in[1] & 0x0F) << 2) | ((in[2] & 0xC0) >> 6)]) in encode_chunk()
60 out[3] = ((n_in > 2) ? b64_map[in[2] & 0x3F] : (uint8_t)'='); in encode_chunk()
79 size_t n_in = MIN(3, size - i); in serd_base64_encode() local
80 memcpy(in, (const uint8_t*)buf + i, n_in); in serd_base64_encode()
87 encode_chunk(str + j, in, n_in); in serd_base64_encode()
117 size_t n_in = 0; in serd_base64_decode() local
118 for (; i < len && n_in < 4; ++n_in) { in serd_base64_decode()
123 in[n_in] = str[i++]; in serd_base64_decode()
126 if (n_in > 1) { in serd_base64_decode()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in, in grn_ts_expr_evaluate_to_buf() argument
162 if (!expr || (!in && n_in) || !out) { in grn_ts_expr_evaluate_to_buf()
165 if (!n_in) { in grn_ts_expr_evaluate_to_buf()
173 const grn_ts_record *in, size_t n_in, void *out) in grn_ts_expr_evaluate() argument
178 if (!expr || (!in && n_in) || (n_in && !out)) { in grn_ts_expr_evaluate()
181 if (!n_in) { in grn_ts_expr_evaluate()
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out); in grn_ts_expr_evaluate()
189 grn_ts_record *in, size_t n_in, in grn_ts_expr_filter() argument
195 if (!expr || (!in && n_in) || !out || !n_out) { in grn_ts_expr_filter()
198 if (!n_in) { in grn_ts_expr_filter()
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) { in grn_ts_expr_id_node_evaluate()
1555 for (i = 0; i < n_in; i++) { in grn_ts_expr_score_node_evaluate()
2014 for (i = 0; i < n_in; i++) { in grn_ts_expr_value_node_filter()
2299 *n_out = n_in; in grn_ts_expr_const_node_filter()
2561 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2586 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2621 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2641 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2787 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_filter()
3439 for (i = 0; i < n_in; i++) { in grn_ts_op_logical_not_evaluate()
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in, in grn_ts_expr_evaluate_to_buf() argument
162 if (!expr || (!in && n_in) || !out) { in grn_ts_expr_evaluate_to_buf()
165 if (!n_in) { in grn_ts_expr_evaluate_to_buf()
173 const grn_ts_record *in, size_t n_in, void *out) in grn_ts_expr_evaluate() argument
178 if (!expr || (!in && n_in) || (n_in && !out)) { in grn_ts_expr_evaluate()
181 if (!n_in) { in grn_ts_expr_evaluate()
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out); in grn_ts_expr_evaluate()
189 grn_ts_record *in, size_t n_in, in grn_ts_expr_filter() argument
195 if (!expr || (!in && n_in) || !out || !n_out) { in grn_ts_expr_filter()
198 if (!n_in) { in grn_ts_expr_filter()
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) { in grn_ts_expr_id_node_evaluate()
1555 for (i = 0; i < n_in; i++) { in grn_ts_expr_score_node_evaluate()
2014 for (i = 0; i < n_in; i++) { in grn_ts_expr_value_node_filter()
2299 *n_out = n_in; in grn_ts_expr_const_node_filter()
2561 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2586 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2621 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2641 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2787 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_filter()
3439 for (i = 0; i < n_in; i++) { in grn_ts_op_logical_not_evaluate()
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in,
162 if (!expr || (!in && n_in) || !out) {
165 if (!n_in) {
173 const grn_ts_record *in, size_t n_in, void *out)
178 if (!expr || (!in && n_in) || (n_in && !out)) {
181 if (!n_in) {
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out);
189 grn_ts_record *in, size_t n_in,
195 if (!expr || (!in && n_in) || !out || !n_out) {
198 if (!n_in) {
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) {
1555 for (i = 0; i < n_in; i++) {
2014 for (i = 0; i < n_in; i++) {
2299 *n_out = n_in;
2561 for (i = 0; i < n_in; i++) {
2586 for (i = 0; i < n_in; i++) {
2621 for (i = 0; i < n_in; i++) {
2641 for (i = 0; i < n_in; i++) {
2787 for (i = 0; i < n_in; i++) {
3439 for (i = 0; i < n_in; i++) {
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in, in grn_ts_expr_evaluate_to_buf() argument
162 if (!expr || (!in && n_in) || !out) { in grn_ts_expr_evaluate_to_buf()
165 if (!n_in) { in grn_ts_expr_evaluate_to_buf()
173 const grn_ts_record *in, size_t n_in, void *out) in grn_ts_expr_evaluate() argument
178 if (!expr || (!in && n_in) || (n_in && !out)) { in grn_ts_expr_evaluate()
181 if (!n_in) { in grn_ts_expr_evaluate()
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out); in grn_ts_expr_evaluate()
189 grn_ts_record *in, size_t n_in, in grn_ts_expr_filter() argument
195 if (!expr || (!in && n_in) || !out || !n_out) { in grn_ts_expr_filter()
198 if (!n_in) { in grn_ts_expr_filter()
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) { in grn_ts_expr_id_node_evaluate()
1555 for (i = 0; i < n_in; i++) { in grn_ts_expr_score_node_evaluate()
2014 for (i = 0; i < n_in; i++) { in grn_ts_expr_value_node_filter()
2299 *n_out = n_in; in grn_ts_expr_const_node_filter()
2561 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2586 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2621 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2641 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2787 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_filter()
3439 for (i = 0; i < n_in; i++) { in grn_ts_op_logical_not_evaluate()
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in, in grn_ts_expr_evaluate_to_buf() argument
162 if (!expr || (!in && n_in) || !out) { in grn_ts_expr_evaluate_to_buf()
165 if (!n_in) { in grn_ts_expr_evaluate_to_buf()
173 const grn_ts_record *in, size_t n_in, void *out) in grn_ts_expr_evaluate() argument
178 if (!expr || (!in && n_in) || (n_in && !out)) { in grn_ts_expr_evaluate()
181 if (!n_in) { in grn_ts_expr_evaluate()
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out); in grn_ts_expr_evaluate()
189 grn_ts_record *in, size_t n_in, in grn_ts_expr_filter() argument
195 if (!expr || (!in && n_in) || !out || !n_out) { in grn_ts_expr_filter()
198 if (!n_in) { in grn_ts_expr_filter()
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) {
1555 for (i = 0; i < n_in; i++) {
2014 for (i = 0; i < n_in; i++) {
2299 *n_out = n_in;
2561 for (i = 0; i < n_in; i++) {
2586 for (i = 0; i < n_in; i++) {
2621 for (i = 0; i < n_in; i++) {
2641 for (i = 0; i < n_in; i++) {
2787 for (i = 0; i < n_in; i++) {
3439 for (i = 0; i < n_in; i++) {
[all …]
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/mroonga/vendor/groonga/lib/ts/ |
| H A D | ts_expr.c | 156 const grn_ts_record *in, size_t n_in, in grn_ts_expr_evaluate_to_buf() argument
162 if (!expr || (!in && n_in) || !out) { in grn_ts_expr_evaluate_to_buf()
165 if (!n_in) { in grn_ts_expr_evaluate_to_buf()
173 const grn_ts_record *in, size_t n_in, void *out) in grn_ts_expr_evaluate() argument
178 if (!expr || (!in && n_in) || (n_in && !out)) { in grn_ts_expr_evaluate()
181 if (!n_in) { in grn_ts_expr_evaluate()
184 return grn_ts_expr_node_evaluate(ctx, expr->root, in, n_in, out); in grn_ts_expr_evaluate()
189 grn_ts_record *in, size_t n_in, in grn_ts_expr_filter() argument
195 if (!expr || (!in && n_in) || !out || !n_out) { in grn_ts_expr_filter()
198 if (!n_in) { in grn_ts_expr_filter()
[all …]
|
| H A D | ts_expr_node.c | 1494 for (i = 0; i < n_in; i++) { in grn_ts_expr_id_node_evaluate()
1555 for (i = 0; i < n_in; i++) { in grn_ts_expr_score_node_evaluate()
2014 for (i = 0; i < n_in; i++) { in grn_ts_expr_value_node_filter()
2299 *n_out = n_in; in grn_ts_expr_const_node_filter()
2561 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2586 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_text_vector()
2621 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2641 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_evaluate_ref_vector()
2787 for (i = 0; i < n_in; i++) { in grn_ts_expr_column_node_filter()
3439 for (i = 0; i < n_in; i++) { in grn_ts_op_logical_not_evaluate()
[all …]
|
| /dports/math/casadi/casadi-3.5.5/casadi/core/ |
| H A D | finite_differences.cpp | 134 casadi_int n_in = derivative_of_.n_in(), n_out = derivative_of_.n_out(); in get_sparsity_in() local
135 if (i<n_in) { in get_sparsity_in()
138 } else if (i<n_in+n_out) { in get_sparsity_in()
160 return derivative_of_.n_in() + derivative_of_.n_out() + derivative_of_.n_in(); in get_n_in()
168 casadi_int n_in = derivative_of_.n_in(), n_out = derivative_of_.n_out(); in get_name_in() local
169 if (i<n_in) { in get_name_in()
171 } else if (i<n_in+n_out) { in get_name_in()
204 casadi_int n_in = derivative_of_.n_in(), n_out = derivative_of_.n_out(); in eval() local
209 arg += n_in; in eval()
221 arg += n_in; in eval()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/polly/lib/External/isl/ |
| H A D | isl_tab_lexopt_templ.c | 56 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()
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()
119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); in SF()
120 isl_int_set_si(dom->ineq[k][1 + n_in], -1); in SF()
[all …]
|
| /dports/math/barvinok/barvinok-0.41.5/isl/ |
| H A D | isl_tab_lexopt_templ.c | 56 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()
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()
119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); in SF()
120 isl_int_set_si(dom->ineq[k][1 + n_in], -1); in SF()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/polly/lib/External/isl/ |
| H A D | isl_tab_lexopt_templ.c | 56 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()
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()
119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); in SF()
120 isl_int_set_si(dom->ineq[k][1 + n_in], -1); in SF()
[all …]
|
| /dports/devel/isl/isl-0.24/ |
| H A D | isl_tab_lexopt_templ.c | 56 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()
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()
119 isl_seq_cpy(dom->ineq[k], cst->row[i], 1 + n_in); in SF()
120 isl_int_set_si(dom->ineq[k][1 + n_in], -1); in SF()
[all …]
|