126     int		type;  in init_history()  local
132 	for (type = 0; type < HIST_COUNT; ++type)   // adjust the tables  in init_history()
139 		    if (type == 0)  // first one: just keep the old length  in init_history()
147 		    type = -1;  in init_history()
155 		if (hisidx[type] < 0)		// there are no entries yet  in init_history()
162 		    for (i = 0; i <= hisidx[type]; ++i)  in init_history()
163 			temp[i] = history[type][i];  in init_history()
165 		    for ( ; i <= newlen - (hislen - hisidx[type]); ++i)  in init_history()
168 			temp[i] = history[type][j];  in init_history()
172 		    j = hisidx[type];  in init_history()
176 			    temp[i] = history[type][j];  in init_history()
178 			    vim_free(history[type][j].hisstr);  in init_history()
181 			if (j == hisidx[type])  in init_history()
184 		    hisidx[type] = newlen - 1;  in init_history()
186 		vim_free(history[type]);  in init_history()
187 		history[type] = temp;  in init_history()
209     int	    type,  in in_history()  argument
219     if (hisidx[type] < 0)  in in_history()
221     i = hisidx[type];  in in_history()
224 	if (history[type][i].hisstr == NULL)  in in_history()
229 	p = history[type][i].hisstr;  in in_history()
231 		&& !(writing && history[type][i].viminfo)  in in_history()
232 		&& (type != HIST_SEARCH || sep == p[STRLEN(p) + 1]))  in in_history()
241     } while (i != hisidx[type]);  in in_history()
245 	str = history[type][i].hisstr;  in in_history()
246 	while (i != hisidx[type])  in in_history()
250 	    history[type][last_i] = history[type][i];  in in_history()
253 	history[type][i].hisnum = ++hisnum[type];  in in_history()
254 	history[type][i].viminfo = FALSE;  in in_history()
255 	history[type][i].hisstr = str;  in in_history()
256 	history[type][i].time_set = vim_time();  in in_history()
607     int		type;  in f_histget()  local
621 	type = get_histtype(str);  in f_histget()
623 	    idx = get_history_idx(type);  in f_histget()
627 	rettv->vval.v_string = vim_strsave(get_history_entry(type, idx));  in f_histget()