db/btree/bt_debug.c

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