commands.c 5.8 KB
Newer Older
1 2 3 4 5 6 7 8
/*
 *	BIRD Client -- Command Handling
 *
 *	(c) 1999--2000 Martin Mares <mj@ucw.cz>
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

9
#include <stdio.h>
10
#include <ctype.h>
11

12
#include "nest/bird.h"
13
#include "lib/resource.h"
14
#include "lib/string.h"
15 16 17 18 19 20
#include "client/client.h"

struct cmd_info {
  char *command;
  char *args;
  char *help;
21
  int is_real_cmd;
22 23
};

24
static struct cmd_info command_table[] = {
25 26
#include "conf/commands.h"
};
27 28 29

struct cmd_node {
  struct cmd_node *sibling, *son, **plastson;
30
  struct cmd_info *cmd, *help;
31
  int len;
32
  signed char prio;
33 34 35 36 37 38 39 40 41 42 43 44
  char token[1];
};

static struct cmd_node cmd_root;

void
cmd_build_tree(void)
{
  unsigned int i;

  cmd_root.plastson = &cmd_root.son;

45
  for(i=0; i<ARRAY_SIZE(command_table); i++)
46 47 48 49 50 51 52 53 54
    {
      struct cmd_info *cmd = &command_table[i];
      struct cmd_node *old, *new;
      char *c = cmd->command;

      old = &cmd_root;
      while (*c)
	{
	  char *d = c;
55
	  while (*c && !isspace(*c))
56 57 58 59 60 61
	    c++;
	  for(new=old->son; new; new=new->sibling)
	    if (new->len == c-d && !memcmp(new->token, d, c-d))
	      break;
	  if (!new)
	    {
62 63 64
	      int size = sizeof(struct cmd_node) + c-d;
	      new = xmalloc(size);
	      bzero(new, size);
65 66 67 68 69
	      *old->plastson = new;
	      old->plastson = &new->sibling;
	      new->plastson = &new->son;
	      new->len = c-d;
	      memcpy(new->token, d, c-d);
70
	      new->prio = (new->len == 3 && !memcmp(new->token, "roa", 3)) ? 0 : 1; /* Hack */
71 72
	    }
	  old = new;
73
	  while (isspace(*c))
74 75
	    c++;
	}
76 77 78 79
      if (cmd->is_real_cmd)
	old->cmd = cmd;
      else
	old->help = cmd;
80 81 82 83
    }
}

static void
84
cmd_do_display_help(struct cmd_info *c)
85 86 87 88 89 90 91
{
  char buf[strlen(c->command) + strlen(c->args) + 4];

  sprintf(buf, "%s %s", c->command, c->args);
  printf("%-45s  %s\n", buf, c->help);
}

92 93 94 95 96 97 98 99 100
static void
cmd_display_help(struct cmd_info *c1, struct cmd_info *c2)
{
  if (c1)
    cmd_do_display_help(c1);
  else if (c2)
    cmd_do_display_help(c2);
}

101
static struct cmd_node *
102
cmd_find_abbrev(struct cmd_node *root, char *cmd, int len, int *pambiguous)
103 104 105
{
  struct cmd_node *m, *best = NULL, *best2 = NULL;

106
  *pambiguous = 0;
107 108 109 110 111 112
  for(m=root->son; m; m=m->sibling)
    {
      if (m->len == len && !memcmp(m->token, cmd, len))
	return m;
      if (m->len > len && !memcmp(m->token, cmd, len))
	{
113 114 115 116
	  if (best && best->prio > m->prio)
	    continue;
	  if (best && best->prio == m->prio)
	    best2 = best;
117 118 119
	  best = m;
	}
    }
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
  if (best2)
    {
      *pambiguous = 1;
      return NULL;
    }
  return best;
}

static void
cmd_list_ambiguous(struct cmd_node *root, char *cmd, int len)
{
  struct cmd_node *m;

  for(m=root->son; m; m=m->sibling)
    if (m->len > len && !memcmp(m->token, cmd, len))	
      cmd_display_help(m->help, m->cmd);
136 137 138 139 140 141 142 143
}

void
cmd_help(char *cmd, int len)
{
  char *end = cmd + len;
  struct cmd_node *n, *m;
  char *z;
144
  int ambig;
145 146 147 148

  n = &cmd_root;
  while (cmd < end)
    {
149
      if (isspace(*cmd))
150 151 152 153 154
	{
	  cmd++;
	  continue;
	}
      z = cmd;
155
      while (cmd < end && !isspace(*cmd))
156
	cmd++;
157 158 159 160 161 162
      m = cmd_find_abbrev(n, z, cmd-z, &ambig);
      if (ambig)
	{
	  cmd_list_ambiguous(n, z, cmd-z);
	  return;
	}
163 164 165 166
      if (!m)
	break;
      n = m;
    }
167
  cmd_display_help(n->cmd, NULL);
168
  for (m=n->son; m; m=m->sibling)
169 170 171 172 173 174 175
    cmd_display_help(m->help, m->cmd);
}

static int
cmd_find_common_match(struct cmd_node *root, char *cmd, int len, int *pcount, char *buf)
{
  struct cmd_node *m;
176
  int best, best_prio, i;
177 178 179

  *pcount = 0;
  best = -1;
180
  best_prio = -1;
181 182 183 184
  for(m=root->son; m; m=m->sibling)
    {
      if (m->len < len || memcmp(m->token, cmd, len))
	continue;
185 186 187 188 189 190 191 192 193 194

      if (best_prio > m->prio)
	continue;

      if (best_prio < m->prio)
	{
	  *pcount = 0;
	  best = -1;
	}

195 196 197 198 199
      (*pcount)++;
      if (best < 0)
	{
	  strcpy(buf, m->token + len);
	  best = m->len - len;
200
	  best_prio = m->prio;
201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
	}
      else
	{
	  i = 0;
	  while (i < best && i < m->len - len && buf[i] == m->token[len+i])
	    i++;
	  best = i;
	}
    }
  return best;
}

int
cmd_complete(char *cmd, int len, char *buf, int again)
{
  char *start = cmd;
  char *end = cmd + len;
  char *fin;
  struct cmd_node *n, *m;
  char *z;
  int ambig, cnt = 0, common;

  /* Find the last word we want to complete */
  for(fin=end; fin > start && !isspace(fin[-1]); fin--)
    ;

  /* Find the context */
  n = &cmd_root;
  while (cmd < fin && n->son)
    {
231
      if (isspace(*cmd))
232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
	{
	  cmd++;
	  continue;
	}
      z = cmd;
      while (cmd < fin && !isspace(*cmd))
	cmd++;
      m = cmd_find_abbrev(n, z, cmd-z, &ambig);
      if (ambig)
	{
	  if (!again)
	    return -1;
	  input_start_list();
	  cmd_list_ambiguous(n, z, cmd-z);
	  input_stop_list();
	  return 0;
	}
      if (!m)
	return -1;
      n = m;
    }

  /* Completion of parameters is not yet supported */
  if (!n->son)
    return -1;

  /* We know the context, let's try to complete */
  common = cmd_find_common_match(n, fin, end-fin, &cnt, buf);
  if (!cnt)
    return -1;
  if (cnt == 1)
    {
      buf[common++] = ' ';
      buf[common] = 0;
      return 1;
    }
  if (common > 0)
    {
      buf[common] = 0;
      return 1;
    }
  if (!again)
    return -1;
  input_start_list();
  cmd_list_ambiguous(n, fin, end-fin);
  input_stop_list();
  return 0;
279
}
280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313

char *
cmd_expand(char *cmd)
{
  struct cmd_node *n, *m;
  char *c, *b, *args;
  int ambig;

  args = c = cmd;
  n = &cmd_root;
  while (*c)
    {
      if (isspace(*c))
	{
	  c++;
	  continue;
	}
      b = c;
      while (*c && !isspace(*c))
	c++;
      m = cmd_find_abbrev(n, b, c-b, &ambig);
      if (!m)
	{
	  if (!ambig)
	    break;
	  puts("Ambiguous command, possible expansions are:");
	  cmd_list_ambiguous(n, b, c-b);
	  return NULL;
	}
      args = c;
      n = m;
    }
  if (!n->cmd)
    {
314
      puts("No such command. Press `?' for help.");
315 316
      return NULL;
    }
317
  b = xmalloc(strlen(n->cmd->command) + strlen(args) + 1);
318 319 320
  sprintf(b, "%s%s", n->cmd->command, args);
  return b;
}