OpenVAS Scanner  22.7.9
nasl_var.c
Go to the documentation of this file.
1 /* SPDX-FileCopyrightText: 2023 Greenbone AG
2  * SPDX-FileCopyrightText: 2002-2004 Tenable Network Security
3  *
4  * SPDX-License-Identifier: GPL-2.0-only
5  */
6 
7 #include "nasl_var.h"
8 
9 #include "exec.h"
10 #include "nasl_debug.h"
11 #include "nasl_func.h"
12 #include "nasl_global_ctxt.h"
13 #include "nasl_lex_ctxt.h"
14 #include "nasl_tree.h"
15 
16 #include <glib.h> /* for g_free */
17 #include <stdlib.h> /* for abort */
18 #include <string.h> /* for strlen */
19 
20 /* Local prototypes */
21 static void
22 copy_array (nasl_array *, const nasl_array *, int);
23 
25 int
26 hash_str2 (const char *s, int n)
27 {
28  unsigned long h = 0;
29  const char *p;
30 
31  if (s == NULL)
32  return 0;
33 
34  for (p = s; *p != '\0'; p++)
35  h = (h << 3) + (unsigned char) *p;
36  return h % n;
37 }
38 
39 static int
40 hash_str (const char *s)
41 {
42  return hash_str2 (s, VAR_NAME_HASH);
43 }
44 
46 nasl_get_var_by_num (void *ctxt, nasl_array *a, int num, int create)
47 {
48  anon_nasl_var *v = NULL;
49 
50  if (num < 0)
51  {
52  /* TBD: implement a min_index field, just like $[ in Perl */
53  nasl_perror (ctxt, "Negative integer index %d are not supported yet!\n",
54  num);
55  return NULL;
56  }
57 
58  if (num < a->max_idx)
59  v = a->num_elt[num];
60  if (v != NULL || !create)
61  return v;
62 
63  if (num >= a->max_idx)
64  {
65  a->num_elt = g_realloc (a->num_elt, sizeof (anon_nasl_var *) * (num + 1));
66  bzero (a->num_elt + a->max_idx,
67  sizeof (anon_nasl_var *) * (num + 1 - a->max_idx));
68  a->max_idx = num + 1;
69  }
70  v = g_malloc0 (sizeof (anon_nasl_var));
71  v->var_type = VAR2_UNDEF;
72 
73  a->num_elt[num] = v;
74  return v;
75 }
76 
77 static named_nasl_var *
78 get_var_by_name (nasl_array *a, const char *s)
79 {
80  int h = hash_str (s);
81  named_nasl_var *v;
82 
83  if (a->hash_elt == NULL)
84  a->hash_elt = g_malloc0 (VAR_NAME_HASH * sizeof (named_nasl_var *));
85 
86  for (v = a->hash_elt[h]; v != NULL; v = v->next_var)
87  if (v->var_name != NULL && strcmp (s, v->var_name) == 0)
88  return v;
89 
90  v = g_malloc0 (sizeof (named_nasl_var));
91  v->var_name = g_strdup (s);
92  v->u.var_type = VAR2_UNDEF;
93  v->next_var = a->hash_elt[h];
94 
95  a->hash_elt[h] = v;
96  return v;
97 }
98 
102 static named_nasl_var *
103 get_var_ref_by_name (lex_ctxt *ctxt, const char *name, int climb)
104 {
105  named_nasl_var *v;
106  int h = hash_str (name);
107  lex_ctxt *c;
108 
109  if (!ctxt)
110  return NULL;
111  if (climb != 0)
112  {
113  for (c = ctxt; c != NULL; c = c->up_ctxt)
114  if (c->ctx_vars.hash_elt != NULL)
115  for (v = c->ctx_vars.hash_elt[h]; v != NULL; v = v->next_var)
116  if (v->var_name != NULL && strcmp (name, v->var_name) == 0)
117  return v;
118  }
119  else
120  {
121  if (ctxt->ctx_vars.hash_elt != NULL)
122  for (v = ctxt->ctx_vars.hash_elt[h]; v != NULL; v = v->next_var)
123  if (v->var_name != NULL && strcmp (name, v->var_name) == 0)
124  return v;
125  }
126 
127  if (ctxt->ctx_vars.hash_elt == NULL)
128  ctxt->ctx_vars.hash_elt =
129  g_malloc0 (sizeof (named_nasl_var *) * VAR_NAME_HASH);
130 
131  v = g_malloc0 (sizeof (named_nasl_var));
132  v->var_name = g_strdup (name);
133  v->u.var_type = VAR2_UNDEF;
134  v->next_var = ctxt->ctx_vars.hash_elt[h];
135  ctxt->ctx_vars.hash_elt[h] = v;
136 
137  return v;
138 }
139 
140 static anon_nasl_var *
141 get_var_ref_by_num (lex_ctxt *ctxt, int num)
142 {
143  anon_nasl_var *v;
144 
145  if (num < 0) /* safer */
146  {
147  nasl_perror (ctxt, "Negative index %d is invalid for array\n", num);
148  return NULL;
149  }
150 
151  if (ctxt->ctx_vars.max_idx <= num)
152  {
153  ctxt->ctx_vars.num_elt = g_realloc (ctxt->ctx_vars.num_elt,
154  sizeof (anon_nasl_var *) * (num + 1));
155  bzero (ctxt->ctx_vars.num_elt + ctxt->ctx_vars.max_idx,
156  sizeof (anon_nasl_var *) * (num + 1 - ctxt->ctx_vars.max_idx));
157  ctxt->ctx_vars.max_idx = num + 1;
158  }
159 
160  v = ctxt->ctx_vars.num_elt[num];
161  if (v != NULL)
162  return v;
163 
164  v = g_malloc0 (sizeof (anon_nasl_var));
165  v->var_type = VAR2_UNDEF;
166  ctxt->ctx_vars.num_elt[num] = v;
167  return v;
168 }
169 
170 tree_cell *
172 {
174  tc->x.ref_val = v; /* No need to free this later! */
175  return tc;
176 }
177 
178 tree_cell *
179 get_variable_by_name (lex_ctxt *ctxt, const char *name)
180 {
181  if (name == NULL)
182  return NULL;
183  /* Broken: Need also code in get_array_elem */
184  if (strcmp (name, "_FCT_ANON_ARGS") == 0)
185  {
187  nasl_array *a = retc->x.ref_val = g_malloc0 (sizeof (nasl_array));
188  copy_array (a, &ctxt->ctx_vars, 0);
189  return retc;
190  }
191  else
192  {
193  named_nasl_var *v = get_var_ref_by_name (ctxt, name, 1);
194  return var2cell (&v->u);
195  }
196  /*NOTREACHED*/}
197 
198  static const char *
200  {
201  static char str[16];
202 #ifdef ALL_VARIABLES_NAMED
203  if (v->av_name != NULL)
204  return v->av_name;
205 #endif
206  snprintf (str, sizeof (str), "[%p]", (void *) v);
207  return str;
208  }
209 
210  tree_cell *
211  get_array_elem (lex_ctxt *ctxt, const char *name, tree_cell *idx)
212  {
213  named_nasl_var *nv;
214  anon_nasl_var *u, *av, fake_var;
215  tree_cell *tc, idx0;
216 
217  /* Fake variable */
218  if (strcmp (name, "_FCT_ANON_ARGS") == 0)
219  {
220  lex_ctxt *c;
221  for (c = ctxt; c != NULL && !c->fct_ctxt; c = c->up_ctxt)
222  ;
223  if (c == NULL)
224  return NULL;
225  fake_var.var_type = VAR2_ARRAY;
226  fake_var.v.v_arr = c->ctx_vars;
227  fake_var.v.v_arr.hash_elt = NULL; /* mask named elements */
228  u = &fake_var;
229  }
230  else
231  {
232  named_nasl_var *v = get_var_ref_by_name (ctxt, name, 1);
233  u = &v->u;
234  }
235 
236  if (idx == NULL)
237  {
238  /* Treat it as zero */
239  memset (&idx0, '\0', sizeof (idx0));
240  idx = &idx0;
241  idx->type = CONST_INT;
242  }
243 
244  switch (u->var_type)
245  {
246  case VAR2_UNDEF:
247  /* We define the array here */
248  u->var_type = VAR2_ARRAY;
249  /* fallthrough */
250  case VAR2_ARRAY:
251  switch (idx->type)
252  {
253  case CONST_INT:
254  av = nasl_get_var_by_num (ctxt, &u->v.v_arr, idx->x.i_val,
255  /* avoid dangling pointers */
256  strcmp (name, "_FCT_ANON_ARGS"));
257  return var2cell (av);
258 
259  case CONST_STR:
260  case CONST_DATA:
261  nv = get_var_by_name (&u->v.v_arr, idx->x.str_val);
262  return var2cell (nv != NULL ? &nv->u : NULL);
263 
264  default:
265  nasl_perror (ctxt,
266  "get_array_elem: unhandled index type 0x%x for "
267  "variable %s\n",
268  idx->type, name);
269  return NULL;
270  }
271  /*NOTREACHED*/ break;
272 
273  case VAR2_INT:
274  nasl_perror (ctxt, "get_array_elem: variable %s is an integer\n", name);
275  return NULL;
276 
277  case VAR2_STRING:
278  case VAR2_DATA:
279  if (idx->type == CONST_INT)
280  {
281  int l = u->v.v_str.s_siz;
282 
283  if (idx->x.i_val >= l)
284  {
285  nasl_perror (ctxt,
286  "get_array_elem: requesting character after end "
287  "of string %s (%d >= %d)\n",
288  name, idx->x.i_val, l);
289  tc = alloc_expr_cell (idx->line_nb, CONST_DATA /*CONST_STR */,
290  NULL, NULL);
291  tc->x.str_val = g_strdup ("");
292  tc->size = 0;
293  return tc;
294  }
295  else
296  {
297  if (idx->x.i_val < 0)
298  {
299  nasl_perror (ctxt,
300  "get_array_elem: Negative index (%d) passed to "
301  "\"%s\"!\n",
302  idx->x.i_val, name);
303  return NULL;
304  }
305  tc = alloc_expr_cell (idx->line_nb, CONST_DATA /*CONST_STR */,
306  NULL, NULL);
307  tc->x.str_val = g_malloc0 (2);
308  tc->x.str_val[0] = u->v.v_str.s_val[idx->x.i_val];
309  tc->x.str_val[1] = '\0';
310  tc->size = 1;
311  return tc;
312  }
313  }
314  else
315  {
316  nasl_perror (ctxt,
317  "get_array_elem: Cannot use a non integer index"
318  " (type 0x%x) in string. Variable: %s\n",
319  idx->type, name);
320  return NULL;
321  }
322  /*NOTREACHED*/ break;
323 
324  default:
325  nasl_perror (ctxt, "Severe bug: unknown variable type 0x%x %s\n",
326  u->var_type, get_line_nb (idx));
327  return NULL;
328  }
329  /*NOTREACHED*/ return NULL;
330  }
331 
332  static void
334  static void
336 
341  void
343  {
344  int i;
345 
346  if (a == NULL)
347  return;
348  if (a->num_elt != NULL)
349  {
350  for (i = 0; i < a->max_idx; i++)
351  free_anon_var (a->num_elt[i]);
352  g_free (a->num_elt);
353  a->num_elt = NULL;
354  }
355  a->max_idx = 0;
356  if (a->hash_elt != NULL)
357  {
358  for (i = 0; i < VAR_NAME_HASH; i++)
359  free_var_chain (a->hash_elt[i]);
360  g_free (a->hash_elt);
361  a->hash_elt = NULL;
362  }
363  }
364 
365  static void
367  {
368  if (v == NULL)
369  return;
371  g_free (v->var_name);
372  switch (v->u.var_type)
373  {
374  case VAR2_STRING:
375  case VAR2_DATA:
376  g_free (v->u.v.v_str.s_val);
377  break;
378  case VAR2_ARRAY:
379  free_array (&v->u.v.v_arr);
380  break;
381  }
382  g_free (v->u.string_form);
383  g_free (v);
384  }
385 
386  static void
388  {
389  if (v == NULL)
390  return;
391  switch (v->var_type)
392  {
393  case VAR2_STRING:
394  case VAR2_DATA:
395  g_free (v->v.v_str.s_val);
396  break;
397  case VAR2_ARRAY:
398  free_array (&v->v.v_arr);
399  break;
400  }
401  g_free (v->string_form);
402  g_free (v);
403  }
404 
405  static void
407  {
408  if (v == NULL)
409  return;
410 
411  switch (v->var_type)
412  {
413  case VAR2_INT:
414  v->v.v_int = 0;
415  break;
416  case VAR2_STRING:
417  case VAR2_DATA:
418  g_free (v->v.v_str.s_val);
419  v->v.v_str.s_val = NULL;
420  v->v.v_str.s_siz = 0;
421  break;
422  case VAR2_ARRAY:
423  free_array (&v->v.v_arr);
424  break;
425  }
426  v->var_type = VAR2_UNDEF;
427  }
428 
429  static void
431  {
432  /* TBD: free variable if necessary? */
433  v1->var_type = v2->var_type;
434  switch (v2->var_type)
435  {
436  case VAR2_STRING:
437  case VAR2_DATA:
438  if (v2->v.v_str.s_val != NULL)
439  {
440  v1->v.v_str.s_val = g_malloc0 (v2->v.v_str.s_siz + 1);
441  memcpy (v1->v.v_str.s_val, v2->v.v_str.s_val, v2->v.v_str.s_siz);
442  v1->v.v_str.s_siz = v2->v.v_str.s_siz;
443  }
444  else
445  {
446  v1->v.v_str.s_val = NULL;
447  v1->v.v_str.s_siz = 0;
448  }
449  break;
450 
451  case VAR2_UNDEF:
452  break;
453 
454  case VAR2_INT:
455  v1->v.v_int = v2->v.v_int;
456  break;
457 
458  case VAR2_ARRAY:
459  copy_array (&v1->v.v_arr, &v2->v.v_arr, 1);
460  break;
461 
462  default:
463  nasl_perror (NULL, "copy_anon_var: unhandled type 0x%x\n", v2->var_type);
464  clear_anon_var (v1);
465  }
466  }
467 
468  static anon_nasl_var *
470  {
471  anon_nasl_var *v1;
472 
473  if (v == NULL)
474  return NULL;
475 
476  v1 = g_malloc0 (sizeof (anon_nasl_var));
477  copy_anon_var (v1, v);
478  return v1;
479  }
480 
481  static named_nasl_var *
483  {
484  named_nasl_var *v1;
485 
486  if (v == NULL)
487  return NULL;
488 
489  v1 = g_malloc0 (sizeof (named_nasl_var));
490  copy_anon_var (&v1->u, &v->u);
491  v1->var_name = g_strdup (v->var_name);
492  return v1;
493  }
494 
495  static void
496  copy_array (nasl_array *a1, const nasl_array *a2, int copy_named)
497  {
498  int i;
499  named_nasl_var *v1, *v2, *v;
500 
501  if (a1 == a2)
502  return;
503 
504  if (a1 == NULL || a2 == NULL)
505  {
506  nasl_perror (NULL, "Internal inconsistency - null array\n");
507  abort ();
508  }
509 
510  free_array (a1);
511 
512  if (a2->num_elt != NULL)
513  {
514  a1->max_idx = a2->max_idx;
515  a1->num_elt = g_malloc0 (sizeof (anon_nasl_var *) * a2->max_idx);
516  for (i = 0; i < a2->max_idx; i++)
517  a1->num_elt[i] = dup_anon_var (a2->num_elt[i]);
518  }
519  if (copy_named && a2->hash_elt != NULL)
520  {
521  a1->hash_elt = g_malloc0 (VAR_NAME_HASH * sizeof (named_nasl_var *));
522  for (i = 0; i < VAR_NAME_HASH; i++)
523  {
524  v1 = NULL;
525  for (v2 = a2->hash_elt[i]; v2 != NULL; v2 = v2->next_var)
526  {
527  v = dup_named_var (v2);
528  v->next_var = v1;
529  a1->hash_elt[i] = v;
530  v1 = v;
531  }
532  }
533  }
534  }
535 
536  tree_cell *
538  {
539  tree_cell *c2;
540  nasl_array *a2;
541 
542  if (c1 == NULL || c1 == FAKE_CELL || c1->type != REF_ARRAY)
543  return NULL;
544 
546  c2->x.ref_val = a2 = g_malloc0 (sizeof (nasl_array));
547  copy_array (a2, c1->x.ref_val, 1);
548  return c2;
549  }
550 
551  extern FILE *nasl_trace_fp;
552 
553  static tree_cell *
555  {
556  anon_nasl_var *v2 = NULL, v0;
557  nasl_array *a = NULL;
558  int t2;
559  void *p;
560 
561  if (v1 == NULL || v1 == FAKE_CELL)
562  return NULL;
563 
564  if (rval == NULL || rval == FAKE_CELL)
565  {
566  clear_anon_var (v1);
567  if (nasl_trace_enabled ())
568  nasl_trace (NULL, "NASL> %s <- undef\n", get_var_name (v1));
569  return NULL;
570  }
571 
572  switch (rval->type)
573  {
574  case CONST_INT:
575  t2 = VAR2_INT;
576  break;
577  case CONST_STR:
578  t2 = VAR2_STRING;
579  break;
580  case CONST_DATA:
581  t2 = VAR2_DATA;
582  break;
583 
584  case REF_VAR:
585  v2 = rval->x.ref_val;
586  if (v2 == NULL)
587  {
588  t2 = 0;
589  a = NULL;
590  break;
591  }
592 
593  if (v2 == v1)
594  return FAKE_CELL;
595 
596  t2 = v2->var_type;
597  if (t2 == VAR2_ARRAY)
598  a = &v2->v.v_arr; /* ? */
599  break;
600 
601  case REF_ARRAY:
602  case DYN_ARRAY:
603  a = rval->x.ref_val;
604  t2 = VAR2_ARRAY;
605  if (v1->var_type == VAR2_ARRAY && &v1->v.v_arr == a)
606  return FAKE_CELL;
607  break;
608 
609  default:
610  nasl_perror (NULL, "Cannot affect rvalue 0x%x to variable\n",
611  rval->type);
612  return NULL;
613  }
614 
615  /*
616  * Bug #146: when executing
617  * x = 'abc'; x = x; or x = make_list(...); x = x[0];
618  * the rvalue will be freed before it is copied to the lvalue
619  */
620  v0 = *v1;
621 
622  /* Bug #146: this fake clear is necessary if we copy an array */
623  memset (v1, 0, sizeof (*v1));
624  /* Bug #146: no risk with the type, we already copied it */
625  v1->var_type = t2;
626 
627  if (rval->type != REF_VAR && rval->type != REF_ARRAY
628  && rval->type != DYN_ARRAY)
629  switch (t2)
630  {
631  case VAR2_INT:
632  v1->v.v_int = rval->x.i_val;
633  break;
634  case VAR2_STRING:
635  case VAR2_DATA:
636  if (rval->x.str_val == NULL)
637  {
638  v1->v.v_str.s_val = NULL;
639  v1->v.v_str.s_siz = 0;
640  }
641  else
642  {
643  p = g_malloc0 (rval->size + 1);
644  memcpy (p, rval->x.str_val, rval->size);
645  v1->v.v_str.s_siz = rval->size;
646  v1->v.v_str.s_val = p;
647  }
648  break;
649  }
650  else /* REF_xxx */
651  switch (t2)
652  {
653  case VAR2_INT:
654  v1->v.v_int = v2->v.v_int;
655  break;
656  case VAR2_STRING:
657  case VAR2_DATA:
658  if (v2->v.v_str.s_val == NULL)
659  {
660  v1->v.v_str.s_val = NULL;
661  v1->v.v_str.s_siz = 0;
662  }
663  else
664  {
665  p = g_malloc0 (v2->v.v_str.s_siz + 1);
666  memcpy (p, v2->v.v_str.s_val, v2->v.v_str.s_siz);
667  v1->v.v_str.s_siz = v2->v.v_str.s_siz;
668  v1->v.v_str.s_val = p;
669  }
670  break;
671  case VAR2_ARRAY:
672  copy_array (&v1->v.v_arr, a, 1);
673  break;
674  }
675 
676  if (nasl_trace_fp != NULL)
677  switch (t2)
678  {
679  case VAR2_INT:
680  nasl_trace (NULL, "NASL> %s <- %lu\n", get_var_name (v1), v1->v.v_int);
681  break;
682  case VAR2_STRING:
683  case VAR2_DATA:
684  nasl_trace (NULL, "NASL> %s <- \"%s\"\n", get_var_name (v1),
685  v1->v.v_str.s_val);
686  break;
687  case VAR2_ARRAY:
688  nasl_trace (NULL, "NASL> %s <- (VAR2_ARRAY)\n", get_var_name (v1));
689  break;
690  default:
691  nasl_trace (NULL, "NASL> %s <- (Type 0x%x)\n", get_var_name (v1), t2);
692  break;
693  }
694 
695  clear_anon_var (&v0);
696  return FAKE_CELL;
697  }
698 
699  tree_cell *
701  {
702  anon_nasl_var *v1 = NULL;
703 
704  if (lval == NULL)
705  {
706  nasl_perror (NULL, "nasl_effect: invalid lvalue\n");
707  return NULL;
708  }
709 
710  if (lval->type != REF_VAR)
711  {
712  nasl_perror (NULL, "nasl_affect: cannot affect to non variable %s\n",
713  nasl_type_name (lval->type));
714  return NULL;
715  }
716 
717  v1 = lval->x.ref_val;
718  return affect_to_anon_var (v1, rval);
719  }
720 
721  static named_nasl_var *
723  {
724  named_nasl_var *v = g_malloc0 (sizeof (named_nasl_var));
725  tree_cell *tc;
726 
727  if (name != NULL)
728  v->var_name = g_strdup (name);
729 
730  if (val == NULL || val == FAKE_CELL)
731  {
732  v->u.var_type = VAR2_UNDEF;
733  return v;
734  }
735 
736  tc = affect_to_anon_var (&v->u, val);
737  /* Here we might test the return value */
738  deref_cell (tc);
739  return v;
740  }
741 
742  static anon_nasl_var *
744  {
745  anon_nasl_var *v = g_malloc0 (sizeof (anon_nasl_var));
746  tree_cell *tc;
747 
748  if (val == NULL || val == FAKE_CELL)
749  {
750  v->var_type = VAR2_UNDEF;
751  return v;
752  }
753 
754  tc = affect_to_anon_var (v, val);
755  /* Here we might test the return value */
756  deref_cell (tc);
757  return v;
758  }
759 
760  tree_cell *
762  {
763  tree_cell *t;
764 
765  for (t = vars; t != NULL; t = t->link[0])
766  if (t->x.str_val == NULL)
767  nasl_perror (lexic, "decl_local_variables: null name!\n");
768  else
769  add_named_var_to_ctxt (lexic, t->x.str_val, NULL);
770  return FAKE_CELL;
771  }
772 
773  tree_cell *
775  {
776  lex_ctxt *c = lexic;
777 
778  while (c->up_ctxt != NULL)
779  c = c->up_ctxt;
780  return decl_local_variables (c, vars);
781  }
782 
783  anon_nasl_var *
785  {
786  anon_nasl_var *v;
787  nasl_array *a = &lexic->ctx_vars;
788 
789  if (a->max_idx > num)
790  {
791  v = a->num_elt[num];
792  if (v != NULL && v->var_type != VAR2_UNDEF)
793  {
794  if (val != NULL)
795  nasl_perror (lexic, "Cannot add existing variable %d\n", num);
796  return NULL;
797  }
798  free_anon_var (a->num_elt[num]);
799  }
800  else
801  {
802  a->num_elt =
803  g_realloc (a->num_elt, (num + 1) * sizeof (anon_nasl_var *));
804  bzero (a->num_elt + a->max_idx,
805  sizeof (anon_nasl_var *) * (num + 1 - a->max_idx));
806  a->max_idx = num + 1;
807  }
808  a->num_elt[num] = v = create_anon_var (val);
809  return v;
810  }
811 
814  {
815  int h = hash_str (name);
816  named_nasl_var *v;
817 
818  /* Duplicated code ? */
819  for (v = lexic->ctx_vars.hash_elt[h]; v != NULL; v = v->next_var)
820  if (v->var_name != NULL && strcmp (name, v->var_name) == 0)
821  {
822  if (val != NULL)
823  nasl_perror (lexic, "Cannot add existing variable %s\n", name);
824  return NULL;
825  }
826  v = create_named_var (name, val);
827  if (v == NULL)
828  return NULL;
829  v->next_var = lexic->ctx_vars.hash_elt[h];
830  lexic->ctx_vars.hash_elt[h] = v;
831  return v;
832  }
833 
834  tree_cell *
836  {
837  tree_cell *ret;
838  anon_nasl_var *v;
839 
840  if (tc == NULL || tc == FAKE_CELL)
841  {
842  nasl_perror (lexic,
843  "nasl_read_var_ref: cannot read NULL or FAKE cell\n");
844  return NULL;
845  }
846  if (tc->type != REF_VAR)
847  {
848  nasl_perror (lexic,
849  "nasl_read_var_ref: argument (type=%d) is not REF_VAR %s\n",
850  tc->type, get_line_nb (tc));
851  return NULL;
852  }
853 
854  v = tc->x.ref_val;
855  if (v == NULL)
856  return NULL;
857 
859  ret->line_nb = tc->line_nb;
860 
861  switch (v->var_type)
862  {
863  case VAR2_INT:
864  ret->type = CONST_INT;
865  ret->x.i_val = v->v.v_int;
866  if (nasl_trace_enabled ())
867  nasl_trace (lexic, "NASL> %s -> %lu\n", get_var_name (v),
868  ret->x.i_val);
869  return ret;
870 
871  case VAR2_STRING:
872  ret->type = CONST_STR;
873  /* Fix bad string length */
874  if (v->v.v_str.s_siz <= 0 && v->v.v_str.s_val[0] != '\0')
875  {
876  v->v.v_str.s_siz = strlen ((char *) v->v.v_str.s_val);
877  nasl_perror (lexic, "nasl_read_var_ref: Bad string length fixed\n");
878  }
879  /* fallthrough */
880  case VAR2_DATA:
881  ret->type = v->var_type == VAR2_STRING ? CONST_STR : CONST_DATA;
882  if (v->v.v_str.s_val == NULL)
883  {
884  ret->x.str_val = NULL;
885  ret->size = 0;
886  }
887  else
888  {
889  ret->x.str_val = g_malloc0 (v->v.v_str.s_siz + 1);
890  memcpy (ret->x.str_val, v->v.v_str.s_val, v->v.v_str.s_siz);
891  ret->size = v->v.v_str.s_siz;
892  }
893  if (nasl_trace_enabled ())
894  nasl_trace (lexic, "NASL> %s -> \"%s\"\n", get_var_name (v),
895  ret->x.str_val);
896  return ret;
897 
898  case VAR2_ARRAY:
899  ret->type = REF_ARRAY;
900  ret->x.ref_val = &v->v.v_arr;
901  return ret;
902 
903  case VAR2_UNDEF:
904  if (nasl_trace_enabled ())
905  nasl_trace (lexic, "NASL> %s -> undef\n", get_var_name (v),
906  v->var_type);
907  break;
908 
909  default:
910  nasl_perror (lexic, "nasl_read_var_ref: unhandled variable type %d\n",
911  v->var_type);
912  if (nasl_trace_enabled ())
913  nasl_trace (lexic, "NASL> %s -> ???? (Var type %d)\n",
914  get_var_name (v), v->var_type);
915  break;
916  }
917  deref_cell (ret);
918  return NULL;
919  }
920 
921  tree_cell *
922  nasl_incr_variable (lex_ctxt *lexic, tree_cell *tc, int pre, int val)
923  {
924  anon_nasl_var *v;
925  int old_val = 0, new_val;
926  tree_cell *retc;
927 
928  if (tc->type != REF_VAR)
929  {
930  nasl_perror (
931  lexic, "nasl_incr_variable: argument (type=%d) is not REF_VAR %s\n",
932  tc->type, get_line_nb (tc));
933  return NULL;
934  }
935 
936  v = tc->x.ref_val;
937 
938  switch (v->var_type)
939  {
940  case VAR2_INT:
941  old_val = v->v.v_int;
942  break;
943  case VAR2_STRING:
944  case VAR2_DATA:
945  old_val =
946  v->v.v_str.s_val == NULL ? 0 : atoi ((char *) v->v.v_str.s_val);
947  break;
948  case VAR2_UNDEF:
949  old_val = 0;
950  break;
951 
952  default:
953  nasl_perror (lexic,
954  "nasl_incr_variable: variable %s has bad type %d %s\n",
955  /*get_var_name(v) */ "", get_line_nb (tc));
956  return NULL;
957  }
958  new_val = old_val + val;
959 
960  clear_anon_var (v);
961  v->var_type = VAR2_INT;
962  v->v.v_int = new_val;
963 
964  retc = alloc_typed_cell (CONST_INT);
965  retc->x.i_val = pre ? new_val : old_val;
966 
967  return retc;
968  }
969 
970  static long int
971  var2int (anon_nasl_var *v, int defval)
972  {
973  if (v == NULL)
974  return defval;
975 
976  switch (v->var_type)
977  {
978  case VAR2_INT:
979  return v->v.v_int;
980 
981  case VAR2_STRING:
982  case VAR2_DATA:
983  return atol ((char *) v->v.v_str.s_val);
984 
985  case VAR2_UNDEF:
986  case VAR2_ARRAY:
987  default:
988  return defval;
989  }
990  /*NOTREACHED*/}
991 
992  char *
994  {
995  GString *str;
996  int i, n1 = 0;
997  anon_nasl_var *u;
998  named_nasl_var *v;
999 
1000  if (a == NULL)
1001  return NULL;
1002 
1003  str = g_string_new ("[ ");
1004  if (a->num_elt != NULL)
1005  for (i = 0; i < a->max_idx; i++)
1006  if ((u = a->num_elt[i]) != NULL && u->var_type != VAR2_UNDEF)
1007  {
1008  if (n1 > 0)
1009  g_string_append (str, ", ");
1010  n1++;
1011  switch (u->var_type)
1012  {
1013  case VAR2_INT:
1014  g_string_append_printf (str, "%d: %ld", i, u->v.v_int);
1015  break;
1016  case VAR2_STRING:
1017  case VAR2_DATA:
1018  if (u->v.v_str.s_siz < 64)
1019  g_string_append_printf (str, "%d: '%s'", i, u->v.v_str.s_val);
1020  else
1021  g_string_append_printf (str, "%d: '%s'...", i,
1022  u->v.v_str.s_val);
1023  break;
1024  default:
1025  g_string_append_printf (str, "%d: ????", i);
1026  break;
1027  }
1028  }
1029 
1030  if (a->hash_elt != NULL)
1031  for (i = 0; i < VAR_NAME_HASH; i++)
1032  for (v = a->hash_elt[i]; v != NULL; v = v->next_var)
1033  if (v->u.var_type != VAR2_UNDEF)
1034  {
1035  u = &v->u;
1036  if (n1 > 0)
1037  g_string_append (str, ", ");
1038  n1++;
1039  switch (u->var_type)
1040  {
1041  case VAR2_INT:
1042  g_string_append_printf (str, "%s: %ld", v->var_name,
1043  u->v.v_int);
1044  break;
1045  case VAR2_STRING:
1046  case VAR2_DATA:
1047  if (u->v.v_str.s_siz < 64)
1048  g_string_append_printf (str, "%s: '%s'", v->var_name,
1049  u->v.v_str.s_val);
1050  else
1051  g_string_append_printf (str, "%s: '%s'...", v->var_name,
1052  u->v.v_str.s_val);
1053  break;
1054  default:
1055  g_string_append_printf (str, "%s: ????", v->var_name);
1056  break;
1057  }
1058  }
1059 
1060  g_string_append (str, " ]");
1061  return g_string_free (str, FALSE);
1062  }
1063 
1064  const char *
1066  {
1067  if (v == NULL)
1068  return NULL;
1069 
1070  if (v->string_form)
1071  return v->string_form;
1072  switch (v->var_type)
1073  {
1074  case VAR2_INT:
1075  v->string_form = g_strdup_printf ("%ld", v->v.v_int);
1076  break;
1077  case VAR2_STRING:
1078  case VAR2_DATA:
1079  v->string_form = g_malloc0 (v->v.v_str.s_siz + 1);
1080  memcpy (v->string_form,
1081  (char *) v->v.v_str.s_val ? (char *) v->v.v_str.s_val : "",
1082  v->v.v_str.s_siz + 1);
1083  break;
1084  case VAR2_UNDEF:
1085  break;
1086  case VAR2_ARRAY:
1087  v->string_form = array2str (&v->v.v_arr);
1088  break;
1089  default:
1090  v->string_form = g_strdup ("");
1091  break;
1092  }
1093  return v->string_form;
1094  }
1095 
1096  long int
1097  get_int_var_by_num (lex_ctxt *lexic, int num, int defval)
1098  {
1099  anon_nasl_var *v = get_var_ref_by_num (lexic, num);
1100  return var2int (v, defval);
1101  }
1102 
1103  long int
1104  get_int_var_by_name (lex_ctxt *lexic, const char *name, int defval)
1105  {
1106  named_nasl_var *v = get_var_ref_by_name (lexic, name, 0);
1107  return var2int (&v->u, defval);
1108  }
1109 
1110  char *
1111  get_str_var_by_num (lex_ctxt *lexic, int num)
1112  {
1113  anon_nasl_var *v = get_var_ref_by_num (lexic, num);
1114  return (char *) var2str (v);
1115  }
1116 
1117  char *
1118  get_str_var_by_name (lex_ctxt *lexic, const char *name)
1119  {
1120  named_nasl_var *v = get_var_ref_by_name (lexic, name, 0);
1121  return (char *) var2str (&v->u);
1122  }
1123  static int
1125  {
1126  if (v == NULL)
1127  return 0;
1128  switch (v->var_type)
1129  {
1130  case VAR2_DATA:
1131  case VAR2_STRING:
1132  return v->v.v_str.s_siz;
1133  }
1134  return 0;
1135  }
1136 
1137  int
1138  get_var_size_by_name (lex_ctxt *lexic, const char *name)
1139  {
1140  named_nasl_var *v = get_var_ref_by_name (lexic, name, 0);
1141  return get_var_size (&v->u);
1142  }
1143 
1144  int
1145  get_var_size_by_num (lex_ctxt *lexic, int num)
1146  {
1147  anon_nasl_var *v = get_var_ref_by_num (lexic, num);
1148  return get_var_size (v);
1149  }
1150 
1154  int
1155  get_var_type_by_num (lex_ctxt *lexic, int num)
1156  {
1157  anon_nasl_var *v = get_var_ref_by_num (lexic, num);
1158  return v == NULL ? VAR2_UNDEF : v->var_type;
1159  }
1160 
1161  int
1162  get_var_type_by_name (lex_ctxt *lexic, const char *name)
1163  {
1164  named_nasl_var *v = get_var_ref_by_name (lexic, name, 0);
1165  return v == NULL ? VAR2_UNDEF : v->u.var_type;
1166  }
1167 
1170  {
1171  nasl_iterator it;
1172  anon_nasl_var *v;
1173 
1174  it.a = NULL;
1175  it.v = NULL;
1176  it.i1 = 0;
1177  it.iH = 0;
1178 
1179  if (c == NULL || c == FAKE_CELL)
1180  return it;
1181 
1182  if (c->type == REF_VAR)
1183  {
1184  v = c->x.ref_val;
1185  if (v == NULL || v->var_type != VAR2_ARRAY)
1186  return it;
1187  it.a = g_malloc0 (sizeof (nasl_array));
1188  copy_array (it.a, &v->v.v_arr, 1);
1189  }
1190  else if (c->type == REF_ARRAY || c->type == DYN_ARRAY)
1191  {
1192  it.a = g_malloc0 (sizeof (nasl_array));
1193  copy_array (it.a, c->x.ref_val, 1);
1194  }
1195  else
1196  {
1197  nasl_perror (ctxt, "nasl_array_iterator: unhandled type %d (0x%x)\n",
1198  c->type, c->type);
1199  }
1200 
1201  return it;
1202  }
1203 
1204  tree_cell *
1206  {
1207  anon_nasl_var *av;
1208 
1209  if (it == NULL || it->a == NULL)
1210  return NULL;
1211 
1212  if (it->i1 >= 0)
1213  {
1214  while (it->i1 < it->a->max_idx)
1215  {
1216  av = it->a->num_elt[it->i1++];
1217  if (av != NULL && av->var_type != VAR2_UNDEF)
1218  return var2cell (av);
1219  }
1220  it->i1 = -1;
1221  }
1222 
1223  if (it->a->hash_elt == NULL)
1224  return NULL;
1225 
1226  if (it->v != NULL)
1227  it->v = it->v->next_var;
1228  do
1229  {
1230  while (it->v == NULL)
1231  if (it->iH >= VAR_NAME_HASH)
1232  return NULL;
1233  else
1234  it->v = it->a->hash_elt[it->iH++];
1235 
1236  while (it->v != NULL && it->v->u.var_type == VAR2_UNDEF)
1237  it->v = it->v->next_var;
1238  }
1239  while (it->v == NULL);
1240 
1241  return var2cell (&it->v->u);
1242  }
1243 
1244  int
1246  {
1247  anon_nasl_var *v2 = NULL;
1248 
1249  if (i < 0)
1250  {
1251  nasl_perror (
1252  NULL, "add_var_to_list: negative index are not (yet) supported\n");
1253  return -1;
1254  }
1255 
1256  if (i >= a->max_idx)
1257  {
1258  a->num_elt = g_realloc (a->num_elt, sizeof (anon_nasl_var *) * (i + 1));
1259  bzero (a->num_elt + a->max_idx,
1260  sizeof (anon_nasl_var *) * (i + 1 - a->max_idx));
1261  a->max_idx = i + 1;
1262  }
1263 
1264  if (a->num_elt)
1265  {
1266  free_anon_var (a->num_elt[i]);
1267  v2 = dup_anon_var (v); /* May return NULL */
1268  a->num_elt[i] = v2;
1269  }
1270  if (v2 == NULL)
1271  return 0;
1272  else
1273  return 1;
1274  }
1275 
1276  int
1278  {
1279  named_nasl_var *v2;
1280  int h = hash_str (name);
1281 
1282  if (a->hash_elt == NULL)
1283  {
1284  a->hash_elt = g_malloc0 (VAR_NAME_HASH * sizeof (named_nasl_var *));
1285  }
1286 
1287  v2 = g_malloc0 (sizeof (named_nasl_var));
1288  v2->var_name = g_strdup (name);
1289  v2->u.var_type = VAR2_UNDEF;
1290  v2->next_var = a->hash_elt[h];
1291  a->hash_elt[h] = v2;
1292 
1293  copy_anon_var (&(v2->u), v);
1294  return 0;
1295  }
1296 
1301  int
1303  {
1304  int i;
1305 
1306  for (i = a->max_idx - 1; i >= 0; i--)
1307  if (a->num_elt[i] != NULL && a->num_elt[i]->var_type != VAR2_UNDEF)
1308  {
1309  /* Fixing max_index will realloc() at next store.
1310  * I am not sure it is a good idea
1311  * Wait and see */
1312  a->max_idx = i + 1;
1313  return i + 1;
1314  }
1315  return 0;
1316  }
1317 
1322  tree_cell *
1324  {
1325  int n;
1326  tree_cell *c, *c2;
1327  nasl_array *a;
1328  anon_nasl_var *v;
1329 
1330  v = g_malloc0 (sizeof (anon_nasl_var));
1331  a = g_malloc0 (sizeof (nasl_array));
1332  /* Either the elements are all "named", or they are "numbered". No mix! */
1333  if (el->x.str_val == NULL) /* numbered */
1334  {
1335  for (n = 0, c = el; c != NULL; c = c->link[1])
1336  n++;
1337  a->max_idx = n;
1338  a->num_elt = g_malloc0 (sizeof (anon_nasl_var *) * n);
1339  a->hash_elt = NULL;
1340  }
1341  else
1342  {
1343  a->num_elt = NULL;
1344  a->hash_elt = g_malloc0 (VAR_NAME_HASH * sizeof (named_nasl_var *));
1345  }
1346 
1347  for (n = 0, c = el; c != NULL; c = c->link[1])
1348  {
1349  c2 = c->link[0];
1350  if (c2 != NULL && c2 != FAKE_CELL)
1351  {
1352  switch (c2->type)
1353  {
1354  case CONST_INT:
1355  v->var_type = VAR2_INT;
1356  v->v.v_int = c2->x.i_val;
1357  break;
1358  case CONST_STR:
1359  case CONST_DATA:
1360  v->var_type = c2->type == CONST_STR ? VAR2_STRING : VAR2_DATA;
1361  if (c2->x.str_val == NULL)
1362  {
1363  v->v.v_str.s_val = NULL;
1364  v->v.v_str.s_siz = 0;
1365  }
1366  else
1367  {
1368  v->v.v_str.s_siz = c2->size;
1369  v->v.v_str.s_val = (unsigned char *) c2->x.str_val;
1370  }
1371  break;
1372  default:
1373  nasl_perror (NULL,
1374  "make_array_from_list: unhandled cell type %s at "
1375  "position %d\n",
1376  nasl_type_name (c2->type), n);
1377  v->var_type = VAR2_UNDEF;
1378  break;
1379  }
1380  }
1381 
1382  if (c->x.str_val == NULL)
1383  add_var_to_list (a, n++, v);
1384  else
1385  add_var_to_array (a, c->x.str_val, v);
1386  }
1387 
1388  g_free (v);
1390  c->x.ref_val = a;
1391  deref_cell (el);
1392  return c;
1393  }
nasl_iterator::i1
int i1
Definition: nasl_var.h:68
st_a_nasl_var
Definition: nasl_var.h:40
get_var_name
static const char * get_var_name(anon_nasl_var *v)
Definition: nasl_var.c:199
nasl_type_name
const char * nasl_type_name(int t)
Definition: nasl_tree.c:346
free_array
void free_array(nasl_array *a)
Definition: nasl_var.c:342
struct_lex_ctxt::ctx_vars
nasl_array ctx_vars
Definition: nasl_lex_ctxt.h:35
dup_anon_var
static anon_nasl_var * dup_anon_var(const anon_nasl_var *v)
Definition: nasl_var.c:469
CONST_DATA
@ CONST_DATA
Definition: nasl_tree.h:82
nasl_trace
void nasl_trace(lex_ctxt *lexic, char *msg,...)
Prints debug message in printf fashion to nasl_trace_fp if it exists.
Definition: nasl_debug.c:175
VAR2_UNDEF
@ VAR2_UNDEF
Definition: nasl_var.h:15
nasl_trace_fp
FILE * nasl_trace_fp
Definition: exec.c:357
nasl_incr_variable
tree_cell * nasl_incr_variable(lex_ctxt *lexic, tree_cell *tc, int pre, int val)
Definition: nasl_var.c:922
TC::str_val
char * str_val
Definition: nasl_tree.h:103
create_named_var
static named_nasl_var * create_named_var(const char *name, tree_cell *val)
Definition: nasl_var.c:722
get_var_ref_by_num
static anon_nasl_var * get_var_ref_by_num(lex_ctxt *ctxt, int num)
Definition: nasl_var.c:141
nasl_iterate_array
tree_cell * nasl_iterate_array(nasl_iterator *it)
Definition: nasl_var.c:1205
copy_array
static void copy_array(nasl_array *, const nasl_array *, int)
Definition: nasl_var.c:496
clear_anon_var
static void clear_anon_var(anon_nasl_var *v)
Definition: nasl_var.c:406
CONST_STR
@ CONST_STR
Definition: nasl_tree.h:80
st_n_nasl_var
Definition: nasl_var.h:55
var2str
const char * var2str(anon_nasl_var *v)
Definition: nasl_var.c:1065
get_str_var_by_num
char * get_str_var_by_num(lex_ctxt *lexic, int num)
Definition: nasl_var.c:1111
decl_global_variables
tree_cell * decl_global_variables(lex_ctxt *lexic, tree_cell *vars)
Definition: nasl_var.c:774
array2str
char * array2str(const nasl_array *a)
Definition: nasl_var.c:993
st_nasl_array::max_idx
int max_idx
Definition: nasl_var.h:34
st_a_nasl_var::v_arr
nasl_array v_arr
Definition: nasl_var.h:49
TC::x
union TC::@5 x
get_var_type_by_num
int get_var_type_by_num(lex_ctxt *lexic, int num)
Returns NASL variable/cell type, VAR2_UNDEF if value is NULL.
Definition: nasl_var.c:1155
st_nasl_array::hash_elt
struct st_n_nasl_var ** hash_elt
Definition: nasl_var.h:36
hash_str2
int hash_str2(const char *s, int n)
Definition: nasl_var.c:26
DYN_ARRAY
@ DYN_ARRAY
Definition: nasl_tree.h:90
FAKE_CELL
#define FAKE_CELL
Definition: nasl_tree.h:110
st_n_nasl_var::var_name
char * var_name
Definition: nasl_var.h:58
create_anon_var
static anon_nasl_var * create_anon_var(tree_cell *val)
Definition: nasl_var.c:743
st_a_nasl_var::v
union st_a_nasl_var::@7 v
st_a_nasl_var::v_str
nasl_string_t v_str
Definition: nasl_var.h:47
VAR2_STRING
@ VAR2_STRING
Definition: nasl_var.h:17
exec.h
st_nasl_string::s_siz
int s_siz
Definition: nasl_var.h:27
name
const char * name
Definition: nasl_init.c:411
VAR2_DATA
@ VAR2_DATA
Definition: nasl_var.h:18
st_nasl_array
Definition: nasl_var.h:33
free_var_chain
static void free_var_chain(named_nasl_var *)
Definition: nasl_var.c:366
nasl_read_var_ref
tree_cell * nasl_read_var_ref(lex_ctxt *lexic, tree_cell *tc)
Definition: nasl_var.c:835
nasl_affect
tree_cell * nasl_affect(tree_cell *lval, tree_cell *rval)
Definition: nasl_var.c:700
struct_lex_ctxt::up_ctxt
struct struct_lex_ctxt * up_ctxt
Definition: nasl_lex_ctxt.h:24
VAR2_INT
@ VAR2_INT
Definition: nasl_var.h:16
get_var_size_by_num
int get_var_size_by_num(lex_ctxt *lexic, int num)
Definition: nasl_var.c:1145
nasl_iterator::v
named_nasl_var * v
Definition: nasl_var.h:70
nasl_debug.h
get_var_by_name
static named_nasl_var * get_var_by_name(nasl_array *a, const char *s)
Definition: nasl_var.c:78
get_str_var_by_name
char * get_str_var_by_name(lex_ctxt *lexic, const char *name)
Definition: nasl_var.c:1118
st_n_nasl_var::next_var
struct st_n_nasl_var * next_var
Definition: nasl_var.h:62
affect_to_anon_var
static tree_cell * affect_to_anon_var(anon_nasl_var *v1, tree_cell *rval)
Definition: nasl_var.c:554
nasl_iterator::iH
int iH
Definition: nasl_var.h:69
nasl_perror
void nasl_perror(lex_ctxt *lexic, char *msg,...)
Definition: nasl_debug.c:111
copy_anon_var
static void copy_anon_var(anon_nasl_var *v1, const anon_nasl_var *v2)
Definition: nasl_var.c:430
nasl_trace_enabled
int nasl_trace_enabled(void)
Checks if the nasl_trace_fp is set.
Definition: nasl_debug.c:161
add_var_to_array
int add_var_to_array(nasl_array *a, char *name, const anon_nasl_var *v)
Definition: nasl_var.c:1277
get_var_size
static int get_var_size(const anon_nasl_var *v)
Definition: nasl_var.c:1124
TC::size
int size
Definition: nasl_tree.h:99
nasl_lex_ctxt.h
nasl_array_iterator
nasl_iterator nasl_array_iterator(void *ctxt, tree_cell *c)
Definition: nasl_var.c:1169
var2cell
tree_cell * var2cell(anon_nasl_var *v)
Definition: nasl_var.c:171
TC::line_nb
short line_nb
Definition: nasl_tree.h:96
get_int_var_by_num
long int get_int_var_by_num(lex_ctxt *lexic, int num, int defval)
Definition: nasl_var.c:1097
get_array_elem
tree_cell * get_array_elem(lex_ctxt *ctxt, const char *name, tree_cell *idx)
Definition: nasl_var.c:211
struct_lex_ctxt::fct_ctxt
unsigned fct_ctxt
Definition: nasl_lex_ctxt.h:26
VAR2_ARRAY
@ VAR2_ARRAY
Definition: nasl_var.h:19
nasl_func.h
TC::ref_val
void * ref_val
Definition: nasl_tree.h:105
dup_named_var
static named_nasl_var * dup_named_var(const named_nasl_var *v)
Definition: nasl_var.c:482
st_a_nasl_var::var_type
int var_type
Definition: nasl_var.h:41
get_line_nb
char * get_line_nb(const tree_cell *c)
Definition: nasl_tree.c:379
alloc_expr_cell
tree_cell * alloc_expr_cell(int lnb, int t, tree_cell *l, tree_cell *r)
Definition: nasl_tree.c:63
make_array_from_elems
tree_cell * make_array_from_elems(tree_cell *el)
Definition: nasl_var.c:1323
TC
Definition: nasl_tree.h:94
struct_lex_ctxt
Definition: nasl_lex_ctxt.h:23
get_variable_by_name
tree_cell * get_variable_by_name(lex_ctxt *ctxt, const char *name)
Definition: nasl_var.c:179
TC::type
short type
Definition: nasl_tree.h:95
TC::link
struct TC * link[4]
Definition: nasl_tree.h:107
nasl_var.h
decl_local_variables
tree_cell * decl_local_variables(lex_ctxt *lexic, tree_cell *vars)
Definition: nasl_var.c:761
st_a_nasl_var::string_form
char * string_form
Definition: nasl_var.h:51
REF_VAR
@ REF_VAR
Definition: nasl_tree.h:88
nasl_global_ctxt.h
CONST_INT
@ CONST_INT
Definition: nasl_tree.h:79
val
const char * val
Definition: nasl_init.c:412
var2int
static long int var2int(anon_nasl_var *v, int defval)
Definition: nasl_var.c:971
add_named_var_to_ctxt
named_nasl_var * add_named_var_to_ctxt(lex_ctxt *lexic, const char *name, tree_cell *val)
Definition: nasl_var.c:813
nasl_iterator::a
nasl_array * a
Definition: nasl_var.h:67
hash_str
static int hash_str(const char *s)
Definition: nasl_var.c:40
nasl_iterator
Definition: nasl_var.h:66
copy_ref_array
tree_cell * copy_ref_array(const tree_cell *c1)
Definition: nasl_var.c:537
add_var_to_list
int add_var_to_list(nasl_array *a, int i, const anon_nasl_var *v)
Definition: nasl_var.c:1245
get_var_size_by_name
int get_var_size_by_name(lex_ctxt *lexic, const char *name)
Definition: nasl_var.c:1138
get_var_type_by_name
int get_var_type_by_name(lex_ctxt *lexic, const char *name)
Definition: nasl_var.c:1162
get_var_ref_by_name
static named_nasl_var * get_var_ref_by_name(lex_ctxt *ctxt, const char *name, int climb)
This function climbs up in the context list.
Definition: nasl_var.c:103
st_a_nasl_var::v_int
long int v_int
Definition: nasl_var.h:48
REF_ARRAY
@ REF_ARRAY
Definition: nasl_tree.h:89
free_anon_var
static void free_anon_var(anon_nasl_var *)
Definition: nasl_var.c:387
deref_cell
void deref_cell(tree_cell *c)
Definition: nasl_tree.c:181
alloc_typed_cell
tree_cell * alloc_typed_cell(int typ)
Definition: nasl_tree.c:28
add_numbered_var_to_ctxt
anon_nasl_var * add_numbered_var_to_ctxt(lex_ctxt *lexic, int num, tree_cell *val)
Definition: nasl_var.c:784
st_n_nasl_var::u
struct st_a_nasl_var u
Definition: nasl_var.h:56
get_int_var_by_name
long int get_int_var_by_name(lex_ctxt *lexic, const char *name, int defval)
Definition: nasl_var.c:1104
NODE_EMPTY
@ NODE_EMPTY
Definition: nasl_tree.h:13
nasl_tree.h
VAR_NAME_HASH
#define VAR_NAME_HASH
Definition: nasl_var.h:22
nasl_get_var_by_num
anon_nasl_var * nasl_get_var_by_num(void *ctxt, nasl_array *a, int num, int create)
Definition: nasl_var.c:46
st_nasl_string::s_val
unsigned char * s_val
Definition: nasl_var.h:26
TC::i_val
long int i_val
Definition: nasl_tree.h:104
array_max_index
int array_max_index(nasl_array *a)
Definition: nasl_var.c:1302
st_nasl_array::num_elt
struct st_a_nasl_var ** num_elt
Definition: nasl_var.h:35