aboutsummaryrefslogtreecommitdiffstats
path: root/src/vppinfra/random_buffer.c
blob: df03698066ce5a926729e8d7dbff6f0da9670df3 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/*
 * Copyright (c) 2015 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
/*
  Copyright (c) 2005 Eliot Dresselhaus

  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 <vppinfra/random_buffer.h>

/* Fill random buffer. */
void
clib_random_buffer_fill (clib_random_buffer_t * b, uword n_words)
{
  uword *w, n = n_words;

  if (n < 256)
    n = 256;

  n = round_pow2 (n, 2 << ISAAC_LOG2_SIZE);

  vec_add2 (b->buffer, w, n);
  do
    {
      isaac2 (b->ctx, w);
      w += 2 * ISAAC_SIZE;
      n -= 2 * ISAAC_SIZE;
    }
  while (n > 0);
}

void
clib_random_buffer_init (clib_random_buffer_t * b, uword seed)
{
  uword i, j;

  memset (b, 0, sizeof (b[0]));

  /* Seed ISAAC. */
  for (i = 0; i < ARRAY_LEN (b->ctx); i++)
    {
      uword s[ISAAC_SIZE];

      for (j = 0; j < ARRAY_LEN (s); j++)
	s[j] = ARRAY_LEN (b->ctx) * (seed + j) + i;

      isaac_init (&b->ctx[i], s);
    }
}

/*
 * fd.io coding-style-patch-verification: ON
 *
 * Local Variables:
 * eval: (c-set-style "gnu")
 * End:
 */
an> = format (s, "%s", t->value.as_pointer); else s = format (s, "%s", lm->lex_token_names[t->token]); return s; } void vlib_lex_get_token (vlib_lex_main_t * lm, vlib_lex_token_t * rv) { u8 c; vlib_lex_table_t *t; vlib_lex_table_entry_t *e; uword tv; if (PREDICT_FALSE (lm->pushback_sp >= 0)) { rv[0] = lm->pushback_vector[lm->pushback_sp--]; return; } rv->value.as_uword = ~0; while (1) { if (PREDICT_FALSE (lm->current_index >= vec_len (lm->input_vector))) { rv->token = VLIB_LEX_eof; return; } t = vec_elt_at_index (lm->lex_tables, lm->current_table_index); c = (lm->input_vector[lm->current_index++]) & 0x7f; e = &t->entries[c]; lm->current_table_index = e->next_table_index; switch (e->action) { case VLIB_LEX_IGNORE: continue; case VLIB_LEX_START_NUMBER: lm->current_token_value = 0; /* fallthru */ case VLIB_LEX_ADD_TO_NUMBER: lm->current_number_base = e->token; lm->current_token_value *= lm->current_number_base; tv = c - '0'; if (tv >= lm->current_number_base) { tv = 10 + c - 'A'; if (tv >= lm->current_number_base) tv = 10 + c - 'a'; } lm->current_token_value += tv; continue; case VLIB_LEX_ADD_TO_TOKEN: vec_add1 (lm->token_buffer, c); continue; case VLIB_LEX_KEYWORD_CHECK: { uword *p; vec_add1 (lm->token_buffer, 0); /* It's either a keyword or just a word. */ p = hash_get_mem (lm->lex_keywords, lm->token_buffer); if (p) { rv->token = p[0]; if (LEX_DEBUG > 0) clib_warning ("keyword '%s' token %s", lm->token_buffer, lm->lex_token_names[rv->token]); } else { /* it's a WORD */ rv->token = VLIB_LEX_word; rv->value.as_pointer = vec_dup (lm->token_buffer); if (LEX_DEBUG > 0) clib_warning ("%s, value '%s'", lm->lex_token_names[VLIB_LEX_word], rv->value.as_pointer); } _vec_len (lm->token_buffer) = 0; /* Rescan the character which terminated the keyword/word. */ lm->current_index--; return; } case VLIB_LEX_RETURN_AND_RESCAN: ASSERT (lm->current_index); lm->current_index--; /* note flow-through */ case VLIB_LEX_RETURN: rv->token = e->token; rv->value.as_uword = lm->current_token_value; lm->current_token_value = ~0; if (LEX_DEBUG > 0) { clib_warning ("table %s char '%c'(0x%02x) next table %s return %s", t->name, c, c, lm->lex_tables[e->next_table_index].name, lm->lex_token_names[e->token]); if (rv->token == VLIB_LEX_number) clib_warning (" numeric value 0x%x (%d)", rv->value, rv->value); } return; } } } u16 vlib_lex_add_token (vlib_lex_main_t * lm, char *token_name) { uword *p; u16 rv; p = hash_get_mem (lm->lex_tokens_by_name, token_name); if (p) return p[0]; rv = vec_len (lm->lex_token_names); hash_set_mem (lm->lex_tokens_by_name, token_name, rv); vec_add1 (lm->lex_token_names, token_name); return rv; } static u16 add_keyword (vlib_lex_main_t * lm, char *keyword, char *token_name) { uword *p; u16 token; p = hash_get_mem (lm->lex_keywords, keyword); ASSERT (p == 0); token = vlib_lex_add_token (lm, token_name); hash_set_mem (lm->lex_keywords, keyword, token); return token; } u16 vlib_lex_find_or_add_keyword (vlib_lex_main_t * lm, char *keyword, char *token_name) { uword *p = hash_get_mem (lm->lex_keywords, keyword); return p ? p[0] : add_keyword (lm, keyword, token_name); } void vlib_lex_set_action_range (u32 table_index, u8 lo, u8 hi, u16 action, u16 token, u32 next_table_index) { int i; vlib_lex_main_t *lm = &vlib_lex_main; vlib_lex_table_t *t = pool_elt_at_index (lm->lex_tables, table_index); for (i = lo; i <= hi; i++) { ASSERT (i < ARRAY_LEN (t->entries)); t->entries[i].action = action; t->entries[i].token = token; t->entries[i].next_table_index = next_table_index; } } u16 vlib_lex_add_table (char *name) { vlib_lex_main_t *lm = &vlib_lex_main; vlib_lex_table_t *t; uword *p; p = hash_get_mem (lm->lex_tables_by_name, name); ASSERT (p == 0); pool_get_aligned (lm->lex_tables, t, CLIB_CACHE_LINE_BYTES); t->name = name; hash_set_mem (lm->lex_tables_by_name, name, t - lm->lex_tables); vlib_lex_set_action_range (t - lm->lex_tables, 1, 0x7F, VLIB_LEX_IGNORE, ~0, t - lm->lex_tables); vlib_lex_set_action_range (t - lm->lex_tables, 0, 0, VLIB_LEX_RETURN, VLIB_LEX_eof, t - lm->lex_tables); return t - lm->lex_tables; } void vlib_lex_reset (vlib_lex_main_t * lm, u8 * input_vector) { if (lm->pushback_vector) _vec_len (lm->pushback_vector) = 0; lm->pushback_sp = -1; lm->input_vector = input_vector; lm->current_index = 0; } static clib_error_t * lex_onetime_init (vlib_main_t * vm) { vlib_lex_main_t *lm = &vlib_lex_main; lm->lex_tables_by_name = hash_create_string (0, sizeof (uword)); lm->lex_tokens_by_name = hash_create_string (0, sizeof (uword)); lm->lex_keywords = hash_create_string (0, sizeof (uword)); lm->pushback_sp = -1; #define _(f) { u16 tmp = vlib_lex_add_token (lm, #f); ASSERT (tmp == VLIB_LEX_##f); } foreach_vlib_lex_global_token; #undef _ vec_validate (lm->token_buffer, 127); _vec_len (lm->token_buffer) = 0; return 0; } VLIB_INIT_FUNCTION (lex_onetime_init); /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */