103 	   int scrollamt,  in print_list()  argument
113 		   &data->items[scrollamt + i],  in print_list()
115 		   data->depths[scrollamt + i],  in print_list()
121 		       (long) (scrollamt),  in print_list()
122 		       (long) (scrollamt),  in print_list()
123 		       (long) (scrollamt + max_choice),  in print_list()
202     int scrollamt = 0;  in dlg_treeview()  local
338     if (choice >= (max_choice + scrollamt)) {  in dlg_treeview()
339 	scrollamt = choice - max_choice + 1;  in dlg_treeview()
353     print_list(&all, choice, scrollamt, max_choice);  in dlg_treeview()
379 		print_list(&all, choice, scrollamt, max_choice);  in dlg_treeview()
395 	    int current = scrollamt + choice;  in dlg_treeview()
415 	    print_list(&all, choice, scrollamt, max_choice);  in dlg_treeview()
427 		for (j = scrollamt + choice + 1; j < item_no; j++) {  in dlg_treeview()
430 			i = j - scrollamt;  in dlg_treeview()
435 		    for (j = 0; j <= scrollamt + choice; j++) {  in dlg_treeview()
438 			    i = j - scrollamt;  in dlg_treeview()
469 		    i = -scrollamt;  in dlg_treeview()
472 		    i = item_no - 1 - scrollamt;  in dlg_treeview()
477 		    else if (scrollamt != 0)  in dlg_treeview()
478 			i = -MIN(scrollamt, max_choice);  in dlg_treeview()
483 		    i = MIN(choice + max_choice, item_no - scrollamt - 1);  in dlg_treeview()
487 		    if (choice == 0 && scrollamt == 0)  in dlg_treeview()
492 		    if (scrollamt + choice >= item_no - 1)  in dlg_treeview()
506 			scrollamt += i;  in dlg_treeview()
510 			scrollamt += (i - max_choice + 1);  in dlg_treeview()
512 		    print_list(&all, choice, scrollamt, max_choice);  in dlg_treeview()
515 		    print_list(&all, choice, scrollamt, max_choice);  in dlg_treeview()
566     *current_item = (scrollamt + choice);  in dlg_treeview()