mm.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485
  1. /****************************************************************************
  2. *
  3. * MODULE: iostream
  4. *
  5. * COPYRIGHT (C) 2007 Laura Toma
  6. *
  7. *
  8. * Iostream is a library that implements streams, external memory
  9. * sorting on streams, and an external memory priority queue on
  10. * streams. These are the fundamental components used in external
  11. * memory algorithms.
  12. * Credits: The library was developed by Laura Toma. The kernel of
  13. * class STREAM is based on the similar class existent in the GPL TPIE
  14. * project developed at Duke University. The sorting and priority
  15. * queue have been developed by Laura Toma based on communications
  16. * with Rajiv Wickremesinghe. The library was developed as part of
  17. * porting Terraflow to GRASS in 2001. PEARL upgrades in 2003 by
  18. * Rajiv Wickremesinghe as part of the Terracost project.
  19. *
  20. * This program is free software; you can redistribute it and/or modify
  21. * it under the terms of the GNU General Public License as published by
  22. * the Free Software Foundation; either version 2 of the License, or
  23. * (at your option) any later version.
  24. *
  25. * This program is distributed in the hope that it will be useful,
  26. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  27. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  28. * General Public License for more details. *
  29. * **************************************************************************/
  30. // A simple registration based memory manager.
  31. #include <stdio.h>
  32. #include <stdlib.h>
  33. #include <assert.h>
  34. #include <iostream>
  35. using namespace std;
  36. //#include <mm.h>
  37. #include <grass/iostream/mm.h>
  38. #define MM_DEBUG if(0)
  39. /* ************************************************************ */
  40. MM_register::MM_register() {
  41. instances++;
  42. if (instances > 1) {
  43. cerr << "MM_register(): Only 1 instance of MM_register should exist.\n";
  44. assert(0); //core dump if debugging
  45. exit(1);
  46. }
  47. assert(instances == 1);
  48. // by default, we ignore if memory limit is exceeded
  49. register_new = MM_IGNORE_MEMORY_EXCEEDED;
  50. }
  51. /* ************************************************************ */
  52. MM_register::~MM_register(void) {
  53. if (instances > 1) {
  54. cerr << "MM_register(): Only 1 instance of MM_register should exist.\n";
  55. assert(0); //core dump if debugging
  56. exit(1);
  57. }
  58. assert(instances == 1);
  59. instances--;
  60. }
  61. /* ************************************************************ */
  62. void MM_register::print() {
  63. size_t availMB = (remaining >> 20);
  64. if (remaining) {
  65. cout << "available memory: " << availMB << "MB "
  66. << "(" << remaining << "B)"
  67. << endl;
  68. } else {
  69. cout << "available memory: " << remaining << "B, exceeding: "
  70. << used - user_limit << "B"
  71. << endl;
  72. }
  73. }
  74. /* ************************************************************ */
  75. // User-callable method to set allowable memory size
  76. MM_err MM_register::set_memory_limit (size_t new_limit) {
  77. assert( new_limit > 0);
  78. if (used > new_limit) {
  79. // return MM_ERROR_EXCESSIVE_ALLOCATION;
  80. switch (register_new) {
  81. case MM_ABORT_ON_MEMORY_EXCEEDED:
  82. cerr << " MM_register::set_memory_limit to " << new_limit
  83. << ", used " << used << ". allocation exceeds new limit.\n";
  84. cerr.flush();
  85. assert(0); //core dump if debugging
  86. exit(1);
  87. break;
  88. case MM_WARN_ON_MEMORY_EXCEEDED:
  89. cerr << " MM_register::set_memory_limit to " << new_limit
  90. << ", used " << used << ". allocation exceeds new limit.\n";
  91. break;
  92. case MM_IGNORE_MEMORY_EXCEEDED:
  93. break;
  94. }
  95. user_limit = new_limit;
  96. remaining = 0;
  97. return MM_ERROR_NO_ERROR;
  98. }
  99. assert(used <= new_limit);
  100. // These are unsigned, so be careful.
  101. if (new_limit < user_limit) {
  102. remaining -= user_limit - new_limit;
  103. } else {
  104. remaining += new_limit - user_limit;
  105. }
  106. user_limit = new_limit;
  107. return MM_ERROR_NO_ERROR;
  108. }
  109. /* ************************************************************ */
  110. //only warn if memory limit exceeded
  111. void MM_register::warn_memory_limit() {
  112. register_new = MM_WARN_ON_MEMORY_EXCEEDED;
  113. }
  114. /* ************************************************************ */
  115. //abort if memory limit exceeded
  116. void MM_register::enforce_memory_limit() {
  117. register_new = MM_ABORT_ON_MEMORY_EXCEEDED;
  118. if (used > user_limit) {
  119. cerr << " MM_register::enforce_memory_limit: limit=" << user_limit
  120. << ", used=" << used << ". allocation exceeds limit.\n";
  121. assert(0); //core dump if debugging
  122. exit(1);
  123. }
  124. }
  125. /* ************************************************************ */
  126. //ignore memory limit accounting
  127. void MM_register::ignore_memory_limit() {
  128. register_new = MM_IGNORE_MEMORY_EXCEEDED;
  129. }
  130. /* ************************************************************ */
  131. // provide accounting state
  132. MM_mode MM_register::get_limit_mode() {
  133. return register_new;
  134. }
  135. /* ************************************************************ */
  136. // provide print ccounting state
  137. void MM_register::print_limit_mode() {
  138. cout << "Memory manager registering memory in ";
  139. switch (register_new) {
  140. case MM_ABORT_ON_MEMORY_EXCEEDED:
  141. cout << "MM_ABORT_ON_MEMORY_EXCEEDED";
  142. break;
  143. case MM_WARN_ON_MEMORY_EXCEEDED:
  144. cout << "MM_WARN_ON_MEMORY_EXCEEDED";
  145. break;
  146. case MM_IGNORE_MEMORY_EXCEEDED:
  147. cout << "MM_IGNORE_MEMORY_EXCEEDED";
  148. break;
  149. }
  150. cout << " mode." << endl;
  151. }
  152. /* ************************************************************ */
  153. //return the amount of memory available before user-specified memory
  154. //limit will be exceeded
  155. size_t MM_register::memory_available() {
  156. return remaining;
  157. }
  158. /* ************************************************************ */
  159. size_t MM_register::memory_used() {
  160. return used;
  161. }
  162. /* ************************************************************ */
  163. size_t MM_register::memory_limit() {
  164. return user_limit;
  165. }
  166. /* ---------------------------------------------------------------------- */
  167. // return the overhead on each memory allocation request
  168. // SIZE_SPACE is to ensure alignment on quad word boundaries. It may be
  169. // possible to check whether a machine needs this at configuration
  170. // time or if dword alignment is ok. On the HP 9000, bus errors occur
  171. // when loading doubles that are not qword aligned.
  172. static const size_t SIZE_SPACE=(sizeof(size_t) > 8 ? sizeof(size_t) : 8);
  173. int MM_register::space_overhead () {
  174. return SIZE_SPACE;
  175. }
  176. /* ************************************************************ */
  177. // check that new allocation request is below user-defined limit.
  178. // This should be a private method, only called by operator new.
  179. MM_err MM_register::register_allocation(size_t request) {
  180. if (request > remaining) {
  181. remaining = 0;
  182. used += request;
  183. return MM_ERROR_INSUFFICIENT_SPACE;
  184. } else {
  185. used += request;
  186. remaining -= request;
  187. return MM_ERROR_NO_ERROR;
  188. }
  189. }
  190. /* ************************************************************ */
  191. // do the accounting for a memory deallocation request.
  192. // This should be a private method, only called by operators
  193. // delete and delete [].
  194. MM_err MM_register::register_deallocation(size_t sz) {
  195. if (sz > used) {
  196. used = 0;
  197. remaining = user_limit;
  198. return MM_ERROR_UNDERFLOW;
  199. } else {
  200. used -= sz;
  201. if (used < user_limit) {
  202. remaining = user_limit - used;
  203. } else {
  204. assert(remaining == 0);
  205. }
  206. return MM_ERROR_NO_ERROR;
  207. }
  208. }
  209. /* ************************************************************ */
  210. void* operator new[] (size_t sz) {
  211. void *p;
  212. MM_DEBUG cout << "new: sz=" << sz << ", register "
  213. << sz+SIZE_SPACE << "B ,";
  214. if (MM_manager.register_allocation (sz + SIZE_SPACE) != MM_ERROR_NO_ERROR){
  215. //must be MM_ERROR_INSUF_SPACE
  216. switch(MM_manager.register_new) {
  217. case MM_ABORT_ON_MEMORY_EXCEEDED:
  218. cerr << "MM error: limit ="<< MM_manager.memory_limit() <<"B. "
  219. << "allocating " << sz << "B. "
  220. << "limit exceeded by "
  221. << MM_manager.memory_used() - MM_manager.memory_limit()<<"B."
  222. << endl;
  223. assert (0); // core dump if debugging
  224. exit (1);
  225. break;
  226. case MM_WARN_ON_MEMORY_EXCEEDED:
  227. cerr << "MM warning: limit="<<MM_manager.memory_limit() <<"B. "
  228. << "allocating " << sz << "B. "
  229. << " limit exceeded by "
  230. << MM_manager.memory_used() - MM_manager.memory_limit()<<"B."
  231. << endl;
  232. break;
  233. case MM_IGNORE_MEMORY_EXCEEDED:
  234. break;
  235. }
  236. }
  237. p = malloc(sz + SIZE_SPACE);
  238. if (!p) {
  239. cerr << "new: out of memory while allocating " << sz << "B" << endl;
  240. assert(0);
  241. exit (1);
  242. }
  243. *((size_t *) p) = sz;
  244. MM_DEBUG cout << "ptr=" << (void*) (((char *) p) + SIZE_SPACE) << endl;
  245. return ((char *) p) + SIZE_SPACE;
  246. }
  247. /* ************************************************************ */
  248. void* operator new (size_t sz) {
  249. void *p;
  250. MM_DEBUG cout << "new: sz=" << sz << ", register "
  251. << sz+SIZE_SPACE << "B ,";
  252. if (MM_manager.register_allocation (sz + SIZE_SPACE) != MM_ERROR_NO_ERROR){
  253. //must be MM_ERROR_INSUF_SPACE
  254. switch(MM_manager.register_new) {
  255. case MM_ABORT_ON_MEMORY_EXCEEDED:
  256. cerr << "MM error: limit ="<< MM_manager.memory_limit() <<"B. "
  257. << "allocating " << sz << "B. "
  258. << "limit exceeded by "
  259. << MM_manager.memory_used() - MM_manager.memory_limit()<<"B."
  260. << endl;
  261. assert (0); // core dump if debugging
  262. exit (1);
  263. break;
  264. case MM_WARN_ON_MEMORY_EXCEEDED:
  265. cerr << "MM warning: limit="<<MM_manager.memory_limit() <<"B. "
  266. << "allocating " << sz << "B. "
  267. << " limit exceeded by "
  268. << MM_manager.memory_used() - MM_manager.memory_limit()<<"B."
  269. << endl;
  270. break;
  271. case MM_IGNORE_MEMORY_EXCEEDED:
  272. break;
  273. }
  274. }
  275. p = malloc(sz + SIZE_SPACE);
  276. if (!p) {
  277. cerr << "new: out of memory while allocating " << sz << "B" << endl;
  278. assert(0);
  279. exit (1);
  280. }
  281. *((size_t *) p) = sz;
  282. MM_DEBUG cout << "ptr=" << (void*) (((char *) p) + SIZE_SPACE) << endl;
  283. return ((char *) p) + SIZE_SPACE;
  284. }
  285. /* ---------------------------------------------------------------------- */
  286. void operator delete (void *ptr) {
  287. size_t sz;
  288. void *p;
  289. MM_DEBUG cout << "delete: ptr=" << ptr << ",";
  290. if (!ptr) {
  291. cerr << "MM warning: operator delete was given a NULL pointer\n";
  292. cerr.flush();
  293. //this may actually happen: for instance when calling a default
  294. //destructor for something that was not allocated with new
  295. //e.g. ofstream str(name) ---- ~ofstream() called ==> ptr=NULL
  296. //who wrote the above comment? -RW
  297. assert(0);
  298. //exit(1);
  299. return;
  300. }
  301. assert(ptr);
  302. p = ((char *)ptr) - SIZE_SPACE; // the base of memory
  303. sz = *((size_t *)p);
  304. MM_DEBUG cout << "size=" << sz <<", free " << p << "B and deallocate "
  305. << sz + SIZE_SPACE << endl;
  306. if(MM_manager.register_deallocation (sz + SIZE_SPACE) != MM_ERROR_NO_ERROR){
  307. //must be MM_ERROR_UNDERFLOW
  308. cerr << "delete: MM_manager.register_deallocation failed\n";
  309. assert(0);
  310. exit(1);
  311. }
  312. free(p);
  313. }
  314. /* ---------------------------------------------------------------------- */
  315. void operator delete[] (void *ptr) {
  316. size_t sz;
  317. void *p;
  318. MM_DEBUG cout << "delete[]: ptr=" << ptr << ",";
  319. if (!ptr) {
  320. //can this hapen? -- it does: see delete above
  321. cerr << "MM warning: operator delete [] was given a NULL pointer\n";
  322. cerr.flush();
  323. //assert(0);
  324. //exit(1);
  325. return;
  326. }
  327. assert(ptr);
  328. p = ((char *)ptr) - SIZE_SPACE; // the base of memory
  329. sz = *((size_t *)p);
  330. MM_DEBUG cout << "size=" << sz <<", free " << p << "B and deallocate "
  331. << sz + SIZE_SPACE << endl;
  332. if(MM_manager.register_deallocation (sz + SIZE_SPACE)!= MM_ERROR_NO_ERROR){
  333. //must be MM_ERROR_UNDERFLOW
  334. cerr << "delete[]: MM_manager.register_deallocation failed\n";
  335. assert(0);
  336. exit(1);
  337. }
  338. free(p);
  339. }
  340. /* ************************************************************ */
  341. // Instantiate the actual memory manager, and allocate the
  342. // its static data members
  343. MM_register MM_manager;
  344. int MM_register::instances = 0; // Number of instances. (init)
  345. // TPIE's "register memory requests" flag
  346. MM_mode MM_register::register_new = MM_IGNORE_MEMORY_EXCEEDED;
  347. //This causes constructors for static variables to fail
  348. //MM_mode MM_register::register_new = MM_ABORT_ON_MEMORY_EXCEEDED;
  349. /* ************************************************************ */
  350. // The counter of mm_register_init instances. It is implicity set to 0.
  351. unsigned int mm_register_init::count;
  352. // The constructor and destructor that ensure that the memory manager is
  353. // created exactly once, and destroyed when appropriate.
  354. mm_register_init::mm_register_init(void) {
  355. if (count++ == 0) {
  356. MM_manager.set_memory_limit(MM_DEFAULT_MM_SIZE);
  357. }
  358. }
  359. mm_register_init::~mm_register_init(void) {
  360. --count;
  361. }