168 load_uclist(uclist_t *ucl, const lwpstatus_t *psp)  in load_uclist()  argument
170 	struct ps_prochandle *P = ucl->uc_proc;  in load_uclist()
181 		if (ucl->uc_nelems == ucl->uc_size) {  in load_uclist()
182 			new_size = ucl->uc_size ? ucl->uc_size * 2 : 16;  in load_uclist()
183 			new_addrs = realloc(ucl->uc_addrs,  in load_uclist()
187 				ucl->uc_addrs = new_addrs;  in load_uclist()
188 				ucl->uc_size = new_size;  in load_uclist()
206 		ucl->uc_addrs[ucl->uc_nelems++] = addr;  in load_uclist()
218 		for (i = 0; i < ucl->uc_nelems - 1; i++) {  in load_uclist()
219 			if (ucl->uc_addrs[i] == addr)  in load_uclist()
241 init_uclist(uclist_t *ucl, struct ps_prochandle *P)  in init_uclist()  argument
245 		ucl->uc_proc = P;  in init_uclist()
246 		ucl->uc_addrs = P->ucaddrs;  in init_uclist()
247 		ucl->uc_nelems = P->ucnelems;  in init_uclist()
248 		ucl->uc_size = P->ucnelems;  in init_uclist()
249 		ucl->uc_cached = 1;  in init_uclist()
253 	ucl->uc_proc = P;  in init_uclist()
254 	ucl->uc_addrs = NULL;  in init_uclist()
255 	ucl->uc_nelems = 0;  in init_uclist()
256 	ucl->uc_size = 0;  in init_uclist()
258 	(void) Plwp_iter(P, (proc_lwp_f *)load_uclist, ucl);  in init_uclist()
259 	qsort(ucl->uc_addrs, ucl->uc_nelems, sizeof (uintptr_t), sort_uclist);  in init_uclist()
262 		P->ucaddrs = ucl->uc_addrs;  in init_uclist()
263 		P->ucnelems = ucl->uc_nelems;  in init_uclist()
264 		ucl->uc_cached = 1;  in init_uclist()
266 		ucl->uc_cached = 0;  in init_uclist()
271 free_uclist(uclist_t *ucl)  in free_uclist()  argument
273 	if (!ucl->uc_cached && ucl->uc_addrs != NULL)  in free_uclist()
274 		free(ucl->uc_addrs);  in free_uclist()
278 find_uclink(uclist_t *ucl, uintptr_t addr)  in find_uclink()  argument
280 	if (ucl->uc_nelems != 0) {  in find_uclink()
281 		return (bsearch(&addr, ucl->uc_addrs, ucl->uc_nelems,  in find_uclink()