Reverse Engineering for Beginners

CHAPTER 51. C++ CHAPTER 51. C++

struct tree_node *M_right;
};

struct tree_struct
{
int M_key_compare;
struct tree_node M_header;
size_t M_node_count;
};

void dump_tree_node (struct tree_node *n, bool is_set, bool traverse, bool dump_keys_and_values⤦
Ç)
{
printf ("ptr=0x%p M_left=0x%p M_parent=0x%p M_right=0x%p M_color=%d\n",
n, n->M_left, n->M_parent, n->M_right, n->M_color);

void *point_after_struct=((char*)n)+sizeof(struct tree_node);

if (dump_keys_and_values)

{

if (is_set)

printf ("key=%d\n", *(int*)point_after_struct);

else

{

struct map_pair *p=(struct map_pair *)point_after_struct;

printf ("key=%d value=[%s]\n", p->key, p->value);

};

};

if (traverse==false)

return;

if (n->M_left)
dump_tree_node (n->M_left, is_set, traverse, dump_keys_and_values);
if (n->M_right)
dump_tree_node (n->M_right, is_set, traverse, dump_keys_and_values);
};

const char* ALOT_OF_TABS="\t\t\t\t\t\t\t\t\t\t\t";

void dump_as_tree (int tabs, struct tree_node n, bool is_set)
{
void point_after_struct=((char*)n)+sizeof(struct tree_node);

if (is_set)

printf ("%d\n", *(int*)point_after_struct);

else

{

struct map_pair *p=(struct map_pair *)point_after_struct;

printf ("%d [%s]\n", p->key, p->value);

}

if (n->M_left)
{
printf ("%.sL-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->M_left, is_set);
};
if (n->M_right)
{
printf ("%.sR-------", tabs, ALOT_OF_TABS);
dump_as_tree (tabs+1, n->M_right, is_set);
};
};

void dump_map_and_set(struct tree_struct *m, bool is_set)
{
printf ("ptr=0x%p, M_key_compare=0x%x, M_header=0x%p, M_node_count=%d\n",
m, m->M_key_compare, &m->M_header, m->M_node_count);
dump_tree_node (m->M_header.M_parent, is_set, true, true);
printf ("As a tree:\n");