X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=selector.cc;h=fb08373138ba3697830f3963bdfb277afaf42ad4;hb=38928273eaf85df985dd2b905ae93eb345230daf;hp=0884477098947454448470e22d9674f117f2d0eb;hpb=b376894273ad07cae4489e3d219b8fef7cd00da7;p=selector.git diff --git a/selector.cc b/selector.cc index 0884477..fb08373 100644 --- a/selector.cc +++ b/selector.cc @@ -1,7 +1,7 @@ /* - * selector is a simple shell command for selection of strings with a - * dynamic pattern-matching. + * selector is a simple command line utility for selection of strings + * with a dynamic pattern-matching. * * Copyright (c) 2009 Francois Fleuret * Written by Francois Fleuret @@ -22,98 +22,305 @@ * */ -// To use it as a super-history-search: -// ./selector -v -f ${HISTFILE} +// To use it as a super-history-search for bash: +// selector -q -b -i -d -v -w -l ${HISTSIZE} <(history) -// This software is highly Linux-specific, but I would be glad to get -// patches to make it work on other OS - -#include -#include +// #include +// #include #include #include +#include #include #include #include #include #include +#include +#include using namespace std; #define VERSION "1.0" +const int buffer_size = 4096; + // Yeah, global variables! -int buffer_size = 1024; -int nb_lines_max = 10000; +int nb_lines_max = 1000; char pattern_separator = ';'; +char label_separator = '\0'; int output_to_vt_buffer = 0; +int add_control_qs = 0; int with_colors = 1; int zsh_history = 0; +int bash_history = 0; +int inverse_order = 0; +int remove_duplicates = 0; +int use_regexp = 0; +int case_sensitive = 0; +char *title = 0; +int error_flash = 0; + +int attr_modeline, attr_focus_line, attr_error; ////////////////////////////////////////////////////////////////////// -// This looks severely Linux-only ... +void inject_into_tty_buffer(char *string) { + struct termios oldtio, newtio; + tcgetattr(STDIN_FILENO, &oldtio); + memset(&newtio, 0, sizeof(newtio)); + // Set input mode (non-canonical, *no echo*,...) + tcsetattr(STDIN_FILENO, TCSANOW, &newtio); + const char control_q = '\021'; + // Put the selected string in the tty input buffer + for(const char *k = string; *k; k++) { + if(add_control_qs && !(*k >= ' ' && *k <= '~')) { + // Add ^Q to quote control characters + ioctl(STDIN_FILENO, TIOCSTI, &control_q); + } + ioctl(STDIN_FILENO, TIOCSTI, k); + } + // Restore the old settings + tcsetattr(STDIN_FILENO, TCSANOW, &oldtio); +} -void inject_into_tty_buffer(char *line) { - char *tty = ttyname(STDIN_FILENO); - int fd = open(tty, O_WRONLY); +////////////////////////////////////////////////////////////////////// - struct termios oldtio, newtio; +void check_opt(int argc, char **argv, int n_opt, int n, const char *help) { + if(n_opt + n >= argc) { + fprintf(stderr, "Missing argument for %s, expecting %s.\n", + argv[n_opt], help); + exit(1); + } +} - if (fd >= 0) { - // Save current port settings - tcgetattr(fd,&oldtio); - memset(&newtio, 0, sizeof(newtio)); - // Set input mode (non-canonical, *no echo*,...) - tcflush(fd, TCIFLUSH); - tcsetattr(fd,TCSANOW, &newtio); - // Put the selected line in the tty input buffer - for(char *k = line; *k; k++) { - ioctl(fd, TIOCSTI, k); - } - // Restore the old settings - tcsetattr(fd,TCSANOW, &oldtio); - close(fd); - } else { - cerr << "Can not open " << tty << "." << endl; +int string_to_positive_integer(char *string) { + int error = 0; + int result = 0; + + if(*string) { + for(char *s = string; *s; s++) { + if(*s >= '0' && *s <= '9') { + result = result * 10 + int(*s - '0'); + } else error = 1; + } + } else error = 1; + + if(error) { + fprintf(stderr, "Value `%s' is not a positive integer.\n", string); exit(1); } + + return result; +} + +void error_feedback() { + if(error_flash) { + flash(); + } else { + beep(); + } } ////////////////////////////////////////////////////////////////////// +// A quick and dirty hash table -int match(char *string, int nb_patterns, char **patterns) { - for(int n = 0; n < nb_patterns; n++) { - if(strstr(string, patterns[n]) == 0) return 0; +// The table itself stores indexes of the strings taken in a char +// **table. When a string is added, if it was already in the table, +// the new index replaces the previous one. + +int *new_hash_table(int hash_table_size) { + int *result; + result = new int[hash_table_size]; + for(int k = 0; k < hash_table_size; k++) { + result[k] = -1; } - return 1; + return result; +} + +// Adds new_string in the table, associated to new_index. If this +// string was not already in the table, returns -1. Otherwise, returns +// the previous index it had. + +int test_and_add(char *new_string, int new_index, + char **strings, + int *hash_table, int hash_table_size) { + + unsigned int code = 0; + + // This is my recipe. I checked, it seems to work (as long as + // hash_table_size is not a multiple of 387433 that should be okay) + + for(int k = 0; new_string[k]; k++) { + code = code * 387433 + (unsigned int) (new_string[k]); + } + + code = code % hash_table_size; + + while(hash_table[code] >= 0) { + // There is a string with that code + if(strcmp(new_string, strings[hash_table[code]]) == 0) { + // It is the same string, we keep a copy of the stored index + int result = hash_table[code]; + // Put the new one + hash_table[code] = new_index; + // And return the previous one + return result; + } + // This collision was not the same string, let's move to the next + // in the table + code = (code + 1) % hash_table_size; + } + + // This string was not already in there, store the index in the + // table and return -1 + hash_table[code] = new_index; + return -1; } ////////////////////////////////////////////////////////////////////// +// A matcher matches either with a collection of substrings, or with a +// regexp + +struct matcher_t { + regex_t preg; + int regexp_error; + int nb_patterns; + int case_sensitive; + char *splitted_patterns, **patterns; +}; + +int match(char *string, matcher_t *matcher) { + if(matcher->nb_patterns >= 0) { + if(matcher->case_sensitive) { + for(int n = 0; n < matcher->nb_patterns; n++) { + if(strstr(string, matcher->patterns[n]) == 0) return 0; + } + } else { + for(int n = 0; n < matcher->nb_patterns; n++) { + if(strcasestr(string, matcher->patterns[n]) == 0) return 0; + } + } + return 1; + } else { + return regexec(&matcher->preg, string, 0, 0, 0) == 0; + } +} -void check_opt(int argc, char **argv, int n_opt, int n, const char *help) { - if(n_opt + n >= argc) { - cerr << "Missing argument for " << argv[n_opt] << "." - << " " - << "Expecting " << help << "." - << endl; - exit(1); +void free_matcher(matcher_t *matcher) { + if(matcher->nb_patterns < 0) { + if(!matcher->regexp_error) regfree(&matcher->preg); + } else { + delete[] matcher->splitted_patterns; + delete[] matcher->patterns; + } +} + +void initialize_matcher(int use_regexp, int case_sensitive, + matcher_t *matcher, const char *pattern) { + + if(use_regexp) { + matcher->nb_patterns = -1; + matcher->regexp_error = regcomp(&matcher->preg, pattern, case_sensitive ? 0 : REG_ICASE); + } else { + matcher->regexp_error = 0; + matcher->nb_patterns = 1; + matcher->case_sensitive = case_sensitive; + + for(const char *s = pattern; *s; s++) { + if(*s == pattern_separator) { + matcher->nb_patterns++; + } + } + + matcher->splitted_patterns = new char[strlen(pattern) + 1]; + matcher->patterns = new char*[matcher->nb_patterns]; + + strcpy(matcher->splitted_patterns, pattern); + + int n = 0; + char *last_pattern_start = matcher->splitted_patterns; + for(char *s = matcher->splitted_patterns; n < matcher->nb_patterns; s++) { + if(*s == pattern_separator || *s == '\0') { + *s = '\0'; + matcher->patterns[n++] = last_pattern_start; + last_pattern_start = s + 1; + } + } } } ////////////////////////////////////////////////////////////////////// +// Buffer edition + +void delete_char(char *buffer, int *position) { + if(buffer[*position]) { + int c = *position; + while(c < buffer_size && buffer[c]) { + buffer[c] = buffer[c+1]; + c++; + } + } else error_feedback(); +} + +void backspace_char(char *buffer, int *position) { + if(*position > 0) { + if(buffer[*position]) { + int c = *position - 1; + while(buffer[c]) { + buffer[c] = buffer[c+1]; + c++; + } + } else { + buffer[*position - 1] = '\0'; + } + + (*position)--; + } else error_feedback(); +} -int previous_visible(int current_line, int nb_lines, char **lines, int nb_patterns, char **patterns) { +void insert_char(char *buffer, int *position, char character) { + if(strlen(buffer) < buffer_size - 1) { + int c = *position; + char t = buffer[c], u; + while(t) { + c++; + u = buffer[c]; + buffer[c] = t; + t = u; + } + c++; + buffer[c] = '\0'; + buffer[(*position)++] = character; + } else error_feedback(); +} + +void kill_before_cursor(char *buffer, int *position) { + int s = 0; + while(buffer[*position + s]) { + buffer[s] = buffer[*position + s]; + s++; + } + buffer[s] = '\0'; + *position = 0; +} + +void kill_after_cursor(char *buffer, int *position) { + buffer[*position] = '\0'; +} + +////////////////////////////////////////////////////////////////////// + +int previous_visible(int current_line, int nb_lines, char **lines, matcher_t *matcher) { int line = current_line - 1; - while(line >= 0 && !match(lines[line], nb_patterns, patterns)) line--; + while(line >= 0 && !match(lines[line], matcher)) line--; return line; } -int next_visible(int current_line, int nb_lines, char **lines, int nb_patterns, char **patterns) { +int next_visible(int current_line, int nb_lines, char **lines, matcher_t *matcher) { int line = current_line + 1; - while(line < nb_lines && !match(lines[line], nb_patterns, patterns)) line++; + while(line < nb_lines && !match(lines[line], matcher)) line++; if(line < nb_lines) return line; @@ -121,237 +328,353 @@ int next_visible(int current_line, int nb_lines, char **lines, int nb_patterns, return -1; } -void update_screen(int *current_line, int *temporary_line, int motion, - int nb_lines, char **lines, - char *pattern_list, - int no_blink) { - - char buffer[buffer_size]; - - // We split the pattern list into individual patterns +////////////////////////////////////////////////////////////////////// - int nb_patterns = 1; +// The value passed to this routine in current_focus_line is the index +// of the line we should have highlited if there was no motion and if +// it matched the matcher. So, the line actually highlighted is the +// first one matching the matcher in that order: (1) +// current_focus_line after motion, (2) the first with a greater +// index, (3) the first with a lesser index. - for(char *s = pattern_list; *s; s++) { - if(*s == pattern_separator) { - nb_patterns++; - } - } +// The index of the line actually shown highlighted is written in +// displayed_focus_line (it can be -1) - char splitted_patterns[strlen(pattern_list) + 1]; - char *patterns[nb_patterns]; +// If there is a motion and a line is actually shown highlighted, its +// value is written in current_focus_line. - strcpy(splitted_patterns, pattern_list); +void update_screen(int *current_focus_line, int *displayed_focus_line, + int motion, + int nb_lines, char **lines, + int cursor_position, + char *pattern) { - int n = 0; - char *last_pattern_start = splitted_patterns; - for(char *s = splitted_patterns; n < nb_patterns; s++) { - if(*s == pattern_separator || *s == '\0') { - *s = '\0'; - patterns[n++] = last_pattern_start; - last_pattern_start = s + 1; - } - } + char buffer[buffer_size]; + matcher_t matcher; - // We now take care of printing the lines per se + initialize_matcher(use_regexp, case_sensitive, &matcher, pattern); int console_width = getmaxx(stdscr); int console_height = getmaxy(stdscr); - // First, we find a visible line. In priority: The current, or the - // first visible after it, or the first visible before it. + // First, we find a visible line. - int new_line; - if(match(lines[*current_line], nb_patterns, patterns)) { - new_line = *current_line; - } else { - new_line = next_visible(*current_line, nb_lines, lines, nb_patterns, patterns); - if(new_line < 0) { - new_line = previous_visible(*current_line, nb_lines, lines, nb_patterns, patterns); - } - } + int nb_printed_lines = 0; - // If we found a visible line and we should move, let's move + use_default_colors(); - if(new_line >= 0 && motion != 0) { - int l = new_line; - if(motion > 0) { - // We want to go down, let's find the first visible line below - for(int m = 0; l >= 0 && m < motion; m++) { - l = next_visible(l, nb_lines, lines, nb_patterns, patterns); - if(l >= 0) { - new_line = l; - } - } + addstr("\n"); + + if(matcher.regexp_error) { + attron(attr_error); + addnstr("Regexp syntax error", console_width); + attroff(attr_error); + } else if(nb_lines > 0) { + int new_focus_line; + if(match(lines[*current_focus_line], &matcher)) { + new_focus_line = *current_focus_line; } else { - // We want to go up, let's find the first visible line above - for(int m = 0; l >= 0 && m < -motion; m++) { - l = previous_visible(l, nb_lines, lines, nb_patterns, patterns); - if(l >= 0) { - new_line = l; - } + new_focus_line = next_visible(*current_focus_line, nb_lines, lines, &matcher); + if(new_focus_line < 0) { + new_focus_line = previous_visible(*current_focus_line, nb_lines, lines, &matcher); } } - } - - if(!no_blink) { - clear(); - } - use_default_colors(); + // If we found a visible line and we should move, let's move - addstr("\n"); - - int nb_printed_lines = 1; + if(new_focus_line >= 0 && motion != 0) { + int l = new_focus_line; + if(motion > 0) { + // We want to go down, let's find the first visible line below + for(int m = 0; l >= 0 && m < motion; m++) { + l = next_visible(l, nb_lines, lines, &matcher); + if(l >= 0) { + new_focus_line = l; + } + } + } else { + // We want to go up, let's find the first visible line above + for(int m = 0; l >= 0 && m < -motion; m++) { + l = previous_visible(l, nb_lines, lines, &matcher); + if(l >= 0) { + new_focus_line = l; + } + } + } + } - // Here new_line is either a line number matching the patterns, or -1 + // Here new_focus_line is either a line number matching the pattern, or -1 - if(new_line >= 0) { + if(new_focus_line >= 0) { - int first_line = new_line, last_line = new_line, nb_match = 1; + int first_line = new_focus_line, last_line = new_focus_line, nb_match = 1; - // We find the first and last line to show, so that the total of - // visible lines between them (them include) is console_height - 1 + // We find the first and last line to show, so that the total of + // visible lines between them (them included) is console_height-1 - while(nb_match < console_height-1 && (first_line > 0 || last_line < nb_lines - 1)) { + while(nb_match < console_height-1 && (first_line > 0 || last_line < nb_lines - 1)) { - if(first_line > 0) { - first_line--; - while(first_line > 0 && !match(lines[first_line], nb_patterns, patterns)) { + if(first_line > 0) { first_line--; + while(first_line > 0 && !match(lines[first_line], &matcher)) { + first_line--; + } + if(match(lines[first_line], &matcher)) { + nb_match++; + } } - if(match(lines[first_line], nb_patterns, patterns)) { - nb_match++; - } - } - if(last_line < nb_lines - 1) { - last_line++; - while(last_line < nb_lines - 1 && !match(lines[last_line], nb_patterns, patterns)) { + if(nb_match < console_height - 1 && last_line < nb_lines - 1) { last_line++; - } + while(last_line < nb_lines - 1 && !match(lines[last_line], &matcher)) { + last_line++; + } - if(match(lines[last_line], nb_patterns, patterns)) { - nb_match++; + if(match(lines[last_line], &matcher)) { + nb_match++; + } } } - } - // Now we display them + // Now we display them - for(int l = first_line; l <= last_line; l++) { - if(match(lines[l], nb_patterns, patterns)) { - int k = 0; + for(int l = first_line; l <= last_line; l++) { + if(match(lines[l], &matcher)) { + int k = 0; - while(lines[l][k] && k < buffer_size - 2 && k < console_width - 2) { - buffer[k] = lines[l][k]; - k++; - } + while(lines[l][k] && k < buffer_size - 2 && k < console_width - 2) { + buffer[k] = lines[l][k]; + k++; + } - // We fill the rest of the line with blanks if either we did - // not clear() or if this is the highlighted line + // We fill the rest of the line with blanks if this is the + // highlighted line - if(no_blink || l == new_line) { - while(k < console_width) { - buffer[k++] = ' '; + if(l == new_focus_line) { + while(k < console_width) { + buffer[k++] = ' '; + } } - } - buffer[k++] = '\n'; - buffer[k++] = '\0'; + buffer[k++] = '\n'; + buffer[k++] = '\0'; - // Highlight the highlighted line ... + clrtoeol(); - if(l == new_line) { - if(with_colors) { - attron(COLOR_PAIR(2)); + // Highlight the highlighted line ... + + if(l == new_focus_line) { + attron(attr_focus_line); addnstr(buffer, console_width); - attroff(COLOR_PAIR(2)); + attroff(attr_focus_line); } else { - attron(A_STANDOUT); addnstr(buffer, console_width); - attroff(A_STANDOUT); } - } else { - addnstr(buffer, console_width); - } - nb_printed_lines++; + nb_printed_lines++; + } } - } - if(motion != 0) { - *current_line = new_line; - } - } + // If we are on a focused line and we moved, this become the new + // focus line - *temporary_line = new_line; + if(motion != 0) { + *current_focus_line = new_focus_line; + } + } - if(nb_printed_lines == 1) { - addnstr("[no selection]\n", console_width); - nb_printed_lines++; - } + *displayed_focus_line = new_focus_line; - if(no_blink) { // Erase the rest of the window. That's slightly ugly. - int k = 0; - while(k < console_width) { - buffer[k++] = ' '; - } - buffer[k++] = '\n'; - buffer[k++] = '\0'; - for(int l = nb_printed_lines; l < console_height; l++) { - addnstr(buffer, console_width); + if(nb_printed_lines == 0) { + attron(attr_error); + addnstr("No selection", console_width); + attroff(attr_error); } + } else { + attron(attr_error); + addnstr("Empty choice", console_width); + attroff(attr_error); } + clrtobot(); + // Draw the modeline - sprintf(buffer, "%d/%d pattern: %s", - nb_printed_lines - 1, - nb_lines, - pattern_list); + move(0, 0); + + attron(attr_modeline); - for(int k = strlen(buffer); k < console_width; k++) buffer[k] = ' '; + for(int k = 0; k < console_width; k++) buffer[k] = ' '; buffer[console_width] = '\0'; + addnstr(buffer, console_width); move(0, 0); - if(with_colors) { - attron(COLOR_PAIR(1)); - addnstr(buffer, console_width); - attroff(COLOR_PAIR(1)); + + // There must be a more elegant way of moving the cursor at a + // location met during display + + int cursor_x = 0; + + if(title) { + addstr(title); + addstr(" "); + cursor_x += strlen(title) + 1; + } + + sprintf(buffer, "%d/%d ", nb_printed_lines, nb_lines); + addstr(buffer); + cursor_x += strlen(buffer); + + addnstr(pattern, cursor_position); + cursor_x += cursor_position; + + if(pattern[cursor_position]) { + addstr(pattern + cursor_position); } else { - attron(A_REVERSE); - addnstr(buffer, console_width); - attroff(A_REVERSE); + addstr(" "); } + if(use_regexp || case_sensitive) { + addstr(" ["); + if(use_regexp) { + addstr("regexp"); + } + + if(case_sensitive) { + if(use_regexp) { + addstr(","); + } + addstr("case"); + } + addstr("]"); + } + + move(0, cursor_x); + + attroff(attr_modeline); + // We are done refresh(); + free_matcher(&matcher); +} + +////////////////////////////////////////////////////////////////////// + +void read_file(const char *input_filename, + int nb_lines_max, int *nb_lines, char **lines, + int hash_table_size, int *hash_table) { + + char raw_line[buffer_size]; + + FILE *file = fopen(input_filename, "r"); + + if(!file) { + fprintf(stderr, "Can not open `%s'.\n", input_filename); + exit(1); + } + + int start = 0, end = 0; + + while(*nb_lines < nb_lines_max && (end > start || !feof(file))) { + int eol = start; + while(eol < end && raw_line[eol] != '\n') eol++; + + if(eol == end) { + for(int k = 0; k < end - start; k++) { + raw_line[k] = raw_line[k + start]; + } + end -= start; + eol -= start; + start = 0; + end += fread(raw_line + end, sizeof(char), buffer_size - end, file); + while(eol < end && raw_line[eol] != '\n') eol++; + } + + if(eol == buffer_size) { + raw_line[buffer_size - 1] = '\0'; + fprintf(stderr, "Line too long:\n"); + fprintf(stderr, raw_line); + fprintf(stderr, "\n"); + exit(1); + } + + raw_line[eol] = '\0'; + + char *t = raw_line + start; + + // Remove the zsh history prefix + + if(zsh_history && *t == ':') { + while(*t && *t != ';') t++; + if(*t == ';') t++; + } + + // Remove the bash history prefix + + if(bash_history) { + while(*t == ' ') t++; + while(*t >= '0' && *t <= '9') t++; + while(*t == ' ') t++; + } + + // Check for duplicates with the hash table and insert the line + // in the list if necessary + + int dup; + + if(hash_table) { + dup = test_and_add(t, *nb_lines, lines, hash_table, hash_table_size); + } else { + dup = -1; + } + + if(dup < 0) { + lines[*nb_lines] = new char[strlen(t) + 1]; + strcpy(lines[*nb_lines], t); + } else { + // The string was already in there, so we do not allocate a + // new string but use the pointer to the first occurence of it + lines[*nb_lines] = lines[dup]; + lines[dup] = 0; + } + + (*nb_lines)++; + + start = eol + 1; + } } ////////////////////////////////////////////////////////////////////// int main(int argc, char **argv) { - char buffer[buffer_size]; - char *lines[nb_lines_max]; - int no_blink = 0; + + if(!ttyname(STDIN_FILENO)) { + fprintf(stderr, "The standard input is not a tty.\n"); + exit(1); + } + int color_fg_modeline, color_bg_modeline; int color_fg_highlight, color_bg_highlight; - color_fg_modeline = COLOR_WHITE; - color_bg_modeline = COLOR_BLACK; + color_fg_modeline = COLOR_WHITE; + color_bg_modeline = COLOR_BLACK; color_fg_highlight = COLOR_BLACK; color_bg_highlight = COLOR_YELLOW; setlocale(LC_ALL, ""); char input_filename[buffer_size], output_filename[buffer_size]; + strcpy(input_filename, ""); - strcpy(output_filename, "/tmp/selector.out"); + strcpy(output_filename, ""); int i = 1; - while(i < argc) { + int error = 0, show_help = 0; + int rest_are_files = 0; + + while(!error && !show_help && i < argc && argv[i][0] == '-' && !rest_are_files) { + if(strcmp(argv[i], "-o") == 0) { check_opt(argc, argv, i, 1, ""); strncpy(output_filename, argv[i+1], buffer_size); @@ -364,24 +687,45 @@ int main(int argc, char **argv) { i += 2; } + else if(strcmp(argv[i], "-x") == 0) { + check_opt(argc, argv, i, 1, "