31 		sizeof(struct udb_radsel_d)+(size_t)a->str_cap);  in size_of_radarray()
50 	udb_radstrlen_type str_cap)  in size_of_lookup_needed()  argument
53 		sizeof(struct udb_radsel_d)+(size_t)str_cap);  in size_of_lookup_needed()
74 		i*lookup(n)->str_cap;  in lookup_string()
214 	unsigned ns = ((unsigned)lookup(n)->str_cap)*2;  in udb_radnode_str_grow()
226 	RADARRAY(&a)->str_cap = ns;  in udb_radnode_str_grow()
234 			lookup_string(n, i), lookup(n)->str_cap);  in udb_radnode_str_grow()
255 		size_of_lookup_needed(ns, lookup(n)->str_cap)))  in udb_radnode_array_grow()
258 	memset(UDB_PTR(&a), 0, size_of_lookup_needed(ns, lookup(n)->str_cap));  in udb_radnode_array_grow()
269 		((size_t)lookup(n)->len) * ((size_t)lookup(n)->str_cap));  in udb_radnode_array_grow()
293 		RADARRAY(&a)->str_cap = len;  in udb_radnode_array_create()
317 		RADARRAY(&a)->str_cap = len;  in udb_radnode_array_space()
328 	if(lookup(n)->str_cap < len) {  in udb_radnode_array_space()
364 			((size_t)lookup(n)->len)*((size_t)lookup(n)->str_cap));  in udb_radnode_array_space()
400 	if(lookup(n)->str_cap < len) {  in udb_radnode_str_space()
831 	assert(strcap <= lookup(n)->str_cap);  in udb_radarray_reduce()
838 	RADARRAY(&a)->str_cap = strcap;  in udb_radarray_reduce()
873 		|| maxlen <= lookup(n)->str_cap/2 || maxlen == 0) &&  in udb_radarray_reduce_if_needed()
875 		lookup(n)->str_cap != maxlen))  in udb_radarray_reduce_if_needed()
1070 #define NSTR(n, byte) (((uint8_t*)(&NARRAY(n)->array[NARRAY(n)->capacity]))+byte*NARRAY(n)->str_cap)  in udb_radix_search()
1461 		p->capacity*(sizeof(struct udb_radsel_d)+p->str_cap));  in udb_radix_array_walk_chunk()