static int malloc_need_init = 1;
typedef struct {
- void* point;
+ void* ptr;
size_t size;
- char comm[MAXDESC];
+ char comm[MAXDESC];
} malloc_entry;
malloc_entry malloc_pointers[MAXMAL];
-/*
-#define mymalloc(x) (mymalloc_file_line(x,__FILE__,__LINE__))
-*/
+
+/* Utility functions */
+
+
+static
void
-malloc_state() {
- int i, total;
- total=0;
+malloc_init(void) {
+ int i;
+ for(i=0; i<MAXMAL; i++) malloc_pointers[i].ptr = NULL;
+ malloc_need_init = 0;
+ atexit(malloc_state);
+}
+
+
+static
+int
+find_ptr(void *p) {
+ int i;
+ for(i=0;i<MAXMAL;i++)
+ if (malloc_pointers[i].ptr == p)
+ return i;
+ return -1;
+}
+
+
+/* Takes a pointer to real start of array,
+ * sets the entries in the table, returns
+ * the offset corrected pointer */
+
+static
+void *
+set_entry(int i, char *buf, size_t size, char *file, int line) {
+ memset( buf, PADBYTE, UNDRRNVAL );
+ memset( &buf[UNDRRNVAL+size], PADBYTE, OVERRNVAL );
+ buf += UNDRRNVAL;
+ malloc_pointers[i].ptr = buf;
+ malloc_pointers[i].size = size;
+ sprintf(malloc_pointers[i].comm,"%s (%d)", file, line);
+ return buf;
+}
+
+
+
+
+void
+malloc_state(void) {
+ int i, total = 0;
+
+ i_clear_error();
mm_log((0,"malloc_state()\n"));
bndcheck_all();
- for(i=0;i<MAXMAL;i++) if (malloc_pointers[i].point!=NULL) {
- mm_log((0,"%d: %d (0x%x) : %s\n",i,malloc_pointers[i].size,malloc_pointers[i].point,malloc_pointers[i].comm));
- total+=malloc_pointers[i].size;
+ for(i=0; i<MAXMAL; i++) if (malloc_pointers[i].ptr != NULL) {
+ mm_log((0,"%d: %d (0x%x) : %s\n", i, malloc_pointers[i].size, malloc_pointers[i].ptr, malloc_pointers[i].comm));
+ total += malloc_pointers[i].size;
}
- if (total==0 ) mm_log((0,"No memory currently used!\n"))
- else mm_log((0,"total: %d\n",total));
+ if (total == 0) mm_log((0,"No memory currently used!\n"))
+ else mm_log((0,"total: %d\n",total));
}
+
void*
-mymalloc_file_line(int size, char* file, int line) {
+mymalloc_file_line(size_t size, char* file, int line) {
char *buf;
int i;
- if (malloc_need_init) {
- for(i=0; i<MAXMAL; i++) malloc_pointers[i].point = NULL;
- malloc_need_init = 0;
- atexit(malloc_state);
+ if (malloc_need_init) malloc_init();
+
+ /* bndcheck_all(); Uncomment for LOTS OF THRASHING */
+
+ if ( (i = find_ptr(NULL)) < 0 ) {
+ mm_log((0,"more than %d segments allocated at %s (%d)\n", MAXMAL, file, line));
+ exit(3);
}
- /* bndcheck_all(); ACTIVATE FOR LOTS OF THRASHING */
-
- if ( (buf = malloc(size+UNDRRNVAL+OVERRNVAL)) == NULL ) { mm_log((1,"Unable to allocate %i for %s (%i)\n", size, file, line)); exit(3); }
- memset( buf, PADBYTE, UNDRRNVAL );
- memset( &buf[UNDRRNVAL+size], PADBYTE, OVERRNVAL );
-
- mm_log((1,"mymalloc_file_line: real address %p\n", buf));
- buf += UNDRRNVAL; /* Do this now so we will see the returned address in the logs. */
-
- for(i=0;i<MAXMAL;i++) if (malloc_pointers[i].point == NULL) {
- malloc_pointers[i].size = size;
- sprintf(malloc_pointers[i].comm,"%s (%d)", file, line);
- malloc_pointers[i].point = buf;
- mm_log((1,"mymalloc_file_line: slot <%d> %d bytes allocated at %p for %s (%d)\n", i, size, buf, file, line));
- return buf;
+ if ( (buf = malloc(size+UNDRRNVAL+OVERRNVAL)) == NULL ) {
+ mm_log((1,"Unable to allocate %i for %s (%i)\n", size, file, line));
+ exit(3);
}
- mm_log((0,"more than %d segments allocated at %s (%d)\n", MAXMAL, file, line));
- exit(255);
- return NULL;
+ buf = set_entry(i, buf, size, file, line);
+ mm_log((1,"mymalloc_file_line: slot <%d> %d bytes allocated at %p for %s (%d)\n", i, size, buf, file, line));
+ return buf;
}
-/* This function not maintained for now */
-/*
+
+
void*
-mymalloc_comm(int size,char *comm) {
- void *buf;
+myrealloc_file_line(void *ptr, size_t newsize, char* file, int line) {
+ char *buf;
int i;
- if (malloc_need_init) {
- for(i=0;i<MAXMAL;i++) malloc_pointers[i].point=NULL;
- malloc_need_init=0;
+
+ if (malloc_need_init) malloc_init();
+ /* bndcheck_all(); ACTIVATE FOR LOTS OF THRASHING */
+
+ if (!ptr) {
+ mm_log((1, "realloc called with ptr = NULL, sending request to malloc\n"));
+ return mymalloc_file_line(newsize, file, line);
}
- if ((buf=malloc(size))==NULL) { mm_log((1,"Unable to malloc.\n")); exit(3); }
+ if (!newsize) {
+ mm_log((1, "newsize = 0, sending request to free\n"));
+ myfree_file_line(ptr, file, line);
+ return NULL;
+ }
- for(i=0;i<MAXMAL;i++) if (malloc_pointers[i].point==NULL) {
- malloc_pointers[i].point=buf;
- malloc_pointers[i].size=size;
- strncpy(malloc_pointers[i].comm,comm,MAXDESC-1);
- return buf;
+ if ( (i = find_ptr(ptr)) == -1) {
+ mm_log((0, "Unable to find %p in realloc for %s (%i)\n", ptr, file, line));
+ exit(3);
+ }
+
+ if ( (buf = realloc(((char *)ptr)-UNDRRNVAL, UNDRRNVAL+OVERRNVAL+newsize)) == NULL ) {
+ mm_log((1,"Unable to reallocate %i bytes at %p for %s (%i)\n", newsize, ptr, file, line));
+ exit(3);
}
- mm_log((0,"more than %d segments malloced\n",MAXMAL));
- exit(255);
- return NULL;
+
+ buf = set_entry(i, buf, newsize, file, line);
+ mm_log((1,"realloc_file_line: slot <%d> %d bytes allocated at %p for %s (%d)\n", i, newsize, buf, file, line));
+ return buf;
}
-*/
+
+
+
static
void
bndcheck(int idx) {
int i;
size_t s = malloc_pointers[idx].size;
- unsigned char *pp = malloc_pointers[idx].point;
+ unsigned char *pp = malloc_pointers[idx].ptr;
if (!pp) {
mm_log((1, "bndcheck: No pointer in slot %d\n", idx));
return;
}
for(i=0;i<UNDRRNVAL;i++)
- if (pp[-(1+i)] != PADBYTE)
- mm_log((1,"bndcheck: UNDERRUN OF %d bytes detected: slot = %d, point = %p, size = %d\n", i+1, idx, pp, s ));
+ if (pp[-(1+i)] != PADBYTE)
+ mm_log((1,"bndcheck: UNDERRUN OF %d bytes detected: slot = %d, point = %p, size = %d\n", i+1, idx, pp, s ));
- for(i=0;i<OVERRNVAL;i++)
+ for(i=0;i<OVERRNVAL;i++)
if (pp[s+i] != PADBYTE)
mm_log((1,"bndcheck: OVERRUN OF %d bytes detected: slot = %d, point = %p, size = %d\n", i+1, idx, pp, s ));
}
int idx;
mm_log((1, "bndcheck_all()\n"));
for(idx=0; idx<MAXMAL; idx++)
- if (malloc_pointers[idx].point)
+ if (malloc_pointers[idx].ptr)
bndcheck(idx);
}
int match = 0;
int i;
- for(i=0; i<MAXMAL; i++) if (malloc_pointers[i].point == p) {
+ for(i=0; i<MAXMAL; i++) if (malloc_pointers[i].ptr == p) {
mm_log((1,"myfree_file_line: pointer %i (%s) freed at %s (%i)\n", i, malloc_pointers[i].comm, file, line));
bndcheck(i);
- malloc_pointers[i].point = NULL;
+ malloc_pointers[i].ptr = NULL;
match++;
}
if (match != 1) {
mm_log((1, "myfree_file_line: INCONSISTENT REFCOUNT %d at %s (%i)\n", match, file, line));
+ fprintf(stderr, "myfree_file_line: INCONSISTENT REFCOUNT %d at %s (%i)\n", match, file, line);
+ exit(255);
}
- mm_log((1, "myfree_file_line: freeing address %p\n", pp-UNDRRNVAL));
+ mm_log((1, "myfree_file_line: freeing address %p (real %p)\n", pp, pp-UNDRRNVAL));
free(pp-UNDRRNVAL);
}
if ( (buf = malloc(size)) == NULL ) {
mm_log((1, "mymalloc: unable to malloc %d\n", size));
- fprintf(stderr,"Unable to malloc.\n"); exit(3);
+ fprintf(stderr,"Unable to malloc %d.\n", size); exit(3);
}
mm_log((1, "mymalloc(size %d) -> %p\n", size, buf));
return buf;
+/* memory pool implementation */
+void
+i_mempool_init(i_mempool *mp) {
+ mp->alloc = 10;
+ mp->used = 0;
+ mp->p = mymalloc(sizeof(void*)*mp->alloc);
+}
+
+void
+i_mempool_extend(i_mempool *mp) {
+ mp->p = myrealloc(mp->p, mp->alloc * 2);
+ mp->alloc *=2;
+}
+
+void *
+i_mempool_alloc(i_mempool *mp, size_t size) {
+ if (mp->used == mp->alloc) i_mempool_extend(mp);
+ mp->p[mp->used] = mymalloc(size);
+ mp->used++;
+ return mp->p[mp->used-1];
+}
+
+
+void
+i_mempool_destroy(i_mempool *mp) {
+ unsigned int i;
+ for(i=0; i<mp->used; i++) myfree(mp->p[i]);
+ myfree(mp->p);
+}
+/* Should these really be here? */
+
#undef min
#undef max
if (a>b) return a; else return b;
}
-int
-myread(int fd,void *buf,int len) {
- unsigned char* bufc;
- int bc,rc;
- bufc = (unsigned char*)buf;
- bc=0;
- while( ((rc=read(fd,bufc+bc,len-bc))>0 ) && (bc!=len) ) bc+=rc;
- if ( rc < 0 ) return rc;
- else return bc;
-}
-
-int
-mywrite(int fd,void *buf,int len) {
- unsigned char* bufc;
- int bc,rc;
- bufc=(unsigned char*)buf;
- bc=0;
- while(((rc=write(fd,bufc+bc,len-bc))>0) && (bc!=len)) bc+=rc;
- if (rc<0) return rc;
- else return bc;
-}
-
-void
-interleave(unsigned char *inbuffer,unsigned char *outbuffer,int rowsize,int channels) {
- int ch,ind,i;
- i=0;
- if ( inbuffer==outbuffer ) return; /* Check if data is already in interleaved format */
- for( ind=0; ind<rowsize; ind++) for (ch=0; ch<channels; ch++) outbuffer[i++] = inbuffer[rowsize*ch+ind];
-}
-
-
projects / imager.git / blobdiff