1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594
|
/*
* Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#if HAVE_CONFIG_H
# include "config.h"
#endif
#include "mutt.h"
#include "history.h"
#include "mutt_menu.h"
#include <stdint.h>
/* This history ring grows from 0..HistSize, with last marking the
* where new entries go:
* 0 the oldest entry in the ring
* 1 entry
* ...
* x-1 most recently entered text
* last-> x NULL (this will be overwritten next)
* x+1 NULL
* ...
* HistSize NULL
*
* Once the array fills up, it is used as a ring. last points where a new
* entry will go. Older entries are "up", and wrap around:
* 0 entry
* 1 entry
* ...
* y-1 most recently entered text
* last-> y entry (this will be overwritten next)
* y+1 the oldest entry in the ring
* ...
* HistSize entry
*
* When $history_remove_dups is set, duplicate entries are scanned and removed
* each time a new entry is added. In order to preserve the history ring size,
* entries 0..last are compacted up. Entries last+1..HistSize are
* compacted down:
* 0 entry
* 1 entry
* ...
* z-1 most recently entered text
* last-> z entry (this will be overwritten next)
* z+1 NULL
* z+2 NULL
* ...
* the oldest entry in the ring
* next oldest entry
* HistSize entry
*/
struct history
{
char **hist;
short cur;
short last;
};
static const struct mapping_t HistoryHelp[] = {
{ N_("Exit"), OP_EXIT },
{ N_("Select"), OP_GENERIC_SELECT_ENTRY },
{ N_("Search"), OP_SEARCH },
{ N_("Help"), OP_HELP },
{ NULL, 0 }
};
/* global vars used for the string-history routines */
static struct history History[HC_LAST];
static int OldSize = 0;
#define GET_HISTORY(CLASS) ((CLASS >= HC_LAST) ? NULL : &History[CLASS])
static void init_history (struct history *h)
{
int i;
if (OldSize)
{
if (h->hist)
{
for (i = 0 ; i <= OldSize ; i ++)
FREE (&h->hist[i]);
FREE (&h->hist);
}
}
if (HistSize)
h->hist = safe_calloc (HistSize + 1, sizeof (char *));
h->cur = 0;
h->last = 0;
}
void mutt_read_histfile (void)
{
FILE *f;
int line = 0, hclass, read;
char *linebuf = NULL, *p;
size_t buflen;
if (!HistFile)
return;
if ((f = fopen (HistFile, "r")) == NULL)
return;
while ((linebuf = mutt_read_line (linebuf, &buflen, f, &line, 0)) != NULL)
{
read = 0;
if (sscanf (linebuf, "%d:%n", &hclass, &read) < 1 || read == 0 ||
*(p = linebuf + strlen (linebuf) - 1) != '|' || hclass < 0)
{
mutt_error (_("Bad history file format (line %d)"), line);
break;
}
/* silently ignore too high class (probably newer mutt) */
if (hclass >= HC_LAST)
continue;
*p = '\0';
p = safe_strdup (linebuf + read);
if (p)
{
mutt_convert_string (&p, "utf-8", Charset, 0);
mutt_history_add (hclass, p, 0);
FREE (&p);
}
}
safe_fclose (&f);
FREE (&linebuf);
}
static int dup_hash_dec (HASH *dup_hash, char *s)
{
struct hash_elem *elem;
uintptr_t count;
elem = hash_find_elem (dup_hash, s);
if (!elem)
return -1;
count = (uintptr_t)elem->data;
if (count <= 1)
{
hash_delete (dup_hash, s, NULL, NULL);
return 0;
}
count--;
elem->data = (void *)count;
return count;
}
static int dup_hash_inc (HASH *dup_hash, char *s)
{
struct hash_elem *elem;
uintptr_t count;
elem = hash_find_elem (dup_hash, s);
if (!elem)
{
count = 1;
hash_insert (dup_hash, s, (void *)count);
return count;
}
count = (uintptr_t)elem->data;
count++;
elem->data = (void *)count;
return count;
}
static void shrink_histfile (void)
{
BUFFER *tmpfname = NULL;
FILE *f, *tmp = NULL;
int n[HC_LAST] = { 0 };
int line, hclass, read;
char *linebuf = NULL, *p;
size_t buflen;
int regen_file = 0;
HASH *dup_hashes[HC_LAST] = { 0 };
if ((f = fopen (HistFile, "r")) == NULL)
return;
if (option (OPTHISTREMOVEDUPS))
for (hclass = 0; hclass < HC_LAST; hclass++)
dup_hashes[hclass] = hash_create (MAX (10, SaveHist * 2), MUTT_HASH_STRDUP_KEYS);
line = 0;
while ((linebuf = mutt_read_line (linebuf, &buflen, f, &line, 0)) != NULL)
{
if (sscanf (linebuf, "%d:%n", &hclass, &read) < 1 || read == 0 ||
*(p = linebuf + strlen (linebuf) - 1) != '|' || hclass < 0)
{
mutt_error (_("Bad history file format (line %d)"), line);
goto cleanup;
}
/* silently ignore too high class (probably newer mutt) */
if (hclass >= HC_LAST)
continue;
*p = '\0';
if (option (OPTHISTREMOVEDUPS) &&
(dup_hash_inc (dup_hashes[hclass], linebuf + read) > 1))
{
regen_file = 1;
continue;
}
n[hclass]++;
}
if (!regen_file)
for (hclass = HC_FIRST; hclass < HC_LAST; hclass++)
if (n[hclass] > SaveHist)
{
regen_file = 1;
break;
}
if (regen_file)
{
tmpfname = mutt_buffer_pool_get ();
mutt_buffer_mktemp (tmpfname);
if ((tmp = safe_fopen (mutt_b2s (tmpfname), "w+")) == NULL)
{
mutt_perror (mutt_b2s (tmpfname));
goto cleanup;
}
rewind (f);
line = 0;
while ((linebuf = mutt_read_line (linebuf, &buflen, f, &line, 0)) != NULL)
{
if (sscanf (linebuf, "%d:%n", &hclass, &read) < 1 || read == 0 ||
*(p = linebuf + strlen (linebuf) - 1) != '|' || hclass < 0)
{
mutt_error (_("Bad history file format (line %d)"), line);
goto cleanup;
}
if (hclass >= HC_LAST)
continue;
*p = '\0';
if (option (OPTHISTREMOVEDUPS) &&
(dup_hash_dec (dup_hashes[hclass], linebuf + read) > 0))
continue;
*p = '|';
if (n[hclass]-- <= SaveHist)
fprintf (tmp, "%s\n", linebuf);
}
}
cleanup:
safe_fclose (&f);
FREE (&linebuf);
if (tmp != NULL)
{
if (fflush (tmp) == 0 &&
(f = fopen (HistFile, "w")) != NULL) /* __FOPEN_CHECKED__ */
{
rewind (tmp);
mutt_copy_stream (tmp, f);
safe_fclose (&f);
}
safe_fclose (&tmp);
unlink (mutt_b2s (tmpfname));
}
mutt_buffer_pool_release (&tmpfname);
if (option (OPTHISTREMOVEDUPS))
for (hclass = 0; hclass < HC_LAST; hclass++)
hash_destroy (&dup_hashes[hclass], NULL);
}
static void save_history (history_class_t hclass, const char *s)
{
static int n = 0;
FILE *f;
char *tmp, *p;
if (!s || !*s) /* This shouldn't happen, but it's safer. */
return;
if ((f = fopen (HistFile, "a")) == NULL)
{
mutt_perror ("fopen");
return;
}
tmp = safe_strdup (s);
mutt_convert_string (&tmp, Charset, "utf-8", 0);
/* Format of a history item (1 line): "<histclass>:<string>|".
We add a '|' in order to avoid lines ending with '\'. */
fprintf (f, "%d:", (int) hclass);
for (p = tmp; *p; p++)
{
/* Don't copy \n as a history item must fit on one line. The string
shouldn't contain such a character anyway, but as this can happen
in practice, we must deal with that. */
if (*p != '\n')
putc ((unsigned char) *p, f);
}
fputs ("|\n", f);
safe_fclose (&f);
FREE (&tmp);
if (--n < 0)
{
n = SaveHist;
shrink_histfile();
}
}
/* When removing dups, we want the created "blanks" to be right below the
* resulting h->last position. See the comment section above 'struct history'.
*/
static void remove_history_dups (history_class_t hclass, const char *s)
{
int source, dest, old_last;
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return; /* disabled */
/* Remove dups from 0..last-1 compacting up. */
source = dest = 0;
while (source < h->last)
{
if (!mutt_strcmp (h->hist[source], s))
FREE (&h->hist[source++]);
else
h->hist[dest++] = h->hist[source++];
}
/* Move 'last' entry up. */
h->hist[dest] = h->hist[source];
old_last = h->last;
h->last = dest;
/* Fill in moved entries with NULL */
while (source > h->last)
h->hist[source--] = NULL;
/* Remove dups from last+1 .. HistSize compacting down. */
source = dest = HistSize;
while (source > old_last)
{
if (!mutt_strcmp (h->hist[source], s))
FREE (&h->hist[source--]);
else
h->hist[dest--] = h->hist[source--];
}
/* Fill in moved entries with NULL */
while (dest > old_last)
h->hist[dest--] = NULL;
}
void mutt_init_history(void)
{
history_class_t hclass;
if (HistSize == OldSize)
return;
for (hclass = HC_FIRST; hclass < HC_LAST; hclass++)
init_history(&History[hclass]);
OldSize = HistSize;
}
void mutt_history_add (history_class_t hclass, const char *s, int save)
{
int prev;
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return; /* disabled */
if (*s)
{
prev = h->last - 1;
if (prev < 0) prev = HistSize;
/* don't add to prompt history:
* - lines beginning by a space
* - repeated lines
*/
if (*s != ' ' && (!h->hist[prev] || mutt_strcmp (h->hist[prev], s) != 0))
{
if (option (OPTHISTREMOVEDUPS))
remove_history_dups (hclass, s);
if (save && SaveHist && HistFile)
save_history (hclass, s);
mutt_str_replace (&h->hist[h->last++], s);
if (h->last > HistSize)
h->last = 0;
}
}
h->cur = h->last; /* reset to the last entry */
}
char *mutt_history_next (history_class_t hclass)
{
int next;
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return (""); /* disabled */
next = h->cur;
do
{
next++;
if (next > HistSize)
next = 0;
if (next == h->last)
break;
} while (h->hist[next] == NULL);
h->cur = next;
return (h->hist[h->cur] ? h->hist[h->cur] : "");
}
char *mutt_history_prev (history_class_t hclass)
{
int prev;
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return (""); /* disabled */
prev = h->cur;
do
{
prev--;
if (prev < 0)
prev = HistSize;
if (prev == h->last)
break;
} while (h->hist[prev] == NULL);
h->cur = prev;
return (h->hist[h->cur] ? h->hist[h->cur] : "");
}
void mutt_reset_history_state (history_class_t hclass)
{
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return; /* disabled */
h->cur = h->last;
}
int mutt_history_at_scratch (history_class_t hclass)
{
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return 0; /* disabled */
return h->cur == h->last;
}
void mutt_history_save_scratch (history_class_t hclass, const char *s)
{
struct history *h = GET_HISTORY(hclass);
if (!HistSize || !h)
return; /* disabled */
/* Don't check if s has a value because the scratch buffer may contain
* an old garbage value that should be overwritten */
mutt_str_replace (&h->hist[h->last], s);
}
static const char *
history_format_str (char *dest, size_t destlen, size_t col, int cols, char op, const char *src,
const char *fmt, const char *ifstring, const char *elsestring,
void *data, format_flag flags)
{
char *match = (char *)data;
switch (op)
{
case 's':
mutt_format_s (dest, destlen, fmt, match);
break;
}
return (src);
}
static void history_entry (char *s, size_t slen, MUTTMENU *m, int num)
{
char *entry = ((char **)m->data)[num];
mutt_FormatString (s, slen, 0, MuttIndexWindow->cols, "%s", history_format_str,
entry, MUTT_FORMAT_ARROWCURSOR);
}
static void history_menu (char *buf, size_t buflen, char **matches, int match_count)
{
MUTTMENU *menu;
int done = 0;
char helpstr[LONG_STRING];
char title[STRING];
snprintf (title, sizeof (title), _("History '%s'"), buf);
menu = mutt_new_menu (MENU_GENERIC);
menu->make_entry = history_entry;
menu->title = title;
menu->help = mutt_compile_help (helpstr, sizeof (helpstr), MENU_GENERIC, HistoryHelp);
mutt_push_current_menu (menu);
menu->max = match_count;
menu->data = matches;
while (!done)
{
switch (mutt_menuLoop (menu))
{
case OP_GENERIC_SELECT_ENTRY:
strfcpy (buf, matches[menu->current], buflen);
/* fall through */
case OP_EXIT:
done = 1;
break;
}
}
mutt_pop_current_menu (menu);
mutt_menuDestroy (&menu);
}
static int search_history (char *search_buf, history_class_t hclass, char **matches)
{
struct history *h = GET_HISTORY(hclass);
int match_count = 0, cur;
if (!HistSize || !h)
return 0;
cur = h->last;
do
{
cur--;
if (cur < 0)
cur = HistSize;
if (cur == h->last)
break;
if (mutt_stristr (h->hist[cur], search_buf))
matches[match_count++] = h->hist[cur];
} while (match_count < HistSize);
return match_count;
}
void mutt_history_complete (char *buf, size_t buflen, history_class_t hclass)
{
char **matches;
int match_count;
matches = safe_calloc (HistSize, sizeof (char *));
match_count = search_history (buf, hclass, matches);
if (match_count)
{
if (match_count == 1)
strfcpy (buf, matches[0], buflen);
else
history_menu (buf, buflen, matches, match_count);
}
FREE(&matches);
}
|