83 	uint32_t		num_items;  member
103 	int end = bd->num_items;  in bsearch4_lookup()
204 	if (bd->num_items >= bd->alloc_items)  in bsearch4_add_route_cb()
207 	rr = &bd->rr[bd->num_items++];  in bsearch4_add_route_cb()
246 	uint32_t		num_items;  member
254 	if (ba->num_items < ba->alloc_items) {  in add_array_entry()
255 		ba->arr[ba->num_items++] = *br_new;  in add_array_entry()
265 	return (&ba->arr[ba->num_items - 1]);  in get_last_entry()
284 	stack->num_items--;  in pop_stack_entry()
322 	while (stack->num_items > 0) {  in bsearch4_process_record()
337 	 if (dst_array->num_items > 0) {  in bsearch4_process_record()
399 	for (int i = 0; i < src_array->num_items; i++) {  in bsearch4_build_array()
411 	while (stack.num_items > 0) {  in bsearch4_build_array()
427 		.num_items = bd->num_items,  in bsearch4_build()
433 	for (int i = 0; i < prefixes_array.num_items; i++) {  in bsearch4_build()
447 	qsort(prefixes_array.arr, prefixes_array.num_items, sizeof(struct bsearch4_record), rr_cmp);  in bsearch4_build()
455 	bd->num_items = dst_array.num_items;  in bsearch4_build()
523 	uint32_t		num_items;  member
609 	if (lr->num_items >= lr->alloc_items)  in lradix4_add_route_cb()
612 	ae = (struct radix4_addr_entry *)(lr->rt_base + lr->num_items * LRADIX4_ITEM_SZ);  in lradix4_add_route_cb()
613 	lr->num_items++;  in lradix4_add_route_cb()