lib/libc/db/btree/bt_debug.c

   1 /*-
   2  * Copyright (c) 1990, 1993, 1994
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Mike Olson.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. Neither the name of the University nor the names of its contributors
  17  *    may be used to endorse or promote products derived from this software
  18  *    without specific prior written permission.
  19  *
  20  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  30  * SUCH DAMAGE.
  31  *
  32  * @(#)bt_debug.c       8.5 (Berkeley) 8/17/94
  33  * $DragonFly: src/lib/libc/db/btree/bt_debug.c,v 1.4 2005/11/12 23:01:54 swildner Exp $
  34  */
  35
  36 #include <sys/param.h>
  37
  38 #include <stdio.h>
  39 #include <stdlib.h>
  40 #include <string.h>
  41
  42 #include <db.h>
  43 #include "btree.h"
  44
  45 #ifdef DEBUG
  46 /*
  47  * BT_DUMP -- Dump the tree
  48  *
  49  * Parameters:
  50  *      dbp:    pointer to the DB
  51  */
  52 void
  53 __bt_dump(DB *dbp)
  54 {
  55         BTREE *t;
  56         PAGE *h;
  57         pgno_t i;
  58         char *sep;
  59
  60         t = dbp->internal;
  61         fprintf(stderr, "%s: pgsz %d",
  62             F_ISSET(t, B_INMEM) ? "memory" : "disk", t->bt_psize);
  63         if (F_ISSET(t, R_RECNO))
  64                 fprintf(stderr, " keys %u", t->bt_nrecs);
  65 #undef X
  66 #define X(flag, name) \
  67         if (F_ISSET(t, flag)) { \
  68                 fprintf(stderr, "%s%s", sep, name); \
  69                 sep = ", "; \
  70         }
  71         if (t->flags != 0) {
  72                 sep = " flags (";
  73                 X(R_FIXLEN,     "FIXLEN");
  74                 X(B_INMEM,      "INMEM");
  75                 X(B_NODUPS,     "NODUPS");
  76                 X(B_RDONLY,     "RDONLY");
  77                 X(R_RECNO,      "RECNO");
  78                 X(B_METADIRTY,"METADIRTY");
  79                 fprintf(stderr, ")\n");
  80         }
  81 #undef X
  82
  83         for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) {
  84                 __bt_dpage(h);
  85                 mpool_put(t->bt_mp, h, 0);
  86         }
  87 }
  88
  89 /*
  90  * BT_DMPAGE -- Dump the meta page
  91  *
  92  * Parameters:
  93  *      h:      pointer to the PAGE
  94  */
  95 void
  96 __bt_dmpage(PAGE *h)
  97 {
  98         BTMETA *m;
  99         char *sep;
 100
 101         m = (BTMETA *)h;
 102         fprintf(stderr, "magic %x\n", m->magic);
 103         fprintf(stderr, "version %u\n", m->version);
 104         fprintf(stderr, "psize %u\n", m->psize);
 105         fprintf(stderr, "free %u\n", m->free);
 106         fprintf(stderr, "nrecs %u\n", m->nrecs);
 107         fprintf(stderr, "flags %u", m->flags);
 108 #undef X
 109 #define X(flag, name) \
 110         if (m->flags & flag) { \
 111                 fprintf(stderr, "%s%s", sep, name); \
 112                 sep = ", "; \
 113         }
 114         if (m->flags) {
 115                 sep = " (";
 116                 X(B_NODUPS,     "NODUPS");
 117                 X(R_RECNO,      "RECNO");
 118                 fprintf(stderr, ")");
 119         }
 120 }
 121
 122 /*
 123  * BT_DNPAGE -- Dump the page
 124  *
 125  * Parameters:
 126  *      n:      page number to dump.
 127  */
 128 void
 129 __bt_dnpage(DB *dbp, pgno_t pgno)
 130 {
 131         BTREE *t;
 132         PAGE *h;
 133
 134         t = dbp->internal;
 135         if ((h = mpool_get(t->bt_mp, pgno, 0)) != NULL) {
 136                 __bt_dpage(h);
 137                 mpool_put(t->bt_mp, h, 0);
 138         }
 139 }
 140
 141 /*
 142  * BT_DPAGE -- Dump the page
 143  *
 144  * Parameters:
 145  *      h:      pointer to the PAGE
 146  */
 147 void
 148 __bt_dpage(PAGE *h)
 149 {
 150         BINTERNAL *bi;
 151         BLEAF *bl;
 152         RINTERNAL *ri;
 153         RLEAF *rl;
 154         indx_t cur, top;
 155         char *sep;
 156
 157         fprintf(stderr, "    page %d: (", h->pgno);
 158 #undef X
 159 #define X(flag, name) \
 160         if (h->flags & flag) { \
 161                 fprintf(stderr, "%s%s", sep, name); \
 162                 sep = ", "; \
 163         }
 164         sep = "";
 165         X(P_BINTERNAL,  "BINTERNAL")            /* types */
 166         X(P_BLEAF,      "BLEAF")
 167         X(P_RINTERNAL,  "RINTERNAL")            /* types */
 168         X(P_RLEAF,      "RLEAF")
 169         X(P_OVERFLOW,   "OVERFLOW")
 170         X(P_PRESERVE,   "PRESERVE");
 171         fprintf(stderr, ")\n");
 172 #undef X
 173
 174         fprintf(stderr, "\tprev %2d next %2d", h->prevpg, h->nextpg);
 175         if (h->flags & P_OVERFLOW)
 176                 return;
 177
 178         top = NEXTINDEX(h);
 179         fprintf(stderr, " lower %3d upper %3d nextind %d\n",
 180             h->lower, h->upper, top);
 181         for (cur = 0; cur < top; cur++) {
 182                 fprintf(stderr, "\t[%03d] %4d ", cur, h->linp[cur]);
 183                 switch (h->flags & P_TYPE) {
 184                 case P_BINTERNAL:
 185                         bi = GETBINTERNAL(h, cur);
 186                         fprintf(stderr,
 187                             "size %03d pgno %03d", bi->ksize, bi->pgno);
 188                         if (bi->flags & P_BIGKEY)
 189                                 fprintf(stderr, " (indirect)");
 190                         else if (bi->ksize)
 191                                 fprintf(stderr,
 192                                     " {%.*s}", (int)bi->ksize, bi->bytes);
 193                         break;
 194                 case P_RINTERNAL:
 195                         ri = GETRINTERNAL(h, cur);
 196                         fprintf(stderr, "entries %03d pgno %03d",
 197                                 ri->nrecs, ri->pgno);
 198                         break;
 199                 case P_BLEAF:
 200                         bl = GETBLEAF(h, cur);
 201                         if (bl->flags & P_BIGKEY)
 202                                 fprintf(stderr,
 203                                     "big key page %u size %u/",
 204                                     *(pgno_t *)bl->bytes,
 205                                     *(u_int32_t *)(bl->bytes + sizeof(pgno_t)));
 206                         else if (bl->ksize)
 207                                 fprintf(stderr, "%.*s/",
 208                                     bl->ksize, bl->bytes);
 209                         if (bl->flags & P_BIGDATA)
 210                                 fprintf(stderr,
 211                                     "big data page %u size %u",
 212                                     *(pgno_t *)(bl->bytes + bl->ksize),
 213                                     *(u_int32_t *)(bl->bytes + bl->ksize +
 214                                     sizeof(pgno_t)));
 215                         else if (bl->dsize)
 216                                 fprintf(stderr, "%.*s",
 217                                     (int)bl->dsize, bl->bytes + bl->ksize);
 218                         break;
 219                 case P_RLEAF:
 220                         rl = GETRLEAF(h, cur);
 221                         if (rl->flags & P_BIGDATA)
 222                                 fprintf(stderr,
 223                                     "big data page %u size %u",
 224                                     *(pgno_t *)rl->bytes,
 225                                     *(u_int32_t *)(rl->bytes + sizeof(pgno_t)));
 226                         else if (rl->dsize)
 227                                 fprintf(stderr,
 228                                     "%.*s", (int)rl->dsize, rl->bytes);
 229                         break;
 230                 }
 231                 fprintf(stderr, "\n");
 232         }
 233 }
 234 #endif
 235
 236 #ifdef STATISTICS
 237 /*
 238  * BT_STAT -- Gather/print the tree statistics
 239  *
 240  * Parameters:
 241  *      dbp:    pointer to the DB
 242  */
 243 void
 244 __bt_stat(DB *dbp)
 245 {
 246         extern u_long bt_cache_hit, bt_cache_miss, bt_pfxsaved, bt_rootsplit;
 247         extern u_long bt_sortsplit, bt_split;
 248         BTREE *t;
 249         PAGE *h;
 250         pgno_t i, pcont, pinternal, pleaf;
 251         u_long ifree, lfree, nkeys;
 252         int levels;
 253
 254         t = dbp->internal;
 255         pcont = pinternal = pleaf = 0;
 256         nkeys = ifree = lfree = 0;
 257         for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) {
 258                 switch (h->flags & P_TYPE) {
 259                 case P_BINTERNAL:
 260                 case P_RINTERNAL:
 261                         ++pinternal;
 262                         ifree += h->upper - h->lower;
 263                         break;
 264                 case P_BLEAF:
 265                 case P_RLEAF:
 266                         ++pleaf;
 267                         lfree += h->upper - h->lower;
 268                         nkeys += NEXTINDEX(h);
 269                         break;
 270                 case P_OVERFLOW:
 271                         ++pcont;
 272                         break;
 273                 }
 274                 mpool_put(t->bt_mp, h, 0);
 275         }
 276
 277         /* Count the levels of the tree. */
 278         for (i = P_ROOT, levels = 0 ;; ++levels) {
 279                 h = mpool_get(t->bt_mp, i, 0);
 280                 if (h->flags & (P_BLEAF|P_RLEAF)) {
 281                         if (levels == 0)
 282                                 levels = 1;
 283                         mpool_put(t->bt_mp, h, 0);
 284                         break;
 285                 }
 286                 i = F_ISSET(t, R_RECNO) ?
 287                     GETRINTERNAL(h, 0)->pgno :
 288                     GETBINTERNAL(h, 0)->pgno;
 289                 mpool_put(t->bt_mp, h, 0);
 290         }
 291
 292         fprintf(stderr, "%d level%s with %ld keys",
 293             levels, levels == 1 ? "" : "s", nkeys);
 294         if (F_ISSET(t, R_RECNO))
 295                 fprintf(stderr, " (%d header count)", t->bt_nrecs);
 296         fprintf(stderr,
 297             "\n%u pages (leaf %d, internal %d, overflow %d)\n",
 298             pinternal + pleaf + pcont, pleaf, pinternal, pcont);
 299         fprintf(stderr, "%ld cache hits, %ld cache misses\n",
 300             bt_cache_hit, bt_cache_miss);
 301         fprintf(stderr, "%lu splits (%lu root splits, %lu sort splits)\n",
 302             bt_split, bt_rootsplit, bt_sortsplit);
 303         pleaf *= t->bt_psize - BTDATAOFF;
 304         if (pleaf)
 305                 fprintf(stderr,
 306                     "%.0f%% leaf fill (%ld bytes used, %ld bytes free)\n",
 307                     ((double)(pleaf - lfree) / pleaf) * 100,
 308                     pleaf - lfree, lfree);
 309         pinternal *= t->bt_psize - BTDATAOFF;
 310         if (pinternal)
 311                 fprintf(stderr,
 312                     "%.0f%% internal fill (%ld bytes used, %ld bytes free\n",
 313                     ((double)(pinternal - ifree) / pinternal) * 100,
 314                     pinternal - ifree, ifree);
 315         if (bt_pfxsaved)
 316                 fprintf(stderr, "prefix checking removed %lu bytes.\n",
 317                     bt_pfxsaved);
 318 }
 319 #endif