1. (gdb) bt full
  2. #0 0x080a9713 in log_file_check (logfile=0x0) at log.c:345
  3. sb = {st_dev = 56, st_ino = 913417, st_mode = 33188, st_nlink = 1,
  4. st_uid = 0, st_gid = 0, st_rdev = 0, st_atim = {tv_sec = 1577721820,
  5. tv_nsec = 419963000}, st_mtim = {tv_sec = 1578012716,
  6. tv_nsec = 487752000}, st_ctim = {tv_sec = 1578012716,
  7. tv_nsec = 487752000}, st_size = 0, st_blocks = 0, st_blksize = 32768,
  8. st_flags = 0, st_gen = 1064609816, st_lspare = 0, st_birthtim = {
  9. tv_sec = 1577721820, tv_nsec = 419954000}}
  10. #1 0x080a9cb7 in log_rotate () at log.c:109
  11. No locals.
  12. #2 0x0806f185 in CClientManager::MainLoop (this=0xbfbfe9d8) at ClientManager.cpp:191
  13. tmp = 0x0
  14. it = <optimized out>
  15. it2 = <optimized out>
  16. #3 0x08055e8c in main () at Main.cpp:89
  17. Config = {<singleton<CConfig>> = {
  18. _vptr.singleton = 0x818dc5c <vtable for CConfig+8>,
  19. static ms_singleton = 0xbfbfe384}, m_valueMap = {_M_t = {
  20. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >> = {
  21. _M_key_compare = {<std::binary_function<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {_M_header = {_M_color = std::_S_red,
  22. _M_parent = 0x28629140, _M_left = 0x286294c0,
  23. _M_right = 0x28629080}, _M_node_count = 20}, <No data fields>}}}}
  24. poller = {<CNetBase> = {_vptr.CNetBase = 0x818dcd0 <vtable for CNetPoller+8>,
  25. static m_fdWatcher = 0x286176e0}, <singleton<CNetPoller>> = {
  26. _vptr.singleton = 0x818dce0 <vtable for CNetPoller+24>,
  27. static ms_singleton = 0xbfbfe36c}, <No data fields>}
  28. DBManager = {<singleton<CDBManager>> = {
  29. _vptr.singleton = 0x818e620 <vtable for CDBManager+8>,
  30. static ms_singleton = 0xbfbfe3f0}, m_mainSQL = {0x28644a00, 0x28645900,
  31. 0x28646800, 0x28647700}, m_directSQL = {0x28644000, 0x28645400,
  32. 0x28646300, 0x28647200}, m_asyncSQL = {0x28644f00, 0x28645e00,
  33. 0x28646d00, 0x28647c00}, m_quit = 0}
  34. ClientManager = {<CNetBase> = {
  35. _vptr.CNetBase = 0x81916b0 <vtable for CClientManager+8>,
  36. static m_fdWatcher = 0x286176e0}, <singleton<CClientManager>> = {
  37. _vptr.singleton = 0x81916c0 <vtable for CClientManager+24>,
  38. static ms_singleton = 0xbfbfe9d8}, m_looping = 1, m_fdAccept = 19,
  39. m_peerList = {<std::__cxx11::_List_base<CPeer*, std::allocator<CPeer*> >> = {--Type <RET> for more, q to quit, c to continue without paging--
  40. _M_impl = {<std::allocator<std::_List_node<CPeer*> >> = {<__gnu_cxx::new_allocator<std::_List_node<CPeer*> >> = {<No data fields>}, <No data fields>},
  41. _M_node = {<std::__detail::_List_node_base> = {_M_next = 0xbfbfe9e8,
  42. _M_prev = 0xbfbfe9e8}, _M_storage = {
  43. _M_storage = "\000\000\000"}}}}, <No data fields>},
  44. m_pkAuthPeer = 0x0, m_map_pkLoginData = {
  45. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CLoginData*> >, unsigned int, CLoginData*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {
  46. static nothrow_move_assignable = true,
  47. static nothrow_move_constructible = <optimized out>,
  48. current_ = false, funcs_ = {{data_ = {buf = "",
  49. align_ = 0 '\000'}}, {data_ = {buf = "",
  50. align_ = 0 '\000'}}}},
  51. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17,
  52. size_ = 0, mlf_ = 1, max_load_ = 0,
  53. buckets_ = 0x0}, <No data fields>}}, m_map_pkLoginDataByLogin = {
  54. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, CLoginData*, boost::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >> = {<boost::unordered::detail::functions<boost::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >> = {static nothrow_move_assignable = true,
  55. static nothrow_move_constructible = <optimized out>,
  56. current_ = false, funcs_ = {{data_ = {buf = "",
  57. align_ = 0 '\000'}}, {data_ = {buf = "",
  58. align_ = 0 '\000'}}}},
  59. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx--Type <RET> for more, q to quit, c to continue without paging--
  60. 11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
  61. buckets_ = 0x0}, <No data fields>}}, m_map_pkLoginDataByAID = {
  62. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CLoginData*> >, unsigned int, CLoginData*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {
  63. static nothrow_move_assignable = true,
  64. static nothrow_move_constructible = <optimized out>,
  65. current_ = false, funcs_ = {{data_ = {buf = "",
  66. align_ = 0 '\000'}}, {data_ = {buf = "",
  67. align_ = 0 '\000'}}}},
  68. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CLoginData*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17,
  69. size_ = 0, mlf_ = 1, max_load_ = 0,
  70. buckets_ = 0x0}, <No data fields>}}, m_map_kLogonAccount = {
  71. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, CLoginData*, boost::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >> = {<boost::unordered::detail::functions<boost::hash<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::equal_to<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >> = {static nothrow_move_assignable = true,
  72. static nothrow_move_constructible = <optimized out>,
  73. current_ = false, funcs_ = {{data_ = {buf = "\002",
  74. align_ = 2 '\002'}}, {data_ = {buf = "",
  75. align_ = 0 '\000'}}}},
  76. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, CLoginData*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, --Type <RET> for more, q to quit, c to continue without paging--
  77. bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
  78. buckets_ = 0x0}, <No data fields>}}, m_iPlayerIDStart = 100,
  79. m_iPlayerDeleteLevelLimit = 250, m_iPlayerDeleteLevelLimitLower = 1,
  80. m_bChinaEventServer = false,
  81. m_vec_mobTable = {<std::_Vector_base<SMobTable, std::allocator<SMobTable> >> = {
  82. _M_impl = {<std::allocator<SMobTable>> = {<__gnu_cxx::new_allocator<SMobTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x2980c040, _M_finish = 0x298830c8,
  83. _M_end_of_storage = 0x298830c8}}, <No data fields>},
  84. m_vec_itemTable = {<std::_Vector_base<SItemTable, std::allocator<SItemTable> >> = {
  85. _M_impl = {<std::allocator<SItemTable>> = {<__gnu_cxx::new_allocator<SItemTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x29c0cf40,
  86. _M_finish = 0x29d96948,
  87. _M_end_of_storage = 0x29d96948}}, <No data fields>},
  88. m_map_itemTableByVnum = {_M_t = {
  89. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, SItemTable*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, SItemTable*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  90. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  91. _M_header = {_M_color = std::_S_red, _M_parent = 0x287f96e0,
  92. _M_left = 0x28617700, _M_right = 0x29dfd660},
  93. _M_node_count = 9596}, <No data fields>}}}, m_iShopTableSize = 64,
  94. m_pShopTable = 0x29a63d00, m_iRefineTableSize = 412,
  95. m_pRefineTable = 0x28716800,
  96. m_vec_skillTable = {<std::_Vector_base<SSkillTable, std::allocator<SSkillTable> >> = {
  97. _M_impl = {<std::allocator<SSkillTable>> = {<__gnu_cxx::new_allocator<SSkillTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x29a0c4c0,
  98. _M_finish = 0x29a34fd3,
  99. _M_end_of_storage = 0x29a34fd3}}, <No data fields>},
  100. m_vec_banwordTable = {<std::_Vector_base<SBanwordTable, std::allocator<SBanwordTable> >> = {
  101. _M_impl = {<std::allocator<SBanwordTable>> = {<__gnu_cxx::new_allocator<SBanwordTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x29a50000,
  102. _M_finish = 0x29a50b3b,
  103. _M_end_of_storage = 0x29a50c80}}, <No data fields>},
  104. m_vec_itemAttrTable = {<std::_Vector_base<TItemAttrTable, std::allocator<TItemAttrTable> >> = {
  105. _M_impl = {<std::allocator<TItemAttrTable>> = {<__gnu_cxx::new_allocator<TItemAttrTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x29a70000,
  106. _M_finish = 0x29a70b52,
  107. _M_end_of_storage = 0x29a70b52}}, <No data fields>},
  108. m_vec_itemRareTable = {<std::_Vector_base<TItemAttrTable, std::allocator<TItemAttrTable> >> = {
  109. _M_impl = {<std::allocator<TItemAttrTable>> = {<__gnu_cxx::new_allocator<--Type <RET> for more, q to quit, c to continue without paging--
  110. TItemAttrTable>> = {<No data fields>}, <No data fields>}, _M_start = 0x29a43000,
  111. _M_finish = 0x29a43564,
  112. _M_end_of_storage = 0x29a43564}}, <No data fields>},
  113. m_vec_kLandTable = {<std::_Vector_base<building::SLand, std::allocator<building::SLand> >> = {
  114. _M_impl = {<std::allocator<building::SLand>> = {<__gnu_cxx::new_allocator<building::SLand>> = {<No data fields>}, <No data fields>}, _M_start = 0x286a0000,
  115. _M_finish = 0x286a0f30,
  116. _M_end_of_storage = 0x286a0f30}}, <No data fields>},
  117. m_vec_kObjectProto = {<std::_Vector_base<building::SObjectProto, std::allocator<building::SObjectProto> >> = {
  118. _M_impl = {<std::allocator<building::SObjectProto>> = {<__gnu_cxx::new_allocator<building::SObjectProto>> = {<No data fields>}, <No data fields>},
  119. _M_start = 0x286a1000, _M_finish = 0x286a1f60,
  120. _M_end_of_storage = 0x286a1f60}}, <No data fields>},
  121. m_map_pkObjectTable = {_M_t = {
  122. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, building::SObject*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, building::SObject*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  123. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  124. _M_header = {_M_color = std::_S_red, _M_parent = 0x29dfd680,
  125. _M_left = 0x29dfd680, _M_right = 0x29dfd680},
  126. _M_node_count = 1}, <No data fields>}}}, m_bShutdowned = false,
  127. m_map_playerCache = {
  128. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CPlayerTableCache*> >, unsigned int, CPlayerTableCache*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {static nothrow_move_assignable = true,
  129. static nothrow_move_constructible = <optimized out>,
  130. current_ = false, funcs_ = {{data_ = {buf = "\372",
  131. align_ = -6 '\372'}}, {data_ = {buf = " ",
  132. align_ = 32 ' '}}}},
  133. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CPlayerTableCache*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CPlayerTableCache*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CPlayerTableCache*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>},
  134. bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
  135. buckets_ = 0x0}, <No data fields>}}, m_map_itemCache = {
  136. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CItemCache*> >, unsigned int, CItemCache*, b--Type <RET> for more, q to quit, c to continue without paging--
  137. oost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {
  138. static nothrow_move_assignable = true,
  139. static nothrow_move_constructible = <optimized out>,
  140. current_ = false, funcs_ = {{data_ = {buf = "\256",
  141. align_ = -82 '\256'}}, {data_ = {buf = " ",
  142. align_ = 32 ' '}}}},
  143. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemCache*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemCache*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemCache*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17,
  144. size_ = 0, mlf_ = 1, max_load_ = 0,
  145. buckets_ = 0x0}, <No data fields>}}, m_map_pkItemCacheSetPtr = {
  146. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, boost::unordered::unordered_set<CItemCache*, boost::hash<CItemCache*>, std::equal_to<CItemCache*>, std::allocator<CItemCache*> >*> >, unsigned int, boost::unordered::unordered_set<CItemCache*, boost::hash<CItemCache*>, std::equal_to<CItemCache*>, std::allocator<CItemCache*> >*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {
  147. static nothrow_move_assignable = true,
  148. static nothrow_move_constructible = <optimized out>,
  149. current_ = false, funcs_ = {{data_ = {buf = "\361",
  150. align_ = -15 '\361'}}, {data_ = {buf = "0",
  151. align_ = 48 '0'}}}},
  152. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, boost::unordered::unordered_set<CItemCache*, boost::hash<CItemCache*>, std::equal_to<CItemCache*>, std::allocator<CItemCache*> >*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, boost::unordered::unordered_set<CItemCache*, boost::hash<CItemCache*>, std::equal_to<CItemCache*>, std::allocator<CItemCache*> >*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, boost::unordered::unordered_set<CItemCache*, boost::hash<CItemCache*>, std::equal_to<CItemCache*>, std::allocator<CItemCache*> >*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17,
  153. size_ = 0, mlf_ = 1, max_load_ = 0,
  154. buckets_ = 0x0}, <No data fields>}}, m_mapItemPriceListCache = {
  155. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CItemPriceListTableCache*> >, unsigned int, CItemPriceListTableCache*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> --Type <RET> for more, q to quit, c to continue without paging--
  156. = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {static nothrow_move_assignable = true,
  157. static nothrow_move_constructible = <optimized out>,
  158. current_ = false, funcs_ = {{data_ = {buf = "\353",
  159. align_ = -21 '\353'}}, {data_ = {buf = "\277",
  160. align_ = -65 '\277'}}}},
  161. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemPriceListTableCache*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemPriceListTableCache*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CItemPriceListTableCache*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
  162. buckets_ = 0x0}, <No data fields>}}, m_mChannelStatus = {
  163. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<short const, unsigned char> >, short, unsigned char, boost::hash<short>, std::equal_to<short> > >> = {<boost::unordered::detail::functions<boost::hash<short>, std::equal_to<short> >> = {static nothrow_move_assignable = true,
  164. static nothrow_move_constructible = <optimized out>,
  165. current_ = false, funcs_ = {{data_ = {buf = "\334",
  166. align_ = -36 '\334'}}, {data_ = {buf = "\031",
  167. align_ = 25 '\031'}}}},
  168. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<short const, unsigned char> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<short const, unsigned char> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<short const, unsigned char> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1,
  169. max_load_ = 0, buckets_ = 0x0}, <No data fields>}},
  170. m_map_pkChannelParty = {_M_t = {
  171. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned char const, std::map<unsigned int, std::map<unsigned int, CClientManager::TPartyInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, CClientManager::TPartyInfo> > >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, std::map<unsigned int, CClientManager::TPartyInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, CClientManager::TPartyInfo> > > > > > > > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned char const, std::map<unsigned int, std::map<unsigned int, CClientManager::TPartyInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, CClientManager::TPartyInfo> > >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, std::map<unsigned int, CClientManager::TPartyInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, CClientManager::TPartyInfo> > > > > > > > >> = {<No data fields>}, <No data fields>}, <std::_--Type <RET> for more, q to quit, c to continue without paging--
  172. Rb_tree_key_compare<std::less<unsigned char> >> = {
  173. _M_key_compare = {<std::binary_function<unsigned char, unsigned char, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  174. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  175. _M_left = 0xbfbfeb88, _M_right = 0xbfbfeb88},
  176. _M_node_count = 0}, <No data fields>}}}, m_map_lEventFlag = {
  177. _M_t = {
  178. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, long> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, long> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >> = {
  179. _M_key_compare = {<std::binary_function<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {_M_header = {_M_color = std::_S_red,
  180. _M_parent = 0x2863fab0, _M_left = 0x2863fab0,
  181. _M_right = 0x2863fab0}, _M_node_count = 1}, <No data fields>}}},
  182. m_bLastHeader = 244 '\364', m_iCacheFlushCount = 0,
  183. m_iCacheFlushCountLimit = 200, m_itemRange = {dwMin = 2000000000,
  184. dwMax = 2100000000, dwUsableItemIDMin = 2000000000},
  185. m_vec_Locale = {<std::_Vector_base<tLocale, std::allocator<tLocale> >> = {
  186. _M_impl = {<std::allocator<tLocale>> = {<__gnu_cxx::new_allocator<tLocale>> = {<No data fields>}, <No data fields>}, _M_start = 0x2865e400,
  187. _M_finish = 0x2865e740,
  188. _M_end_of_storage = 0x2865e800}}, <No data fields>}, m_map_logout = {
  189. table_ = {<boost::unordered::detail::table<boost::unordered::detail::map<std::allocator<std::pair<unsigned int const, CClientManager::TLogoutPlayer*> >, unsigned int, CClientManager::TLogoutPlayer*, boost::hash<unsigned int>, std::equal_to<unsigned int> > >> = {<boost::unordered::detail::functions<boost::hash<unsigned int>, std::equal_to<unsigned int> >> = {static nothrow_move_assignable = true,
  190. static nothrow_move_constructible = <optimized out>,
  191. current_ = false, funcs_ = {{data_ = {buf = "J", align_ = 74 'J'}},
  192. {data_ = {buf = "\037", align_ = 31 '\037'}}}},
  193. allocators_ = {<boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_bucket>, 1>> = {<std::allocator<boost::unordered::detail::ptr_bucket>> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_bucket>> = {<No data fields>}, <No data fields>}, <No data fields>}, <boost::unordered::detail::compressed_base<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CClientManager::TLogoutPlayer*> > >, 2>> = {<std::allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CClientManager::TLogoutPlayer*> > >> = {<__gnu_cxx::new_allocator<boost::unordered::detail::ptr_node<std::pair<unsigned int const, CClientManager::TLogoutPlayer*> > >> = {<No data fields>}, <No data fields>}, <No data fields>}, <No data fields>}, bucket_count_ = 17, size_ = 0, mlf_ = 1, max_load_ = 0,
  194. buckets_ = 0x0}, <No data fields>}}}
  196. GuildManager = {<singleton<CGuildManager>> = {
  197. _vptr.singleton = 0x8196c2c <vtable for CGuildManager+8>,
  198. --Type <RET> for more, q to quit, c to continue without paging--
  199. static ms_singleton = 0xbfbfe83c}, m_map_kGuild = {_M_t = {
  200. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, SGuild> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, SGuild> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  201. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  202. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  203. _M_left = 0xbfbfe844, _M_right = 0xbfbfe844},
  204. _M_node_count = 0}, <No data fields>}}}, m_mapGuildWarEndTime = {
  205. _M_t = {
  206. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, std::map<unsigned int, int, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, int> > > > > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, std::map<unsigned int, int, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, int> > > > > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  207. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  208. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  209. _M_left = 0xbfbfe85c, _M_right = 0xbfbfe85c},
  210. _M_node_count = 0}, <No data fields>}}}, m_DeclareMap = {_M_t = {
  211. _M_impl = {<std::allocator<std::_Rb_tree_node<TGuildDeclareInfo> >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<TGuildDeclareInfo> >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<TGuildDeclareInfo> >> = {
  212. _M_key_compare = {<std::binary_function<TGuildDeclareInfo, TGuildDeclareInfo, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  213. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  214. _M_left = 0xbfbfe874, _M_right = 0xbfbfe874},
  215. _M_node_count = 0}, <No data fields>}}}, m_WarMap = {_M_t = {
  216. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, std::map<unsigned int, SGuildWarInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, SGuildWarInfo> > > > > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, std::map<unsigned int, SGuildWarInfo, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, SGuildWarInfo> > > > > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  217. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {_M_header = { _M_color = std::_S_red, _M_parent = 0x0, _M_left = 0xbfbfe88c,
  218. _M_right = 0xbfbfe88c}, _M_node_count = 0}, <No data fields>}}},
  219. m_pqOnWar = {
  220. c = {<std::_Vector_base<std::pair<int, TGuildWarPQElement*>, std::allocator<std::pair<int, TGuildWarPQElement*> > >> = {
  221. _M_impl = {<std::allocator<std::pair<int, TGuildWarPQElement*> >> = {<__gnu_cxx::new_allocator<std::pair<int, TGuildWarPQElement*> >> = {<No data fields>}, <No data fields>}, _M_start = 0x0, _M_finish = 0x0,
  222. _M_end_of_storage = 0x0}}, <No data fields>},
  223. --Type <RET> for more, q to quit, c to continue without paging--
  224. comp = {<std::binary_function<std::pair<int, TGuildWarPQElement*>, std::pair<int, TGuildWarPQElement*>, bool>> = {<No data fields>}, <No data fields>}},
  225. m_pqWaitStart = {
  226. c = {<std::_Vector_base<std::pair<int, TGuildWaitStartInfo>, std::allocator<std::pair<int, TGuildWaitStartInfo> > >> = {
  227. _M_impl = {<std::allocator<std::pair<int, TGuildWaitStartInfo> >> = {<__gnu_cxx::new_allocator<std::pair<int, TGuildWaitStartInfo> >> = {<No data fields>}, <No data fields>}, _M_start = 0x0, _M_finish = 0x0,
  228. _M_end_of_storage = 0x0}}, <No data fields>},
  229. comp = {<std::binary_function<std::pair<int, TGuildWaitStartInfo>, std::pair<int, TGuildWaitStartInfo>, bool>> = {<No data fields>}, <No data fields>}},
  230. m_pqSkill = {
  231. c = {<std::_Vector_base<std::pair<int, TGuildSkillUsed>, std::allocator<std::pair<int, TGuildSkillUsed> > >> = {
  232. _M_impl = {<std::allocator<std::pair<int, TGuildSkillUsed> >> = {<__gnu_cxx::new_allocator<std::pair<int, TGuildSkillUsed> >> = {<No data fields>}, <No data fields>}, _M_start = 0x0, _M_finish = 0x0,
  233. _M_end_of_storage = 0x0}}, <No data fields>},
  234. comp = {<std::binary_function<std::pair<int, TGuildSkillUsed>, std::pair<int, TGuildSkillUsed>, bool>> = {<No data fields>}, <No data fields>}},
  235. m_map_kWarReserve = {_M_t = {
  236. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, CGuildWarReserve*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, CGuildWarReserve*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  237. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  238. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  239. _M_left = 0xbfbfe8d4, _M_right = 0xbfbfe8d4},
  240. _M_node_count = 0}, <No data fields>}}},
  241. polyPower = <incomplete type>, polyHandicap = <incomplete type>,
  242. map_kLadderPointRankingByGID = {_M_t = {
  243. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  244. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  245. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  246. _M_left = 0xbfbfe9c4, _M_right = 0xbfbfe9c4},
  247. _M_node_count = 0}, <No data fields>}}}}
  248. PrivManager = {<singleton<CPrivManager>> = {
  249. _vptr.singleton = 0x8196f0c <vtable for CPrivManager+8>,
  250. static ms_singleton = 0xbfbfe6c8}, m_pqPrivChar = {
  251. c = {<std::_Vector_base<std::pair<int, TPrivCharData*>, std::allocator<std::pair<int, TPrivCharData*> > >> = {
  252. _M_impl = {<std::allocator<std::pair<int, TPrivCharData*> >> = {<__gnu_cxx::new_allocator<std::pair<int, TPrivCharData*> >> = {<No data fields>}, <No data fie--Type <RET> for more, q to quit, c to continue without paging--
  253. lds>}, _M_start = 0x0, _M_finish = 0x0, _M_end_of_storage = 0x0}}, <No data fields>},
  254. comp = {<std::binary_function<std::pair<int, TPrivCharData*>, std::pair<int, TPrivCharData*>, bool>> = {<No data fields>}, <No data fields>}}, m_pqPrivGuild = {
  255. c = {<std::_Vector_base<std::pair<int, TPrivGuildData*>, std::allocator<std::pair<int, TPrivGuildData*> > >> = {
  256. _M_impl = {<std::allocator<std::pair<int, TPrivGuildData*> >> = {<__gnu_cxx::new_allocator<std::pair<int, TPrivGuildData*> >> = {<No data fields>}, <No data fields>}, _M_start = 0x0, _M_finish = 0x0,
  257. _M_end_of_storage = 0x0}}, <No data fields>},
  258. comp = {<std::binary_function<std::pair<int, TPrivGuildData*>, std::pair<int, TPrivGuildData*>, bool>> = {<No data fields>}, <No data fields>}},
  259. m_pqPrivEmpire = {
  260. c = {<std::_Vector_base<std::pair<int, TPrivEmpireData*>, std::allocator<std::pair<int, TPrivEmpireData*> > >> = {
  261. _M_impl = {<std::allocator<std::pair<int, TPrivEmpireData*> >> = {<__gnu_cxx::new_allocator<std::pair<int, TPrivEmpireData*> >> = {<No data fields>}, <No data fields>}, _M_start = 0x0, _M_finish = 0x0,
  262. _M_end_of_storage = 0x0}}, <No data fields>},
  263. comp = {<std::binary_function<std::pair<int, TPrivEmpireData*>, std::pair<int, TPrivEmpireData*>, bool>> = {<No data fields>}, <No data fields>}},
  264. m_aaPrivEmpire = {{0x0, 0x0, 0x0, 0x0}, {0x0, 0x0, 0x0, 0x0}, {0x0, 0x0,
  265. 0x0, 0x0}, {0x0, 0x0, 0x0, 0x0}, {0x0, 0x0, 0x0, 0x0}}, m_aPrivGuild = {
  266. {_M_t = {
  267. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  268. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  269. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  270. _M_left = 0xbfbfe750, _M_right = 0xbfbfe750},
  271. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  272. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  273. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  274. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  275. _M_left = 0xbfbfe768, _M_right = 0xbfbfe768},
  276. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  277. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  278. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  279. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  280. --Type <RET> for more, q to quit, c to continue without paging--
  281. _M_left = 0xbfbfe780, _M_right = 0xbfbfe780},
  282. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  283. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  284. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  285. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  286. _M_left = 0xbfbfe798, _M_right = 0xbfbfe798},
  287. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  288. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivGuildData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  289. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  290. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  291. _M_left = 0xbfbfe7b0, _M_right = 0xbfbfe7b0},
  292. _M_node_count = 0}, <No data fields>}}}}, m_aPrivChar = {{_M_t = {
  293. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  294. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  295. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  296. _M_left = 0xbfbfe7c8, _M_right = 0xbfbfe7c8},
  297. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  298. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  299. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  300. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  301. _M_left = 0xbfbfe7e0, _M_right = 0xbfbfe7e0},
  302. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  303. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  304. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  305. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  306. _M_left = 0xbfbfe7f8, _M_right = 0xbfbfe7f8},
  307. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  308. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int co--Type <RET> for more, q to quit, c to continue without paging--
  309. nst, TPrivCharData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  310. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  311. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  312. _M_left = 0xbfbfe810, _M_right = 0xbfbfe810},
  313. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  314. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TPrivCharData*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  315. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  316. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  317. _M_left = 0xbfbfe828, _M_right = 0xbfbfe828},
  318. _M_node_count = 0}, <No data fields>}}}}}
  319. MoneyLog = {<singleton<CMoneyLog>> = {
  320. _vptr.singleton = 0x8196f50 <vtable for CMoneyLog+8>,
  321. static ms_singleton = 0xbfbfe494}, m_MoneyLogContainer = {{_M_t = {
  322. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  323. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  324. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  325. _M_left = 0xbfbfe49c, _M_right = 0xbfbfe49c},
  326. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  327. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  328. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  329. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  330. _M_left = 0xbfbfe4b4, _M_right = 0xbfbfe4b4},
  331. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  332. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  333. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  334. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  335. _M_left = 0xbfbfe4cc, _M_right = 0xbfbfe4cc},
  336. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  337. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int co--Type <RET> for more, q to quit, c to continue without paging--
  338. nst, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  339. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  340. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  341. _M_left = 0xbfbfe4e4, _M_right = 0xbfbfe4e4},
  342. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  343. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  344. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  345. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  346. _M_left = 0xbfbfe4fc, _M_right = 0xbfbfe4fc},
  347. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  348. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  349. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  350. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  351. _M_left = 0xbfbfe514, _M_right = 0xbfbfe514},
  352. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  353. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  354. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  355. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  356. _M_left = 0xbfbfe52c, _M_right = 0xbfbfe52c},
  357. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  358. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  359. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  360. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  361. _M_left = 0xbfbfe544, _M_right = 0xbfbfe544},
  362. _M_node_count = 0}, <No data fields>}}}, {_M_t = {
  363. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, int> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  364. --Type <RET> for more, q to quit, c to continue without paging--
  365. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  366. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  367. _M_left = 0xbfbfe55c, _M_right = 0xbfbfe55c},
  368. _M_node_count = 0}, <No data fields>}}}}}
  369. ItemAwardManager = {<singleton<ItemAwardManager>> = {
  370. _vptr.singleton = 0x81970f4 <vtable for ItemAwardManager+8>,
  371. static ms_singleton = 0xbfbfe3bc}, m_map_award = {_M_t = {
  372. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, SItemAward*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, SItemAward*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  373. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  374. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  375. _M_left = 0xbfbfe3c4, _M_right = 0xbfbfe3c4},
  376. _M_node_count = 0}, <No data fields>}}}, m_map_kSetAwardByLogin = {
  377. _M_t = {
  378. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::set<SItemAward*, std::less<SItemAward*>, std::allocator<SItemAward*> > > > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::set<SItemAward*, std::less<SItemAward*>, std::allocator<SItemAward*> > > > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >> = {
  379. _M_key_compare = {<std::binary_function<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {_M_header = {_M_color = std::_S_red,
  380. _M_parent = 0x0, _M_left = 0xbfbfe3dc, _M_right = 0xbfbfe3dc},
  381. _M_node_count = 0}, <No data fields>}}}}
  383. MarriageManager = {<singleton<marriage::CManager>> = {
  384. _vptr.singleton = 0x81976e8 <vtable for marriage::CManager+8>,
  385. static ms_singleton = 0xbfbfe428}, m_Marriages = {_M_t = {
  386. _M_impl = {<std::allocator<std::_Rb_tree_node<marriage::TMarriage*> >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<marriage::TMarriage*> >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<marriage::TMarriage*> >> = {
  387. _M_key_compare = {<std::binary_function<marriage::TMarriage*, marriage::TMarriage*, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  388. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  389. _M_left = 0xbfbfe430, _M_right = 0xbfbfe430},
  390. _M_node_count = 0}, <No data fields>}}}, m_MarriageByPID = {_M_t = {
  391. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, marriage::TMarriage*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, marriage::TMarriage*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  392. --Type <RET> for more, q to quit, c to continue without paging--
  393. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  394. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  395. _M_left = 0xbfbfe448, _M_right = 0xbfbfe448},
  396. _M_node_count = 0}, <No data fields>}}}, m_pqWeddingStart = {
  397. c = {<std::_Vector_base<marriage::TWedding, std::allocator<marriage::TWedding> >> = {
  398. _M_impl = {<std::allocator<marriage::TWedding>> = {<__gnu_cxx::new_allocator<marriage::TWedding>> = {<No data fields>}, <No data fields>}, _M_start = 0x0,
  399. _M_finish = 0x0, _M_end_of_storage = 0x0}}, <No data fields>},
  400. comp = {<std::binary_function<marriage::TWedding, marriage::TWedding, bool>> = {<No data fields>}, <No data fields>}}, m_pqWeddingEnd = {
  401. c = {<std::_Vector_base<marriage::TWeddingInfo, std::allocator<marriage::TWeddingInfo> >> = {
  402. _M_impl = {<std::allocator<marriage::TWeddingInfo>> = {<__gnu_cxx::new_allocator<marriage::TWeddingInfo>> = {<No data fields>}, <No data fields>},
  403. _M_start = 0x0, _M_finish = 0x0,
  404. _M_end_of_storage = 0x0}}, <No data fields>},
  405. comp = {<std::binary_function<marriage::TWeddingInfo, marriage::TWeddingInfo, bool>> = {<No data fields>}, <No data fields>}}, m_mapRunningWedding = {_M_t = {
  406. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<std::pair<unsigned int, unsigned int> const, marriage::TWedding> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<std::pair<unsigned int, unsigned int> const, marriage::TWedding> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<std::pair<unsigned int, unsigned int> > >> = {
  407. _M_key_compare = {<std::binary_function<std::pair<unsigned int, unsigned int>, std::pair<unsigned int, unsigned int>, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {_M_header = {_M_color = std::_S_red,
  408. _M_parent = 0x0, _M_left = 0xbfbfe480, _M_right = 0xbfbfe480},
  409. _M_node_count = 0}, <No data fields>}}}}
  410. Monarch = {<singleton<CMonarch>> = {
  411. _vptr.singleton = 0x8197a6c <vtable for CMonarch+8>,
  412. static ms_singleton = 0xbfbfe570}, m_map_MonarchElection = {_M_t = {
  413. _M_impl = {<std::allocator<std::_Rb_tree_node<std::pair<unsigned int const, TMonarchElectionInfo*> > >> = {<__gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, TMonarchElectionInfo*> > >> = {<No data fields>}, <No data fields>}, <std::_Rb_tree_key_compare<std::less<unsigned int> >> = {
  414. _M_key_compare = {<std::binary_function<unsigned int, unsigned int, bool>> = {<No data fields>}, <No data fields>}}, <std::_Rb_tree_header> = {
  415. _M_header = {_M_color = std::_S_red, _M_parent = 0x0,
  416. _M_left = 0xbfbfe578, _M_right = 0xbfbfe578},
  417. _M_node_count = 0}, <No data fields>}}},
  418. m_vec_MonarchCandidacy = {<std::_Vector_base<tMonarchCandidacy, std::allocator<tMonarchCandidacy> >> = {
  419. _M_impl = {<std::allocator<tMonarchCandidacy>> = {<__gnu_cxx::new_allocator<tMonarchCandidacy>> = {<No data fields>}, <No data fields>}, _M_start = 0x0,
  420. _M_finish = 0x0, _M_end_of_storage = 0x0}}, <No data fields>},
  421. m_MonarchInfo = {pid = {0, 0, 0, 0}, money = {0, 0, 0, 0}, name = {
  422. --Type <RET> for more, q to quit, c to continue without paging--
  423. '\000' <repeats 31 times>, '\000' <repeats 31 times>,
  424. '\000' <repeats 31 times>, '\000' <repeats 31 times>}, date = {
  425. '\000' <repeats 31 times>, '\000' <repeats 31 times>,
  426. '\000' <repeats 31 times>, '\000' <repeats 31 times>}}}
  427. BlockCountry = {<singleton<CBlockCountry>> = {
  428. _vptr.singleton = 0x8197bb0 <vtable for CBlockCountry+8>,
  429. static ms_singleton = 0xbfbfe3a0},
  430. m_block_ip = {<std::_Vector_base<CBlockCountry::BLOCK_IP*, std::allocator<CBlockCountry::BLOCK_IP*> >> = {
  431. _M_impl = {<std::allocator<CBlockCountry::BLOCK_IP*>> = {<__gnu_cxx::new_allocator<CBlockCountry::BLOCK_IP*>> = {<No data fields>}, <No data fields>},
  432. _M_start = 0x286421d8, _M_finish = 0x286421dc,
  433. _M_end_of_storage = 0x286421dc}}, <No data fields>},
  434. m_block_exception = {<std::_Vector_base<char const*, std::allocator<char const*> >> = {
  435. _M_impl = {<std::allocator<char const*>> = {<__gnu_cxx::new_allocator<char const*>> = {<No data fields>}, <No data fields>}, _M_start = 0x286421e8,
  436. _M_finish = 0x286421ec,
  437. _M_end_of_storage = 0x286421ec}}, <No data fields>}}
  438. ItemIDRangeManager = {<singleton<CItemIDRangeManager>> = {
  439. _vptr.singleton = 0x818e4d0 <vtable for CItemIDRangeManager+8>,
  440. static ms_singleton = 0xbfbfe374}, static cs_dwMaxItemID = 4290000000,
  441. static cs_dwMinimumRange = 10000000,
  442. static cs_dwMinimumRemainCount = 10000,
  443. m_listData = {<std::__cxx11::_List_base<tItemIDRange, std::allocator<tItemIDRange> >> = {
  444. _M_impl = {<std::allocator<std::_List_node<tItemIDRange> >> = {<__gnu_cxx::new_allocator<std::_List_node<tItemIDRange> >> = {<No data fields>}, <No data fields>}, _M_node = {<std::__detail::_List_node_base> = {_M_next = 0x29dfd6a0,
  445. _M_prev = 0x29bffaa0}, _M_storage = {
  446. _M_storage = "\241\001\000"}}}}, <No data fields>}}
  447. iCount = <optimized out>
  448. (gdb)
  449. (gdb)
  450. (gdb)