mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-11-04 10:07:04 +00:00
e1cbb2ff67
Completions now include nodes that the input partially matches as well as the children of nodes those that the input exactly matches. Also some minor cleanup and bugfixes. Signed-off-by: Quentin Young <qlyoung@cumulusnetworks.com>
109 lines
2.9 KiB
C
109 lines
2.9 KiB
C
#include "command.h"
|
|
#include "command_graph.h"
|
|
#include "command_parse.h"
|
|
#include "command_match.h"
|
|
#include "linklist.h"
|
|
|
|
#define GRAMMAR_STR "CLI grammar sandbox\n"
|
|
|
|
struct graph_node * nodegraph;
|
|
|
|
DEFUN (grammar_test,
|
|
grammar_test_cmd,
|
|
"grammar parse .COMMAND",
|
|
GRAMMAR_STR
|
|
"command to pass to new parser\n")
|
|
{
|
|
char* command = argv_concat(argv, argc, 0);
|
|
struct cmd_element *cmd = malloc(sizeof(struct cmd_element));
|
|
cmd->string = command;
|
|
cmd->doc = NULL;
|
|
cmd->func = NULL;
|
|
cmd->tokens = vector_init(VECTOR_MIN_SIZE);
|
|
parse_command_format(nodegraph, cmd);
|
|
return CMD_SUCCESS;
|
|
}
|
|
|
|
DEFUN (grammar_test_show,
|
|
grammar_test_show_cmd,
|
|
"grammar tree",
|
|
GRAMMAR_STR
|
|
"print current accumulated DFA\n")
|
|
{
|
|
if (!nodegraph)
|
|
fprintf(stderr, "!nodegraph\n");
|
|
fprintf(stderr, "trying to print nodegraph->type\n");
|
|
fprintf(stderr, "%d\n", nodegraph->type);
|
|
walk_graph(nodegraph, 0);
|
|
return CMD_SUCCESS;
|
|
}
|
|
|
|
DEFUN (grammar_test_complete,
|
|
grammar_test_complete_cmd,
|
|
"grammar complete .COMMAND",
|
|
GRAMMAR_STR
|
|
"attempt to complete input on DFA\n"
|
|
"command to complete")
|
|
{
|
|
const char* command = argv_concat(argv, argc, 0);
|
|
struct list *result = match_command_complete (nodegraph, command);
|
|
|
|
if (result->count == 0) // invalid command
|
|
fprintf(stderr, "%% Unknown command\n");
|
|
else
|
|
{
|
|
fprintf(stderr, "%% Matched full input, possible completions:\n");
|
|
char* desc = malloc(50);
|
|
struct listnode *node;
|
|
struct graph_node *cnode;
|
|
// print possible next hops, if any
|
|
for (ALL_LIST_ELEMENTS_RO(result,node,cnode)) {
|
|
if (cnode->type == END_GN)
|
|
fprintf(stderr, "<cr> %p\n", cnode->element->func);
|
|
else
|
|
fprintf(stderr, "%s\n", describe_node(cnode, desc, 50));
|
|
}
|
|
free(desc);
|
|
}
|
|
list_delete(result);
|
|
|
|
return CMD_SUCCESS;
|
|
}
|
|
|
|
DEFUN (grammar_test_match,
|
|
grammar_test_match_cmd,
|
|
"grammar match .COMMAND",
|
|
GRAMMAR_STR
|
|
"attempt to match input on DFA\n"
|
|
"command to match")
|
|
{
|
|
struct list *argvv = NULL;
|
|
const char *command = argv_concat(argv, argc, 0);
|
|
struct cmd_element *element = match_command (nodegraph, command, &argvv);
|
|
|
|
if (element) {
|
|
fprintf(stderr, "Matched: %s\n", element->string);
|
|
struct listnode *ln;
|
|
struct graph_node *gn;
|
|
for (ALL_LIST_ELEMENTS_RO(argvv,ln,gn))
|
|
fprintf(stderr, "%s -- %s\n", gn->text, gn->arg);
|
|
}
|
|
else {
|
|
fprintf(stderr, "Returned NULL\n");
|
|
return CMD_SUCCESS;
|
|
}
|
|
|
|
return CMD_SUCCESS;
|
|
}
|
|
|
|
|
|
void grammar_sandbox_init(void);
|
|
void grammar_sandbox_init() {
|
|
fprintf(stderr, "reinitializing graph\n");
|
|
nodegraph = new_node(START_GN);
|
|
install_element (ENABLE_NODE, &grammar_test_cmd);
|
|
install_element (ENABLE_NODE, &grammar_test_show_cmd);
|
|
install_element (ENABLE_NODE, &grammar_test_match_cmd);
|
|
install_element (ENABLE_NODE, &grammar_test_complete_cmd);
|
|
}
|