118 static int serialize_uep(bufinfo_T *bi, u_entry_T *uep);
154     u_entry_T *uep;  in u_check_tree()  local
189 	for (uep = uhp->uh_entry; uep != NULL; uep = uep->ue_next)  in u_check_tree()
191 	    if (uep->ue_magic != UE_MAGIC)  in u_check_tree()
421     u_entry_T	*uep;  in u_savecommon()  local
627 	    uep = u_get_headentry();  in u_savecommon()
631 		if (uep == NULL)  in u_savecommon()
636 		if ((curbuf->b_u_newhead->uh_getbot_entry != uep  in u_savecommon()
637 			    ? (uep->ue_top + uep->ue_size + 1  in u_savecommon()
638 				!= (uep->ue_bot == 0  in u_savecommon()
640 				    : uep->ue_bot))  in u_savecommon()
641 			    : uep->ue_lcount != curbuf->b_ml.ml_line_count)  in u_savecommon()
642 			|| (uep->ue_size > 1  in u_savecommon()
643 			    && top >= uep->ue_top  in u_savecommon()
644 			    && top + 2 <= uep->ue_top + uep->ue_size + 1))  in u_savecommon()
648 		if (uep->ue_size == 1 && uep->ue_top == top)  in u_savecommon()
664 			prev_uep->ue_next = uep->ue_next;  in u_savecommon()
665 			uep->ue_next = curbuf->b_u_newhead->uh_entry;  in u_savecommon()
666 			curbuf->b_u_newhead->uh_entry = uep;  in u_savecommon()
671 			uep->ue_bot = newbot;  in u_savecommon()
673 			uep->ue_bot = 0;  in u_savecommon()
676 			uep->ue_lcount = curbuf->b_ml.ml_line_count;  in u_savecommon()
677 			curbuf->b_u_newhead->uh_getbot_entry = uep;  in u_savecommon()
681 		prev_uep = uep;  in u_savecommon()
682 		uep = uep->ue_next;  in u_savecommon()
702     uep = U_ALLOC_LINE(sizeof(u_entry_T));  in u_savecommon()
703     if (uep == NULL)  in u_savecommon()
705     CLEAR_POINTER(uep);  in u_savecommon()
707     uep->ue_magic = UE_MAGIC;  in u_savecommon()
710     uep->ue_size = size;  in u_savecommon()
711     uep->ue_top = top;  in u_savecommon()
713 	uep->ue_bot = newbot;  in u_savecommon()
719 	uep->ue_bot = 0;  in u_savecommon()
722 	uep->ue_lcount = curbuf->b_ml.ml_line_count;  in u_savecommon()
723 	curbuf->b_u_newhead->uh_getbot_entry = uep;  in u_savecommon()
728 	if ((uep->ue_array = U_ALLOC_LINE(sizeof(undoline_T) * size)) == NULL)  in u_savecommon()
730 	    u_freeentry(uep, 0L);  in u_savecommon()
738 		u_freeentry(uep, i);  in u_savecommon()
741 	    if (u_save_line(&uep->ue_array[i], lnum++) == FAIL)  in u_savecommon()
743 		u_freeentry(uep, i);  in u_savecommon()
749 	uep->ue_array = NULL;  in u_savecommon()
750     uep->ue_next = curbuf->b_u_newhead->uh_entry;  in u_savecommon()
751     curbuf->b_u_newhead->uh_entry = uep;  in u_savecommon()
910     u_entry_T	*uep;  in u_free_uhp()  local
912     uep = uhp->uh_entry;  in u_free_uhp()
913     while (uep != NULL)  in u_free_uhp()
915 	nuep = uep->ue_next;  in u_free_uhp()
916 	u_freeentry(uep, uep->ue_size);  in u_free_uhp()
917 	uep = nuep;  in u_free_uhp()
1284     u_entry_T	*uep;  in serialize_uhp()  local
1313     for (uep = uhp->uh_entry; uep != NULL; uep = uep->ue_next)  in serialize_uhp()
1316 	if (serialize_uep(bi, uep) == FAIL)  in serialize_uhp()
1328     u_entry_T	*uep, *last_uep;  in unserialize_uhp()  local
1390 	uep = unserialize_uep(bi, &error, file_name);  in unserialize_uhp()
1392 	    uhp->uh_entry = uep;  in unserialize_uhp()
1394 	    last_uep->ue_next = uep;  in unserialize_uhp()
1395 	last_uep = uep;  in unserialize_uhp()
1396 	if (uep == NULL || error)  in unserialize_uhp()
1418     u_entry_T	*uep)  in serialize_uep()  argument
1423     undo_write_bytes(bi, (long_u)uep->ue_top, 4);  in serialize_uep()
1424     undo_write_bytes(bi, (long_u)uep->ue_bot, 4);  in serialize_uep()
1425     undo_write_bytes(bi, (long_u)uep->ue_lcount, 4);  in serialize_uep()
1426     undo_write_bytes(bi, (long_u)uep->ue_size, 4);  in serialize_uep()
1427     for (i = 0; i < uep->ue_size; ++i)  in serialize_uep()
1431 	len = STRLEN(uep->ue_array[i].ul_line);  in serialize_uep()
1434 	if (len > 0 && fwrite_crypt(bi, uep->ue_array[i].ul_line, len) == FAIL)  in serialize_uep()
1444     u_entry_T	*uep;  in unserialize_uep()  local
1449     uep = U_ALLOC_LINE(sizeof(u_entry_T));  in unserialize_uep()
1450     if (uep == NULL)  in unserialize_uep()
1452     CLEAR_POINTER(uep);  in unserialize_uep()
1454     uep->ue_magic = UE_MAGIC;  in unserialize_uep()
1456     uep->ue_top = undo_read_4c(bi);  in unserialize_uep()
1457     uep->ue_bot = undo_read_4c(bi);  in unserialize_uep()
1458     uep->ue_lcount = undo_read_4c(bi);  in unserialize_uep()
1459     uep->ue_size = undo_read_4c(bi);  in unserialize_uep()
1460     if (uep->ue_size > 0)  in unserialize_uep()
1462 	if (uep->ue_size < LONG_MAX / (int)sizeof(char_u *))  in unserialize_uep()
1463 	    array = U_ALLOC_LINE(sizeof(undoline_T) * uep->ue_size);  in unserialize_uep()
1467 	    return uep;  in unserialize_uep()
1469 	vim_memset(array, 0, sizeof(undoline_T) * uep->ue_size);  in unserialize_uep()
1471     uep->ue_array = array;  in unserialize_uep()
1473     for (i = 0; i < uep->ue_size; ++i)  in unserialize_uep()
1486 	    return uep;  in unserialize_uep()
1491     return uep;  in unserialize_uep()
2677     u_entry_T	*uep, *nuep;  in u_undoredo()  local
2708     for (uep = curhead->uh_entry; uep != NULL; uep = nuep)  in u_undoredo()
2710 	top = uep->ue_top;  in u_undoredo()
2711 	bot = uep->ue_bot;  in u_undoredo()
2724 	newsize = uep->ue_size;	    // number of lines after undo  in u_undoredo()
2748 		    if (curbuf->b_ml.ml_line_len != uep->ue_array[i].ul_len  in u_undoredo()
2749 			    || memcmp(uep->ue_array[i].ul_line, p,  in u_undoredo()
2753 		if (i == newsize && newlnum == MAXLNUM && uep->ue_next == NULL)  in u_undoredo()
2779 		while (uep != NULL)  in u_undoredo()
2781 		    nuep = uep->ue_next;  in u_undoredo()
2782 		    u_freeentry(uep, uep->ue_size);  in u_undoredo()
2783 		    uep = nuep;  in u_undoredo()
2816 		    ml_replace_len((linenr_T)1, uep->ue_array[i].ul_line,  in u_undoredo()
2817 					  uep->ue_array[i].ul_len, TRUE, TRUE);  in u_undoredo()
2819 		    ml_append_flags(lnum, uep->ue_array[i].ul_line,  in u_undoredo()
2820 			     (colnr_T)uep->ue_array[i].ul_len, ML_APPEND_UNDO);  in u_undoredo()
2821 		vim_free(uep->ue_array[i].ul_line);  in u_undoredo()
2823 	    vim_free((char_u *)uep->ue_array);  in u_undoredo()
2849 	uep->ue_size = oldsize;  in u_undoredo()
2850 	uep->ue_array = newarray;  in u_undoredo()
2851 	uep->ue_bot = top + newsize + 1;  in u_undoredo()
2856 	nuep = uep->ue_next;  in u_undoredo()
2857 	uep->ue_next = newlist;  in u_undoredo()
2858 	newlist = uep;  in u_undoredo()
3216     u_entry_T   *uep;  in u_find_first_changed()  local
3223     uep = uhp->uh_entry;  in u_find_first_changed()
3224     if (uep->ue_top != 0 || uep->ue_bot != 0)  in u_find_first_changed()
3228 					      && lnum <= uep->ue_size; ++lnum)  in u_find_first_changed()
3232 	if (uep->ue_array[lnum - 1].ul_len != curbuf->b_ml.ml_line_len  in u_find_first_changed()
3233 		|| memcmp(p, uep->ue_array[lnum - 1].ul_line, uep->ue_array[lnum - 1].ul_len) != 0)  in u_find_first_changed()
3240     if (curbuf->b_ml.ml_line_count != uep->ue_size)  in u_find_first_changed()
3303     u_entry_T	*uep;  in u_getbot()  local
3306     uep = u_get_headentry();	// check for corrupt undo list  in u_getbot()
3307     if (uep == NULL)  in u_getbot()
3310     uep = curbuf->b_u_newhead->uh_getbot_entry;  in u_getbot()
3311     if (uep != NULL)  in u_getbot()
3318 	extra = curbuf->b_ml.ml_line_count - uep->ue_lcount;  in u_getbot()
3319 	uep->ue_bot = uep->ue_top + uep->ue_size + 1 + extra;  in u_getbot()
3320 	if (uep->ue_bot < 1 || uep->ue_bot > curbuf->b_ml.ml_line_count)  in u_getbot()
3323 	    uep->ue_bot = uep->ue_top + 1;  // assume all lines deleted, will  in u_getbot()
3414     u_entry_T	    *uep, *nuep;  in u_freeentries()  local
3424     for (uep = uhp->uh_entry; uep != NULL; uep = nuep)  in u_freeentries()
3426 	nuep = uep->ue_next;  in u_freeentries()
3427 	u_freeentry(uep, uep->ue_size);  in u_freeentries()
3441 u_freeentry(u_entry_T *uep, long n)  in u_freeentry()  argument
3444 	vim_free(uep->ue_array[--n].ul_line);  in u_freeentry()
3445     vim_free((char_u *)uep->ue_array);  in u_freeentry()
3447     uep->ue_magic = 0;  in u_freeentry()
3449     vim_free((char_u *)uep);  in u_freeentry()