summary refs log tree commit diff stats
path: root/Makefile
Commit message (Collapse)AuthorAgeFilesLines
* Makefile: Don't fail build when py.test is not installedhut2016-02-281-1/+8
|
* tests: add a dummy pytest test and add it to the make test stepLaurent Charignon2016-01-311-0/+1
|
* Neater copyright headerhut2015-03-191-2/+2
|
* Makefile: quote a variablehut2015-02-071-1/+1
| | | | This avoids an error if the path to rangers repository contains a space.
* update email addresshut2014-12-111-1/+1
|
* fix references to README.mdhut2014-08-221-1/+1
|
* Makefile: allow selecting files for "make test" by setting $FILTERhut2014-02-031-1/+2
| | | | | | | | | For example: FILTER=signals make test will test only files that match "signals", i.e. only ranger/ext/signals.py. FILTER is passed as a pattern directly to grep.
* Changed email address in source codehut2013-08-081-1/+1
| | | | | Since lavabit.com ceased providing email services, I had to change my address from hut lavabit com to hut lepus uberspace de.
* Revert "Added bumblebee-like "make uninstall""hut2013-04-021-7/+0
| | | | This reverts commit f19c589432c68ae1979adb723deb3665d38c0b4a.
* Added bumblebee-like "make uninstall"hut2013-04-011-0/+7
| | | | | | | | | | | This innovative uninstalling method unlocks the power and immense efficiency that resulted from years of dedicated R&D by the greatest minds to ever walk the face of the earth. By now, this method is state-of-the-art after being tested by prestigious software such as bumblebee [1], marking a milestone and becoming a true legend in the history of open source development. [1] https://github.com/MrMEEE/bumblebee-Old-and-abbandoned/commit/a047be85247755cdbe0acce6f1dafc8beb84f2ac
* Makefile: Fix regex of 'make clean'hut2013-03-011-1/+1
|
* updated rest of the copyright noticeshut2013-02-221-1/+1
|
* update email address (romanz@lavabit.com -> hut@lavabit.com)hut2013-02-221-1/+1
|
* doc/rifle.1: Added man page for riflehut2013-02-181-0/+4
|
* Makefile: Add python3.3 to the list of python versionshut2013-01-281-2/+2
|
* Makefile: "make dist" instead of "make snapshot"hut2013-01-281-1/+3
|
* Makefile: use python2.7 toohut2012-10-181-1/+1
|
* test rifle when running "make test"hut2012-04-131-1/+1
|
* shorten all copyright messages for better readabilityhut2012-03-141-13/+1
|
* Makefile: Added info about DESTDIR in "make options"hut2011-10-291-0/+1
|
* Makefile: Fixed "PHONY" stuffhut2011-10-291-1/+1
|
* Updated copyright headershut2011-10-101-1/+1
| | | | As much as I hate this, it has to be done
* Makefile: Fixed doctests for python3.2hut2011-10-081-1/+1
|
* Makefile: added `make test' back in.hut2011-10-071-1/+9
|
* Makefile: updatehut2011-10-051-4/+8
|
* Makefile: added "make todo" and added some notes in codehut2011-10-051-1/+4
|
* updated Makefilehut2011-09-291-1/+2
|
* removed tests. (half of them are outdated)hut2011-09-281-9/+1
| | | | To get them back, you can always simply revert this commit.
* extended manpage and fixed {load,save}_copy_buffer commandshut2011-09-251-0/+3
|
* Overhauled manpage. It's in POD format now.hut2011-09-241-1/+5
|
* Makefile, setup.py: Fixed `make doc`hut2010-09-111-1/+0
|
* Makefile: simplificationhut2010-06-241-1/+1
|
* make doc: minor cleanup and fixhut2010-06-211-2/+2
|
* commited pydocs are author agnosticshpelda2010-06-211-1/+2
|
* INSTALL: changed logname from uninstall_info to install_log.txthut2010-06-181-1/+1
|
* Removed built-in support for uninstalling.hut2010-06-181-5/+4
| | | | | | Since distutils (setup.py) is used and distutils doesn't support uninstalling, I shouldn't implement my own half-assed, potentially dangerous uninstall script either.
* Rewrote INSTALL and "make (un)install"hut2010-06-181-2/+12
|
* Makefile: removed functions which are now handled by setup.pyhut2010-06-181-51/+4
|
* make snapshot: prefix ranger-$VERSION/ in archiveshut2010-06-141-1/+1
|
* make install: Fixed script for finding PYTHON_SITE_DESThut2010-06-141-2/+6
|
* Makefile: dynamically get the version numberhut2010-06-091-1/+1
|
* simplified all_tests.py, moved to test/hut2010-06-071-2/+2
|
* make bm, make test: make use of PYTHON variablehut2010-05-251-2/+2
|
* make: replace literal python with $(PYTHON)hut2010-05-171-1/+1
|
* make: added DESTDIR to Makefilehut2010-05-171-9/+9
| | | | Patch by David Woodfall
* Makefile: updatedhut2010-05-101-9/+12
|
* Added license header to a few fileshut2010-05-041-0/+15
|
* Makefile: added `make bm` to run all benchmarks BMCOUNT timeshut2010-05-031-2/+5
|
* Makefile: cleaned up, added automatic uninstallhut2010-05-031-58/+57
|
* make clean: fixedhut2010-04-071-1/+1
|
>) if (argc == 3 && is_equal(argv[1], "browse-trace")) { load_trace(argv[2]); start_trace_browser(); return 0; } :(before "End Globals") set<int> Visible; int Top_of_screen = 0; int Left_of_screen = 0; int Last_printed_row = 0; map<int, int> Trace_index; // screen row -> trace index string Current_search_pattern = ""; :(before "End Types") enum search_direction { FORWARD, BACKWARD }; :(before "End Globals") search_direction Current_search_direction = FORWARD; :(code) void start_trace_browser() { if (!Trace_stream) return; cerr << "computing min depth to display\n"; int min_depth = 9999; for (int i = 0; i < SIZE(Trace_stream->past_lines); ++i) { trace_line& curr_line = Trace_stream->past_lines.at(i); if (curr_line.depth < min_depth) min_depth = curr_line.depth; } cerr << "min depth is " << min_depth << '\n'; cerr << "computing lines to display\n"; for (int i = 0; i < SIZE(Trace_stream->past_lines); ++i) { if (Trace_stream->past_lines.at(i).depth == min_depth) Visible.insert(i); } tb_init(); tb_clear(); Display_row = Display_column = 0; Top_of_screen = 0; refresh_screen_rows(); while (true) { render(); int key = read_key(); if (key == 'q' || key == 'Q' || key == TB_KEY_CTRL_C) break; if (key == 'j' || key == TB_KEY_ARROW_DOWN) { // move cursor one line down if (Display_row < Last_printed_row) ++Display_row; } else if (key == 'k' || key == TB_KEY_ARROW_UP) { // move cursor one line up if (Display_row > 0) --Display_row; } else if (key == 't') { // move cursor to top of screen Display_row = 0; } else if (key == 'c') { // move cursor to center of screen Display_row = tb_height()/2; while (!contains_key(Trace_index, Display_row)) --Display_row; } else if (key == 'b') { // move cursor to bottom of screen Display_row = tb_height()-1; while (!contains_key(Trace_index, Display_row)) --Display_row; } else if (key == 'T') { // scroll line at cursor to top of screen Top_of_screen = get(Trace_index, Display_row); Display_row = 0; refresh_screen_rows(); } else if (key == 'h' || key == TB_KEY_ARROW_LEFT) { // pan screen one character left if (Left_of_screen > 0) --Left_of_screen; } else if (key == 'l' || key == TB_KEY_ARROW_RIGHT) { // pan screen one character right ++Left_of_screen; } else if (key == 'H') { // pan screen one screen-width left Left_of_screen -= (tb_width() - 5); if (Left_of_screen < 0) Left_of_screen = 0; } else if (key == 'L') { // pan screen one screen-width right Left_of_screen += (tb_width() - 5); } else if (key == 'J' || key == TB_KEY_PGDN || key == TB_KEY_CTRL_F) { // page-down if (Trace_index.find(tb_height()-1) != Trace_index.end()) { Top_of_screen = get(Trace_index, tb_height()-1) + 1; refresh_screen_rows(); } } else if (key == 'K' || key == TB_KEY_PGUP || key == TB_KEY_CTRL_B) { // page-up is more convoluted for (int screen_row = tb_height(); screen_row > 0 && Top_of_screen > 0; --screen_row) { --Top_of_screen; if (Top_of_screen <= 0) break; while (Top_of_screen > 0 && !contains_key(Visible, Top_of_screen)) --Top_of_screen; } if (Top_of_screen >= 0) refresh_screen_rows(); } else if (key == 'g' || key == TB_KEY_HOME) { Top_of_screen = 0; Last_printed_row = 0; Display_row = 0; refresh_screen_rows(); } else if (key == 'G' || key == TB_KEY_END) { // go to bottom of screen; largely like page-up, interestingly Top_of_screen = SIZE(Trace_stream->past_lines)-1; for (int screen_row = tb_height(); screen_row > 0 && Top_of_screen > 0; --screen_row) { --Top_of_screen; if (Top_of_screen <= 0) break; while (Top_of_screen > 0 && !contains_key(Visible, Top_of_screen)) --Top_of_screen; } refresh_screen_rows(); // move cursor to bottom Display_row = Last_printed_row; refresh_screen_rows(); } else if (key == TB_KEY_CARRIAGE_RETURN) { // expand lines under current by one level assert(contains_key(Trace_index, Display_row)); int start_index = get(Trace_index, Display_row); int index = 0; // simultaneously compute end_index and min_depth int min_depth = 9999; for (index = start_index+1; index < SIZE(Trace_stream->past_lines); ++index) { if (contains_key(Visible, index)) break; trace_line& curr_line = Trace_stream->past_lines.at(index); assert(curr_line.depth > Trace_stream->past_lines.at(start_index).depth); if (curr_line.depth < min_depth) min_depth = curr_line.depth; } int end_index = index; // mark as visible all intervening indices at min_depth for (index = start_index; index < end_index; ++index) { trace_line& curr_line = Trace_stream->past_lines.at(index); if (curr_line.depth == min_depth) { Visible.insert(index); } } refresh_screen_rows(); } else if (key == TB_KEY_BACKSPACE || key == TB_KEY_BACKSPACE2) { // collapse all lines under current assert(contains_key(Trace_index, Display_row)); int start_index = get(Trace_index, Display_row); int index = 0; // end_index is the next line at a depth same as or lower than start_index int initial_depth = Trace_stream->past_lines.at(start_index).depth; for (index = start_index+1; index < SIZE(Trace_stream->past_lines); ++index) { if (!contains_key(Visible, index)) continue; trace_line& curr_line = Trace_stream->past_lines.at(index); if (curr_line.depth <= initial_depth) break; } int end_index = index; // mark as visible all intervening indices at min_depth for (index = start_index+1; index < end_index; ++index) { Visible.erase(index); } refresh_screen_rows(); } else if (key == '/') { if (start_search_editor(FORWARD)) search(Current_search_pattern, Current_search_direction); } else if (key == '?') { if (start_search_editor(BACKWARD)) search(Current_search_pattern, Current_search_direction); } else if (key == 'n') { if (!Current_search_pattern.empty()) search(Current_search_pattern, Current_search_direction); } else if (key == 'N') { if (!Current_search_pattern.empty()) search(Current_search_pattern, opposite(Current_search_direction)); } } tb_shutdown(); } bool start_search_editor(search_direction dir) { const int bottom_screen_line = tb_height()-1; // run a little editor just in the last line of the screen clear_line(bottom_screen_line); int col = 0; // screen column of cursor on bottom line. also used to update pattern. tb_set_cursor(col, bottom_screen_line); tb_print('/', TB_WHITE, TB_BLACK); ++col; string pattern; while (true) { int key = read_key(); if (key == TB_KEY_ENTER) { if (!pattern.empty()) { Current_search_pattern = pattern; Current_search_direction = dir; } return true; } else if (key == TB_KEY_ESC || key == TB_KEY_CTRL_C) { return false; } else if (key == TB_KEY_ARROW_LEFT) { if (col > /*slash*/1) { --col; tb_set_cursor(col, bottom_screen_line); } } else if (key == TB_KEY_ARROW_RIGHT) { if (col-/*slash*/1 < SIZE(pattern)) { ++col; tb_set_cursor(col, bottom_screen_line); } } else if (key == TB_KEY_HOME || key == TB_KEY_CTRL_A) { col = /*skip slash*/1; tb_set_cursor(col, bottom_screen_line); } else if (key == TB_KEY_END || key == TB_KEY_CTRL_E) { col = SIZE(pattern)+/*skip slash*/1; tb_set_cursor(col, bottom_screen_line); } else if (key == TB_KEY_BACKSPACE || key == TB_KEY_BACKSPACE2) { if (col > /*slash*/1) { assert(col <= SIZE(pattern)+1); --col; // update pattern pattern.erase(col-/*slash*/1, /*len*/1); // update screen tb_set_cursor(col, bottom_screen_line); for (int x = col; x < SIZE(pattern)+/*skip slash*/1; ++x) tb_print(pattern.at(x-/*slash*/1), TB_WHITE, TB_BLACK); tb_print(' ', TB_WHITE, TB_BLACK); tb_set_cursor(col, bottom_screen_line); } } else if (key == TB_KEY_CTRL_K) { int old_pattern_size = SIZE(pattern); pattern.erase(col-/*slash*/1, SIZE(pattern) - (col-/*slash*/1)); tb_set_cursor(col, bottom_screen_line); for (int x = col; x < old_pattern_size+/*slash*/1; ++x) tb_print(' ', TB_WHITE, TB_BLACK); tb_set_cursor(col, bottom_screen_line); } else if (key == TB_KEY_CTRL_U) { int old_pattern_size = SIZE(pattern); pattern.erase(0, col-/*slash*/1); col = /*skip slash*/1; tb_set_cursor(col, bottom_screen_line); for (int x = /*slash*/1; x < SIZE(pattern)+/*skip slash*/1; ++x) tb_print(pattern.at(x-/*slash*/1), TB_WHITE, TB_BLACK); for (int x = SIZE(pattern)+/*slash*/1; x < old_pattern_size+/*skip slash*/1; ++x) tb_print(' ', TB_WHITE, TB_BLACK); tb_set_cursor(col, bottom_screen_line); } else if (key < 128) { // ascii only // update pattern char c = static_cast<char>(key); assert(col-1 >= 0); assert(col-1 <= SIZE(pattern)); pattern.insert(col-/*slash*/1, /*num*/1, c); // update screen for (int x = col; x < SIZE(pattern)+/*skip slash*/1; ++x) tb_print(pattern.at(x-/*slash*/1), TB_WHITE, TB_BLACK); ++col; tb_set_cursor(col, bottom_screen_line); } } } void search(const string& pat, search_direction dir) { if (dir == FORWARD) search_next(pat); else search_previous(pat); } search_direction opposite(search_direction dir) { if (dir == FORWARD) return BACKWARD; else return FORWARD; } void search_next(const string& pat) { for (int trace_index = get(Trace_index, Display_row)+1; trace_index < SIZE(Trace_stream->past_lines); ++trace_index) { if (!contains_key(Visible, trace_index)) continue; const trace_line& line = Trace_stream->past_lines.at(trace_index); if (line.label.find(pat) == string::npos && line.contents.find(pat) == string::npos) continue; Top_of_screen = trace_index; Display_row = 0; refresh_screen_rows(); return; } } void search_previous(const string& pat) { for (int trace_index = get(Trace_index, Display_row)-1; trace_index >= 0; --trace_index) { if (!contains_key(Visible, trace_index)) continue; const trace_line& line = Trace_stream->past_lines.at(trace_index); if (line.label.find(pat) == string::npos && line.contents.find(pat) == string::npos) continue; Top_of_screen = trace_index; Display_row = 0; refresh_screen_rows(); return; } } void clear_line(int screen_row) { tb_set_cursor(0, screen_row); for (int col = 0; col < tb_width(); ++col) tb_print(' ', TB_WHITE, TB_BLACK); tb_set_cursor(0, screen_row); } // update Trace_indices for each screen_row on the basis of Top_of_screen and Visible void refresh_screen_rows() { int screen_row = 0, index = 0; Trace_index.clear(); for (screen_row = 0, index = Top_of_screen; screen_row < tb_height() && index < SIZE(Trace_stream->past_lines); ++screen_row, ++index) { // skip lines without depth for now while (!contains_key(Visible, index)) { ++index; if (index >= SIZE(Trace_stream->past_lines)) goto done; } assert(index < SIZE(Trace_stream->past_lines)); put(Trace_index, screen_row, index); } done:; } void render() { int screen_row = 0; for (screen_row = 0; screen_row < tb_height(); ++screen_row) { if (!contains_key(Trace_index, screen_row)) break; trace_line& curr_line = Trace_stream->past_lines.at(get(Trace_index, screen_row)); ostringstream out; out << std::setw(4) << curr_line.depth << ' ' << curr_line.label << ": " << curr_line.contents; if (screen_row < tb_height()-1) { int delta = lines_hidden(screen_row); // home-brew escape sequence for red if (delta > 1) { if (delta > 999) out << static_cast<char>(1); out << " (" << delta << ")"; if (delta > 999) out << static_cast<char>(2); } } render_line(screen_row, out.str(), screen_row == Display_row); } // clear rest of screen Last_printed_row = screen_row-1; for (; screen_row < tb_height(); ++screen_row) render_line(screen_row, "~", /*cursor_line?*/false); // move cursor back to display row at the end tb_set_cursor(0, Display_row); } int lines_hidden(int screen_row) { assert(contains_key(Trace_index, screen_row)); if (!contains_key(Trace_index, screen_row+1)) return SIZE(Trace_stream->past_lines) - get(Trace_index, screen_row); else return get(Trace_index, screen_row+1) - get(Trace_index, screen_row); } void render_line(int screen_row, const string& s, bool cursor_line) { int col = 0; int color = TB_WHITE; int background_color = cursor_line ? /*subtle grey*/240 : TB_BLACK; vector<pair<size_t, size_t> > highlight_ranges = find_all_occurrences(s, Current_search_pattern); tb_set_cursor(0, screen_row); for (col = 0; col < tb_width() && col+Left_of_screen < SIZE(s); ++col) { char c = s.at(col+Left_of_screen); // todo: unicode if (c == '\n') c = ';'; // replace newlines with semi-colons // escapes. hack: can't start a line with them. if (c == '\1') { color = /*red*/1; c = ' '; } if (c == '\2') { color = TB_WHITE; c = ' '; } if (in_range(highlight_ranges, col+Left_of_screen)) tb_print(c, TB_BLACK, /*yellow*/11); else tb_print(c, color, background_color); } for (; col < tb_width(); ++col) tb_print(' ', TB_WHITE, background_color); } vector<pair<size_t, size_t> > find_all_occurrences(const string& s, const string& pat) { vector<pair<size_t, size_t> > result; if (pat.empty()) return result; size_t idx = 0; while (true) { size_t next_idx = s.find(pat, idx); if (next_idx == string::npos) break; result.push_back(pair<size_t, size_t>(next_idx, next_idx+SIZE(pat))); idx = next_idx+SIZE(pat); } return result; } bool in_range(const vector<pair<size_t, size_t> >& highlight_ranges, size_t idx) { for (int i = 0; i < SIZE(highlight_ranges); ++i) { if (idx >= highlight_ranges.at(i).first && idx < highlight_ranges.at(i).second) return true; if (idx < highlight_ranges.at(i).second) break; } return false; } void load_trace(const char* filename) { ifstream tin(filename); if (!tin) { cerr << "no such file: " << filename << '\n'; exit(1); } Trace_stream = new trace_stream; while (has_data(tin)) { tin >> std::noskipws; skip_whitespace_but_not_newline(tin); if (!isdigit(tin.peek())) { string dummy; getline(tin, dummy); continue; } tin >> std::skipws; int depth; tin >> depth; string label; tin >> label; if (*--label.end() == ':') label.erase(--label.end()); string line; getline(tin, line); Trace_stream->past_lines.push_back(trace_line(depth, label, line)); } cerr << "lines read: " << Trace_stream->past_lines.size() << '\n'; } int read_key() { tb_event event; do { tb_poll_event(&event); } while (event.type != TB_EVENT_KEY); return event.key ? event.key : event.ch; }