/*
* fmg 8/20/97
* Search history - main function that started the C-code blasphemy :-)
* This function doesn't care about case/case-less status...
*/
void searchhist(WIN *w_hist, wchar_t *str)
{
int y;
WIN *w_new;
const char *hline;
size_t i;
/* Find out how big a window we must open. */
y = w_hist->y2;
if (st == (WIN *)0 || (st && tempst))
y--;
/* Open a Search line window. */
w_new = mc_wopen(0, y+1, w_hist->x2, y+1, 0, st_attr, sfcolor, sbcolor, 0, 0, 1);
w_new->doscroll = 0;
w_new->wrap = 0;
hline = _("SEARCH FOR (ESC=Exit)");
mc_wprintf(w_new, "%s(%d):",hline,MAX_SEARCH);
mc_wredraw(w_new, 1);
mc_wflush();
mc_wlocate(w_new, mbslen(hline)+6, 0);
for (i = 0; str[i] != 0; i++)
mc_wputc(w_new, str[i]);
mc_wlocate(w_new, mbslen(hline)+6, 0);
mc_wgetwcs(w_new, str, MAX_SEARCH, MAX_SEARCH);
#if 0
if (!str[0]) { /* then unchanged... must have pressed ESC... get out */
mc_wflush();
mc_wclose(w_new, 0);
return;
}
#endif
mc_wredraw(w_hist, 1);
mc_wclose(w_new, 1);
mc_wflush();
return;
}
/* Knuth-Morris-Pratt algorithm.
See http://en.wikipedia.org/wiki/Knuth-Morris-Pratt_algorithm
Return a boolean indicating success:
Return true and set *RESULTP if the search was completed.
Return false if it was aborted because not enough memory was available. */
static bool
knuth_morris_pratt_multibyte (const char *haystack, const char *needle,
const char **resultp)
{
size_t m = mbslen (needle);
mbchar_t *needle_mbchars;
size_t *table;
/* Allocate room for needle_mbchars and the table. */
char *memory = (char *) nmalloca (m, sizeof (mbchar_t) + sizeof (size_t));
if (memory == NULL)
return false;
needle_mbchars = (mbchar_t *) memory;
table = (size_t *) (memory + m * sizeof (mbchar_t));
/* Fill needle_mbchars. */
{
mbui_iterator_t iter;
size_t j;
j = 0;
for (mbui_init (iter, needle); mbui_avail (iter); mbui_advance (iter), j++)
mb_copy (&needle_mbchars[j], &mbui_cur (iter));
}
/* Fill the table.
For 0 < i < m:
0 < table[i] <= i is defined such that
forall 0 < x < table[i]: needle[x..i-1] != needle[0..i-1-x],
and table[i] is as large as possible with this property.
This implies:
1) For 0 < i < m:
If table[i] < i,
needle[table[i]..i-1] = needle[0..i-1-table[i]].
2) For 0 < i < m:
rhaystack[0..i-1] == needle[0..i-1]
and exists h, i <= h < m: rhaystack[h] != needle[h]
implies
forall 0 <= x < table[i]: rhaystack[x..x+m-1] != needle[0..m-1].
table[0] remains uninitialized. */
{
size_t i, j;
/* i = 1: Nothing to verify for x = 0. */
table[1] = 1;
j = 0;
for (i = 2; i < m; i++)
{
/* Here: j = i-1 - table[i-1].
The inequality needle[x..i-1] != needle[0..i-1-x] is known to hold
for x < table[i-1], by induction.
Furthermore, if j>0: needle[i-1-j..i-2] = needle[0..j-1]. */
mbchar_t *b = &needle_mbchars[i - 1];
for (;;)
{
/* Invariants: The inequality needle[x..i-1] != needle[0..i-1-x]
is known to hold for x < i-1-j.
Furthermore, if j>0: needle[i-1-j..i-2] = needle[0..j-1]. */
if (mb_equal (*b, needle_mbchars[j]))
{
/* Set table[i] := i-1-j. */
table[i] = i - ++j;
break;
}
/* The inequality needle[x..i-1] != needle[0..i-1-x] also holds
for x = i-1-j, because
needle[i-1] != needle[j] = needle[i-1-x]. */
if (j == 0)
{
/* The inequality holds for all possible x. */
table[i] = i;
break;
}
/* The inequality needle[x..i-1] != needle[0..i-1-x] also holds
for i-1-j < x < i-1-j+table[j], because for these x:
needle[x..i-2]
= needle[x-(i-1-j)..j-1]
!= needle[0..j-1-(x-(i-1-j))] (by definition of table[j])
= needle[0..i-2-x],
hence needle[x..i-1] != needle[0..i-1-x].
Furthermore
needle[i-1-j+table[j]..i-2]
= needle[table[j]..j-1]
= needle[0..j-1-table[j]] (by definition of table[j]). */
j = j - table[j];
}
/* Here: j = i - table[i]. */
}
}
/* Search, using the table to accelerate the processing. */
{
size_t j;
mbui_iterator_t rhaystack;
mbui_iterator_t phaystack;
*resultp = NULL;
j = 0;
mbui_init (rhaystack, haystack);
mbui_init (phaystack, haystack);
/* Invariant: phaystack = rhaystack + j. */
while (mbui_avail (phaystack))
if (mb_equal (needle_mbchars[j], mbui_cur (phaystack)))
{
j++;
mbui_advance (phaystack);
if (j == m)
{
/* The entire needle has been found. */
*resultp = mbui_cur_ptr (rhaystack);
break;
}
}
else if (j > 0)
{
/* Found a match of needle[0..j-1], mismatch at needle[j]. */
size_t count = table[j];
j -= count;
for (; count > 0; count--)
{
if (!mbui_avail (rhaystack))
abort ();
mbui_advance (rhaystack);
}
}
else
{
/* Found a mismatch at needle[0] already. */
if (!mbui_avail (rhaystack))
abort ();
mbui_advance (rhaystack);
mbui_advance (phaystack);
}
}
freea (memory);
return true;
}
static bool
knuth_morris_pratt_multibyte (const char *haystack, const char *needle,
const char **resultp)
{
size_t m = mbslen (needle);
mbchar_t *needle_mbchars;
size_t *table;
/* Allocate room for needle_mbchars and the table. */
char *memory = (char *) malloca (m * (sizeof (mbchar_t) + sizeof (size_t)));
if (memory == NULL)
return false;
needle_mbchars = (mbchar_t *) memory;
table = (size_t *) (memory + m * sizeof (mbchar_t));
/* Fill needle_mbchars. */
{
mbui_iterator_t iter;
size_t j;
j = 0;
for (mbui_init (iter, needle); mbui_avail (iter); mbui_advance (iter), j++)
mb_copy (&needle_mbchars[j], &mbui_cur (iter));
}
/* Fill the table.
For 0 < i < m:
0 < table[i] <= i is defined such that
rhaystack[0..i-1] == needle[0..i-1] and rhaystack[i] != needle[i]
implies
forall 0 <= x < table[i]: rhaystack[x..x+m-1] != needle[0..m-1],
and table[i] is as large as possible with this property.
table[0] remains uninitialized. */
{
size_t i, j;
table[1] = 1;
j = 0;
for (i = 2; i < m; i++)
{
mbchar_t *b = &needle_mbchars[i - 1];
for (;;)
{
if (mb_equal (*b, needle_mbchars[j]))
{
table[i] = i - ++j;
break;
}
if (j == 0)
{
table[i] = i;
break;
}
j = j - table[j];
}
}
}
/* Search, using the table to accelerate the processing. */
{
size_t j;
mbui_iterator_t rhaystack;
mbui_iterator_t phaystack;
*resultp = NULL;
j = 0;
mbui_init (rhaystack, haystack);
mbui_init (phaystack, haystack);
/* Invariant: phaystack = rhaystack + j. */
while (mbui_avail (phaystack))
if (mb_equal (needle_mbchars[j], mbui_cur (phaystack)))
{
j++;
mbui_advance (phaystack);
if (j == m)
{
/* The entire needle has been found. */
*resultp = mbui_cur_ptr (rhaystack);
break;
}
}
else if (j > 0)
{
/* Found a match of needle[0..j-1], mismatch at needle[j]. */
size_t count = table[j];
j -= count;
for (; count > 0; count--)
{
if (!mbui_avail (rhaystack))
abort ();
mbui_advance (rhaystack);
}
}
else
{
/* Found a mismatch at needle[0] already. */
if (!mbui_avail (rhaystack))
abort ();
mbui_advance (rhaystack);
mbui_advance (phaystack);
}
}
freea (memory);
return true;
}
/*
* Initialize new file directory.
*
* Sets the current working directory. Non-0 return = no change.
*/
static int new_filedir(GETSDIR_ENTRY *dirdat, int flushit)
{
static size_t dp_len = 0;
static char cwd_str_fmt[BUFSIZ] = "";
size_t new_dp_len, fmt_len;
char disp_dir[80];
int initial_y = (76 - (WHAT_NR_OPTIONS * WHAT_WIDTH >= 76
? 74 : WHAT_NR_OPTIONS * WHAT_WIDTH)) / 2;
size_t i;
char * new_prev_dir;
cur = 0;
ocur = 0;
subm = SUBM_OKAY;
quit = 0;
top = 0;
c = 0;
pgud = 0;
first = 1;
min_len = 1;
dprev = -1;
tag_cnt = 0;
/*
* get last directory
*/
work_dir = down_loading ? d_work_dir : u_work_dir;
/*
* init working directory to default?
*/
if (work_dir == NULL) {
char *s = down_loading? P_DOWNDIR : P_UPDIR;
min_len = 1;
if (*s != '/')
min_len += strlen(homedir) + 1;
min_len += strlen(s);
if (min_len < BUFSIZ)
min_len = BUFSIZ;
work_dir = set_work_dir(NULL, min_len);
if (*s == '/')
strncpy(work_dir, s, min_len);
else
snprintf(work_dir, min_len, "%s/%s", homedir, s);
}
/* lop-off trailing "/" for consistency */
if (strlen(work_dir) > 1 && work_dir[strlen(work_dir) - 1] == '/')
work_dir[strlen(work_dir) - 1] = (char)0;
/* get the current working directory, which will become the prev_dir, on success */
new_prev_dir = getcwd(NULL, BUFSIZ);
if (!new_prev_dir)
return -1;
if (!access(work_dir, R_OK | X_OK) && !chdir(work_dir)) {
/* was able to change to new working directory */
free(prev_dir);
prev_dir = new_prev_dir;
}
else {
/* Could not change to the new working directory */
mc_wbell();
werror(
_("Could not change to directory %s (%s)"),
work_dir,
strerror(errno));
/* restore the previous working directory */
free(work_dir);
work_dir = set_work_dir(new_prev_dir, strlen(new_prev_dir));
}
/* All right, draw the file directory! */
if (flushit) {
dirflush = 0;
mc_winclr(main_w);
mc_wredraw(main_w, 1);
}
mc_wcursor(main_w, CNORMAL);
{
char *s;
if (down_loading) {
if (how_many < 0)
s = _("Select one or more files for download");
else if (how_many)
s = _("Select a file for download");
else
s = _("Select a directory for download");
} else {
if (how_many < 0)
s = _("Select one or more files for upload");
else if (how_many)
s = _("Select a file for upload");
else
s = _("Select a directory for upload");
}
snprintf(file_title, sizeof(file_title), "%s", s);
}
mc_wtitle(main_w, TMID, file_title);
if ((new_dp_len = strlen(work_dir)) > dp_len) {
dp_len = new_dp_len;
snprintf(cwd_str_fmt, sizeof(cwd_str_fmt),
_("Directory: %%-%ds"), (int)dp_len);
}
new_dp_len = mbslen (work_dir);
if (new_dp_len + (fmt_len = mbslen(cwd_str_fmt)) > 75) {
size_t i;
char *tmp_dir = work_dir;
/* We want the last 73 characters */
for (i = 0; 73 + i < new_dp_len + fmt_len; i++) {
wchar_t wc;
tmp_dir += one_mbtowc(&wc, work_dir, MB_LEN_MAX);
}
snprintf(disp_dir, sizeof(disp_dir), "...%s", tmp_dir);
snprintf(cwd_str, sizeof(cwd_str), cwd_str_fmt, disp_dir);
} else
snprintf(cwd_str, sizeof(cwd_str), cwd_str_fmt, work_dir);
mc_wlocate(main_w, 0, 0);
mc_wputs(main_w, cwd_str);
for (i = 0; i < WHAT_NR_OPTIONS; i++) {
const char *str, *c;
size_t j;
str = _(what[i]);
c = str;
for (j = 0; j < WHAT_WIDTH - 1 && *c != 0; j++) {
wchar_t wc;
c += one_mbtowc (&wc, c, MB_LEN_MAX);
}
what_lens[i] = c - str;
j = WHAT_WIDTH - j; /* Characters left for padding */
what_padding[i][1] = j / 2; /* Rounding down */
what_padding[i][0] = j - what_padding[i][1]; /* >= 1 */
}
mc_wlocate(dsub, initial_y, 0);
for (i = 0; i < WHAT_NR_OPTIONS; i++)
horiz_draw(i, mc_wgetattr(dsub), mc_wgetattr(dsub));
mc_wsetregion(main_w, 1, main_w->ys - FILE_MWTR);
main_w->doscroll = 0;
/* old dir to discard? */
free(dirdat);
dirdat = NULL;
/* get sorted directory */
if ((nrents = getsdir(".", wc_str,
GETSDIR_PARNT|GETSDIR_NSORT|GETSDIR_DIRSF,
0, &dirdat, &longest)) < 0) {
/* we really want to announce the error here!!! */
mc_wclose(main_w, 1);
mc_wclose(dsub, 1);
free(dirdat);
dirdat = NULL;
return -1;
}
global_dirdat = dirdat; // Hmm...
prdir(main_w, top, top, dirdat, longest);
mc_wlocate(main_w, initial_y, main_w->ys - FILE_MWTR);
mc_wputs(main_w, _("( Escape to exit, Space to tag )"));
dhili(subm);
/* this really needs to go in dhili !!!*/
mc_wlocate(main_w, 0, cur + FILE_MWTR - top);
if (flushit) {
dirflush = 1;
mc_wredraw(dsub, 1);
}
return 0;
}
/*
* Run an external script.
* ask = 1 if first ask for confirmation.
* s = scriptname, l=loginname, p=password.
*/
void runscript(int ask, const char *s, const char *l, const char *p)
{
int status;
int n, i;
int pipefd[2];
char buf[81];
char scr_lines[5];
char cmdline[128];
struct pollfd fds[2];
char *translated_cmdline;
char *ptr;
WIN *w;
int done = 0;
char *msg = _("Same as last");
char *username = _(" A - Username :"******" B - Password :"******" C - Name of script :"),
*question = _("Change which setting? (Return to run, ESC to stop)");
if (ask) {
w = mc_wopen(10, 5, 70, 10, BDOUBLE, stdattr, mfcolor, mbcolor, 0, 0, 1);
mc_wtitle(w, TMID, _("Run a script"));
mc_wputs(w, "\n");
mc_wprintf(w, "%s %s\n", username, scr_user[0] ? msg : "");
mc_wprintf(w, "%s %s\n", password, scr_passwd[0] ? msg : "");
mc_wprintf(w, "%s %s\n", name_of_script, scr_name);
mc_wlocate(w, 4, 5);
mc_wputs(w, question);
mc_wredraw(w, 1);
while (!done) {
mc_wlocate(w, mbslen (question) + 5, 5);
n = wxgetch();
if (islower(n))
n = toupper(n);
switch (n) {
case '\r':
case '\n':
if (scr_name[0] == '\0') {
mc_wbell();
break;
}
mc_wclose(w, 1);
done = 1;
break;
case 27: /* ESC */
mc_wclose(w, 1);
return;
case 'A':
mc_wlocate(w, mbslen (username) + 1, 1);
mc_wclreol(w);
scr_user[0] = 0;
mc_wgets(w, scr_user, 32, 32);
break;
case 'B':
mc_wlocate(w, mbslen (password) + 1, 2);
mc_wclreol(w);
scr_passwd[0] = 0;
mc_wgets(w, scr_passwd, 32, 32);
break;
case 'C':
mc_wlocate(w, mbslen (name_of_script) + 1, 3);
mc_wgets(w, scr_name, 32, 32);
break;
default:
break;
}
}
} else {
strncpy(scr_user, l, sizeof(scr_user));
strncpy(scr_name, s, sizeof(scr_name));
strncpy(scr_passwd, p, sizeof(scr_passwd));
}
sprintf(scr_lines, "%d", (int) lines); /* jl 13.09.97 */
/* Throw away status line if temporary */
if (tempst) {
mc_wclose(st, 1);
tempst = 0;
st = NULL;
}
scriptname(scr_name);
pipe(pipefd);
if (mcd(P_SCRIPTDIR) < 0)
return;
snprintf(cmdline, sizeof(cmdline), "%s %s %s %s",
P_SCRIPTPROG, scr_name, logfname, logfname[0]==0? "": homedir);
switch (udpid = fork()) {
case -1:
werror(_("Out of memory: could not fork()"));
close(pipefd[0]);
close(pipefd[1]);
mcd("");
return;
case 0: /* Child */
dup2(portfd, 0);
dup2(portfd, 1);
dup2(pipefd[1], 2);
close(pipefd[0]);
close(pipefd[1]);
for (n = 1; n < _NSIG; n++)
signal(n, SIG_DFL);
mc_setenv("LOGIN", scr_user);
mc_setenv("PASS", scr_passwd);
mc_setenv("TERMLIN", scr_lines); /* jl 13.09.97 */
translated_cmdline = translate(cmdline);
if (translated_cmdline != NULL) {
fastexec(translated_cmdline);
free(translated_cmdline);
}
exit(1);
default: /* Parent */
break;
}
setcbreak(1); /* Cbreak, no echo */
enab_sig(1, 0); /* But enable SIGINT */
signal(SIGINT, udcatch);
close(pipefd[1]);
/* pipe output from "runscript" program to terminal emulator */
fds[0].fd = pipefd[0]; /* runscript */
fds[0].events = POLLIN;
fds[1].fd = STDIN_FILENO; /* stdin */
fds[1].events = POLLIN;
script_running = 1;
while (script_running && poll(fds, 2, -1) > 0)
for (i = 0; i < 2; i++) {
if (fds[i].revents & (POLLERR | POLLHUP | POLLNVAL))
script_running = 0;
else if ((fds[i].revents & POLLIN)
&& (n = read(fds[i].fd, buf, sizeof(buf)-1)) > 0) {
ptr = buf;
while (n--)
if (i)
vt_send(*ptr++);
else
vt_out(*ptr++);
timer_update();
mc_wflush();
}
}
/* Collect status, and clean up. */
m_wait(&status);
enab_sig(0, 0);
signal(SIGINT, SIG_IGN);
setcbreak(2); /* Raw, no echo */
close(pipefd[0]);
scriptname("");
mcd("");
}
