summaryrefslogtreecommitdiff
path: root/src/backend/access/nbtree/nbtree.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/backend/access/nbtree/nbtree.c')
-rw-r--r--src/backend/access/nbtree/nbtree.c32
1 files changed, 18 insertions, 14 deletions
diff --git a/src/backend/access/nbtree/nbtree.c b/src/backend/access/nbtree/nbtree.c
index e75814dd8e..512f2b0879 100644
--- a/src/backend/access/nbtree/nbtree.c
+++ b/src/backend/access/nbtree/nbtree.c
@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
- * $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtree.c,v 1.17 1997/03/24 08:48:11 vadim Exp $
+ * $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtree.c,v 1.18 1997/04/18 03:37:53 vadim Exp $
*
* NOTES
* This file contains only the public interface routines.
@@ -33,6 +33,12 @@
# include <string.h>
#endif
+#ifdef BTREE_BUILD_STATS
+#include <tcop/tcopprot.h>
+extern int ShowExecutorStats;
+#endif
+
+
bool BuildingBtree = false; /* see comment in btbuild() */
bool FastBuild = true; /* use sort/build instead of insertion build */
@@ -77,10 +83,6 @@ btbuild(Relation heap,
bool isunique;
bool usefast;
-#if 0
- ResetBufferUsage();
-#endif
-
/* note that this is a new btree */
BuildingBtree = true;
@@ -95,6 +97,11 @@ btbuild(Relation heap,
*/
usefast = (FastBuild && IsNormalProcessingMode());
+#ifdef BTREE_BUILD_STATS
+ if ( ShowExecutorStats )
+ ResetUsage ();
+#endif
+
/* see if index is unique */
isunique = IndexIsUniqueNoCache(RelationGetRelationId(index));
@@ -278,18 +285,15 @@ btbuild(Relation heap,
_bt_spooldestroy(spool);
}
-#if 0
+#ifdef BTREE_BUILD_STATS
+ if ( ShowExecutorStats )
{
- extern int ReadBufferCount, BufferHitCount, BufferFlushCount;
- extern long NDirectFileRead, NDirectFileWrite;
-
- printf("buffer(%d): r=%d w=%d\n", heap->rd_rel->relblocksz,
- ReadBufferCount - BufferHitCount, BufferFlushCount);
- printf("direct(%d): r=%d w=%d\n", LocalBlockSize,
- NDirectFileRead, NDirectFileWrite);
+ fprintf(stderr, "! BtreeBuild Stats:\n");
+ ShowUsage ();
+ ResetUsage ();
}
#endif
-
+
/*
* Since we just counted the tuples in the heap, we update its
* stats in pg_class to guarantee that the planner takes advantage