File: nse_debug.cc

package info (click to toggle)
nmap 6.00-0.3+deb7u1
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 55,576 kB
  • sloc: ansic: 108,190; cpp: 60,191; sh: 19,314; python: 16,531; xml: 9,428; makefile: 2,473; perl: 1,980; yacc: 608; lex: 469; asm: 372
file content (101 lines) | stat: -rw-r--r-- 2,235 bytes parent folder | download
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101

extern "C" {
  #include "lua.h"
  #include "lauxlib.h"
}

#include "nmap.h"
#include "nse_debug.h"
#include "output.h"

/* Print a Lua table. depth_limit is the limit on recursive printing of
   subtables. */
static void table_dump (lua_State *L, int i, int depth_limit)
{
  assert(lua_type(L, i) == LUA_TTABLE);
  printf("{ ");
  lua_pushvalue(L, i);
  lua_pushnil(L);
  while (lua_next(L, -2) != 0) {
    value_dump(L, -2, depth_limit - 1);
    printf(" = ");
    value_dump(L, -1, depth_limit - 1);
    printf(", ");
    lua_pop(L, 1);
  }
  lua_pop(L, 1);
  printf("}");
}

/* Print a Lua value. depth_limit controls the depth to which tables will be
   printed recursively (0 for no recursion). */
void value_dump (lua_State *L, int i, int depth_limit)
{
  int t = lua_type(L, i);
  switch (t)
  {
    case LUA_TSTRING:  /* strings */
      printf("'%s'", lua_tostring(L, i));
      break;
    case LUA_TBOOLEAN:  /* booleans */
      printf(lua_toboolean(L, i) ? "true" : "false");
      break;
    case LUA_TNUMBER:  /* numbers */
      printf("%g", lua_tonumber(L, i));
      break;
    case LUA_TTABLE:
      if (depth_limit > 0)
        table_dump(L, i, depth_limit);
      else
        printf("table: %p", lua_topointer(L, i));
      break;
    case LUA_TTHREAD:
    case LUA_TFUNCTION:
    case LUA_TUSERDATA:
    case LUA_TLIGHTUSERDATA:
      printf("%s: %p", lua_typename(L, t), lua_topointer(L, i));
      break;
    default:  /* other values */
      printf("%s", lua_typename(L, t));
      break;
  }
}

void stack_dump (lua_State *L)
{
  int i, top = lua_gettop(L);
  for (i = 1; i <= top; i++)
  {
    printf("[%d, %d] = ", i, (-top + i - 1));
    value_dump(L, i, 0);
    printf("\n");
  }
}

void lua_state_dump (lua_State *L)
{
  int top;

  printf("=== LUA STATE ===\n");

  top = lua_gettop(L);
  printf("=== STACK (height %d)\n", top);
  stack_dump(L);

  printf("=== GLOBALS\n");
  table_dump(L, LUA_GLOBALSINDEX, 0);
  printf("\n");

  printf("=== REGISTRY\n");
  table_dump(L, LUA_REGISTRYINDEX, 0);
  printf("\n");

  printf("=== nmap.registry\n");
  lua_getglobal(L, "nmap");
  lua_getfield(L, -1, "registry");
  table_dump(L, -1, 1);
  printf("\n");
  lua_pop(L, 2);

  assert(lua_gettop(L) == top);
}