2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
15 #include <vlib/vlib.h>
18 vlib_lex_main_t vlib_lex_main;
23 format_vlib_lex_token (u8 * s, va_list * args)
25 vlib_lex_main_t *lm = va_arg (*args, vlib_lex_main_t *);
26 vlib_lex_token_t *t = va_arg (*args, vlib_lex_token_t *);
28 if (t->token == VLIB_LEX_word)
29 s = format (s, "%s", t->value.as_pointer);
31 s = format (s, "%s", lm->lex_token_names[t->token]);
36 vlib_lex_get_token (vlib_lex_main_t * lm, vlib_lex_token_t * rv)
40 vlib_lex_table_entry_t *e;
43 if (PREDICT_FALSE (lm->pushback_sp >= 0))
45 rv[0] = lm->pushback_vector[lm->pushback_sp--];
49 rv->value.as_uword = ~0;
53 if (PREDICT_FALSE (lm->current_index >= vec_len (lm->input_vector)))
55 rv->token = VLIB_LEX_eof;
59 t = vec_elt_at_index (lm->lex_tables, lm->current_table_index);
60 c = (lm->input_vector[lm->current_index++]) & 0x7f;
62 lm->current_table_index = e->next_table_index;
69 case VLIB_LEX_START_NUMBER:
70 lm->current_token_value = 0;
73 case VLIB_LEX_ADD_TO_NUMBER:
74 lm->current_number_base = e->token;
75 lm->current_token_value *= lm->current_number_base;
77 if (tv >= lm->current_number_base)
80 if (tv >= lm->current_number_base)
83 lm->current_token_value += tv;
86 case VLIB_LEX_ADD_TO_TOKEN:
87 vec_add1 (lm->token_buffer, c);
90 case VLIB_LEX_KEYWORD_CHECK:
94 vec_add1 (lm->token_buffer, 0);
96 /* It's either a keyword or just a word. */
97 p = hash_get_mem (lm->lex_keywords, lm->token_buffer);
102 clib_warning ("keyword '%s' token %s",
104 lm->lex_token_names[rv->token]);
109 rv->token = VLIB_LEX_word;
110 rv->value.as_pointer = vec_dup (lm->token_buffer);
112 clib_warning ("%s, value '%s'",
113 lm->lex_token_names[VLIB_LEX_word],
114 rv->value.as_pointer);
116 _vec_len (lm->token_buffer) = 0;
118 /* Rescan the character which terminated the keyword/word. */
123 case VLIB_LEX_RETURN_AND_RESCAN:
124 ASSERT (lm->current_index);
126 /* note flow-through */
128 case VLIB_LEX_RETURN:
129 rv->token = e->token;
130 rv->value.as_uword = lm->current_token_value;
131 lm->current_token_value = ~0;
135 ("table %s char '%c'(0x%02x) next table %s return %s",
136 t->name, c, c, lm->lex_tables[e->next_table_index].name,
137 lm->lex_token_names[e->token]);
138 if (rv->token == VLIB_LEX_number)
139 clib_warning (" numeric value 0x%x (%d)", rv->value,
148 vlib_lex_add_token (vlib_lex_main_t * lm, char *token_name)
153 p = hash_get_mem (lm->lex_tokens_by_name, token_name);
158 rv = vec_len (lm->lex_token_names);
159 hash_set_mem (lm->lex_tokens_by_name, token_name, rv);
160 vec_add1 (lm->lex_token_names, token_name);
166 add_keyword (vlib_lex_main_t * lm, char *keyword, char *token_name)
171 p = hash_get_mem (lm->lex_keywords, keyword);
175 token = vlib_lex_add_token (lm, token_name);
177 hash_set_mem (lm->lex_keywords, keyword, token);
182 vlib_lex_find_or_add_keyword (vlib_lex_main_t * lm, char *keyword,
185 uword *p = hash_get_mem (lm->lex_keywords, keyword);
186 return p ? p[0] : add_keyword (lm, keyword, token_name);
190 vlib_lex_set_action_range (u32 table_index, u8 lo, u8 hi, u16 action,
191 u16 token, u32 next_table_index)
194 vlib_lex_main_t *lm = &vlib_lex_main;
195 vlib_lex_table_t *t = pool_elt_at_index (lm->lex_tables, table_index);
197 for (i = lo; i <= hi; i++)
199 ASSERT (i < ARRAY_LEN (t->entries));
200 t->entries[i].action = action;
201 t->entries[i].token = token;
202 t->entries[i].next_table_index = next_table_index;
207 vlib_lex_add_table (char *name)
209 vlib_lex_main_t *lm = &vlib_lex_main;
213 p = hash_get_mem (lm->lex_tables_by_name, name);
217 pool_get_aligned (lm->lex_tables, t, CLIB_CACHE_LINE_BYTES);
221 hash_set_mem (lm->lex_tables_by_name, name, t - lm->lex_tables);
223 vlib_lex_set_action_range (t - lm->lex_tables, 1, 0x7F, VLIB_LEX_IGNORE, ~0,
226 vlib_lex_set_action_range (t - lm->lex_tables, 0, 0, VLIB_LEX_RETURN,
227 VLIB_LEX_eof, t - lm->lex_tables);
229 return t - lm->lex_tables;
233 vlib_lex_reset (vlib_lex_main_t * lm, u8 * input_vector)
235 if (lm->pushback_vector)
236 _vec_len (lm->pushback_vector) = 0;
237 lm->pushback_sp = -1;
239 lm->input_vector = input_vector;
240 lm->current_index = 0;
243 static clib_error_t *
244 lex_onetime_init (vlib_main_t * vm)
246 vlib_lex_main_t *lm = &vlib_lex_main;
248 lm->lex_tables_by_name = hash_create_string (0, sizeof (uword));
249 lm->lex_tokens_by_name = hash_create_string (0, sizeof (uword));
250 lm->lex_keywords = hash_create_string (0, sizeof (uword));
251 lm->pushback_sp = -1;
253 #define _(f) { u16 tmp = vlib_lex_add_token (lm, #f); ASSERT (tmp == VLIB_LEX_##f); }
254 foreach_vlib_lex_global_token;
257 vec_validate (lm->token_buffer, 127);
258 _vec_len (lm->token_buffer) = 0;
263 VLIB_INIT_FUNCTION (lex_onetime_init);
266 * fd.io coding-style-patch-verification: ON
269 * eval: (c-set-style "gnu")