Reverse Engineering for Beginners

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

printf ("root----");
dump_as_tree (1, m->M_header.M_parent, is_set);
};

int main()
{
// map

std::map<int, const char*> m;

m[10]="ten";

m[20]="twenty";

m[3]="three";

m[101]="one hundred one";

m[100]="one hundred";

m[12]="twelve";

m[107]="one hundred seven";

m[0]="zero";

m[1]="one";

m[6]="six";

m[99]="ninety-nine";

m[5]="five";

m[11]="eleven";

m[1001]="one thousand one";

m[1010]="one thousand ten";

m[2]="two";

m[9]="nine";

printf ("dumping m as map:\n");

dump_map_and_set ((struct tree_struct *)(void*)&m, false);

std::map<int, const char*>::iterator it1=m.begin();

printf ("m.begin():\n");

dump_tree_node ((struct tree_node *)*(void**)&it1, false, false, true);

it1=m.end();

printf ("m.end():\n");

dump_tree_node ((struct tree_node *)*(void**)&it1, false, false, false);

// set

std::set s;
s.insert(123);
s.insert(456);
s.insert(11);
s.insert(12);
s.insert(100);
s.insert(1001);
printf ("dumping s as set:\n");
dump_map_and_set ((struct tree_struct )(void)&s, true);
std::set::iterator it2=s.begin();
printf ("s.begin():\n");
dump_tree_node ((struct tree_node )(void)&it2, true, false, true);
it2=s.end();
printf ("s.end():\n");
dump_tree_node ((struct tree_node )(void)&it2, true, false, false);
};

Listing 51.36: GCC 4.8.1

dumping m as map:
ptr=0x0028FE3C, M_key_compare=0x402b70, M_header=0x0028FE40, M_node_count=17
ptr=0x007A4988 M_left=0x007A4C00 M_parent=0x0028FE40 M_right=0x007A4B80 M_color=1
key=10 value=[ten]
ptr=0x007A4C00 M_left=0x007A4BE0 M_parent=0x007A4988 M_right=0x007A4C60 M_color=1
key=1 value=[one]
ptr=0x007A4BE0 M_left=0x00000000 M_parent=0x007A4C00 M_right=0x00000000 M_color=1
key=0 value=[zero]
ptr=0x007A4C60 M_left=0x007A4B40 M_parent=0x007A4C00 M_right=0x007A4C20 M_color=0
key=5 value=[five]
ptr=0x007A4B40 M_left=0x007A4CE0 M_parent=0x007A4C60 M_right=0x00000000 M_color=1