spacepaste

Paste details

reply | raw

  1.  
  2. pwndbg>
  3. Continuing.
  4. c = 85
  5. zrule_name = @����
  6. zkey = H�E���UH��ATSH��@H�}�dH�%(
  7. insert(@����0, "H�E���UH��ATSH��@H�}�dH�%(", 1, rule_4);
  9. Hardware watchpoint 1: trie_trie->rear->rule_name
  11. Old value = 0x555555555a76 "rule_"
  12. New value = 0x7fffffffdbd0 "@\334\377\377\377\177"
  14. Hardware watchpoint 2: trie_trie->rear->key
  16. Old value = 0x555555758830 "5"
  17. New value = 0x555555758890 "H\213E\370\311\303UH\211\345ATSH\203"...
  18. trie_store_asm3 (q=0x555555758690, rule_name=0x7fffffffdbd0 "@\334\377\377\377\177", rule_name_index=0, key=0x555555758890 "H\213E\370\311\303UH\211\345ATSH\203"..., index=1, rule_next=0x555555555a76 "rule_", rule_next_index=4) at trie.c:110
  19. 110 }
  20. LEGEND: STACK | HEAP | CODE | DATA | RWX | RODATA
  21. ────────────────────────────[ REGISTERS ]─────────────────────────────
  22. RAX 0x555555758690 —▸ 0x5555557586b0 —▸ 0x555555555a6d ◂— jae 0x555555555ae4 /* 'sub_root' */
  23. RBX 0x555555555a76 ◂— jb 0x555555555aed /* 'rule_' */
  24. RCX 0x5555557588c0 —▸ 0x7fffffffdbd0 —▸ 0x7fffffffdc40 —▸ 0x5555555559e0 (__libc_csu_init) ◂— push r15
  25. RDX 0x5555557588c0 —▸ 0x7fffffffdbd0 —▸ 0x7fffffffdc40 —▸ 0x5555555559e0 (__libc_csu_init) ◂— push r15
  26. RDI 0x5555557588f0 ◂— 0x0
  27. RSI 0x0
  28. R8 0x555555555a76 ◂— jb 0x555555555aed /* 'rule_' */
  29. R9 0x0
  30. R10 0x555555758010 ◂— 0x0
  31. R11 0x0
  32. R12 0x4
  33. R13 0x555555555a76 ◂— jb 0x555555555aed /* 'rule_' */
  34. R14 0x0
  35. R15 0x0
  36. RBP 0x7fffffffdb10 —▸ 0x7fffffffdb60 —▸ 0x7fffffffdbd0 —▸ 0x7fffffffdc40 —▸ 0x5555555559e0 (__libc_csu_init) ◂— ...
  37. RSP 0x7fffffffdad0 ◂— 0x0
  38. RIP 0x555555554b53 (trie_store_asm3+138) ◂— leave
  39. ──────────────────────────────[ DISASM ]──────────────────────────────
  40. ► 0x555555554b53 <trie_store_asm3+138> leave
  41. 0x555555554b54 <trie_store_asm3+139> ret
  42. ↓
  43. 0x555555554d2f <trie_queue_add3+105> add rsp, 0x10
  44. 0x555555554d33 <trie_queue_add3+109> mov eax, 0
  45. 0x555555554d38 <trie_queue_add3+114> leave
  46. 0x555555554d39 <trie_queue_add3+115> ret
  47. ↓
  48. 0x555555554fbb <parse_branch+420> add rsp, 0x10
  49. 0x555555554fbf <parse_branch+424> mov dword ptr [rbp - 0x34], 0
  50. 0x555555554fc6 <parse_branch+431> jmp parse_branch+987 <0x5555555551f2>
  51. ↓
  52. 0x5555555551f2 <parse_branch+987> mov eax, dword ptr [rbp - 0x34]
  53. 0x5555555551f5 <parse_branch+990> movsxd rdx, eax
  54. ──────────────────────────[ SOURCE (CODE) ]───────────────────────────
  55. 105 }
  56. 106
  57. 107 // Add the new node at the end of queue and change rear
  58. 108 q->rear->next = temp;
  59. 109 q->rear = temp;
  60. ► 110 }
  61. 111
  62. 112 struct trie_QNode * trie_load_asm(struct trie_Queue **q)
  63. 113 {
  64. 114 // If queue is empty, return NULL.
  65. 115 if ((q) == NULL) return NULL;
  66. ──────────────────────────────[ STACK ]───────────────────────────────
  67. 00:0000│ rsp 0x7fffffffdad0 ◂— 0x0
  68. 01:0008│ 0x7fffffffdad8 —▸ 0x555555555a76 ◂— jb 0x555555555aed /* 'rule_' */
  69. 02:0010│ 0x7fffffffdae0 —▸ 0x555555758890 ◂— 0x4855c3c9f8458b48
  70. 03:0018│ 0x7fffffffdae8 ◂— 0x1
  71. 04:0020│ 0x7fffffffdaf0 —▸ 0x7fffffffdbd0 —▸ 0x7fffffffdc40 —▸ 0x5555555559e0 (__libc_csu_init) ◂— push r15
  72. 05:0028│ 0x7fffffffdaf8 —▸ 0x555555758690 —▸ 0x5555557586b0 —▸ 0x555555555a6d ◂— jae 0x555555555ae4 /* 'sub_root' */
  73. 06:0030│ 0x7fffffffdb00 ◂— 0xffffffffffffffb0
  74. 07:0038│ 0x7fffffffdb08 —▸ 0x5555557588c0 —▸ 0x7fffffffdbd0 —▸ 0x7fffffffdc40 —▸ 0x5555555559e0 (__libc_csu_init) ◂— ...
  75. ────────────────────────────[ BACKTRACE ]─────────────────────────────
  76. ► f 0 555555554b53 trie_store_asm3+138
  77. f 1 555555554d2f trie_queue_add3+105
  78. f 2 555555554fbb parse_branch+420
  79. f 3 5555555552ca main+162
  80. f 4 7ffff77feb97 __libc_start_main+231
  81. Breakpoint None
  82. Breakpoint None
  83. pwndbg> bt
  84. #0 trie_store_asm3 (q=0x555555758690, rule_name=0x7fffffffdbd0 "@\334\377\377\377\177", rule_name_index=0, key=0x555555758890 "H\213E\370\311\303UH\211\345ATSH\203"..., index=1, rule_next=0x555555555a76 "rule_", rule_next_index=4) at trie.c:110
  85. #1 0x0000555555554d2f in trie_queue_add3 (q=0x555555757038 <trie_trie>, rule_name=0x7fffffffdbd0 "@\334\377\377\377\177", rule_name_index=0, key=0x555555758890 "H\213E\370\311\303UH\211\345ATSH\203"..., index=1, rule_next=0x555555555a76 "rule_", rule_next_index=4) at trie.c:145
  86. #2 0x0000555555554fbb in parse_branch (co=0x555555758750 "85") at trie.c:210
  87. #3 0x00005555555552ca in main (argc=1, argv=0x7fffffffdd28) at trie.c:266
  88. #4 0x00007ffff77feb97 in __libc_start_main (main=0x555555555228 <main>, argc=1, argv=0x7fffffffdd28, init=<optimised out>, fini=<optimised out>, rtld_fini=<optimised out>, stack_end=0x7fffffffdd18) at ../csu/libc-start.c:310
  89. #5 0x000055555555477a in _start ()
  90. pwndbg> l trie.c:210
  91. 205 else if (itterations == 2) rule_index_tmp++;
  92. 206 actual_index_tmp = actual_index+1;
  93. 207 printf("zrule_name = %s\n", zrule_name);
  94. 208 printf("zkey = %s\n", zkey);
  95. 209 printf("insert(%s%d, \"%s\", %d, %s%d);\n", zrule_name, zrule_name_index, zkey, zindex, trie_rule_prefix, rule_index_tmp-(itterations==1?0:1));
  96. 210 trie_queue_add3(&trie_trie, zrule_name, zrule_name_index, strdup(zkey), zindex, trie_rule_prefix, rule_index_tmp-(itterations==1?0:1));
  97. 211 for (int level = 0; co[level]; level++) {
  98. 212 char tmp[2];
  99. 213 tmp[0] = co[level];
  100. 214 tmp[1] = '\0';
  101. pwndbg> l --
  102. Function "--" not defined.
  103. pwndbg> l -
  104. 195 char * zkey;
  105. 196 int zindex;
  106. 197 if (itterations == 1) {
  107. 198 zrule_name = trie_trie->rear->rule_name;
  108. 199 zrule_name_index = trie_trie->rear->rule_name_index;
  109. 200 zkey = trie_trie->rear->key;
  110. 201 zindex = trie_trie->rear->index;
  111. 202 rule_index_tmp = rule_index+1;
  112. 203 final_rule = rule_index_tmp;
  113. 204 }
  114.  
Powered by spacepaste. Paste removal.