mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 17:42:43 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			1277 lines
		
	
	
	
		
			46 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			1277 lines
		
	
	
	
		
			46 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
 | |
|  * All rights reserved.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions are met:
 | |
|  *
 | |
|  * 1. Redistributions of source code must retain the above copyright notice, this
 | |
|  *    list of conditions and the following disclaimer.
 | |
|  *
 | |
|  * 2. Redistributions in binary form must reproduce the above copyright notice,
 | |
|  *    this list of conditions and the following disclaimer in the documentation
 | |
|  *    and/or other materials provided with the distribution.
 | |
|  *
 | |
|  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 | |
|  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 | |
|  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 | |
|  * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 | |
|  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 | |
|  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 | |
|  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 | |
|  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 | |
|  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 | |
|  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 | |
|  */
 | |
| 
 | |
| #include "Editor.h"
 | |
| #include <AK/StringBuilder.h>
 | |
| #include <AK/Utf32View.h>
 | |
| #include <AK/Utf8View.h>
 | |
| #include <ctype.h>
 | |
| #include <stdio.h>
 | |
| #include <sys/ioctl.h>
 | |
| #include <sys/select.h>
 | |
| #include <sys/time.h>
 | |
| #include <unistd.h>
 | |
| 
 | |
| namespace Line {
 | |
| 
 | |
| Editor::Editor(Configuration configuration)
 | |
|     : m_configuration(configuration)
 | |
| {
 | |
|     m_always_refresh = configuration.refresh_behaviour == Configuration::RefreshBehaviour::Eager;
 | |
|     m_pending_chars = ByteBuffer::create_uninitialized(0);
 | |
|     struct winsize ws;
 | |
|     if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &ws) < 0) {
 | |
|         m_num_columns = 80;
 | |
|         m_num_lines = 25;
 | |
|     } else {
 | |
|         m_num_columns = ws.ws_col;
 | |
|         m_num_lines = ws.ws_row;
 | |
|     }
 | |
| }
 | |
| 
 | |
| Editor::~Editor()
 | |
| {
 | |
|     if (m_initialized)
 | |
|         restore();
 | |
| }
 | |
| 
 | |
| void Editor::add_to_history(const String& line)
 | |
| {
 | |
|     if ((m_history.size() + 1) > m_history_capacity)
 | |
|         m_history.take_first();
 | |
|     m_history.append(line);
 | |
| }
 | |
| 
 | |
| void Editor::clear_line()
 | |
| {
 | |
|     for (size_t i = 0; i < m_cursor; ++i)
 | |
|         fputc(0x8, stdout);
 | |
|     fputs("\033[K", stdout);
 | |
|     fflush(stdout);
 | |
|     m_buffer.clear();
 | |
|     m_cursor = 0;
 | |
|     m_inline_search_cursor = m_cursor;
 | |
| }
 | |
| 
 | |
| void Editor::insert(const String& string)
 | |
| {
 | |
|     for (auto ch : Utf8View { string })
 | |
|         insert(ch);
 | |
| }
 | |
| 
 | |
| void Editor::insert(const u32 cp)
 | |
| {
 | |
|     StringBuilder builder;
 | |
|     builder.append(Utf32View(&cp, 1));
 | |
|     auto str = builder.build();
 | |
|     m_pending_chars.append(str.characters(), str.length());
 | |
| 
 | |
|     if (m_cursor == m_buffer.size()) {
 | |
|         m_buffer.append(cp);
 | |
|         m_cursor = m_buffer.size();
 | |
|         m_inline_search_cursor = m_cursor;
 | |
|         return;
 | |
|     }
 | |
| 
 | |
|     m_buffer.insert(m_cursor, cp);
 | |
|     ++m_chars_inserted_in_the_middle;
 | |
|     ++m_cursor;
 | |
|     m_inline_search_cursor = m_cursor;
 | |
| }
 | |
| 
 | |
| void Editor::register_character_input_callback(char ch, Function<bool(Editor&)> callback)
 | |
| {
 | |
|     if (m_key_callbacks.contains(ch)) {
 | |
|         dbg() << "Key callback registered twice for " << ch;
 | |
|         ASSERT_NOT_REACHED();
 | |
|     }
 | |
|     m_key_callbacks.set(ch, make<KeyCallback>(move(callback)));
 | |
| }
 | |
| 
 | |
| static size_t codepoint_length_in_utf8(u32 codepoint)
 | |
| {
 | |
|     if (codepoint <= 0x7f)
 | |
|         return 1;
 | |
|     if (codepoint <= 0x07ff)
 | |
|         return 2;
 | |
|     if (codepoint <= 0xffff)
 | |
|         return 3;
 | |
|     if (codepoint <= 0x10ffff)
 | |
|         return 4;
 | |
|     return 3;
 | |
| }
 | |
| 
 | |
| void Editor::stylize(const Span& span, const Style& style)
 | |
| {
 | |
|     auto start = span.beginning();
 | |
|     auto end = span.end();
 | |
| 
 | |
|     if (span.mode() == Span::ByteOriented) {
 | |
|         size_t byte_offset = 0;
 | |
|         size_t codepoint_offset = 0;
 | |
|         size_t start_codepoint_offset = 0, end_codepoint_offset = 0;
 | |
| 
 | |
|         for (;;) {
 | |
|             if (codepoint_offset >= m_buffer.size())
 | |
|                 break;
 | |
| 
 | |
|             if (byte_offset > end)
 | |
|                 break;
 | |
| 
 | |
|             if (byte_offset < start)
 | |
|                 ++start_codepoint_offset;
 | |
| 
 | |
|             ++end_codepoint_offset;
 | |
| 
 | |
|             byte_offset += codepoint_length_in_utf8(m_buffer[codepoint_offset++]);
 | |
|         }
 | |
| 
 | |
|         start = start_codepoint_offset;
 | |
|         end = end_codepoint_offset;
 | |
|     }
 | |
| 
 | |
|     auto starting_map = m_spans_starting.get(start).value_or({});
 | |
| 
 | |
|     if (!starting_map.contains(end))
 | |
|         m_refresh_needed = true;
 | |
| 
 | |
|     starting_map.set(end, style);
 | |
| 
 | |
|     m_spans_starting.set(start, starting_map);
 | |
| 
 | |
|     auto ending_map = m_spans_ending.get(end).value_or({});
 | |
| 
 | |
|     if (!ending_map.contains(start))
 | |
|         m_refresh_needed = true;
 | |
|     ending_map.set(start, style);
 | |
| 
 | |
|     m_spans_ending.set(end, ending_map);
 | |
| }
 | |
| 
 | |
| String Editor::get_line(const String& prompt)
 | |
| {
 | |
|     initialize();
 | |
|     m_is_editing = true;
 | |
| 
 | |
|     set_prompt(prompt);
 | |
|     reset();
 | |
|     set_origin();
 | |
| 
 | |
|     m_history_cursor = m_history.size();
 | |
|     for (;;) {
 | |
|         if (m_always_refresh)
 | |
|             m_refresh_needed = true;
 | |
|         refresh_display();
 | |
|         if (m_finish) {
 | |
|             m_finish = false;
 | |
|             printf("\n");
 | |
|             fflush(stdout);
 | |
|             auto string = line();
 | |
|             m_buffer.clear();
 | |
|             m_is_editing = false;
 | |
|             restore();
 | |
|             return string;
 | |
|         }
 | |
|         char keybuf[16];
 | |
|         ssize_t nread = 0;
 | |
| 
 | |
|         if (!m_incomplete_data.size())
 | |
|             nread = read(0, keybuf, sizeof(keybuf));
 | |
| 
 | |
|         if (nread < 0) {
 | |
|             if (errno == EINTR) {
 | |
|                 if (!m_was_interrupted) {
 | |
|                     if (m_was_resized)
 | |
|                         continue;
 | |
| 
 | |
|                     finish();
 | |
|                     continue;
 | |
|                 }
 | |
| 
 | |
|                 m_was_interrupted = false;
 | |
| 
 | |
|                 if (!m_buffer.is_empty())
 | |
|                     printf("^C");
 | |
| 
 | |
|                 m_buffer.clear();
 | |
|                 m_cursor = 0;
 | |
| 
 | |
|                 if (on_interrupt_handled)
 | |
|                     on_interrupt_handled();
 | |
| 
 | |
|                 m_refresh_needed = true;
 | |
|                 continue;
 | |
|             }
 | |
|             perror("read failed");
 | |
|             // FIXME: exit()ing here is a bit off. Should communicate failure to caller somehow instead.
 | |
|             exit(2);
 | |
|         }
 | |
| 
 | |
|         m_incomplete_data.append(keybuf, nread);
 | |
|         nread = m_incomplete_data.size();
 | |
| 
 | |
|         // FIXME: exit()ing here is a bit off. Should communicate failure to caller somehow instead.
 | |
|         if (nread == 0)
 | |
|             exit(0);
 | |
| 
 | |
|         auto reverse_tab = false;
 | |
|         auto increment_suggestion_index = [&] {
 | |
|             if (m_suggestions.size())
 | |
|                 m_next_suggestion_index = (m_next_suggestion_index + 1) % m_suggestions.size();
 | |
|             else
 | |
|                 m_next_suggestion_index = 0;
 | |
|         };
 | |
|         auto decrement_suggestion_index = [&] {
 | |
|             if (m_next_suggestion_index == 0)
 | |
|                 m_next_suggestion_index = m_suggestions.size();
 | |
|             m_next_suggestion_index--;
 | |
|         };
 | |
|         auto ctrl_held = false;
 | |
| 
 | |
|         // discard starting bytes until they make sense as utf-8
 | |
|         size_t valid_bytes = 0;
 | |
|         while (nread) {
 | |
|             Utf8View { StringView { m_incomplete_data.data(), (size_t)nread } }.validate(valid_bytes);
 | |
|             if (valid_bytes)
 | |
|                 break;
 | |
|             m_incomplete_data.take_first();
 | |
|             --nread;
 | |
|         }
 | |
| 
 | |
|         Utf8View input_view { StringView { m_incomplete_data.data(), valid_bytes } };
 | |
|         size_t consumed_codepoints = 0;
 | |
| 
 | |
|         for (auto codepoint : input_view) {
 | |
|             if (m_finish)
 | |
|                 break;
 | |
| 
 | |
|             ++consumed_codepoints;
 | |
| 
 | |
|             if (codepoint == 0)
 | |
|                 continue;
 | |
| 
 | |
|             switch (m_state) {
 | |
|             case InputState::ExpectBracket:
 | |
|                 if (codepoint == '[') {
 | |
|                     m_state = InputState::ExpectFinal;
 | |
|                     continue;
 | |
|                 } else {
 | |
|                     m_state = InputState::Free;
 | |
|                     break;
 | |
|                 }
 | |
|             case InputState::ExpectFinal:
 | |
|                 switch (codepoint) {
 | |
|                 case 'O': // mod_ctrl
 | |
|                     ctrl_held = true;
 | |
|                     continue;
 | |
|                 case 'A': // up
 | |
|                 {
 | |
|                     m_searching_backwards = true;
 | |
|                     auto inline_search_cursor = m_inline_search_cursor;
 | |
|                     StringBuilder builder;
 | |
|                     builder.append(Utf32View { m_buffer.data(), inline_search_cursor });
 | |
|                     String search_phrase = builder.to_string();
 | |
|                     if (search(search_phrase, true, true)) {
 | |
|                         ++m_search_offset;
 | |
|                     } else {
 | |
|                         insert(search_phrase);
 | |
|                     }
 | |
|                     m_inline_search_cursor = inline_search_cursor;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 }
 | |
|                 case 'B': // down
 | |
|                 {
 | |
|                     auto inline_search_cursor = m_inline_search_cursor;
 | |
|                     StringBuilder builder;
 | |
|                     builder.append(Utf32View { m_buffer.data(), inline_search_cursor });
 | |
|                     String search_phrase = builder.to_string();
 | |
|                     auto search_changed_directions = m_searching_backwards;
 | |
|                     m_searching_backwards = false;
 | |
|                     if (m_search_offset > 0) {
 | |
|                         m_search_offset -= 1 + search_changed_directions;
 | |
|                         if (!search(search_phrase, true, true)) {
 | |
|                             insert(search_phrase);
 | |
|                         }
 | |
|                     } else {
 | |
|                         m_search_offset = 0;
 | |
|                         m_cursor = 0;
 | |
|                         m_buffer.clear();
 | |
|                         insert(search_phrase);
 | |
|                         m_refresh_needed = true;
 | |
|                     }
 | |
|                     m_inline_search_cursor = inline_search_cursor;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 }
 | |
|                 case 'D': // left
 | |
|                     if (m_cursor > 0) {
 | |
|                         if (ctrl_held) {
 | |
|                             auto skipped_at_least_one_character = false;
 | |
|                             for (;;) {
 | |
|                                 if (m_cursor == 0)
 | |
|                                     break;
 | |
|                                 if (skipped_at_least_one_character && isspace(m_buffer[m_cursor - 1])) // stop *after* a space, but only if it changes the position
 | |
|                                     break;
 | |
|                                 skipped_at_least_one_character = true;
 | |
|                                 --m_cursor;
 | |
|                             }
 | |
|                         } else {
 | |
|                             --m_cursor;
 | |
|                         }
 | |
|                     }
 | |
|                     m_inline_search_cursor = m_cursor;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 case 'C': // right
 | |
|                     if (m_cursor < m_buffer.size()) {
 | |
|                         if (ctrl_held) {
 | |
|                             // temporarily put a space at the end of our buffer
 | |
|                             // this greatly simplifies the logic below
 | |
|                             m_buffer.append(' ');
 | |
|                             for (;;) {
 | |
|                                 if (m_cursor >= m_buffer.size())
 | |
|                                     break;
 | |
|                                 if (isspace(m_buffer[++m_cursor]))
 | |
|                                     break;
 | |
|                             }
 | |
|                             m_buffer.take_last();
 | |
|                         } else {
 | |
|                             ++m_cursor;
 | |
|                         }
 | |
|                     }
 | |
|                     m_inline_search_cursor = m_cursor;
 | |
|                     m_search_offset = 0;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 case 'H':
 | |
|                     m_cursor = 0;
 | |
|                     m_inline_search_cursor = m_cursor;
 | |
|                     m_search_offset = 0;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 case 'F':
 | |
|                     m_cursor = m_buffer.size();
 | |
|                     m_state = InputState::Free;
 | |
|                     m_inline_search_cursor = m_cursor;
 | |
|                     m_search_offset = 0;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 case 'Z': // shift+tab
 | |
|                     reverse_tab = true;
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     break;
 | |
|                 case '3':
 | |
|                     if (m_cursor == m_buffer.size()) {
 | |
|                         fputc('\a', stdout);
 | |
|                         fflush(stdout);
 | |
|                         continue;
 | |
|                     }
 | |
|                     m_buffer.remove(m_cursor);
 | |
|                     m_refresh_needed = true;
 | |
|                     m_search_offset = 0;
 | |
|                     m_state = InputState::ExpectTerminator;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 default:
 | |
|                     dbgprintf("Shell: Unhandled final: %02x (%c)\r\n", codepoint, codepoint);
 | |
|                     m_state = InputState::Free;
 | |
|                     ctrl_held = false;
 | |
|                     continue;
 | |
|                 }
 | |
|                 break;
 | |
|             case InputState::ExpectTerminator:
 | |
|                 m_state = InputState::Free;
 | |
|                 continue;
 | |
|             case InputState::Free:
 | |
|                 if (codepoint == 27) {
 | |
|                     m_state = InputState::ExpectBracket;
 | |
|                     continue;
 | |
|                 }
 | |
|                 break;
 | |
|             }
 | |
| 
 | |
|             auto cb = m_key_callbacks.get(codepoint);
 | |
|             if (cb.has_value()) {
 | |
|                 if (!cb.value()->callback(*this)) {
 | |
|                     continue;
 | |
|                 }
 | |
|             }
 | |
| 
 | |
|             m_search_offset = 0; // reset search offset on any key
 | |
| 
 | |
|             if (codepoint == '\t' || reverse_tab) {
 | |
|                 if (!on_tab_complete_first_token || !on_tab_complete_other_token)
 | |
|                     continue;
 | |
| 
 | |
|                 auto should_break_token = [mode = m_configuration.split_mechanism](auto& buffer, size_t index) {
 | |
|                     switch (mode) {
 | |
|                     case Configuration::TokenSplitMechanism::Spaces:
 | |
|                         return buffer[index] == ' ';
 | |
|                     case Configuration::TokenSplitMechanism::UnescapedSpaces:
 | |
|                         return buffer[index] == ' ' && (index == 0 || buffer[index - 1] != '\\');
 | |
|                     }
 | |
| 
 | |
|                     ASSERT_NOT_REACHED();
 | |
|                     return true;
 | |
|                 };
 | |
| 
 | |
|                 bool is_empty_token = m_cursor == 0 || should_break_token(m_buffer, m_cursor - 1);
 | |
| 
 | |
|                 // reverse tab can count as regular tab here
 | |
|                 m_times_tab_pressed++;
 | |
| 
 | |
|                 int token_start = m_cursor - 1;
 | |
| 
 | |
|                 if (!is_empty_token) {
 | |
|                     while (token_start >= 0 && !should_break_token(m_buffer, token_start))
 | |
|                         --token_start;
 | |
|                     ++token_start;
 | |
|                 }
 | |
| 
 | |
|                 bool is_first_token = true;
 | |
|                 for (int i = token_start - 1; i >= 0; --i) {
 | |
|                     if (should_break_token(m_buffer, i)) {
 | |
|                         is_first_token = false;
 | |
|                         break;
 | |
|                     }
 | |
|                 }
 | |
| 
 | |
|                 StringBuilder builder;
 | |
|                 builder.append(Utf32View { m_buffer.data() + token_start, m_cursor - token_start });
 | |
|                 String token = is_empty_token ? String() : builder.to_string();
 | |
| 
 | |
|                 // ask for completions only on the first tab
 | |
|                 // and scan for the largest common prefix to display
 | |
|                 // further tabs simply show the cached completions
 | |
|                 if (m_times_tab_pressed == 1) {
 | |
|                     if (is_first_token)
 | |
|                         m_suggestions = on_tab_complete_first_token(token);
 | |
|                     else
 | |
|                         m_suggestions = on_tab_complete_other_token(token);
 | |
|                     size_t common_suggestion_prefix { 0 };
 | |
|                     if (m_suggestions.size() == 1) {
 | |
|                         m_largest_common_suggestion_prefix_length = m_suggestions[0].text.length();
 | |
|                     } else if (m_suggestions.size()) {
 | |
|                         char last_valid_suggestion_char;
 | |
|                         for (;; ++common_suggestion_prefix) {
 | |
|                             if (m_suggestions[0].text.length() <= common_suggestion_prefix)
 | |
|                                 goto no_more_commons;
 | |
| 
 | |
|                             last_valid_suggestion_char = m_suggestions[0].text[common_suggestion_prefix];
 | |
| 
 | |
|                             for (const auto& suggestion : m_suggestions) {
 | |
|                                 if (suggestion.text.length() <= common_suggestion_prefix || suggestion.text[common_suggestion_prefix] != last_valid_suggestion_char) {
 | |
|                                     goto no_more_commons;
 | |
|                                 }
 | |
|                             }
 | |
|                         }
 | |
|                     no_more_commons:;
 | |
|                         m_largest_common_suggestion_prefix_length = common_suggestion_prefix;
 | |
|                     } else {
 | |
|                         m_largest_common_suggestion_prefix_length = 0;
 | |
|                         // there are no suggestions, beep~
 | |
|                         putchar('\a');
 | |
|                         fflush(stdout);
 | |
|                     }
 | |
|                     m_prompt_lines_at_suggestion_initiation = num_lines();
 | |
|                 }
 | |
| 
 | |
|                 // Adjust already incremented / decremented index when switching tab direction
 | |
|                 if (reverse_tab && m_tab_direction != TabDirection::Backward) {
 | |
|                     decrement_suggestion_index();
 | |
|                     decrement_suggestion_index();
 | |
|                     m_tab_direction = TabDirection::Backward;
 | |
|                 }
 | |
|                 if (!reverse_tab && m_tab_direction != TabDirection::Forward) {
 | |
|                     increment_suggestion_index();
 | |
|                     increment_suggestion_index();
 | |
|                     m_tab_direction = TabDirection::Forward;
 | |
|                 }
 | |
|                 reverse_tab = false;
 | |
| 
 | |
|                 auto current_suggestion_index = m_next_suggestion_index;
 | |
|                 if (m_next_suggestion_index < m_suggestions.size()) {
 | |
|                     auto can_complete = m_next_suggestion_invariant_offset <= m_largest_common_suggestion_prefix_length;
 | |
|                     if (!m_last_shown_suggestion.text.is_null()) {
 | |
|                         size_t actual_offset;
 | |
|                         size_t shown_length = m_last_shown_suggestion_display_length;
 | |
|                         switch (m_times_tab_pressed) {
 | |
|                         case 1:
 | |
|                             actual_offset = m_cursor;
 | |
|                             break;
 | |
|                         case 2:
 | |
|                             actual_offset = m_cursor - m_largest_common_suggestion_prefix_length + m_next_suggestion_invariant_offset;
 | |
|                             if (can_complete)
 | |
|                                 shown_length = m_largest_common_suggestion_prefix_length + m_last_shown_suggestion.trailing_trivia.length();
 | |
|                             break;
 | |
|                         default:
 | |
|                             if (m_last_shown_suggestion_display_length == 0)
 | |
|                                 actual_offset = m_cursor;
 | |
|                             else
 | |
|                                 actual_offset = m_cursor - m_last_shown_suggestion_display_length + m_next_suggestion_invariant_offset;
 | |
|                             break;
 | |
|                         }
 | |
| 
 | |
|                         for (size_t i = m_next_suggestion_invariant_offset; i < shown_length; ++i)
 | |
|                             m_buffer.remove(actual_offset);
 | |
|                         m_cursor = actual_offset;
 | |
|                         m_inline_search_cursor = m_cursor;
 | |
|                         m_refresh_needed = true;
 | |
|                     }
 | |
|                     m_last_shown_suggestion = m_suggestions[m_next_suggestion_index];
 | |
|                     m_last_shown_suggestion_display_length = m_last_shown_suggestion.text.length();
 | |
|                     m_last_shown_suggestion_was_complete = true;
 | |
|                     if (m_times_tab_pressed == 1) {
 | |
|                         // This is the first time, so only auto-complete *if possible*
 | |
|                         if (can_complete) {
 | |
|                             insert(m_last_shown_suggestion.text.substring_view(m_next_suggestion_invariant_offset, m_largest_common_suggestion_prefix_length - m_next_suggestion_invariant_offset));
 | |
|                             m_last_shown_suggestion_display_length = m_largest_common_suggestion_prefix_length;
 | |
|                             // do not increment the suggestion index, as the first tab should only be a *peek*
 | |
|                             if (m_suggestions.size() == 1) {
 | |
|                                 // if there's one suggestion, commit and forget
 | |
|                                 m_times_tab_pressed = 0;
 | |
|                                 // add in the trivia of the last selected suggestion
 | |
|                                 insert(m_last_shown_suggestion.trailing_trivia);
 | |
|                                 m_last_shown_suggestion_display_length += m_last_shown_suggestion.trailing_trivia.length();
 | |
|                             }
 | |
|                         } else {
 | |
|                             m_last_shown_suggestion_display_length = 0;
 | |
|                         }
 | |
|                         ++m_times_tab_pressed;
 | |
|                         m_last_shown_suggestion_was_complete = false;
 | |
|                     } else {
 | |
|                         insert(m_last_shown_suggestion.text.substring_view(m_next_suggestion_invariant_offset, m_last_shown_suggestion.text.length() - m_next_suggestion_invariant_offset));
 | |
|                         // add in the trivia of the last selected suggestion
 | |
|                         insert(m_last_shown_suggestion.trailing_trivia);
 | |
|                         m_last_shown_suggestion_display_length += m_last_shown_suggestion.trailing_trivia.length();
 | |
|                         if (m_tab_direction == TabDirection::Forward)
 | |
|                             increment_suggestion_index();
 | |
|                         else
 | |
|                             decrement_suggestion_index();
 | |
|                     }
 | |
|                 } else {
 | |
|                     m_next_suggestion_index = 0;
 | |
|                 }
 | |
| 
 | |
|                 if (m_times_tab_pressed > 1 && !m_suggestions.is_empty()) {
 | |
|                     size_t longest_suggestion_length = 0;
 | |
|                     size_t start_index = 0;
 | |
| 
 | |
|                     for (auto& suggestion : m_suggestions) {
 | |
|                         if (start_index++ < m_last_displayed_suggestion_index)
 | |
|                             continue;
 | |
|                         longest_suggestion_length = max(longest_suggestion_length, suggestion.text.length());
 | |
|                     }
 | |
| 
 | |
|                     size_t num_printed = 0;
 | |
|                     size_t lines_used { 1 };
 | |
|                     size_t index { 0 };
 | |
|                     vt_save_cursor();
 | |
|                     vt_clear_lines(0, m_lines_used_for_last_suggestions);
 | |
|                     vt_restore_cursor();
 | |
|                     auto spans_entire_line { false };
 | |
|                     auto max_line_count = (m_cached_prompt_length + longest_suggestion_length + m_num_columns - 1) / m_num_columns;
 | |
|                     if (longest_suggestion_length >= m_num_columns - 2) {
 | |
|                         spans_entire_line = true;
 | |
|                         // we should make enough space for the biggest entry in
 | |
|                         // the suggestion list to fit in the prompt line
 | |
|                         auto start = max_line_count - m_prompt_lines_at_suggestion_initiation;
 | |
|                         for (size_t i = start; i < max_line_count; ++i) {
 | |
|                             putchar('\n');
 | |
|                         }
 | |
|                         lines_used += max_line_count;
 | |
|                         longest_suggestion_length = 0;
 | |
|                     }
 | |
|                     vt_move_absolute(max_line_count + m_origin_x, 1);
 | |
|                     for (auto& suggestion : m_suggestions) {
 | |
|                         if (index < m_last_displayed_suggestion_index) {
 | |
|                             ++index;
 | |
|                             continue;
 | |
|                         }
 | |
|                         size_t next_column = num_printed + suggestion.text.length() + longest_suggestion_length + 2;
 | |
| 
 | |
|                         if (next_column > m_num_columns) {
 | |
|                             auto lines = (suggestion.text.length() + m_num_columns - 1) / m_num_columns;
 | |
|                             lines_used += lines;
 | |
|                             putchar('\n');
 | |
|                             num_printed = 0;
 | |
|                         }
 | |
| 
 | |
|                         // show just enough suggestions to fill up the screen
 | |
|                         // without moving the prompt out of view
 | |
|                         if (lines_used + m_prompt_lines_at_suggestion_initiation >= m_num_lines)
 | |
|                             break;
 | |
| 
 | |
|                         // only apply colour to the selection if something is *actually* added to the buffer
 | |
|                         if (m_last_shown_suggestion_was_complete && index == current_suggestion_index) {
 | |
|                             vt_apply_style({ Style::Foreground(Style::XtermColor::Blue) });
 | |
|                             fflush(stdout);
 | |
|                         }
 | |
| 
 | |
|                         if (spans_entire_line) {
 | |
|                             num_printed += m_num_columns;
 | |
|                             fprintf(stderr, "%s", suggestion.text.characters());
 | |
|                         } else {
 | |
|                             num_printed += fprintf(stderr, "%-*s", static_cast<int>(longest_suggestion_length) + 2, suggestion.text.characters());
 | |
|                         }
 | |
| 
 | |
|                         if (m_last_shown_suggestion_was_complete && index == current_suggestion_index) {
 | |
|                             vt_apply_style({});
 | |
|                             fflush(stdout);
 | |
|                         }
 | |
| 
 | |
|                         ++index;
 | |
|                     }
 | |
|                     m_lines_used_for_last_suggestions = lines_used;
 | |
| 
 | |
|                     // if we filled the screen, move back the origin
 | |
|                     if (m_origin_x + lines_used >= m_num_lines) {
 | |
|                         m_origin_x = m_num_lines - lines_used;
 | |
|                     }
 | |
| 
 | |
|                     --index;
 | |
|                     // cycle pages of suggestions
 | |
|                     if (index == current_suggestion_index)
 | |
|                         m_last_displayed_suggestion_index = index;
 | |
| 
 | |
|                     if (m_last_displayed_suggestion_index >= m_suggestions.size() - 1)
 | |
|                         m_last_displayed_suggestion_index = 0;
 | |
|                 }
 | |
|                 if (m_suggestions.size() < 2) {
 | |
|                     // we have none, or just one suggestion
 | |
|                     // we should just commit that and continue
 | |
|                     // after it, as if it were auto-completed
 | |
|                     suggest(0, 0);
 | |
|                     m_last_shown_suggestion = String::empty();
 | |
|                     m_last_shown_suggestion_display_length = 0;
 | |
|                     m_suggestions.clear();
 | |
|                     m_times_tab_pressed = 0;
 | |
|                     m_last_displayed_suggestion_index = 0;
 | |
|                 }
 | |
|                 continue;
 | |
|             }
 | |
| 
 | |
|             if (m_times_tab_pressed) {
 | |
|                 // we probably have some suggestions drawn
 | |
|                 // let's clean them up
 | |
|                 if (m_lines_used_for_last_suggestions) {
 | |
|                     vt_clear_lines(0, m_lines_used_for_last_suggestions);
 | |
|                     reposition_cursor();
 | |
|                     m_refresh_needed = true;
 | |
|                     m_lines_used_for_last_suggestions = 0;
 | |
|                 }
 | |
|                 m_last_shown_suggestion_display_length = 0;
 | |
|                 m_last_shown_suggestion = String::empty();
 | |
|                 m_last_displayed_suggestion_index = 0;
 | |
|                 m_suggestions.clear();
 | |
|                 suggest(0, 0);
 | |
|             }
 | |
|             m_times_tab_pressed = 0; // Safe to say if we get here, the user didn't press TAB
 | |
| 
 | |
|             auto do_backspace = [&] {
 | |
|                 if (m_is_searching) {
 | |
|                     return;
 | |
|                 }
 | |
|                 if (m_cursor == 0) {
 | |
|                     fputc('\a', stdout);
 | |
|                     fflush(stdout);
 | |
|                     return;
 | |
|                 }
 | |
|                 m_buffer.remove(m_cursor - 1);
 | |
|                 --m_cursor;
 | |
|                 m_inline_search_cursor = m_cursor;
 | |
|                 // we will have to redraw :(
 | |
|                 m_refresh_needed = true;
 | |
|             };
 | |
| 
 | |
|             if (codepoint == 8 || codepoint == m_termios.c_cc[VERASE]) {
 | |
|                 do_backspace();
 | |
|                 continue;
 | |
|             }
 | |
|             if (codepoint == m_termios.c_cc[VWERASE]) {
 | |
|                 bool has_seen_nonspace = false;
 | |
|                 while (m_cursor > 0) {
 | |
|                     if (isspace(m_buffer[m_cursor - 1])) {
 | |
|                         if (has_seen_nonspace)
 | |
|                             break;
 | |
|                     } else {
 | |
|                         has_seen_nonspace = true;
 | |
|                     }
 | |
|                     do_backspace();
 | |
|                 }
 | |
|                 continue;
 | |
|             }
 | |
|             if (codepoint == m_termios.c_cc[VKILL]) {
 | |
|                 for (size_t i = 0; i < m_cursor; ++i)
 | |
|                     m_buffer.remove(0);
 | |
|                 m_cursor = 0;
 | |
|                 m_refresh_needed = true;
 | |
|                 continue;
 | |
|             }
 | |
|             // ^L
 | |
|             if (codepoint == 0xc) {
 | |
|                 printf("\033[3J\033[H\033[2J"); // Clear screen.
 | |
|                 vt_move_absolute(1, 1);
 | |
|                 m_origin_x = 1;
 | |
|                 m_origin_y = 1;
 | |
|                 m_refresh_needed = true;
 | |
|                 continue;
 | |
|             }
 | |
|             // ^A
 | |
|             if (codepoint == 0x01) {
 | |
|                 m_cursor = 0;
 | |
|                 continue;
 | |
|             }
 | |
|             // ^R
 | |
|             if (codepoint == 0x12) {
 | |
|                 if (m_is_searching) {
 | |
|                     // how did we get here?
 | |
|                     ASSERT_NOT_REACHED();
 | |
|                 } else {
 | |
|                     m_is_searching = true;
 | |
|                     m_search_offset = 0;
 | |
|                     m_pre_search_buffer.clear();
 | |
|                     for (auto codepoint : m_buffer)
 | |
|                         m_pre_search_buffer.append(codepoint);
 | |
|                     m_pre_search_cursor = m_cursor;
 | |
|                     m_search_editor = make<Editor>(Configuration { Configuration::Eager, m_configuration.split_mechanism }); // Has anyone seen 'Inception'?
 | |
|                     m_search_editor->on_display_refresh = [this](Editor& search_editor) {
 | |
|                         StringBuilder builder;
 | |
|                         builder.append(Utf32View { search_editor.buffer().data(), search_editor.buffer().size() });
 | |
|                         search(builder.build());
 | |
|                         refresh_display();
 | |
|                         return;
 | |
|                     };
 | |
| 
 | |
|                     // whenever the search editor gets a ^R, cycle between history entries
 | |
|                     m_search_editor->register_character_input_callback(0x12, [this](Editor& search_editor) {
 | |
|                         ++m_search_offset;
 | |
|                         search_editor.m_refresh_needed = true;
 | |
|                         return false; // Do not process this key event
 | |
|                     });
 | |
| 
 | |
|                     // whenever the search editor gets a backspace, cycle back between history entries
 | |
|                     // unless we're at the zeroth entry, in which case, allow the deletion
 | |
|                     m_search_editor->register_character_input_callback(m_termios.c_cc[VERASE], [this](Editor& search_editor) {
 | |
|                         if (m_search_offset > 0) {
 | |
|                             --m_search_offset;
 | |
|                             search_editor.m_refresh_needed = true;
 | |
|                             return false; // Do not process this key event
 | |
|                         }
 | |
|                         return true;
 | |
|                     });
 | |
| 
 | |
|                     // ^L - This is a source of issues, as the search editor refreshes first,
 | |
|                     // and we end up with the wrong order of prompts, so we will first refresh
 | |
|                     // ourselves, then refresh the search editor, and then tell him not to process
 | |
|                     // this event
 | |
|                     m_search_editor->register_character_input_callback(0x0c, [this](auto& search_editor) {
 | |
|                         printf("\033[3J\033[H\033[2J"); // Clear screen.
 | |
| 
 | |
|                         // refresh our own prompt
 | |
|                         m_origin_x = 1;
 | |
|                         m_origin_y = 1;
 | |
|                         m_refresh_needed = true;
 | |
|                         refresh_display();
 | |
| 
 | |
|                         // move the search prompt below ours
 | |
|                         // and tell it to redraw itself
 | |
|                         search_editor.m_origin_x = 2;
 | |
|                         search_editor.m_origin_y = 1;
 | |
|                         search_editor.m_refresh_needed = true;
 | |
| 
 | |
|                         return false;
 | |
|                     });
 | |
| 
 | |
|                     // quit without clearing the current buffer
 | |
|                     m_search_editor->register_character_input_callback('\t', [this](Editor& search_editor) {
 | |
|                         search_editor.finish();
 | |
|                         m_reset_buffer_on_search_end = false;
 | |
|                         return false;
 | |
|                     });
 | |
| 
 | |
|                     printf("\n");
 | |
|                     fflush(stdout);
 | |
| 
 | |
|                     auto search_prompt = "\x1b[32msearch:\x1b[0m ";
 | |
|                     auto search_string = m_search_editor->get_line(search_prompt);
 | |
| 
 | |
|                     m_search_editor = nullptr;
 | |
|                     m_is_searching = false;
 | |
|                     m_search_offset = 0;
 | |
| 
 | |
|                     // manually cleanup the search line
 | |
|                     reposition_cursor();
 | |
|                     vt_clear_lines(0, (search_string.length() + actual_rendered_string_length(search_prompt) + m_num_columns - 1) / m_num_columns);
 | |
| 
 | |
|                     reposition_cursor();
 | |
| 
 | |
|                     if (!m_reset_buffer_on_search_end || search_string.length() == 0) {
 | |
|                         // if the entry was empty, or we purposely quit without a newline,
 | |
|                         // do not return anything
 | |
|                         // instead, just end the search
 | |
|                         end_search();
 | |
|                         continue;
 | |
|                     }
 | |
| 
 | |
|                     // return the string
 | |
|                     finish();
 | |
|                     continue;
 | |
|                 }
 | |
|                 continue;
 | |
|             }
 | |
|             // Normally ^D
 | |
|             if (codepoint == m_termios.c_cc[VEOF]) {
 | |
|                 if (m_buffer.is_empty()) {
 | |
|                     printf("<EOF>\n");
 | |
|                     if (!m_always_refresh) // this is a little off, but it'll do for now
 | |
|                         exit(0);
 | |
|                 }
 | |
|                 continue;
 | |
|             }
 | |
|             // ^E
 | |
|             if (codepoint == 0x05) {
 | |
| 
 | |
|                 m_cursor = m_buffer.size();
 | |
|                 continue;
 | |
|             }
 | |
|             if (codepoint == '\n') {
 | |
|                 finish();
 | |
|                 continue;
 | |
|             }
 | |
| 
 | |
|             insert(codepoint);
 | |
|         }
 | |
| 
 | |
|         if (consumed_codepoints == m_incomplete_data.size()) {
 | |
|             m_incomplete_data.clear();
 | |
|         } else {
 | |
|             for (size_t i = 0; i < consumed_codepoints; ++i)
 | |
|                 m_incomplete_data.take_first();
 | |
|         }
 | |
|     }
 | |
| }
 | |
| 
 | |
| bool Editor::search(const StringView& phrase, bool allow_empty, bool from_beginning)
 | |
| {
 | |
| 
 | |
|     int last_matching_offset = -1;
 | |
| 
 | |
|     // do not search for empty strings
 | |
|     if (allow_empty || phrase.length() > 0) {
 | |
|         size_t search_offset = m_search_offset;
 | |
|         for (size_t i = m_history_cursor; i > 0; --i) {
 | |
|             auto contains = from_beginning ? m_history[i - 1].starts_with(phrase) : m_history[i - 1].contains(phrase);
 | |
|             if (contains) {
 | |
|                 last_matching_offset = i - 1;
 | |
|                 if (search_offset == 0)
 | |
|                     break;
 | |
|                 --search_offset;
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         if (last_matching_offset == -1) {
 | |
|             fputc('\a', stdout);
 | |
|             fflush(stdout);
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     m_buffer.clear();
 | |
|     m_cursor = 0;
 | |
|     if (last_matching_offset >= 0) {
 | |
|         insert(m_history[last_matching_offset]);
 | |
|     }
 | |
|     // always needed
 | |
|     m_refresh_needed = true;
 | |
|     return last_matching_offset >= 0;
 | |
| }
 | |
| 
 | |
| void Editor::recalculate_origin()
 | |
| {
 | |
|     // changing the columns can affect our origin if
 | |
|     // the new size is smaller than our prompt, which would
 | |
|     // cause said prompt to take up more space, so we should
 | |
|     // compensate for that
 | |
|     if (m_cached_prompt_length >= m_num_columns) {
 | |
|         auto added_lines = (m_cached_prompt_length + 1) / m_num_columns - 1;
 | |
|         m_origin_x += added_lines;
 | |
|     }
 | |
| 
 | |
|     // we also need to recalculate our cursor position
 | |
|     // but that will be calculated and applied at the next
 | |
|     // refresh cycle
 | |
| }
 | |
| void Editor::cleanup()
 | |
| {
 | |
|     vt_move_relative(0, m_pending_chars.size() - m_chars_inserted_in_the_middle);
 | |
|     auto current_line = cursor_line();
 | |
| 
 | |
|     vt_clear_lines(current_line - 1, num_lines() - current_line);
 | |
|     vt_move_relative(-num_lines() + 1, -offset_in_line() - m_old_prompt_length - m_pending_chars.size() + m_chars_inserted_in_the_middle);
 | |
| };
 | |
| 
 | |
| void Editor::refresh_display()
 | |
| {
 | |
|     auto has_cleaned_up = false;
 | |
|     // someone changed the window size, figure it out
 | |
|     // and react to it, we might need to redraw
 | |
|     if (m_was_resized) {
 | |
|         auto previous_num_columns = m_num_columns;
 | |
| 
 | |
|         struct winsize ws;
 | |
|         if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &ws) < 0) {
 | |
|             m_num_columns = 80;
 | |
|             m_num_lines = 25;
 | |
|         } else {
 | |
|             m_num_columns = ws.ws_col;
 | |
|             m_num_lines = ws.ws_row;
 | |
|         }
 | |
| 
 | |
|         if (previous_num_columns != m_num_columns) {
 | |
|             // we need to cleanup and redo everything
 | |
|             m_cached_prompt_valid = false;
 | |
|             m_refresh_needed = true;
 | |
|             swap(previous_num_columns, m_num_columns);
 | |
|             recalculate_origin();
 | |
|             cleanup();
 | |
|             swap(previous_num_columns, m_num_columns);
 | |
|             has_cleaned_up = true;
 | |
|         }
 | |
|     }
 | |
|     // do not call hook on pure cursor movement
 | |
|     if (m_cached_prompt_valid && !m_refresh_needed && m_pending_chars.size() == 0) {
 | |
|         // probably just moving around
 | |
|         reposition_cursor();
 | |
|         m_cached_buffer_size = m_buffer.size();
 | |
|         return;
 | |
|     }
 | |
| 
 | |
|     if (on_display_refresh)
 | |
|         on_display_refresh(*this);
 | |
| 
 | |
|     if (m_cached_prompt_valid) {
 | |
|         if (!m_refresh_needed && m_cursor == m_buffer.size()) {
 | |
|             // just write the characters out and continue
 | |
|             // no need to refresh the entire line
 | |
|             char null = 0;
 | |
|             m_pending_chars.append(&null, 1);
 | |
|             fputs((char*)m_pending_chars.data(), stdout);
 | |
|             m_pending_chars.clear();
 | |
|             m_drawn_cursor = m_cursor;
 | |
|             m_cached_buffer_size = m_buffer.size();
 | |
|             fflush(stdout);
 | |
|             return;
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     // ouch, reflow entire line
 | |
|     // FIXME: handle multiline stuff
 | |
|     if (!has_cleaned_up) {
 | |
|         cleanup();
 | |
|     }
 | |
|     vt_move_absolute(m_origin_x, m_origin_y);
 | |
| 
 | |
|     fputs(m_new_prompt.characters(), stdout);
 | |
| 
 | |
|     vt_clear_to_end_of_line();
 | |
|     HashMap<u32, Style> empty_styles {};
 | |
|     StringBuilder builder;
 | |
|     for (size_t i = 0; i < m_buffer.size(); ++i) {
 | |
|         auto ends = m_spans_ending.get(i).value_or(empty_styles);
 | |
|         auto starts = m_spans_starting.get(i).value_or(empty_styles);
 | |
|         if (ends.size()) {
 | |
|             // go back to defaults
 | |
|             vt_apply_style(find_applicable_style(i));
 | |
|         }
 | |
|         if (starts.size()) {
 | |
|             // set new options
 | |
|             vt_apply_style(starts.begin()->value); // apply some random style that starts here
 | |
|         }
 | |
|         builder.clear();
 | |
|         builder.append(Utf32View { &m_buffer[i], 1 });
 | |
|         fputs(builder.to_string().characters(), stdout);
 | |
|     }
 | |
|     vt_apply_style({}); // don't bleed to EOL
 | |
|     m_pending_chars.clear();
 | |
|     m_refresh_needed = false;
 | |
|     m_cached_buffer_size = m_buffer.size();
 | |
|     m_chars_inserted_in_the_middle = 0;
 | |
|     if (!m_cached_prompt_valid) {
 | |
|         m_cached_prompt_valid = true;
 | |
|     }
 | |
| 
 | |
|     reposition_cursor();
 | |
|     fflush(stdout);
 | |
| }
 | |
| 
 | |
| void Editor::reposition_cursor()
 | |
| {
 | |
|     m_drawn_cursor = m_cursor;
 | |
| 
 | |
|     auto line = cursor_line() - 1;
 | |
|     auto column = offset_in_line();
 | |
| 
 | |
|     vt_move_absolute(line + m_origin_x, column + m_origin_y);
 | |
| }
 | |
| 
 | |
| void Editor::vt_move_absolute(u32 x, u32 y)
 | |
| {
 | |
|     printf("\033[%d;%dH", x, y);
 | |
|     fflush(stdout);
 | |
| }
 | |
| 
 | |
| void Editor::vt_move_relative(int x, int y)
 | |
| {
 | |
|     char x_op = 'A', y_op = 'D';
 | |
| 
 | |
|     if (x > 0)
 | |
|         x_op = 'B';
 | |
|     else
 | |
|         x = -x;
 | |
|     if (y > 0)
 | |
|         y_op = 'C';
 | |
|     else
 | |
|         y = -y;
 | |
| 
 | |
|     if (x > 0)
 | |
|         printf("\033[%d%c", x, x_op);
 | |
|     if (y > 0)
 | |
|         printf("\033[%d%c", y, y_op);
 | |
| }
 | |
| 
 | |
| Style Editor::find_applicable_style(size_t offset) const
 | |
| {
 | |
|     // walk through our styles and find one that fits in the offset
 | |
|     for (auto& entry : m_spans_starting) {
 | |
|         if (entry.key > offset)
 | |
|             continue;
 | |
|         for (auto& style_value : entry.value) {
 | |
|             if (style_value.key <= offset)
 | |
|                 continue;
 | |
|             return style_value.value;
 | |
|         }
 | |
|     }
 | |
|     return {};
 | |
| }
 | |
| 
 | |
| String Style::Background::to_vt_escape() const
 | |
| {
 | |
|     if (m_is_rgb) {
 | |
|         return String::format("\033[48;2;%d;%d;%dm", m_rgb_color[0], m_rgb_color[1], m_rgb_color[2]);
 | |
|     } else {
 | |
|         return String::format("\033[%dm", (u8)m_xterm_color + 40);
 | |
|     }
 | |
| }
 | |
| 
 | |
| String Style::Foreground::to_vt_escape() const
 | |
| {
 | |
|     if (m_is_rgb) {
 | |
|         return String::format("\033[38;2;%d;%d;%dm", m_rgb_color[0], m_rgb_color[1], m_rgb_color[2]);
 | |
|     } else {
 | |
|         return String::format("\033[%dm", (u8)m_xterm_color + 30);
 | |
|     }
 | |
| }
 | |
| 
 | |
| void Editor::vt_apply_style(const Style& style)
 | |
| {
 | |
|     printf(
 | |
|         "\033[%d;%d;%dm%s%s",
 | |
|         style.bold() ? 1 : 22,
 | |
|         style.underline() ? 4 : 24,
 | |
|         style.italic() ? 3 : 23,
 | |
|         style.background().to_vt_escape().characters(),
 | |
|         style.foreground().to_vt_escape().characters());
 | |
| }
 | |
| 
 | |
| void Editor::vt_clear_lines(size_t count_above, size_t count_below)
 | |
| {
 | |
|     // go down count_below lines
 | |
|     if (count_below > 0)
 | |
|         printf("\033[%dB", (int)count_below);
 | |
|     // then clear lines going upwards
 | |
|     for (size_t i = count_below + count_above; i > 0; --i)
 | |
|         fputs(i == 1 ? "\033[2K" : "\033[2K\033[A", stdout);
 | |
| }
 | |
| 
 | |
| void Editor::vt_save_cursor()
 | |
| {
 | |
|     fputs("\033[s", stdout);
 | |
|     fflush(stdout);
 | |
| }
 | |
| 
 | |
| void Editor::vt_restore_cursor()
 | |
| {
 | |
|     fputs("\033[u", stdout);
 | |
|     fflush(stdout);
 | |
| }
 | |
| 
 | |
| void Editor::vt_clear_to_end_of_line()
 | |
| {
 | |
|     fputs("\033[K", stdout);
 | |
|     fflush(stdout);
 | |
| }
 | |
| 
 | |
| size_t Editor::actual_rendered_string_length(const StringView& string) const
 | |
| {
 | |
|     size_t length { 0 };
 | |
|     enum VTState {
 | |
|         Free = 1,
 | |
|         Escape = 3,
 | |
|         Bracket = 5,
 | |
|         BracketArgsSemi = 7,
 | |
|         Title = 9,
 | |
|     } state { Free };
 | |
|     Utf8View view { string };
 | |
|     auto it = view.begin();
 | |
| 
 | |
|     for (size_t i = 0; i < view.length_in_codepoints(); ++i, ++it) {
 | |
|         auto c = *it;
 | |
|         switch (state) {
 | |
|         case Free:
 | |
|             if (c == '\x1b') {
 | |
|                 // escape
 | |
|                 state = Escape;
 | |
|                 continue;
 | |
|             }
 | |
|             if (c == '\r' || c == '\n') {
 | |
|                 // reset length to 0, since we either overwrite, or are on a newline
 | |
|                 length = 0;
 | |
|                 continue;
 | |
|             }
 | |
|             // FIXME: This will not support anything sophisticated
 | |
|             ++length;
 | |
|             break;
 | |
|         case Escape:
 | |
|             if (c == ']') {
 | |
|                 ++i;
 | |
|                 ++it;
 | |
|                 if (*it == '0')
 | |
|                     state = Title;
 | |
|                 continue;
 | |
|             }
 | |
|             if (c == '[') {
 | |
|                 state = Bracket;
 | |
|                 continue;
 | |
|             }
 | |
|             // FIXME: This does not support non-VT (aside from set-title) escapes
 | |
|             break;
 | |
|         case Bracket:
 | |
|             if (isdigit(c)) {
 | |
|                 state = BracketArgsSemi;
 | |
|                 continue;
 | |
|             }
 | |
|             break;
 | |
|         case BracketArgsSemi:
 | |
|             if (c == ';') {
 | |
|                 state = Bracket;
 | |
|                 continue;
 | |
|             }
 | |
|             if (!isdigit(c))
 | |
|                 state = Free;
 | |
|             break;
 | |
|         case Title:
 | |
|             if (c == 7)
 | |
|                 state = Free;
 | |
|             break;
 | |
|         }
 | |
|     }
 | |
|     return length;
 | |
| }
 | |
| 
 | |
| Vector<size_t, 2> Editor::vt_dsr()
 | |
| {
 | |
|     char buf[16];
 | |
|     u32 length { 0 };
 | |
| 
 | |
|     // read whatever junk there is before talking to the terminal
 | |
|     // and insert them later when we're reading user input
 | |
|     bool more_junk_to_read { false };
 | |
|     timeval timeout { 0, 0 };
 | |
|     fd_set readfds;
 | |
|     FD_ZERO(&readfds);
 | |
|     FD_SET(0, &readfds);
 | |
| 
 | |
|     do {
 | |
|         more_junk_to_read = false;
 | |
|         (void)select(1, &readfds, nullptr, nullptr, &timeout);
 | |
|         if (FD_ISSET(0, &readfds)) {
 | |
|             auto nread = read(0, buf, 16);
 | |
|             m_incomplete_data.append(buf, nread);
 | |
|             more_junk_to_read = true;
 | |
|         }
 | |
|     } while (more_junk_to_read);
 | |
| 
 | |
|     fputs("\033[6n", stdout);
 | |
|     fflush(stdout);
 | |
| 
 | |
|     do {
 | |
|         auto nread = read(0, buf + length, 16 - length);
 | |
|         if (nread < 0) {
 | |
|             if (errno == 0) {
 | |
|                 // ????
 | |
|                 continue;
 | |
|             }
 | |
|             dbg() << "Error while reading DSR: " << strerror(errno);
 | |
|             return { 1, 1 };
 | |
|         }
 | |
|         if (nread == 0) {
 | |
|             dbg() << "Terminal DSR issue; received no response";
 | |
|             return { 1, 1 };
 | |
|         }
 | |
|         length += nread;
 | |
|     } while (buf[length - 1] != 'R' && length < 16);
 | |
|     size_t x { 1 }, y { 1 };
 | |
| 
 | |
|     if (buf[0] == '\033' && buf[1] == '[') {
 | |
|         auto parts = StringView(buf + 2, length - 3).split_view(';');
 | |
|         bool ok;
 | |
|         x = parts[0].to_int(ok);
 | |
|         if (!ok) {
 | |
|             dbg() << "Terminal DSR issue; received garbage x";
 | |
|         }
 | |
|         y = parts[1].to_int(ok);
 | |
|         if (!ok) {
 | |
|             dbg() << "Terminal DSR issue; received garbage y";
 | |
|         }
 | |
|     }
 | |
|     return { x, y };
 | |
| }
 | |
| 
 | |
| String Editor::line() const
 | |
| {
 | |
|     StringBuilder builder;
 | |
|     builder.append(Utf32View { m_buffer.data(), m_buffer.size() });
 | |
|     return builder.build();
 | |
| }
 | |
| 
 | |
| }
 | 
