| /freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/ |
| HD | sorts.c | 144 qsort(array->elts, array->nelts, array->elt_size, comparison_func); in svn_sort__array()
203 int nelts, in bsearch_lower_bound() argument
208 int upper = nelts - 1; in bsearch_lower_bound()
232 array->elts, array->nelts, array->elt_size, in svn_sort__bsearch_lower_bound()
252 if (idx >= array->nelts) in svn_sort__array_lookup()
260 *hint = array->nelts; in svn_sort__array_lookup()
261 if (array->nelts == 0) in svn_sort__array_lookup()
264 offset = (array->nelts - 1) * array->elt_size; in svn_sort__array_lookup()
293 idx = bsearch_lower_bound(key, array->elts, array->nelts, array->elt_size, in svn_sort__array_lookup()
297 if (idx >= array->nelts) in svn_sort__array_lookup()
[all …]
|
| HD | target.c | 46 int i, j, num_condensed = targets->nelts; in svn_path_condense_targets()
54 if (targets->nelts <= 0) in svn_path_condense_targets()
74 if (targets->nelts == 1) in svn_path_condense_targets()
90 removed = apr_pcalloc(pool, (targets->nelts * sizeof(svn_boolean_t))); in svn_path_condense_targets()
91 abs_targets = apr_array_make(pool, targets->nelts, sizeof(const char *)); in svn_path_condense_targets()
95 for (i = 1; i < targets->nelts; ++i) in svn_path_condense_targets()
137 for (i = 0; i < abs_targets->nelts; ++i) in svn_path_condense_targets()
142 for (j = i + 1; j < abs_targets->nelts; ++j) in svn_path_condense_targets()
187 for (i = 0; i < abs_targets->nelts; ++i) in svn_path_condense_targets()
205 for (i = 0; i < abs_targets->nelts; ++i) in svn_path_condense_targets()
[all …]
|
| HD | mergeinfo.c | 264 if (rangelist->nelts > 0) in combine_with_lastrange()
265 lastrange = APR_ARRAY_IDX(rangelist, rangelist->nelts - 1, svn_merge_range_t *); in combine_with_lastrange()
643 for (i = 0; i < rangelist->nelts; ++i) in svn_rangelist__is_canonical()
650 for (i = 0; i < rangelist->nelts - 1; ++i) in svn_rangelist__is_canonical()
680 for (i = 1; i < rangelist->nelts; i++) in svn_rangelist__canonicalize()
744 if (rangelist->nelts == 0) in parse_revision_line()
830 rl->nelts, err->message); in rangelist_to_string_debug()
842 for (i = 1; i < rangelist->nelts; i++) in rangelist_is_sorted()
884 = (it->i < it->rl->nelts in rlii_update()
915 if (it->i >= it->rl->nelts) in rlii_next_any_interval()
[all …]
|
| /freebsd-11-stable/contrib/apr/tables/ |
| HD | apr_tables.c | 55 int nelts, int elt_size, int clear) in make_array_core() argument
61 if (nelts < 1) { in make_array_core()
62 nelts = 1; in make_array_core()
66 res->elts = apr_pcalloc(p, nelts * elt_size); in make_array_core()
69 res->elts = apr_palloc(p, nelts * elt_size); in make_array_core()
74 res->nelts = 0; /* No active elements yet... */ in make_array_core()
75 res->nalloc = nelts; /* ...but this many allocated */ in make_array_core()
80 return ((a == NULL) || (a->nelts == 0)); in apr_is_empty_array()
84 int nelts, int elt_size) in apr_array_make() argument
89 make_array_core(res, p, nelts, elt_size, 1); in apr_array_make()
[all …]
|
| /freebsd-11-stable/contrib/apr/poll/unix/ |
| HD | poll.c | 181 if (pollset->nelts == pollset->nalloc) { in impl_pollset_add()
185 pollset->p->query_set[pollset->nelts] = *descriptor; in impl_pollset_add()
188 pollset->p->pollset[pollset->nelts].fd = descriptor->desc.s->socketdes; in impl_pollset_add()
192 pollset->p->pollset[pollset->nelts].fd = descriptor->desc.f->filedes; in impl_pollset_add()
196 pollset->p->pollset[pollset->nelts].fd = (SOCKET)descriptor->desc.f->filedes; in impl_pollset_add()
201 pollset->p->pollset[pollset->nelts].events = in impl_pollset_add()
203 pollset->nelts++; in impl_pollset_add()
213 for (i = 0; i < pollset->nelts; i++) { in impl_pollset_remove()
217 apr_uint32_t old_nelts = pollset->nelts; in impl_pollset_remove()
218 pollset->nelts--; in impl_pollset_remove()
[all …]
|
| HD | z_asio.c | 314 pollset->nelts = 0; in asio_pollset_create()
346 if (pollset->nelts == priv->size) { in posix_add()
350 priv->query_set[pollset->nelts] = *descriptor; in posix_add()
358 priv->pollset[pollset->nelts].fd = fd; in posix_add()
360 priv->pollset[pollset->nelts].events = in posix_add()
363 pollset->nelts++; in posix_add()
428 pollset->nelts++; in asio_pollset_add()
453 for (i = 0; i < pollset->nelts; i++) { in posix_remove()
457 apr_uint32_t old_nelts = pollset->nelts; in posix_remove()
458 pollset->nelts--; in posix_remove()
[all …]
|
| /freebsd-11-stable/contrib/subversion/subversion/svn/ |
| HD | relocate-cmd.c | 64 if (targets->nelts < 1) in svn_cl__relocate()
70 if ((targets->nelts == 1) || in svn_cl__relocate()
71 ((targets->nelts == 2) in svn_cl__relocate()
77 path = (targets->nelts == 2) ? APR_ARRAY_IDX(targets, 1, const char *) in svn_cl__relocate()
91 if (targets->nelts == 2) in svn_cl__relocate()
102 for (i = 2; i < targets->nelts; i++) in svn_cl__relocate()
108 for (i = 2; i < targets->nelts; i++) in svn_cl__relocate()
|
| HD | checkout-cmd.c | 83 if (! targets->nelts) in svn_cl__checkout()
88 last_target = APR_ARRAY_IDX(targets, targets->nelts - 1, const char *); in svn_cl__checkout()
91 if (targets->nelts == 1) in svn_cl__checkout()
106 if (targets->nelts == 1) in svn_cl__checkout()
124 for (i = 0; i < targets->nelts; ++i) in svn_cl__checkout()
147 if (targets->nelts == 1) in svn_cl__checkout()
|
| HD | merge-cmd.c | 310 if (targets->nelts < 1) in svn_cl__merge()
320 if (targets->nelts >= 2) in svn_cl__merge()
328 if (targets->nelts <= 1) in svn_cl__merge()
332 else if (targets->nelts == 2) in svn_cl__merge()
338 if (opt_state->revision_ranges->nelts > 0) in svn_cl__merge()
366 if (targets->nelts > 2) in svn_cl__merge()
379 if (targets->nelts == 2) in svn_cl__merge()
391 if (targets->nelts < 2) in svn_cl__merge()
393 if (targets->nelts > 3) in svn_cl__merge()
417 if (targets->nelts == 3) in svn_cl__merge()
|
| HD | switch-cmd.c | 52 if (targets->nelts < 2) in rewrite_urls()
67 if (targets->nelts == 2) in rewrite_urls()
76 for (i = 2; i < targets->nelts; i++) in rewrite_urls()
123 if (targets->nelts < 1) in svn_cl__switch()
125 if (targets->nelts > 2) in svn_cl__switch()
133 if (targets->nelts == 1) in svn_cl__switch()
|
| HD | add-cmd.c | 60 if (! targets->nelts) in svn_cl__add()
71 for (i = 0; i < targets->nelts; i++) in svn_cl__add()
91 if (errors->nelts > 0) in svn_cl__add()
96 for (i = 0; i < errors->nelts; i++) in svn_cl__add()
|
| /freebsd-11-stable/contrib/apr/file_io/unix/ |
| HD | filepath_util.c | 37 int nelts; in apr_filepath_list_split_impl() local
43 for (nelts = 0, ptr = path; ptr != NULL; ++nelts) in apr_filepath_list_split_impl()
51 elts = apr_array_make(p, nelts, sizeof(char*)); in apr_filepath_list_split_impl()
81 for (i = 0; i < pathelts->nelts; ++i) in apr_filepath_list_merge_impl()
95 for (i = 0; i < pathelts->nelts; ++i) in apr_filepath_list_merge_impl()
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_delta/ |
| HD | path_driver.c | 77 SVN_ERR_ASSERT(db_stack && db_stack->nelts); in open_dir()
80 item = APR_ARRAY_IDX(db_stack, db_stack->nelts - 1, void *); in open_dir()
108 SVN_ERR_ASSERT(db_stack && db_stack->nelts); in pop_stack()
111 item = APR_ARRAY_IDX(db_stack, db_stack->nelts - 1, dir_stack_t *); in pop_stack()
159 if (! relpaths->nelts) in svn_delta_path_driver3()
166 if (sort_paths && relpaths->nelts > 1) in svn_delta_path_driver3()
180 for (i = 0; i < relpaths->nelts; i++) in svn_delta_path_driver3()
316 if (state->db_stack->nelts) in svn_delta_path_driver_step()
318 item = APR_ARRAY_IDX(state->db_stack, state->db_stack->nelts - 1, void *); in svn_delta_path_driver_step()
352 while (state->db_stack->nelts) in svn_delta_path_driver_finish()
|
| /freebsd-11-stable/contrib/flex/ |
| HD | buf.c | 62 for (i=0; i < buf->nelts; i++){ in buf_print_strings()
121 buf_append(dest, src->elts, src->nelts); in buf_concat()
135 buf->nelts--;
211 buf->nelts = 0;
243 if (n_elem + buf->nelts > buf->nmax) {
246 n_alloc = (n_elem + buf->nelts) * buf->elt_size;
267 memcpy ((char *) buf->elts + buf->nelts * buf->elt_size, ptr,
269 buf->nelts += n_elem;
|
| /freebsd-11-stable/contrib/apr-util/misc/ |
| HD | apr_queue.c | 45 unsigned int nelts; /**< # elements */ member
61 q->nelts, q->in, q->out, in Q_DBG()
73 #define apr_queue_full(queue) ((queue)->nelts == (queue)->bounds)
79 #define apr_queue_empty(queue) ((queue)->nelts == 0)
131 queue->nelts = 0; in apr_queue_create()
191 queue->nelts++; in apr_queue_push()
233 queue->nelts++; in apr_queue_trypush()
252 return queue->nelts; in apr_queue_size()
302 queue->nelts--; in apr_queue_pop()
344 queue->nelts--; in apr_queue_trypop()
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
| HD | changes.c | 186 for (i = 0; i < list->nelts; ++i) in svn_fs_x__changes_append_list()
190 APR_ARRAY_PUSH(changes->offsets, int) = changes->changes->nelts; in svn_fs_x__changes_append_list()
191 *list_index = (apr_size_t)(changes->offsets->nelts - 2); in svn_fs_x__changes_append_list()
207 + changes->changes->nelts * 10 in svn_fs_x__changes_estimate_size()
229 if (idx + 1 >= (apr_size_t)changes->offsets->nelts) in svn_fs_x__changes_get_list()
235 idx, changes->offsets->nelts - 1); in svn_fs_x__changes_get_list()
318 for (i = 0; i < changes->offsets->nelts; ++i) in svn_fs_x__write_changes_container()
323 for (i = 0; i < changes->changes->nelts; ++i) in svn_fs_x__write_changes_container()
407 = changes->changes->elt_size * changes->changes->nelts in svn_fs_x__serialize_changes_container()
408 + changes->offsets->elt_size * changes->offsets->nelts in svn_fs_x__serialize_changes_container()
[all …]
|
| HD | noderevs.c | 188 idx = ids->nelts; in store_id()
215 idx = reps->nelts; in store_representation()
280 return container->noderevs->nelts - 1; in svn_fs_x__noderevs_add()
297 + container->noderevs->nelts * 16 in svn_fs_x__noderevs_estimate_size()
298 + container->ids->nelts * 4 in svn_fs_x__noderevs_estimate_size()
299 + container->reps->nelts * 40 in svn_fs_x__noderevs_estimate_size()
318 if (idx < 0 || idx > ids->nelts) in get_id()
321 idx, ids->nelts); in get_id()
346 if (idx < 0 || idx > reps->nelts) in get_representation()
350 idx, reps->nelts); in get_representation()
[all …]
|
| HD | string_table.c | 279 builder->tables->nelts - 1, in svn_fs_x__string_table_builder_add()
297 + (((apr_size_t)builder->tables->nelts - 1) << TABLE_SHIFT); in svn_fs_x__string_table_builder_add()
299 if (table->long_strings->nelts == MAX_STRINGS_PER_TABLE) in svn_fs_x__string_table_builder_add()
302 result = table->long_strings->nelts in svn_fs_x__string_table_builder_add()
304 + (((apr_size_t)builder->tables->nelts - 1) << TABLE_SHIFT); in svn_fs_x__string_table_builder_add()
307 (void*)(apr_uintptr_t)table->long_strings->nelts); in svn_fs_x__string_table_builder_add()
319 if ( table->short_strings->nelts == MAX_STRINGS_PER_TABLE in svn_fs_x__string_table_builder_add()
323 item->position = table->short_strings->nelts; in svn_fs_x__string_table_builder_add()
333 result = ((apr_size_t)builder->tables->nelts - 1) << TABLE_SHIFT; in svn_fs_x__string_table_builder_add()
338 + (((apr_size_t)builder->tables->nelts - 1) << TABLE_SHIFT); in svn_fs_x__string_table_builder_add()
[all …]
|
| HD | pack.c | 523 while (context->reps->nelts <= idx) in add_item_rep_mapping()
546 if (context->reps->nelts > idx) in get_item()
634 = apr_array_make(result_pool, ordered->nelts, sizeof(svn_fs_dirent_t *)); in svn_fs_x__order_dir_entries()
637 for (i = 0; i < ordered->nelts; ++i) in svn_fs_x__order_dir_entries()
882 int upper = context->references->nelts - 1; in find_first_reference()
907 if (context->references->nelts <= idx) in is_reference_match()
943 for (; idx < path_order->nelts; ++idx) in select_reps()
966 for (i = 0; i < rep_parts->nelts; ++i) in select_reps()
998 for (i = 0; i < selected->nelts; ++i) in reps_fit_into_containers()
1024 if (items->nelts == 0) in write_nodes_container()
[all …]
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_client/ |
| HD | commit.c | 104 for (i = 0; i < commit_items->nelts; i++) in get_ra_editor()
290 for (i = 0; i < target_relpaths->nelts; i++) in determine_lock_targets()
342 if (wc_targets->nelts == 1) in determine_lock_targets()
359 else if (wc_targets->nelts > 1) in determine_lock_targets()
366 if (wc_targets->nelts == 0 in determine_lock_targets()
450 rel_targets_nelts_fixed = rel_targets->nelts; in append_externals_as_explicit_targets()
478 for (j = 0; j < externals->nelts; j++) in append_externals_as_explicit_targets()
589 if (rel_targets->nelts == 0) in svn_client__wc_replay()
671 for (i = 0; i < targets->nelts; i++) in svn_client_commit6()
693 if (rel_targets->nelts == 0) in svn_client_commit6()
[all …]
|
| HD | log.c | 222 for (i = 0; i < rb->revprops->nelts; i++) in pre_15_receiver()
345 if (targets->nelts == 0) in resolve_log_targets()
353 MAX(1, targets->nelts - 1), in resolve_log_targets()
367 if (targets->nelts > 1) in resolve_log_targets()
370 for (i = 1; i < targets->nelts; i++) in resolve_log_targets()
402 if (targets->nelts > 1) in resolve_log_targets()
507 *revision_ranges = apr_array_make(result_pool, opt_rev_ranges->nelts, in convert_opt_rev_array_to_rev_range_array()
510 for (i = 0; i < opt_rev_ranges->nelts; i++) in convert_opt_rev_array_to_rev_range_array()
724 for (i = 0; i < revision_ranges->nelts; i++) in run_ra_get_log()
751 log_segments->nelts, log_segments->elt_size, in run_ra_get_log()
[all …]
|
| /freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/ |
| HD | log.c | 599 for (i = 0; i < histories->nelts; ++i) in next_history_rev()
906 if (! paths->nelts) in get_combined_mergeinfo_changes()
942 for (i = 0; i < paths->nelts; i++) in get_combined_mergeinfo_changes()
1075 for (i = 0; i < paths->nelts; i++) in get_combined_mergeinfo_changes()
1109 svn_boolean_t want_revprops = !revprops || revprops->nelts; in fill_log_entry()
1174 if (revprops->nelts == apr_hash_count(r_props) && !censor_revprops) in fill_log_entry()
1177 for (i = 0; i < revprops->nelts; i++) in fill_log_entry()
1192 for (i = 0; i < revprops->nelts; i++) in fill_log_entry()
1264 for (i = 0; i < rangelist->nelts; i++) in interesting_merge()
1419 *histories = apr_array_make(pool, paths->nelts, in get_path_histories()
[all …]
|
| /freebsd-11-stable/contrib/gdb/gdb/ |
| HD | linespec.c | 475 decode_line_2 (struct symbol *sym_arr[], int nelts, int funfirstline, in decode_line_2() argument
487 alloca (nelts * sizeof (struct symtab_and_line)); in decode_line_2()
489 xmalloc (nelts * sizeof (struct symtab_and_line)); in decode_line_2()
494 canonical_arr = (char **) xmalloc (nelts * sizeof (char *)); in decode_line_2()
496 memset (canonical_arr, 0, nelts * sizeof (char *)); in decode_line_2()
502 while (i < nelts) in decode_line_2()
556 for (i = 0; i < nelts; i++) in decode_line_2()
566 (nelts * sizeof (struct symtab_and_line))); in decode_line_2()
567 return_values.nelts = nelts; in decode_line_2()
572 if (num >= nelts + 2) in decode_line_2()
[all …]
|
| /freebsd-11-stable/contrib/gcc/cp/ |
| HD | init.c | 149 build_zero_init (tree type, tree nelts, bool static_storage_p) in build_zero_init() argument
171 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST); in build_zero_init()
220 if (nelts) in build_zero_init()
221 max_index = fold_build2 (MINUS_EXPR, TREE_TYPE (nelts), in build_zero_init()
222 nelts, integer_one_node); in build_zero_init()
279 build_default_init (tree type, tree nelts) in build_default_init() argument
309 || (nelts && TREE_CODE (nelts) != INTEGER_CST)) in build_default_init()
314 return build_zero_init (type, nelts, /*static_storage_p=*/false); in build_default_init()
1554 build_raw_new_expr (tree placement, tree type, tree nelts, tree init, in build_raw_new_expr() argument
1560 nelts, init); in build_raw_new_expr()
[all …]
|
| /freebsd-11-stable/contrib/gcclibs/libcpp/ |
| HD | symtab.c | 255 size_t nelts, nids, overhead, headers; in ht_dump_statistics() local
283 nelts = table->nelements; in ht_dump_statistics()
288 (unsigned long) nelts); in ht_dump_statistics()
290 (unsigned long) nids, nids * 100.0 / nelts); in ht_dump_statistics()
299 exp_len = (double)total_bytes / (double)nelts; in ht_dump_statistics()
301 exp_len2 = (double) sum_of_squares / (double) nelts; in ht_dump_statistics()
306 (double) nelts / (double) table->searches); in ht_dump_statistics()
|