summaryrefslogtreecommitdiff
path: root/src/include/storage/fsm_internals.h
diff options
context:
space:
mode:
authorBruce Momjian2009-06-11 14:49:15 +0000
committerBruce Momjian2009-06-11 14:49:15 +0000
commitd7471402794266078953f1bd113dab4913d631a1 (patch)
tree618e392a84eaf837e00bf78f8694097b78fec227 /src/include/storage/fsm_internals.h
parent4e86efb4e51b66ef57b3fe6f28576de23a1bf1c6 (diff)
8.4 pgindent run, with new combined Linux/FreeBSD/MinGW typedef list
provided by Andrew.
Diffstat (limited to 'src/include/storage/fsm_internals.h')
-rw-r--r--src/include/storage/fsm_internals.h20
1 files changed, 10 insertions, 10 deletions
diff --git a/src/include/storage/fsm_internals.h b/src/include/storage/fsm_internals.h
index 9444a5af130..70031a4e910 100644
--- a/src/include/storage/fsm_internals.h
+++ b/src/include/storage/fsm_internals.h
@@ -7,7 +7,7 @@
* Portions Copyright (c) 1996-2009, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
- * $PostgreSQL: pgsql/src/include/storage/fsm_internals.h,v 1.2 2009/01/01 17:24:01 momjian Exp $
+ * $PostgreSQL: pgsql/src/include/storage/fsm_internals.h,v 1.3 2009/06/11 14:49:12 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@@ -25,22 +25,22 @@
typedef struct
{
/*
- * fsm_search_avail() tries to spread the load of multiple backends
- * by returning different pages to different backends in a round-robin
- * fashion. fp_next_slot points to the next slot to be returned
- * (assuming there's enough space on it for the request). It's defined
- * as an int, because it's updated without an exclusive lock. uint16
- * would be more appropriate, but int is more likely to be atomically
+ * fsm_search_avail() tries to spread the load of multiple backends by
+ * returning different pages to different backends in a round-robin
+ * fashion. fp_next_slot points to the next slot to be returned (assuming
+ * there's enough space on it for the request). It's defined as an int,
+ * because it's updated without an exclusive lock. uint16 would be more
+ * appropriate, but int is more likely to be atomically
* fetchable/storable.
*/
- int fp_next_slot;
+ int fp_next_slot;
/*
* fp_nodes contains the binary tree, stored in array. The first
* NonLeafNodesPerPage elements are upper nodes, and the following
* LeafNodesPerPage elements are leaf nodes. Unused nodes are zero.
*/
- uint8 fp_nodes[1];
+ uint8 fp_nodes[1];
} FSMPageData;
typedef FSMPageData *FSMPage;
@@ -63,7 +63,7 @@ typedef FSMPageData *FSMPage;
/* Prototypes for functions in fsmpage.c */
extern int fsm_search_avail(Buffer buf, uint8 min_cat, bool advancenext,
- bool exclusive_lock_held);
+ bool exclusive_lock_held);
extern uint8 fsm_get_avail(Page page, int slot);
extern uint8 fsm_get_max_avail(Page page);
extern bool fsm_set_avail(Page page, int slot, uint8 value);