mirror of
https://github.com/radareorg/radare2.git
synced 2024-12-19 03:09:09 +00:00
343 lines
8.2 KiB
C
343 lines
8.2 KiB
C
/* radare - LGPL - Copyright 2008-2017 - pancake */
|
|
|
|
#include <r_cons.h>
|
|
#include <ctype.h>
|
|
|
|
#define I(x) r_cons_singleton ()->x
|
|
|
|
// Display the content of a file in the hud
|
|
R_API char *r_cons_hud_file(const char *f) {
|
|
char *s = r_file_slurp (f, NULL);
|
|
if (s) {
|
|
char *ret = r_cons_hud_string (s);
|
|
free (s);
|
|
return ret;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
// Display a buffer in the hud (splitting it line-by-line and ignoring
|
|
// the lines starting with # )
|
|
R_API char *r_cons_hud_string(const char *s) {
|
|
char *os, *track, *ret, *o = strdup (s);
|
|
if (!o) {
|
|
return NULL;
|
|
}
|
|
RList *fl = r_list_new ();
|
|
int i;
|
|
if (!fl) {
|
|
free (o);
|
|
return NULL;
|
|
}
|
|
fl->free = free;
|
|
for (os = o, i = 0; o[i]; i++) {
|
|
if (o[i] == '\n') {
|
|
o[i] = 0;
|
|
if (*os && *os != '#') {
|
|
track = strdup (os);
|
|
if (!r_list_append (fl, track)) {
|
|
free (track);
|
|
break;
|
|
}
|
|
}
|
|
os = o + i + 1;
|
|
}
|
|
}
|
|
ret = r_cons_hud (fl, NULL);
|
|
free (o);
|
|
r_list_free (fl);
|
|
return ret;
|
|
}
|
|
|
|
/* Match a filter on a line. A filter can contain multiple words
|
|
separated by spaces, which are all matched *in any order* over the target
|
|
entry. If all words are present, the function returns true.
|
|
The mask is a character buffer wich is filled by 'x' to mark those characters
|
|
that match the filter */
|
|
static bool strmatch(char *entry, char *filter, char *mask, const int mask_size) {
|
|
char *p, *current_token = filter;
|
|
const char *filter_end = filter + strlen (filter);
|
|
// first we separate the filter in words (include the terminator char
|
|
// to avoid special handling of the last token)
|
|
for (p = filter; p <= filter_end; p++) {
|
|
if (*p == ' ' || *p == '\0') {
|
|
const char *next_match, *entry_ptr = entry;
|
|
char old_char = *p;
|
|
int token_len;
|
|
|
|
// Ignoring consecutive spaces
|
|
if (p == current_token) {
|
|
current_token++;
|
|
continue;
|
|
}
|
|
*p = 0;
|
|
token_len = strlen (current_token);
|
|
// look for all matches of the current_token in this entry
|
|
while ((next_match = r_str_casestr (entry_ptr, current_token))) {
|
|
int i;
|
|
for (i = next_match - entry;
|
|
(i < next_match - entry + token_len) && i < mask_size;
|
|
i++) {
|
|
mask[i] = 'x';
|
|
}
|
|
entry_ptr += token_len;
|
|
}
|
|
*p = old_char;
|
|
if (entry_ptr == entry) {
|
|
// the word is not present in the target
|
|
return false;
|
|
}
|
|
current_token = p + 1;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
// Display a list of entries in the hud, filtered and emphasized based
|
|
// on the user input.
|
|
R_API char *r_cons_hud(RList *list, const char *prompt) {
|
|
const int buf_size = 128;
|
|
int ch, nch, first_line, current_entry_n, j, i = 0;
|
|
char *p, *x;
|
|
#ifdef _MSC_VER
|
|
#define buf_size 128
|
|
#endif
|
|
char user_input[buf_size], mask[buf_size];
|
|
int last_color_change, top_entry_n = 0;
|
|
char *selected_entry = NULL;
|
|
char tmp, last_mask = 0;
|
|
void *current_entry;
|
|
RListIter *iter;
|
|
|
|
user_input[0] = 0;
|
|
r_cons_clear ();
|
|
// Repeat until the user exits the hud
|
|
for (;;) {
|
|
first_line = 1;
|
|
r_cons_gotoxy (0, 0);
|
|
current_entry_n = 0;
|
|
if (top_entry_n < 0) {
|
|
top_entry_n = 0;
|
|
}
|
|
selected_entry = NULL;
|
|
if (prompt && *prompt) {
|
|
r_cons_print (">> ");
|
|
r_cons_println (prompt);
|
|
}
|
|
r_cons_printf ("%d> %s|\n", top_entry_n, user_input);
|
|
int counter = 0;
|
|
int rows;
|
|
(void) r_cons_get_size (&rows);
|
|
// Iterate over each entry in the list
|
|
r_list_foreach (list, iter, current_entry) {
|
|
memset (mask, 0, buf_size);
|
|
if (!user_input[0] || strmatch (current_entry, user_input, mask, buf_size)) {
|
|
counter++;
|
|
if (counter == rows + top_entry_n) {
|
|
break;
|
|
}
|
|
// if the user scrolled down the list, do not print the first entries
|
|
if (!top_entry_n || current_entry_n >= top_entry_n) {
|
|
// remove everything after a tab (in ??, it contains the commands)
|
|
x = strchr (current_entry, '\t');
|
|
if (x) {
|
|
*x = 0;
|
|
}
|
|
p = strdup (current_entry);
|
|
// if the filter is empty, print the entry and move on
|
|
if (!user_input[0]) {
|
|
r_cons_printf (" %c %s\n", first_line? '-': ' ', current_entry);
|
|
} else {
|
|
// otherwise we need to emphasize the matching part
|
|
if (I (use_color)) {
|
|
last_color_change = 0;
|
|
last_mask = 0;
|
|
r_cons_printf (" %c ", first_line? '-': ' ');
|
|
// Instead of printing one char at the time
|
|
// (which would be slow), we group substrings of the same color
|
|
for (j = 0; p[j] && j < buf_size; j++) {
|
|
if (mask[j] != last_mask) {
|
|
tmp = p[j];
|
|
p[j] = 0;
|
|
if (mask[j]) {
|
|
r_cons_printf (Color_RESET "%s", p + last_color_change);
|
|
} else {
|
|
r_cons_printf (Color_GREEN "%s", p + last_color_change);
|
|
}
|
|
p[j] = tmp;
|
|
last_color_change = j;
|
|
last_mask = mask[j];
|
|
}
|
|
}
|
|
if (last_mask) {
|
|
r_cons_printf (Color_GREEN "%s\n"Color_RESET, p + last_color_change);
|
|
} else {
|
|
r_cons_printf (Color_RESET "%s\n", p + last_color_change);
|
|
}
|
|
} else {
|
|
// Otherwise we print the matching characters uppercase
|
|
for (j = 0; p[j]; j++) {
|
|
if (mask[j]) {
|
|
p[j] = toupper ((unsigned char) p[j]);
|
|
}
|
|
}
|
|
r_cons_printf (" %c %s\n", first_line? '-': ' ', p);
|
|
}
|
|
}
|
|
// Clean up and restore the tab character (if any)
|
|
free (p);
|
|
if (x) {
|
|
*x = '\t';
|
|
}
|
|
if (first_line) {
|
|
selected_entry = current_entry;
|
|
}
|
|
first_line = 0;
|
|
}
|
|
current_entry_n++;
|
|
}
|
|
}
|
|
|
|
r_cons_visual_flush ();
|
|
ch = r_cons_readchar ();
|
|
nch = r_cons_arrow_to_hjkl (ch);
|
|
(void) r_cons_get_size (&rows);
|
|
if (nch == 'J' && ch != 'J') {
|
|
top_entry_n += (rows - 1);
|
|
if (top_entry_n + 1 >= current_entry_n) {
|
|
top_entry_n = current_entry_n;
|
|
}
|
|
} else if (nch == 'K' && ch != 'K') {
|
|
top_entry_n -= (rows - 1);
|
|
if (top_entry_n < 0) {
|
|
top_entry_n = 0;
|
|
}
|
|
} else if (nch == 'j' && ch != 'j') {
|
|
if (top_entry_n + 1 < current_entry_n) {
|
|
top_entry_n++;
|
|
}
|
|
} else if (nch == 'k' && ch != 'k') {
|
|
if (top_entry_n >= 0) {
|
|
top_entry_n--;
|
|
}
|
|
} else {
|
|
switch (ch) {
|
|
case 9: // \t
|
|
if (top_entry_n + 1 < current_entry_n) {
|
|
top_entry_n++;
|
|
} else {
|
|
top_entry_n = 0;
|
|
}
|
|
break;
|
|
case 10:// \n
|
|
case 13:// \r
|
|
top_entry_n = 0;
|
|
// if (!*buf)
|
|
// return NULL;
|
|
if (current_entry_n >= 1) {
|
|
// eprintf ("%s\n", buf);
|
|
// i = buf[0] = 0;
|
|
return strdup (selected_entry);
|
|
} // no match!
|
|
break;
|
|
case 23:// ^w
|
|
top_entry_n = 0;
|
|
i = user_input[0] = 0;
|
|
break;
|
|
case 0x1b: // ESC
|
|
return NULL;
|
|
case 8: // bs
|
|
case 127: // bs
|
|
top_entry_n = 0;
|
|
if (i < 1) {
|
|
return NULL;
|
|
}
|
|
user_input[--i] = 0;
|
|
break;
|
|
default:
|
|
if (IS_PRINTABLE (ch)) {
|
|
if (i >= buf_size) {
|
|
break;
|
|
}
|
|
top_entry_n = 0;
|
|
if (i + 1 >= buf_size) {
|
|
// too many
|
|
break;
|
|
}
|
|
user_input[i++] = ch;
|
|
user_input[i] = 0;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
// Display the list of files in a directory
|
|
R_API char *r_cons_hud_path(const char *path, int dir) {
|
|
char *tmp, *ret = NULL;
|
|
RList *files;
|
|
if (path) {
|
|
path = r_str_chop_ro (path);
|
|
tmp = strdup (*path? path: "./");
|
|
} else {
|
|
tmp = strdup ("./");
|
|
}
|
|
files = r_sys_dir (tmp);
|
|
if (files) {
|
|
ret = r_cons_hud (files, tmp);
|
|
if (ret) {
|
|
tmp = r_str_append (tmp, "/");
|
|
tmp = r_str_append (tmp, ret);
|
|
ret = r_file_abspath (tmp);
|
|
free (tmp);
|
|
tmp = ret;
|
|
if (r_file_is_directory (tmp)) {
|
|
ret = r_cons_hud_path (tmp, dir);
|
|
free (tmp);
|
|
tmp = ret;
|
|
}
|
|
}
|
|
r_list_free (files);
|
|
} else {
|
|
eprintf ("No files found\n");
|
|
}
|
|
if (!ret) {
|
|
free (tmp);
|
|
return NULL;
|
|
}
|
|
return tmp;
|
|
}
|
|
|
|
R_API char *r_cons_message(const char *msg) {
|
|
int len = strlen (msg);
|
|
int rows, cols = r_cons_get_size (&rows);
|
|
r_cons_clear ();
|
|
r_cons_gotoxy ((cols - len) / 2, rows / 2);
|
|
r_cons_println (msg);
|
|
r_cons_flush ();
|
|
r_cons_gotoxy (0, rows - 2);
|
|
r_cons_any_key (NULL);
|
|
return NULL;
|
|
}
|
|
|
|
#ifdef MAIN
|
|
main () {
|
|
char *res;
|
|
RFList fl = r_flist_new (3);
|
|
r_flist_set (fl, 0, "foo is pure cow");
|
|
r_flist_set (fl, 1, "bla is kinda crazy");
|
|
r_flist_set (fl, 2, "funny to see you here");
|
|
r_cons_new ();
|
|
res = r_cons_hud (fl, NULL, 0);
|
|
r_cons_clear ();
|
|
if (res) {
|
|
r_cons_println (res);
|
|
free (res);
|
|
}
|
|
r_cons_flush ();
|
|
r_cons_free ();
|
|
}
|
|
#endif
|