Polaris: HeapStats.cc Source File

HeapStats.cc Go to the documentation of this file. /// /// \file HeapStats.cc //Modification History: /// 98-05-20 evansl@cs.tamu.edu(Larry Evans) /// WHAT: /// 1.added operator new[] and operator delete[] /// 2.Removed all but call to HeapStats::_hs_delete from operator /// delete(void*). /// WHY: /// 1.to avoid misleading memory leak reports. /// 2.The changes made to Listable::operator delete(void*) and /// dec_refs_delete_or_zombie make the removed code useless. /// #ifdef POLARIS_GNU_PRAGMAS #pragma implementation #endif /// /// #include <new> #include <iostream.h> #include <stdlib.h> #include "Listable.h" #include "HeapStats.h" #include "Collection/Map.h" #include "p-assert.h" #include "GC_TRACE_MACS.h" template class TypedBaseMap<HeapObject,HeapElem>; template class ProtoMap<HeapObject,HeapElem>; template class Map<HeapObject,HeapElem>; template ostream & operator << (ostream &, const Map<HeapObject,HeapElem> &); template class KeyIterator<HeapObject,HeapElem>; int HeapStats::collect_news = 0; int HeapStats::collect_dels = 0; int HeapStats::num_news = 0; int HeapStats::num_deletes = 0; Map<HeapObject,HeapElem> *HeapStats::objs = 0; void HeapStats::stop() { collect_news = 0; collect_dels = 0; } void HeapStats::stop_news() { collect_news = 0; } void HeapStats::stop_dels() { collect_dels = 0; } void HeapStats::restart() { collect_news = 1; collect_dels = 1; } void HeapStats::start() { collect_news = 1; collect_dels = 1; } void HeapStats::start_news() { collect_news = 1; } void HeapStats::start_dels() { collect_dels = 1; } void HeapStats::report(ostream & o) { o << num_news << " operator new calls\n"; o << num_deletes << " operator delete calls\n"; } void HeapStats::reset(void) { if (objs != 0) delete objs; objs = 0; num_news = 0; num_deletes = 0; } int HeapStats::memory_leak(void) { return (num_news != num_deletes); } void HeapStats::print_memory_leaks(ostream & o) { if (objs == 0 || objs->entries() == 0) o << "There are no memory leaks\n"; else { int num_leaks = objs->entries(); o << "There are " << num_leaks << " memory leaks:\n"; for (const HeapObject *p = objs->first_ref(); p != 0; p = objs->successor_ref(*p)) { HeapElem *curr = objs->find_ref(*p); o << " ptr = " << curr->ptr; o << ", size = " << curr->size; #ifdef LISTABLE_DEBUG Listable & elem = *(Listable *) curr->ptr; if (elem.fingerprint_ok()) o << ", \"" << elem << "\""; #endif o << "\n"; } } } void * //HeapStats::_hs_record( void *new_obj, size_t sz ) HeapStats::_hs_record( void *new_obj, unsigned int sz ) { char *ptr = CASTAWAY(char *) new_obj; #if POLARIS_DEBUG for (int count = sz; count > 0; --count) *ptr++ = 0x57; #endif if (collect_news) { num_news += 1; collect_news = 0;/// ... to prevent recording following news HeapElem *new_elem = new HeapElem; new_elem->ptr = new_obj; new_elem->size = sz; if (objs == 0) { objs = new Map<HeapObject,HeapElem>; } HeapObject *addr = (HeapObject *) new_obj; objs->ins( *addr, new_elem ); collect_news = 1;/// ... to restart recording news } return new_obj; } static void* //check_new(size_t sz) check_new(unsigned int sz) { #ifdef CLASS_INSTANCE_REGISTRY void *new_obj = pmalloc(sz); #else void *new_obj = malloc(sz); #endif #ifdef GC_TRACE_ALLOC_FREE cout<<"ALLOC:"<<new_obj<<endl; #endif if (! new_obj) p_abort( "no more swap space" ); return new_obj; } void * //HeapStats::_hs_new(size_t sz) HeapStats::_hs_new(unsigned int sz) { void *new_obj = check_new(sz); return new_obj; /// return _hs_record( new_obj, sz ); } void HeapStats::_hs_remove(void *p) { if (p) { Listable* lp=(Listable*)p; /// ... cout<<"+HeapStats::_hs_remove:"<<p<<endl; if (collect_dels) { num_deletes += 1; collect_dels = 0; if (objs != 0) { HeapObject *addr = (HeapObject *) p; HeapElem *curr = objs->find_ref(*addr); if (curr != 0) objs->del(*addr); } collect_dels = 1; } /// ... cout<<"-HeapStats::_hs_remove:"<<p<<endl; } } void HeapStats::_hs_delete(void *p) { if (p) { /// _hs_remove( p ); #ifdef GC_TRACE_ALLOC_FREE cout<<"FREE:"<<p<<endl; #endif #ifdef CLASS_INSTANCE_REGISTRY pfree(p); #else free(p); #endif } } void * //operator new(size_t sz) operator new(unsigned int sz)throw (std::bad_alloc) { void* p=HeapStats::_hs_new(sz); #ifdef GC_TRACE_NEWS cout<<"operator new:ptr="<<p<<" size="<<sz<<endl; #endif return p; } void operator delete(void *p)throw () { #ifdef GC_TRACE_DELETES cout<<"operator delete:"<<p<<endl; #endif HeapStats::_hs_delete(p); } #define NEW_VEC #ifdef NEW_VEC void * //operator new[](size_t sz) operator new[](unsigned int sz) { ; void* p=operator new(sz) //; cout<<"new[]:"<<p<<endl ; return p ;} #endif #define DELETE_VEC #ifdef DELETE_VEC void operator delete[](void* p) { //; cout<<"delete[]:"<<p<<endl ; operator delete(p) ;} #endif Listable* HeapElem::listable_clone() const { return 0; } void HeapElem::print(ostream &o) const { o << " ptr = " << this->ptr; o << ", size = " << this->size; Listable & listable = *(Listable *) this->ptr; if (listable.fingerprint_ok()) o << ", \"" << listable << "\""; }

© 1995-2005 University of Illinois, Urbana-Champaign. All rights reserved.  Fri Mar 25 23:05:54 2005