423 fix_top_item(ALL_DATA * all, int cur_item, int selected)  in fix_top_item()  argument
426     int cur_row = index2row(all, cur_item, selected);  in fix_top_item()
430 	top_item = cur_item;  in fix_top_item()
438 	       cur_item, mySide(selected), top_item));  in fix_top_item()
559     int cur_item;  in dlg_buildlist()  local
586 	cur_item = dlg_default_listitem(items);  in dlg_buildlist()
588 	if ((cur_item = first_item(&all, 0)) < 0)  in dlg_buildlist()
589 	    cur_item = first_item(&all, 1);  in dlg_buildlist()
592 	      ? (items[cur_item].state ? sRIGHT : sLEFT)  in dlg_buildlist()
716 	if ((items[cur_item].state != 0) == i) {  in dlg_buildlist()
717 	    int top_item = cur_item - j + 1;  in dlg_buildlist()
741 	int which = (items[cur_item].state != 0);  in dlg_buildlist()
749 		   cur_item, item_no - 1,  in dlg_buildlist()
755 	    print_both(&all, cur_item);  in dlg_buildlist()
761 	    int cur_row = index2row(&all, cur_item, which);  in dlg_buildlist()
801 		cur_item = k;  in dlg_buildlist()
802 		print_both(&all, cur_item);  in dlg_buildlist()
833 	    int new_state = items[cur_item].state + 1;  in dlg_buildlist()
835 	    if ((new_choice = next_item(&all, cur_item, which)) == cur_item) {  in dlg_buildlist()
836 		new_choice = prev_item(&all, cur_item, which);  in dlg_buildlist()
838 	    DLG_TRACE(("# cur_item %d, new_choice:%d\n", cur_item, new_choice));  in dlg_buildlist()
843 	    items[cur_item].state = new_state;  in dlg_buildlist()
847 		    append_right_side(&all, cur_item);  in dlg_buildlist()
849 		    amend_right_side(&all, cur_item);  in dlg_buildlist()
854 	    if (cur_item == moi->top_index) {  in dlg_buildlist()
859 		fix_top_item(&all, cur_item, !which);  in dlg_buildlist()
860 		cur_item = new_choice;  in dlg_buildlist()
862 	    print_both(&all, cur_item);  in dlg_buildlist()
875 		for (j = cur_item + 1; j < item_no; j++) {  in dlg_buildlist()
883 		    for (j = 0; j <= cur_item; j++) {  in dlg_buildlist()
948 	    i = cur_item;  in dlg_buildlist()
952 		i = closest_item(&all, cur_item, 0);  in dlg_buildlist()
959 		    i = closest_item(&all, cur_item, 1);  in dlg_buildlist()
964 		if (cur_item > moi->top_index) {  in dlg_buildlist()
999 		i = prev_item(&all, cur_item, which);  in dlg_buildlist()
1000 		if (stop_prev(&all, cur_item, which))  in dlg_buildlist()
1004 		i = next_item(&all, cur_item, which);  in dlg_buildlist()
1013 	    if (i != cur_item) {  in dlg_buildlist()
1085 		cur_item = i;  in dlg_buildlist()
1086 		print_both(&all, cur_item);  in dlg_buildlist()
1135 	int new_item = cur_item;  in dlg_buildlist()
1146 		if (choice == cur_item)  in dlg_buildlist()
1152 	cur_item = new_item;  in dlg_buildlist()
1167     *current_item = cur_item;  in dlg_buildlist()