236 	usg_elem *ue;  in scanopt_usage()  local
268 		ue = store + store_idx++;  in scanopt_usage()
269 		ue->idx = i;  in scanopt_usage()
270 		ue->next = ue->alias = NULL;  in scanopt_usage()
274 			byr_val = ue;  in scanopt_usage()
282 				    RVAL (s, ue->idx)) {  in scanopt_usage()
291 						NAME (s, ue->idx)) > 0) {  in scanopt_usage()
298 			ue->next = *ue_curr;  in scanopt_usage()
299 			*ue_curr = ue;  in scanopt_usage()
309 		ue = byr_val;  in scanopt_usage()
310 		while (ue) {  in scanopt_usage()
313 			printf ("%2d: %s\n", ue->idx, NAME (s, ue->idx));  in scanopt_usage()
314 			for (ue2 = ue->alias; ue2; ue2 = ue2->next)  in scanopt_usage()
317 			ue = ue->next;  in scanopt_usage()
325 	for (ue = byr_val; ue; ue = ue->next) {  in scanopt_usage()
338 		if (!(FLAGS (s, ue->idx) & IS_LONG))  in scanopt_usage()
339 			CALC_LEN (ue->idx);  in scanopt_usage()
342 		for (ap = ue->alias; ap; ap = ap->next) {  in scanopt_usage()
348 		if (FLAGS (s, ue->idx) & IS_LONG)  in scanopt_usage()
349 			CALC_LEN (ue->idx);  in scanopt_usage()
352 		for (ap = ue->alias; ap; ap = ap->next) {  in scanopt_usage()
362 		len = (int) strlen (DESC (s, ue->idx));  in scanopt_usage()
391 		for (ue = byr_val; ue; ue = ue->next) {  in scanopt_usage()
396 			has_short = !(FLAGS (s, ue->idx) & IS_LONG);  in scanopt_usage()
397 			for (ap = ue->alias; ap; ap = ap->next) {  in scanopt_usage()
417 			if (!(FLAGS (s, ue->idx) & IS_LONG))  in scanopt_usage()
418 				PRINT_IT (ue->idx);  in scanopt_usage()
421 			for (ap = ue->alias; ap; ap = ap->next) {  in scanopt_usage()
427 			if (FLAGS (s, ue->idx) & IS_LONG)  in scanopt_usage()
428 				PRINT_IT (ue->idx);  in scanopt_usage()
431 			for (ap = ue->alias; ap; ap = ap->next) {  in scanopt_usage()
443 				pstart = DESC (s, ue->idx);  in scanopt_usage()