head	1.4;
access;
symbols
	Version_2_1:1.3
	Version_2:1.2;
locks; strict;
comment	@ * @;


1.4
date	91.11.12.20.24.42;	author mer;	state Exp;
branches;
next	1.3;

1.3
date	90.08.17.08.53.52;	author cimarron;	state Exp;
branches;
next	1.2;

1.2
date	90.07.21.02.34.22;	author kemnitz;	state Version_2;
branches;
next	1.1;

1.1
date	90.06.29.03.37.27;	author kemnitz;	state Exp;
branches;
next	;


desc
@pg_malloc header file.
@


1.4
log
@prototyping changes
@
text
@
#ifndef PG_MALLOC_H
#define PG_MALLOC_H	"$Header: /users/mer/postgres/src/lib/H/utils/RCS/pg_malloc.h,v 1.3 1990/08/17 08:53:52 cimarron Exp mer $"

#include "tmp/c.h"
#include "nodes/pg_lisp.h"
#include "utils/log.h"

#define MAPSIZE 72
#define FULL 0xff
#define BITS_IN_BYTE 8
#define TOTAL_NONNODE_PAGES 8
#define TRUE 1
#define FALSE 0
#define HEADER_TYPE 0xf0

/*
 * XXX Hack for palloc header info.
 */

#define PALLOC_HEADER_SIZE 16

/*
 * Each page is 4K in total (including header stuff) except for large pages.
 */

#define PAGE_SIZE 4*1024

/*
 * Allocate 128 pages initially for 1/2 meg of contiguous storage.
 */

#define PAGES_ALLOCATED 128

/*
 * Returns nonzero if the i'th bit of X is 1, zero otherwise.
 */

#define TEST_BIT(X, I)  ((X) & ((unsigned) 1 << (7 - (I))))

/*
 * Sets the i'th bit of X to 1 by or'ing it.
 */

#define SET_BIT(X, I)   ((X) | ((unsigned) 1 << (7 - (I)))) 

/*
 * Unsets the i'th bit of X by exclusive or'ing it.
 */

#define UNSET_BIT(X, I) ((X) ^ ((unsigned) 1 << (7 - (I))))

typedef struct
{
	long sanity_check;
	short debug_depth, size;
} NodeMemoryHeader;

/*
 * Memory page for NODES (and any objects that happen to be the same size
 * as nodes).  MAKE SURE THIS STRUCTURE IS ALWAYS A MULTIPLE OF FOUR IN SIZE!
 */

typedef struct node_mempage
{
	long sanity_check; /* Used as a sanity check - equal to &memory[1] */
	bool8 is_malloced, page_full;
	short ref_count, max_elements, element_size;
	long offset;
	NodeMemoryHeader *first_free_header;
	unsigned char *begin_addr, *end_addr;
	unsigned char page_map[MAPSIZE];
	struct node_mempage *next;
	unsigned char memory[1]; /* force contiguity */
}
NodeMemoryPage;


/* 
 * Memory page for non-nodes (meaning objects which are not the size of any
 * of the nodes in the node system).
 */

typedef struct 
{
	long sanity_check;
	short size;
	bool8 used;
	uint8 debug_depth;
}
OtherMemoryHeader;

/*
 * Memory page header for other (non-node) memory pages.
 *
 * When adding stuff to these, MAKE SURE THAT &memory[0] is
 * on a longword boundary!
 */

typedef struct other_mempage
{
	long sanity_check;
	bool8 is_malloced, page_full;
	short ref_count, total, biggest_free_object;
	unsigned char *begin_addr, *end_addr, *working_addr;
	OtherMemoryHeader *first_free_header, *last_header;
	struct other_mempage *next;
	unsigned char memory[1]; /* force contiguity */
}
OtherMemoryPage;

/*
 * For big pages (objects > about 3.9K).  For these, one object per page.
 */

typedef struct big_memory_page
{
	long sanity_check;
	struct big_memory_page *next;
	unsigned char *begin_addr, *end_addr;
	OtherMemoryHeader header;
	unsigned char memory[1];
}
BigMemoryPage;

/*
 * The node table.
 */

typedef struct
{
	char            **names;
	int             node_count;
	bool8  			used;
	Size            size;
	int             page_count;
	NodeMemoryPage *first_page;
}
NodeTable;

/*
 * The table of memory page data.  There will be three of these
 * when everything is complete: 
 * -- one for persistent objects
 * -- one for objects which disappear at end-transaction
 * -- one for portals
 */

typedef struct page_data
{
	unsigned char *my_space;
	long total_size, space_used;
	NodeTable *node_table;
	OtherMemoryPage *other_pages;
	BigMemoryPage *big_pages;
} MemoryPageData;

struct nodeinfo
{
    char    *ni_name;
	TypeId  ni_id;
	TypeId  ni_parent;
	Size    ni_size;
};

/* Function declarations */

/*
 * Allocates space.
 */

unsigned char *
pg_malloc ARGS((
Size size
));

unsigned char *
GetNodeMemory ARGS((
Size size
));

unsigned char *
GetOtherMemory ARGS((
Size size
));

unsigned char *
GetBigMemory ARGS((
Size size
));

NodeTable *
InitializeNodeTable ARGS((void));

NodeMemoryPage *
AllocateNodePage ARGS((
Size element_size
));

OtherMemoryPage *
AllocateOtherPage ARGS((void));

BigMemoryPage *
AllocateBigPage ARGS((
Size size
));

bool8
FreeNodeMemory ARGS((
unsigned char *addr
));

bool8
FreeOtherMemory ARGS((
unsigned char *addr
));

bool8
FreeBigMemory ARGS((
unsigned char *addr
));

int
FindFreeElement ARGS((
unsigned char *page_map
));

Size
LargestFreeObject ARGS((
OtherMemoryPage *page
));

int pg_free ARGS((unsigned char *addr ));
int pg_zero_memory ARGS((void ));
int InitMemoryPages ARGS((void ));
int SetElement ARGS((unsigned char *page_map ));
int SetNextFreeNode ARGS((NodeMemoryPage *page , long offset ));
int other_memory_page_info ARGS((OtherMemoryPage *page ));
int PushMemoryTraceLevel ARGS((void ));
int DumpMemoryTrace ARGS((void ));
int DumpAllTrace ARGS((void ));
bool8 FindCorruptedAddresses ARGS((void ));
int PopMemoryTraceLevel ARGS((void ));
int DumpTrace ARGS((uint8 trace_depth ));
int DecrementTraceLevel ARGS((uint8 trace_depth ));

#endif /* PG_MALLOC_H */
@


1.3
log
@added pathnames to #include statements
@
text
@d3 1
a3 1
#define PG_MALLOC_H	"$Header: RCS/pg_malloc.h,v 1.2 90/07/21 02:34:22 kemnitz Version_2 Locker: cimarron $"
d174 1
a174 1
Size size;
d179 1
a179 1
Size size;
d184 1
a184 1
Size size;
d189 1
a189 1
Size size;
d197 1
a197 1
Size element_size;
d205 1
a205 1
Size size;
d210 1
a210 1
unsigned char *addr;
d215 1
a215 1
unsigned char *addr;
d220 1
a220 1
unsigned char *addr;
d225 1
a225 1
unsigned char *page_map;
d230 1
a230 1
OtherMemoryPage page;
d232 14
@


1.2
log
@Added RCS header.
@
text
@a0 3
#include "pg_lisp.h"
#include "log.h"
#include "c.h"
d3 5
a7 1
#define PG_MALLOC_H	"$Header: RCS/pg_malloc.h,v 1.11 90/06/09 18:56:50 kemnitz Exp Locker: kemnitz $"
@


1.1
log
@Initial revision
@
text
@d5 3
d231 2
@