--- parser3/src/include/pa_pool.h 2001/01/26 15:33:40 1.3 +++ parser3/src/include/pa_pool.h 2002/02/08 08:30:13 1.78 @@ -1,102 +1,181 @@ -/* - $Id: pa_pool.h,v 1.3 2001/01/26 15:33:40 paf Exp $ -*/ +/** @file + Parser: pool class decl. -/* + Copyright (c) 2001, 2002 ArtLebedev Group (http://www.artlebedev.com) - String Chunk0 - ====== ======== - head--------->[ptr, size] - append_here-------->[ptr, size] - link_row ........ - . . - . [ptr, size] - ...........>[link to the next chunk] + Author: Alexandr Petrosian (http://paf.design.ru) + $Id: pa_pool.h,v 1.78 2002/02/08 08:30:13 paf Exp $ */ #ifndef PA_POOL_H #define PA_POOL_H -#include +#include "pa_config_includes.h" + +#ifdef XML +# include "gdome.h" +// for xmlChar +# include "libxml/tree.h" +#endif + +// forwards -class Pool; +class Exception; +class String; +class Charset; +class GdomeDOMString_auto_ptr; + +/** + Pool mechanizm allows users not to free up allocated memory, + leaving that problem to 'pools'. -class String { + @see Pooled +*/ + +class Pool { public: - enum { - CR_PREALLOCATED_COUNT=5, - CR_GROW_PERCENT=60 - }; -private: - friend Pool; + Pool(void *astorage); - // the pool I'm allocated on - Pool *pool; + ///{@ statistics + size_t total_allocated() { return ftotal_allocated; } + unsigned int total_times() { return ftotal_times; } + ///}@ + + void set_context(void *acontext) { fcontext=acontext; } + void *get_context() { return fcontext; } + + /// allocates some bytes on pool + void *malloc(size_t size, int place=0) { + return check(real_malloc(size, place), size); + } + /// allocates some bytes clearing them with zeros + void *calloc(size_t size) { + return check(real_calloc(size), size); + } + + /// registers a routine to clean up non-pooled allocations + void register_cleanup(void (*cleanup) (void *), void *data) { + if(!real_register_cleanup(cleanup, data)) + fail_register_cleanup(); + } + + ///{@ source charset + void set_source_charset(Charset& acharset); + Charset& get_source_charset(); + ///}@ + + ///{@ client charset + void set_client_charset(Charset& charset); + Charset& get_client_charset(); + ///}@ + +#ifdef XML + + /// @see Charset::transcode_cstr(xmlChar *s); + const char *transcode_cstr(xmlChar *s); + /// @see Charset::transcode(xmlChar *s); + String& transcode(xmlChar *s); + /// @see Charset::transcode_cstr(GdomeDOMString *s); + const char *transcode_cstr(GdomeDOMString *s); + /// @see Charset::transcode(GdomeDOMString *s); + String& transcode(GdomeDOMString *s); + /// @see Charset::transcode(const String& s) + GdomeDOMString_auto_ptr transcode(const String& s); - // last chank allocated count cache - int curr_chunk_rows; - struct Chunk { - // the number of rows per chunk - int count; - union Row { - // chunk item - struct { - char *ptr; // pointer to the start of string fragment - size_t size; // length of the fragment - } item; - Chunk *link; // link to the next chunk in chain - } first[CR_PREALLOCATED_COUNT]; - // next rows are here - Chunk *preallocated_link; - } - head; // the head chunk of the chunk chain +#endif - // next append would write to this record - Chunk::Row *append_here; +private: + + void *fstorage; + void *fcontext; + Charset *source_charset; + Charset *client_charset; + +private: - // the address of place where lies address - // of the link to the next chunk to allocate - Chunk::Row *link_row; - - // new&constructors made private to enforce factory manufacturing at pool - void *operator new(size_t size, Pool *apool); - - void construct(Pool *apool); - String(Pool *apool) { - construct(apool); - } - String(Pool *apool, char *src) { - construct(apool); - *this+=src; + //{ + /// @name implementation defined + void *real_malloc(size_t size, int place); + void *real_calloc(size_t size); + bool real_register_cleanup(void (*cleanup) (void *), void *data); + //} + +private: + + /// checks whether mem allocated OK. throws exception otherwise + void *check(void *ptr, size_t size) { + if(ptr) { + ftotal_allocated+=size; + ftotal_times++; + return ptr; + } + + fail_alloc(size); + + // never reached + return 0; } + /// throws allocation exception + void fail_alloc(size_t size) const; - bool chunk_is_full() { - return append_here == link_row; - } - void expand(); + /// throws register cleanup exception + void fail_register_cleanup() const; -public: +private: // statistics + + size_t ftotal_allocated; + unsigned int ftotal_times; + +private: //disabled - size_t size(); - char *c_str(); - String& operator += (char *src); + Pool(const Pool&); + Pool& operator= (const Pool&); }; -class Pool { +/** + Base for all classes that are allocated in 'pools'. + + Holds Pool object. Contains useful wrappers to it's methods. + + @see NEW +*/ +class Pooled { + // the pool i'm allocated on + Pool *fpool; public: - Pool(); - ~Pool(); - void *alloc(size_t size); - void *calloc(size_t size); - String *makeString() { - return new(this) String(this); - } - String *makeString(char *src) { - return new(this) String(this, src); - } + /// the Pooled-sole: Pooled instances can be allocated in Pool rather then on heap + static void *operator new(size_t size, Pool& apool) { + return apool.malloc(size, 1); + } + + Pooled(Pool& apool) : fpool(&apool) {} + + /// my pool + Pool& pool() const { return *fpool; } + + /** used for moving objects from one pool to another. + in between object can have no pool and can not be used + @see SQL_Driver_manager + */ + void set_pool(Pool *apool) { fpool=apool; } + + //{ + /// @name useful wrapper around pool + void *malloc(size_t size, int place=0) const { return fpool->malloc(size, place); } + void *calloc(size_t size) const { return fpool->calloc(size); } + void register_cleanup(void (*cleanup) (void *), void *data) { fpool->register_cleanup(cleanup, data); } +#ifdef XML + + const char *transcode_cstr(GdomeDOMString *s) { return fpool->transcode_cstr(s); } + String& transcode(GdomeDOMString *s) { return fpool->transcode(s); } + +#endif + //} }; +/// useful macro for creating objects on current Pooled object Pooled::pool() +#define NEW new(pool()) #endif