2320     long	    target;  in undo_time()  local
2348 	target = step;  in undo_time()
2354 	    target = (long)(curbuf->b_u_time_cur) + step;  in undo_time()
2370 		    target = curbuf->b_u_save_nr_cur + step;  in undo_time()
2373 		    target = curbuf->b_u_save_nr_cur + step + 1;  in undo_time()
2374 		if (target <= 0)  in undo_time()
2382 		target = curbuf->b_u_save_nr_cur + step;  in undo_time()
2383 		if (target > curbuf->b_u_save_nr_last)  in undo_time()
2387 		    target = curbuf->b_u_seq_last + 1;  in undo_time()
2393 	    target = curbuf->b_u_seq_cur + step;  in undo_time()
2396 	    if (target < 0)  in undo_time()
2397 		target = 0;  in undo_time()
2408 	    if (target >= closest)  in undo_time()
2409 		target = closest - 1;  in undo_time()
2416     if (target == 0)  in undo_time()
2467 				|| (val > target  in undo_time()
2468 				    ? (closest > target  in undo_time()
2469 					? val - target <= closest - target  in undo_time()
2470 					: val - target <= target - closest)  in undo_time()
2471 				    : (closest > target  in undo_time()
2472 					? target - val <= closest - target  in undo_time()
2473 					: target - val <= target - closest))))  in undo_time()
2482 	    if (target == val && !dosec)  in undo_time()
2484 		target = uhp->uh_seq;  in undo_time()
2540 	target = closest_seq;  in undo_time()
2549     if (uhp != NULL || target == 0)  in undo_time()
2564 	    if (uhp == NULL || (target > 0 && uhp->uh_walk != mark)  in undo_time()
2565 					 || (uhp->uh_seq == target && !above))  in undo_time()
2569 	    if (target > 0)  in undo_time()
2574 	if (target > 0)  in undo_time()
2626 		if (uhp->uh_seq == target && above)  in undo_time()
2628 		    curbuf->b_u_seq_cur = target - 1;  in undo_time()
2641 		if (uhp->uh_seq == target)	// found it!  in undo_time()