Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
bitmapset.h	3.36 KB	-rw-r--r--
execnodes.h	64.77 KB	-rw-r--r--
makefuncs.h	2.32 KB	-rw-r--r--
memnodes.h	2.55 KB	-rw-r--r--
nodeFuncs.h	2.45 KB	-rw-r--r--
nodes.h	14.35 KB	-rw-r--r--
params.h	3.69 KB	-rw-r--r--
parsenodes.h	86.96 KB	-rw-r--r--
pg_list.h	11.49 KB	-rw-r--r--
plannodes.h	27.61 KB	-rw-r--r--
primnodes.h	50.04 KB	-rw-r--r--
print.h	1.04 KB	-rw-r--r--
readfuncs.h	897 B	-rw-r--r--
relation.h	68.13 KB	-rw-r--r--
replnodes.h	1.03 KB	-rw-r--r--
tidbitmap.h	2.19 KB	-rw-r--r--
value.h	1.76 KB	-rw-r--r--

Code Editor : tidbitmap.h

/*-------------------------------------------------------------------------
 *
 * tidbitmap.h
 *	  PostgreSQL tuple-id (TID) bitmap package
 *
 * This module provides bitmap data structures that are spiritually
 * similar to Bitmapsets, but are specially adapted to store sets of
 * tuple identifiers (TIDs), or ItemPointers.  In particular, the division
 * of an ItemPointer into BlockNumber and OffsetNumber is catered for.
 * Also, since we wish to be able to store very large tuple sets in
 * memory with this data structure, we support "lossy" storage, in which
 * we no longer remember individual tuple offsets on a page but only the
 * fact that a particular page needs to be visited.
 *
 *
 * Copyright (c) 2003-2012, PostgreSQL Global Development Group
 *
 * src/include/nodes/tidbitmap.h
 *
 *-------------------------------------------------------------------------
 */
#ifndef TIDBITMAP_H
#define TIDBITMAP_H

#include "storage/itemptr.h"

/*
 * Actual bitmap representation is private to tidbitmap.c.  Callers can
 * do IsA(x, TIDBitmap) on it, but nothing else.
 */
typedef struct TIDBitmap TIDBitmap;

/* Likewise, TBMIterator is private */
typedef struct TBMIterator TBMIterator;

/* Result structure for tbm_iterate */
typedef struct
{
	BlockNumber blockno;		/* page number containing tuples */
	int			ntuples;		/* -1 indicates lossy result */
	bool		recheck;		/* should the tuples be rechecked? */
	/* Note: recheck is always true if ntuples < 0 */
	OffsetNumber offsets[1];	/* VARIABLE LENGTH ARRAY */
} TBMIterateResult;				/* VARIABLE LENGTH STRUCT */

/* function prototypes in nodes/tidbitmap.c */

extern TIDBitmap *tbm_create(long maxbytes);
extern void tbm_free(TIDBitmap *tbm);

extern void tbm_add_tuples(TIDBitmap *tbm,
			   const ItemPointer tids, int ntids,
			   bool recheck);
extern void tbm_add_page(TIDBitmap *tbm, BlockNumber pageno);

extern void tbm_union(TIDBitmap *a, const TIDBitmap *b);
extern void tbm_intersect(TIDBitmap *a, const TIDBitmap *b);

extern bool tbm_is_empty(const TIDBitmap *tbm);

extern TBMIterator *tbm_begin_iterate(TIDBitmap *tbm);
extern TBMIterateResult *tbm_iterate(TBMIterator *iterator);
extern void tbm_end_iterate(TBMIterator *iterator);

#endif   /* TIDBITMAP_H */

${this.title}

Code Editor : tidbitmap.h