aboutsummaryrefslogtreecommitdiff
path: root/circuitpython/py/repl.c
diff options
context:
space:
mode:
authorRaghuram Subramani <raghus2247@gmail.com>2022-06-19 19:47:51 +0530
committerRaghuram Subramani <raghus2247@gmail.com>2022-06-19 19:47:51 +0530
commit4fd287655a72b9aea14cdac715ad5b90ed082ed2 (patch)
tree65d393bc0e699dd12d05b29ba568e04cea666207 /circuitpython/py/repl.c
parent0150f70ce9c39e9e6dd878766c0620c85e47bed0 (diff)
add circuitpython code
Diffstat (limited to '')
-rw-r--r--circuitpython/py/repl.c324
1 files changed, 324 insertions, 0 deletions
diff --git a/circuitpython/py/repl.c b/circuitpython/py/repl.c
new file mode 100644
index 0000000..78367e6
--- /dev/null
+++ b/circuitpython/py/repl.c
@@ -0,0 +1,324 @@
+/*
+ * This file is part of the MicroPython project, http://micropython.org/
+ *
+ * The MIT License (MIT)
+ *
+ * SPDX-FileCopyrightText: Copyright (c) 2013-2015 Damien P. George
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+#include <string.h>
+#include "py/obj.h"
+#include "py/objmodule.h"
+#include "py/runtime.h"
+#include "py/builtin.h"
+#include "py/repl.h"
+
+#if MICROPY_HELPER_REPL
+
+STATIC bool str_startswith_word(const char *str, const char *head) {
+ size_t i;
+ for (i = 0; str[i] && head[i]; i++) {
+ if (str[i] != head[i]) {
+ return false;
+ }
+ }
+ return head[i] == '\0' && (str[i] == '\0' || !unichar_isident(str[i]));
+}
+
+bool mp_repl_continue_with_input(const char *input) {
+ // check for blank input
+ if (input[0] == '\0') {
+ return false;
+ }
+
+ // check if input starts with a certain keyword
+ bool starts_with_compound_keyword =
+ input[0] == '@'
+ || str_startswith_word(input, "if")
+ || str_startswith_word(input, "while")
+ || str_startswith_word(input, "for")
+ || str_startswith_word(input, "try")
+ || str_startswith_word(input, "with")
+ || str_startswith_word(input, "def")
+ || str_startswith_word(input, "class")
+ #if MICROPY_PY_ASYNC_AWAIT
+ || str_startswith_word(input, "async")
+ #endif
+ ;
+
+ // check for unmatched open bracket, quote or escape quote
+ #define Q_NONE (0)
+ #define Q_1_SINGLE (1)
+ #define Q_1_DOUBLE (2)
+ #define Q_3_SINGLE (3)
+ #define Q_3_DOUBLE (4)
+ int n_paren = 0;
+ int n_brack = 0;
+ int n_brace = 0;
+ int in_quote = Q_NONE;
+ const char *i;
+ for (i = input; *i; i++) {
+ if (*i == '\'') {
+ if ((in_quote == Q_NONE || in_quote == Q_3_SINGLE) && i[1] == '\'' && i[2] == '\'') {
+ i += 2;
+ in_quote = Q_3_SINGLE - in_quote;
+ } else if (in_quote == Q_NONE || in_quote == Q_1_SINGLE) {
+ in_quote = Q_1_SINGLE - in_quote;
+ }
+ } else if (*i == '"') {
+ if ((in_quote == Q_NONE || in_quote == Q_3_DOUBLE) && i[1] == '"' && i[2] == '"') {
+ i += 2;
+ in_quote = Q_3_DOUBLE - in_quote;
+ } else if (in_quote == Q_NONE || in_quote == Q_1_DOUBLE) {
+ in_quote = Q_1_DOUBLE - in_quote;
+ }
+ } else if (*i == '\\' && (i[1] == '\'' || i[1] == '"' || i[1] == '\\')) {
+ if (in_quote != Q_NONE) {
+ i++;
+ }
+ } else if (in_quote == Q_NONE) {
+ switch (*i) {
+ case '(':
+ n_paren += 1;
+ break;
+ case ')':
+ n_paren -= 1;
+ break;
+ case '[':
+ n_brack += 1;
+ break;
+ case ']':
+ n_brack -= 1;
+ break;
+ case '{':
+ n_brace += 1;
+ break;
+ case '}':
+ n_brace -= 1;
+ break;
+ default:
+ break;
+ }
+ }
+ }
+
+ // continue if unmatched 3-quotes
+ if (in_quote == Q_3_SINGLE || in_quote == Q_3_DOUBLE) {
+ return true;
+ }
+
+ // continue if unmatched brackets, but only if not in a 1-quote
+ if ((n_paren > 0 || n_brack > 0 || n_brace > 0) && in_quote == Q_NONE) {
+ return true;
+ }
+
+ // continue if last character was backslash (for line continuation)
+ if (i[-1] == '\\') {
+ return true;
+ }
+
+ // continue if compound keyword and last line was not empty
+ if (starts_with_compound_keyword && i[-1] != '\n') {
+ return true;
+ }
+
+ // otherwise, don't continue
+ return false;
+}
+
+STATIC bool test_qstr(mp_obj_t obj, qstr name) {
+ if (obj) {
+ // try object member
+ mp_obj_t dest[2];
+ mp_load_method_protected(obj, name, dest, true);
+ return dest[0] != MP_OBJ_NULL;
+ } else {
+ // try builtin module
+ return mp_map_lookup((mp_map_t *)&mp_builtin_module_map,
+ MP_OBJ_NEW_QSTR(name), MP_MAP_LOOKUP) != NULL;
+ }
+}
+
+STATIC const char *find_completions(const char *s_start, size_t s_len,
+ mp_obj_t obj, size_t *match_len, qstr *q_first, qstr *q_last) {
+
+ const char *match_str = NULL;
+ *match_len = 0;
+ *q_first = *q_last = 0;
+ size_t nqstr = QSTR_TOTAL();
+ for (qstr q = MP_QSTR_ + 1; q < nqstr; ++q) {
+ size_t d_len;
+ const char *d_str = (const char *)qstr_data(q, &d_len);
+ // special case; filter out words that begin with underscore
+ // unless there's already a partial match
+ if (s_len == 0 && d_str[0] == '_') {
+ continue;
+ }
+ if (s_len <= d_len && strncmp(s_start, d_str, s_len) == 0) {
+ if (test_qstr(obj, q)) {
+ if (match_str == NULL) {
+ match_str = d_str;
+ *match_len = d_len;
+ } else {
+ // search for longest common prefix of match_str and d_str
+ // (assumes these strings are null-terminated)
+ for (size_t j = s_len; j <= *match_len && j <= d_len; ++j) {
+ if (match_str[j] != d_str[j]) {
+ *match_len = j;
+ break;
+ }
+ }
+ }
+ if (*q_first == 0) {
+ *q_first = q;
+ }
+ *q_last = q;
+ }
+ }
+ }
+ return match_str;
+}
+
+STATIC void print_completions(const mp_print_t *print,
+ const char *s_start, size_t s_len,
+ mp_obj_t obj, qstr q_first, qstr q_last) {
+
+ #define WORD_SLOT_LEN (16)
+ #define MAX_LINE_LEN (4 * WORD_SLOT_LEN)
+
+ int line_len = MAX_LINE_LEN; // force a newline for first word
+ for (qstr q = q_first; q <= q_last; ++q) {
+ size_t d_len;
+ const char *d_str = (const char *)qstr_data(q, &d_len);
+ if (s_len <= d_len && strncmp(s_start, d_str, s_len) == 0) {
+ if (test_qstr(obj, q)) {
+ int gap = (line_len + WORD_SLOT_LEN - 1) / WORD_SLOT_LEN * WORD_SLOT_LEN - line_len;
+ if (gap < 2) {
+ gap += WORD_SLOT_LEN;
+ }
+ if (line_len + gap + d_len <= MAX_LINE_LEN) {
+ // TODO optimise printing of gap?
+ for (int j = 0; j < gap; ++j) {
+ mp_print_str(print, " ");
+ }
+ mp_print_str(print, d_str);
+ line_len += gap + d_len;
+ } else {
+ mp_printf(print, "\n%s", d_str);
+ line_len = d_len;
+ }
+ }
+ }
+ }
+ mp_print_str(print, "\n");
+}
+
+size_t mp_repl_autocomplete(const char *str, size_t len, const mp_print_t *print, const char **compl_str) {
+ // scan backwards to find start of "a.b.c" chain
+ const char *org_str = str;
+ const char *top = str + len;
+ for (const char *s = top; --s >= str;) {
+ if (!(unichar_isalpha(*s) || unichar_isdigit(*s) || *s == '_' || *s == '.')) {
+ ++s;
+ str = s;
+ break;
+ }
+ }
+
+ // begin search in outer global dict which is accessed from __main__
+ mp_obj_t obj = MP_OBJ_FROM_PTR(&mp_module___main__);
+ mp_obj_t dest[2];
+
+ const char *s_start;
+ size_t s_len;
+
+ for (;;) {
+ // get next word in string to complete
+ s_start = str;
+ while (str < top && *str != '.') {
+ ++str;
+ }
+ s_len = str - s_start;
+
+ if (str == top) {
+ // end of string, do completion on this partial name
+ break;
+ }
+
+ // a complete word, lookup in current object
+ qstr q = qstr_find_strn(s_start, s_len);
+ if (q == MP_QSTRnull) {
+ // lookup will fail
+ return 0;
+ }
+ mp_load_method_protected(obj, q, dest, true);
+ obj = dest[0]; // attribute, method, or MP_OBJ_NULL if nothing found
+
+ if (obj == MP_OBJ_NULL) {
+ // lookup failed
+ return 0;
+ }
+
+ // skip '.' to move to next word
+ ++str;
+ }
+
+ // after "import", suggest built-in modules
+ static const char import_str[] = "import ";
+ if (len >= 7 && !memcmp(org_str, import_str, 7)) {
+ obj = MP_OBJ_NULL;
+ }
+
+ // look for matches
+ size_t match_len;
+ qstr q_first, q_last;
+ const char *match_str =
+ find_completions(s_start, s_len, obj, &match_len, &q_first, &q_last);
+
+ // nothing found
+ if (q_first == 0) {
+ // If there're no better alternatives, and if it's first word
+ // in the line, try to complete "import".
+ if (s_start == org_str && s_len > 0 && s_len < sizeof(import_str) - 1) {
+ if (memcmp(s_start, import_str, s_len) == 0) {
+ *compl_str = import_str + s_len;
+ return sizeof(import_str) - 1 - s_len;
+ }
+ }
+ if (q_first == 0) {
+ *compl_str = " ";
+ return s_len ? 0 : 4;
+ }
+ }
+
+ // 1 match found, or multiple matches with a common prefix
+ if (q_first == q_last || match_len > s_len) {
+ *compl_str = match_str + s_len;
+ return match_len - s_len;
+ }
+
+ // multiple matches found, print them out
+ print_completions(print, s_start, s_len, obj, q_first, q_last);
+
+ return (size_t)(-1); // indicate many matches
+}
+
+#endif // MICROPY_HELPER_REPL