granicus.if.org Git - postgresql/blob - src/backend/commands/vacuum.c

   1 /*-------------------------------------------------------------------------
   2  *
   3  * vacuum.c--
   4  *        the postgres vacuum cleaner
   5  *
   6  * Copyright (c) 1994, Regents of the University of California
   7  *
   8  *
   9  * IDENTIFICATION
  10  *        $Header: /cvsroot/pgsql/src/backend/commands/vacuum.c,v 1.62 1998/02/25 23:40:32 vadim Exp $
  11  *
  12  *-------------------------------------------------------------------------
  13  */
  14 #include <sys/types.h>
  15 #include <sys/file.h>
  16 #include <string.h>
  17 #include <sys/stat.h>
  18 #include <fcntl.h>
  19 #include <unistd.h>
  20
  21 #include <postgres.h>
  22
  23 #include <fmgr.h>
  24 #include <utils/portal.h>
  25 #include <access/genam.h>
  26 #include <access/heapam.h>
  27 #include <access/xact.h>
  28 #include <storage/bufmgr.h>
  29 #include <access/transam.h>
  30 #include <catalog/pg_index.h>
  31 #include <catalog/index.h>
  32 #include <catalog/catname.h>
  33 #include <catalog/catalog.h>
  34 #include <catalog/pg_class.h>
  35 #include <catalog/pg_proc.h>
  36 #include <catalog/pg_statistic.h>
  37 #include <catalog/pg_type.h>
  38 #include <catalog/pg_operator.h>
  39 #include <parser/parse_oper.h>
  40 #include <storage/smgr.h>
  41 #include <storage/lmgr.h>
  42 #include <utils/inval.h>
  43 #include <utils/mcxt.h>
  44 #include <utils/inval.h>
  45 #include <utils/syscache.h>
  46 #include <utils/builtins.h>
  47 #include <commands/vacuum.h>
  48 #include <storage/bufpage.h>
  49 #include "storage/shmem.h"
  50 #ifndef HAVE_GETRUSAGE
  51 #include <rusagestub.h>
  52 #else
  53 #include <sys/time.h>
  54 #include <sys/resource.h>
  55 #endif
  56
  57 /* #include <port-protos.h> */ /* Why? */
  58
  59 extern int BlowawayRelationBuffers(Relation rdesc, BlockNumber block);
  60
  61 bool            VacuumRunning = false;
  62
  63 static Portal vc_portal;
  64
  65 static int      MESSAGE_LEVEL;          /* message level */
  66
  67 #define swapLong(a,b)   {long tmp; tmp=a; a=b; b=tmp;}
  68 #define swapInt(a,b)    {int tmp; tmp=a; a=b; b=tmp;}
  69 #define swapDatum(a,b)  {Datum tmp; tmp=a; a=b; b=tmp;}
  70 #define VacAttrStatsEqValid(stats) ( stats->f_cmpeq.fn_addr != NULL )
  71 #define VacAttrStatsLtGtValid(stats) ( stats->f_cmplt.fn_addr != NULL && \
  72                                                                    stats->f_cmpgt.fn_addr != NULL && \
  73                                                                    RegProcedureIsValid(stats->outfunc) )
  74
  75
  76 /* non-export function prototypes */
  77 static void vc_init(void);
  78 static void vc_shutdown(void);
  79 static void vc_vacuum(NameData *VacRelP, bool analyze, List *va_cols);
  80 static VRelList vc_getrels(NameData *VacRelP);
  81 static void vc_vacone(Oid relid, bool analyze, List *va_cols);
  82 static void vc_scanheap(VRelStats *vacrelstats, Relation onerel, VPageList Vvpl, VPageList Fvpl);
  83 static void vc_rpfheap(VRelStats *vacrelstats, Relation onerel, VPageList Vvpl, VPageList Fvpl, int nindices, Relation *Irel);
  84 static void vc_vacheap(VRelStats *vacrelstats, Relation onerel, VPageList vpl);
  85 static void vc_vacpage(Page page, VPageDescr vpd);
  86 static void vc_vaconeind(VPageList vpl, Relation indrel, int nhtups);
  87 static void vc_scanoneind(Relation indrel, int nhtups);
  88 static void vc_attrstats(Relation onerel, VRelStats *vacrelstats, HeapTuple htup);
  89 static void vc_bucketcpy(AttributeTupleForm attr, Datum value, Datum *bucket, int16 *bucket_len);
  90 static void vc_updstats(Oid relid, int npages, int ntups, bool hasindex, VRelStats *vacrelstats);
  91 static void vc_delhilowstats(Oid relid, int attcnt, int *attnums);
  92 static void vc_setpagelock(Relation rel, BlockNumber blkno);
  93 static VPageDescr vc_tidreapped(ItemPointer itemptr, VPageList vpl);
  94 static void vc_reappage(VPageList vpl, VPageDescr vpc);
  95 static void vc_vpinsert(VPageList vpl, VPageDescr vpnew);
  96 static void vc_free(VRelList vrl);
  97 static void vc_getindices(Oid relid, int *nindices, Relation **Irel);
  98 static void vc_clsindices(int nindices, Relation *Irel);
  99 static void vc_mkindesc(Relation onerel, int nindices, Relation *Irel, IndDesc **Idesc);
 100 static char *vc_find_eq(char *bot, int nelem, int size, char *elm, int (*compar) (char *, char *));
 101 static int      vc_cmp_blk(char *left, char *right);
 102 static int      vc_cmp_offno(char *left, char *right);
 103 static bool vc_enough_space(VPageDescr vpd, Size len);
 104
 105 void
 106 vacuum(char *vacrel, bool verbose, bool analyze, List *va_spec)
 107 {
 108         char       *pname;
 109         MemoryContext old;
 110         PortalVariableMemory pmem;
 111         NameData        VacRel;
 112         List       *le;
 113         List       *va_cols = NIL;
 114
 115         /*
 116          * Create a portal for safe memory across transctions.  We need to
 117          * palloc the name space for it because our hash function expects the
 118          * name to be on a longword boundary.  CreatePortal copies the name to
 119          * safe storage for us.
 120          */
 121         pname = (char *) palloc(strlen(VACPNAME) + 1);
 122         strcpy(pname, VACPNAME);
 123         vc_portal = CreatePortal(pname);
 124         pfree(pname);
 125
 126         if (verbose)
 127                 MESSAGE_LEVEL = NOTICE;
 128         else
 129                 MESSAGE_LEVEL = DEBUG;
 130
 131         /* vacrel gets de-allocated on transaction commit */
 132         if (vacrel)
 133                 strcpy(VacRel.data, vacrel);
 134
 135         pmem = PortalGetVariableMemory(vc_portal);
 136         old = MemoryContextSwitchTo((MemoryContext) pmem);
 137
 138         if (va_spec != NIL && !analyze)
 139                 elog(ERROR,"Can't vacuum columns, only tables.  You can 'vacuum analyze' columns.");
 140
 141         foreach(le, va_spec)
 142         {
 143                 char       *col = (char *) lfirst(le);
 144                 char       *dest;
 145
 146                 dest = (char *) palloc(strlen(col) + 1);
 147                 strcpy(dest, col);
 148                 va_cols = lappend(va_cols, dest);
 149         }
 150         MemoryContextSwitchTo(old);
 151
 152         /* initialize vacuum cleaner */
 153         vc_init();
 154
 155         /* vacuum the database */
 156         if (vacrel)
 157                 vc_vacuum(&VacRel, analyze, va_cols);
 158         else
 159                 vc_vacuum(NULL, analyze, NIL);
 160
 161         PortalDestroy(&vc_portal);
 162
 163         /* clean up */
 164         vc_shutdown();
 165 }
 166
 167 /*
 168  *      vc_init(), vc_shutdown() -- start up and shut down the vacuum cleaner.
 169  *
 170  *              We run exactly one vacuum cleaner at a time.  We use the file system
 171  *              to guarantee an exclusive lock on vacuuming, since a single vacuum
 172  *              cleaner instantiation crosses transaction boundaries, and we'd lose
 173  *              postgres-style locks at the end of every transaction.
 174  *
 175  *              The strangeness with committing and starting transactions in the
 176  *              init and shutdown routines is due to the fact that the vacuum cleaner
 177  *              is invoked via a sql command, and so is already executing inside
 178  *              a transaction.  We need to leave ourselves in a predictable state
 179  *              on entry and exit to the vacuum cleaner.  We commit the transaction
 180  *              started in PostgresMain() inside vc_init(), and start one in
 181  *              vc_shutdown() to match the commit waiting for us back in
 182  *              PostgresMain().
 183  */
 184 static void
 185 vc_init()
 186 {
 187         int                     fd;
 188
 189         if ((fd = open("pg_vlock", O_CREAT | O_EXCL, 0600)) < 0)
 190                 elog(ERROR, "can't create lock file -- another vacuum cleaner running?");
 191
 192         close(fd);
 193
 194         /*
 195          * By here, exclusive open on the lock file succeeded.  If we abort
 196          * for any reason during vacuuming, we need to remove the lock file.
 197          * This global variable is checked in the transaction manager on xact
 198          * abort, and the routine vc_abort() is called if necessary.
 199          */
 200
 201         VacuumRunning = true;
 202
 203         /* matches the StartTransaction in PostgresMain() */
 204         CommitTransactionCommand();
 205 }
 206
 207 static void
 208 vc_shutdown()
 209 {
 210         /* on entry, not in a transaction */
 211         if (unlink("pg_vlock") < 0)
 212                 elog(ERROR, "vacuum: can't destroy lock file!");
 213
 214         /* okay, we're done */
 215         VacuumRunning = false;
 216
 217         /* matches the CommitTransaction in PostgresMain() */
 218         StartTransactionCommand();
 219
 220 }
 221
 222 void
 223 vc_abort()
 224 {
 225         /* on abort, remove the vacuum cleaner lock file */
 226         unlink("pg_vlock");
 227
 228         VacuumRunning = false;
 229 }
 230
 231 /*
 232  *      vc_vacuum() -- vacuum the database.
 233  *
 234  *              This routine builds a list of relations to vacuum, and then calls
 235  *              code that vacuums them one at a time.  We are careful to vacuum each
 236  *              relation in a separate transaction in order to avoid holding too many
 237  *              locks at one time.
 238  */
 239 static void
 240 vc_vacuum(NameData *VacRelP, bool analyze, List *va_cols)
 241 {
 242         VRelList        vrl,
 243                                 cur;
 244
 245         /* get list of relations */
 246         vrl = vc_getrels(VacRelP);
 247
 248         if (analyze && VacRelP == NULL && vrl != NULL)
 249                 vc_delhilowstats(InvalidOid, 0, NULL);
 250
 251         /* vacuum each heap relation */
 252         for (cur = vrl; cur != (VRelList) NULL; cur = cur->vrl_next)
 253                 vc_vacone(cur->vrl_relid, analyze, va_cols);
 254
 255         vc_free(vrl);
 256 }
 257
 258 static VRelList
 259 vc_getrels(NameData *VacRelP)
 260 {
 261         Relation        pgclass;
 262         TupleDesc       pgcdesc;
 263         HeapScanDesc pgcscan;
 264         HeapTuple       pgctup;
 265         Buffer          buf;
 266         PortalVariableMemory portalmem;
 267         MemoryContext old;
 268         VRelList        vrl,
 269                                 cur;
 270         Datum           d;
 271         char       *rname;
 272         char            rkind;
 273         bool            n;
 274         ScanKeyData pgckey;
 275         bool            found = false;
 276
 277         StartTransactionCommand();
 278
 279         if (VacRelP->data)
 280         {
 281                 ScanKeyEntryInitialize(&pgckey, 0x0, Anum_pg_class_relname,
 282                                                            NameEqualRegProcedure,
 283                                                            PointerGetDatum(VacRelP->data));
 284         }
 285         else
 286         {
 287                 ScanKeyEntryInitialize(&pgckey, 0x0, Anum_pg_class_relkind,
 288                                                   CharacterEqualRegProcedure, CharGetDatum('r'));
 289         }
 290
 291         portalmem = PortalGetVariableMemory(vc_portal);
 292         vrl = cur = (VRelList) NULL;
 293
 294         pgclass = heap_openr(RelationRelationName);
 295         pgcdesc = RelationGetTupleDescriptor(pgclass);
 296
 297         pgcscan = heap_beginscan(pgclass, false, false, 1, &pgckey);
 298
 299         while (HeapTupleIsValid(pgctup = heap_getnext(pgcscan, 0, &buf)))
 300         {
 301
 302                 found = true;
 303
 304                 d = heap_getattr(pgctup, Anum_pg_class_relname, pgcdesc, &n);
 305                 rname = (char *) d;
 306
 307                 /*
 308                  * don't vacuum large objects for now - something breaks when we
 309                  * do
 310                  */
 311                 if ((strlen(rname) >= 5) && rname[0] == 'x' &&
 312                         rname[1] == 'i' && rname[2] == 'n' &&
 313                         (rname[3] == 'v' || rname[3] == 'x') &&
 314                         rname[4] >= '0' && rname[4] <= '9')
 315                 {
 316                         elog(NOTICE, "Rel %s: can't vacuum LargeObjects now",
 317                                  rname);
 318                         ReleaseBuffer(buf);
 319                         continue;
 320                 }
 321
 322                 d = heap_getattr(pgctup, Anum_pg_class_relkind, pgcdesc, &n);
 323
 324                 rkind = DatumGetChar(d);
 325
 326                 /* skip system relations */
 327                 if (rkind != 'r')
 328                 {
 329                         ReleaseBuffer(buf);
 330                         elog(NOTICE, "Vacuum: can not process index and certain system tables");
 331                         continue;
 332                 }
 333
 334                 /* get a relation list entry for this guy */
 335                 old = MemoryContextSwitchTo((MemoryContext) portalmem);
 336                 if (vrl == (VRelList) NULL)
 337                 {
 338                         vrl = cur = (VRelList) palloc(sizeof(VRelListData));
 339                 }
 340                 else
 341                 {
 342                         cur->vrl_next = (VRelList) palloc(sizeof(VRelListData));
 343                         cur = cur->vrl_next;
 344                 }
 345                 MemoryContextSwitchTo(old);
 346
 347                 cur->vrl_relid = pgctup->t_oid;
 348                 cur->vrl_next = (VRelList) NULL;
 349
 350                 /* wei hates it if you forget to do this */
 351                 ReleaseBuffer(buf);
 352         }
 353         if (found == false)
 354                 elog(NOTICE, "Vacuum: table not found");
 355
 356
 357         heap_endscan(pgcscan);
 358         heap_close(pgclass);
 359
 360         CommitTransactionCommand();
 361
 362         return (vrl);
 363 }
 364
 365 /*
 366  *      vc_vacone() -- vacuum one heap relation
 367  *
 368  *              This routine vacuums a single heap, cleans out its indices, and
 369  *              updates its statistics npages and ntups statistics.
 370  *
 371  *              Doing one heap at a time incurs extra overhead, since we need to
 372  *              check that the heap exists again just before we vacuum it.      The
 373  *              reason that we do this is so that vacuuming can be spread across
 374  *              many small transactions.  Otherwise, two-phase locking would require
 375  *              us to lock the entire database during one pass of the vacuum cleaner.
 376  */
 377 static void
 378 vc_vacone(Oid relid, bool analyze, List *va_cols)
 379 {
 380         Relation        pgclass;
 381         TupleDesc       pgcdesc;
 382         HeapTuple       pgctup,
 383                                 pgttup;
 384         Buffer          pgcbuf;
 385         HeapScanDesc pgcscan;
 386         Relation        onerel;
 387         ScanKeyData pgckey;
 388         VPageListData Vvpl;                     /* List of pages to vacuum and/or clean
 389                                                                  * indices */
 390         VPageListData Fvpl;                     /* List of pages with space enough for
 391                                                                  * re-using */
 392         VPageDescr *vpp;
 393         Relation   *Irel;
 394         int32           nindices,
 395                                 i;
 396         VRelStats  *vacrelstats;
 397
 398         StartTransactionCommand();
 399
 400         ScanKeyEntryInitialize(&pgckey, 0x0, ObjectIdAttributeNumber,
 401                                                    ObjectIdEqualRegProcedure,
 402                                                    ObjectIdGetDatum(relid));
 403
 404         pgclass = heap_openr(RelationRelationName);
 405         pgcdesc = RelationGetTupleDescriptor(pgclass);
 406         pgcscan = heap_beginscan(pgclass, false, false, 1, &pgckey);
 407
 408         /*
 409          * Race condition -- if the pg_class tuple has gone away since the
 410          * last time we saw it, we don't need to vacuum it.
 411          */
 412
 413         if (!HeapTupleIsValid(pgctup = heap_getnext(pgcscan, 0, &pgcbuf)))
 414         {
 415                 heap_endscan(pgcscan);
 416                 heap_close(pgclass);
 417                 CommitTransactionCommand();
 418                 return;
 419         }
 420
 421         /* now open the class and vacuum it */
 422         onerel = heap_open(relid);
 423
 424         vacrelstats = (VRelStats *) palloc(sizeof(VRelStats));
 425         vacrelstats->relid = relid;
 426         vacrelstats->npages = vacrelstats->ntups = 0;
 427         vacrelstats->hasindex = false;
 428         if (analyze && !IsSystemRelationName((RelationGetRelationName(onerel))->data))
 429         {
 430                 int                     attr_cnt,
 431                                    *attnums = NULL;
 432                 AttributeTupleForm *attr;
 433
 434                 attr_cnt = onerel->rd_att->natts;
 435                 attr = onerel->rd_att->attrs;
 436
 437                 if (va_cols != NIL)
 438                 {
 439                         int                     tcnt = 0;
 440                         List       *le;
 441
 442                         if (length(va_cols) > attr_cnt)
 443                                 elog(ERROR, "vacuum: too many attributes specified for relation %s",
 444                                          (RelationGetRelationName(onerel))->data);
 445                         attnums = (int *) palloc(attr_cnt * sizeof(int));
 446                         foreach(le, va_cols)
 447                         {
 448                                 char       *col = (char *) lfirst(le);
 449
 450                                 for (i = 0; i < attr_cnt; i++)
 451                                 {
 452                                         if (namestrcmp(&(attr[i]->attname), col) == 0)
 453                                                 break;
 454                                 }
 455                                 if (i < attr_cnt)               /* found */
 456                                         attnums[tcnt++] = i;
 457                                 else
 458                                 {
 459                                         elog(ERROR, "vacuum: there is no attribute %s in %s",
 460                                                  col, (RelationGetRelationName(onerel))->data);
 461                                 }
 462                         }
 463                         attr_cnt = tcnt;
 464                 }
 465
 466                 vacrelstats->vacattrstats =
 467                         (VacAttrStats *) palloc(attr_cnt * sizeof(VacAttrStats));
 468
 469                 for (i = 0; i < attr_cnt; i++)
 470                 {
 471                         Operator        func_operator;
 472                         OperatorTupleForm pgopform;
 473                         VacAttrStats *stats;
 474
 475                         stats = &vacrelstats->vacattrstats[i];
 476                         stats->attr = palloc(ATTRIBUTE_TUPLE_SIZE);
 477                         memmove(stats->attr, attr[((attnums) ? attnums[i] : i)], ATTRIBUTE_TUPLE_SIZE);
 478                         stats->best = stats->guess1 = stats->guess2 = 0;
 479                         stats->max = stats->min = 0;
 480                         stats->best_len = stats->guess1_len = stats->guess2_len = 0;
 481                         stats->max_len = stats->min_len = 0;
 482                         stats->initialized = false;
 483                         stats->best_cnt = stats->guess1_cnt = stats->guess1_hits = stats->guess2_hits = 0;
 484                         stats->max_cnt = stats->min_cnt = stats->null_cnt = stats->nonnull_cnt = 0;
 485
 486                         func_operator = oper("=", stats->attr->atttypid, stats->attr->atttypid, true);
 487                         if (func_operator != NULL)
 488                         {
 489                                 pgopform = (OperatorTupleForm) GETSTRUCT(func_operator);
 490                                 fmgr_info(pgopform->oprcode, &(stats->f_cmpeq));
 491                         }
 492                         else
 493                                 stats->f_cmpeq.fn_addr = NULL;
 494
 495                         func_operator = oper("<", stats->attr->atttypid, stats->attr->atttypid, true);
 496                         if (func_operator != NULL)
 497                         {
 498                                 pgopform = (OperatorTupleForm) GETSTRUCT(func_operator);
 499                                 fmgr_info(pgopform->oprcode, &(stats->f_cmplt));
 500                         }
 501                         else
 502                                 stats->f_cmplt.fn_addr = NULL;
 503
 504                         func_operator = oper(">", stats->attr->atttypid, stats->attr->atttypid, true);
 505                         if (func_operator != NULL)
 506                         {
 507                                 pgopform = (OperatorTupleForm) GETSTRUCT(func_operator);
 508                                 fmgr_info(pgopform->oprcode, &(stats->f_cmpgt));
 509                         }
 510                         else
 511                                 stats->f_cmpgt.fn_addr = NULL;
 512
 513                         pgttup = SearchSysCacheTuple(TYPOID,
 514                                                                  ObjectIdGetDatum(stats->attr->atttypid),
 515                                                                                  0, 0, 0);
 516                         if (HeapTupleIsValid(pgttup))
 517                                 stats->outfunc = ((TypeTupleForm) GETSTRUCT(pgttup))->typoutput;
 518                         else
 519                                 stats->outfunc = InvalidOid;
 520                 }
 521                 vacrelstats->va_natts = attr_cnt;
 522                 vc_delhilowstats(relid, ((attnums) ? attr_cnt : 0), attnums);
 523                 if (attnums)
 524                         pfree(attnums);
 525         }
 526         else
 527         {
 528                 vacrelstats->va_natts = 0;
 529                 vacrelstats->vacattrstats = (VacAttrStats *) NULL;
 530         }
 531
 532         /* we require the relation to be locked until the indices are cleaned */
 533         RelationSetLockForWrite(onerel);
 534
 535         /* scan it */
 536         Vvpl.vpl_npages = Fvpl.vpl_npages = 0;
 537         vc_scanheap(vacrelstats, onerel, &Vvpl, &Fvpl);
 538
 539         /* Now open indices */
 540         Irel = (Relation *) NULL;
 541         vc_getindices(vacrelstats->relid, &nindices, &Irel);
 542
 543         if (nindices > 0)
 544                 vacrelstats->hasindex = true;
 545         else
 546                 vacrelstats->hasindex = false;
 547
 548         /* Clean/scan index relation(s) */
 549         if (Irel != (Relation *) NULL)
 550         {
 551                 if (Vvpl.vpl_npages > 0)
 552                 {
 553                         for (i = 0; i < nindices; i++)
 554                                 vc_vaconeind(&Vvpl, Irel[i], vacrelstats->ntups);
 555                 }
 556                 else
 557 /* just scan indices to update statistic */
 558                 {
 559                         for (i = 0; i < nindices; i++)
 560                                 vc_scanoneind(Irel[i], vacrelstats->ntups);
 561                 }
 562         }
 563
 564         if (Fvpl.vpl_npages > 0)        /* Try to shrink heap */
 565                 vc_rpfheap(vacrelstats, onerel, &Vvpl, &Fvpl, nindices, Irel);
 566         else
 567         {
 568                 if (Irel != (Relation *) NULL)
 569                         vc_clsindices(nindices, Irel);
 570                 if (Vvpl.vpl_npages > 0)/* Clean pages from Vvpl list */
 571                         vc_vacheap(vacrelstats, onerel, &Vvpl);
 572         }
 573
 574         /* ok - free Vvpl list of reapped pages */
 575         if (Vvpl.vpl_npages > 0)
 576         {
 577                 vpp = Vvpl.vpl_pgdesc;
 578                 for (i = 0; i < Vvpl.vpl_npages; i++, vpp++)
 579                         pfree(*vpp);
 580                 pfree(Vvpl.vpl_pgdesc);
 581                 if (Fvpl.vpl_npages > 0)
 582                         pfree(Fvpl.vpl_pgdesc);
 583         }
 584
 585         /* all done with this class */
 586         heap_close(onerel);
 587         heap_endscan(pgcscan);
 588         heap_close(pgclass);
 589
 590         /* update statistics in pg_class */
 591         vc_updstats(vacrelstats->relid, vacrelstats->npages, vacrelstats->ntups,
 592                                 vacrelstats->hasindex, vacrelstats);
 593
 594         /* next command frees attribute stats */
 595
 596         CommitTransactionCommand();
 597 }
 598
 599 /*
 600  *      vc_scanheap() -- scan an open heap relation
 601  *
 602  *              This routine sets commit times, constructs Vvpl list of
 603  *              empty/uninitialized pages and pages with dead tuples and
 604  *              ~LP_USED line pointers, constructs Fvpl list of pages
 605  *              appropriate for purposes of shrinking and maintains statistics
 606  *              on the number of live tuples in a heap.
 607  */
 608 static void
 609 vc_scanheap(VRelStats *vacrelstats, Relation onerel,
 610                         VPageList Vvpl, VPageList Fvpl)
 611 {
 612         int                     nblocks,
 613                                 blkno;
 614         ItemId          itemid;
 615         ItemPointer itemptr;
 616         HeapTuple       htup;
 617         Buffer          buf;
 618         Page            page,
 619                                 tempPage = NULL;
 620         OffsetNumber offnum,
 621                                 maxoff;
 622         bool            pgchanged,
 623                                 tupgone,
 624                                 dobufrel,
 625                                 notup;
 626         char       *relname;
 627         VPageDescr      vpc,
 628                                 vp;
 629         uint32          nvac,
 630                                 ntups,
 631                                 nunused,
 632                                 ncrash,
 633                                 nempg,
 634                                 nnepg,
 635                                 nchpg,
 636                                 nemend;
 637         Size            frsize,
 638                                 frsusf;
 639         Size            min_tlen = MAXTUPLEN;
 640         Size            max_tlen = 0;
 641         int32           i /* , attr_cnt */ ;
 642         struct rusage ru0,
 643                                 ru1;
 644         bool            do_shrinking = true;
 645
 646         getrusage(RUSAGE_SELF, &ru0);
 647
 648         nvac = ntups = nunused = ncrash = nempg = nnepg = nchpg = nemend = 0;
 649         frsize = frsusf = 0;
 650
 651         relname = (RelationGetRelationName(onerel))->data;
 652
 653         nblocks = RelationGetNumberOfBlocks(onerel);
 654
 655         vpc = (VPageDescr) palloc(sizeof(VPageDescrData) + MaxOffsetNumber * sizeof(OffsetNumber));
 656         vpc->vpd_nusd = 0;
 657
 658         for (blkno = 0; blkno < nblocks; blkno++)
 659         {
 660                 buf = ReadBuffer(onerel, blkno);
 661                 page = BufferGetPage(buf);
 662                 vpc->vpd_blkno = blkno;
 663                 vpc->vpd_noff = 0;
 664
 665                 if (PageIsNew(page))
 666                 {
 667                         elog(NOTICE, "Rel %s: Uninitialized page %u - fixing",
 668                                  relname, blkno);
 669                         PageInit(page, BufferGetPageSize(buf), 0);
 670                         vpc->vpd_free = ((PageHeader) page)->pd_upper - ((PageHeader) page)->pd_lower;
 671                         frsize += (vpc->vpd_free - sizeof(ItemIdData));
 672                         nnepg++;
 673                         nemend++;
 674                         vc_reappage(Vvpl, vpc);
 675                         WriteBuffer(buf);
 676                         continue;
 677                 }
 678
 679                 if (PageIsEmpty(page))
 680                 {
 681                         vpc->vpd_free = ((PageHeader) page)->pd_upper - ((PageHeader) page)->pd_lower;
 682                         frsize += (vpc->vpd_free - sizeof(ItemIdData));
 683                         nempg++;
 684                         nemend++;
 685                         vc_reappage(Vvpl, vpc);
 686                         ReleaseBuffer(buf);
 687                         continue;
 688                 }
 689
 690                 pgchanged = false;
 691                 notup = true;
 692                 maxoff = PageGetMaxOffsetNumber(page);
 693                 for (offnum = FirstOffsetNumber;
 694                          offnum <= maxoff;
 695                          offnum = OffsetNumberNext(offnum))
 696                 {
 697                         itemid = PageGetItemId(page, offnum);
 698
 699                         /*
 700                          * Collect un-used items too - it's possible to have indices
 701                          * pointing here after crash.
 702                          */
 703                         if (!ItemIdIsUsed(itemid))
 704                         {
 705                                 vpc->vpd_voff[vpc->vpd_noff++] = offnum;
 706                                 nunused++;
 707                                 continue;
 708                         }
 709
 710                         htup = (HeapTuple) PageGetItem(page, itemid);
 711                         tupgone = false;
 712
 713                         if (!(htup->t_infomask & HEAP_XMIN_COMMITTED))
 714                         {
 715                                 if (htup->t_infomask & HEAP_XMIN_INVALID)
 716                                         tupgone = true;
 717                                 else
 718                                 {
 719                                         if (TransactionIdDidAbort(htup->t_xmin))
 720                                                 tupgone = true;
 721                                         else if (TransactionIdDidCommit(htup->t_xmin))
 722                                         {
 723                                                 htup->t_infomask |= HEAP_XMIN_COMMITTED;
 724                                                 pgchanged = true;
 725                                         }
 726                                         else if (!TransactionIdIsInProgress(htup->t_xmin))
 727                                         {
 728                                                 /*
 729                                                  * Not Aborted, Not Committed, Not in Progress -
 730                                                  * so it's from crashed process. - vadim 11/26/96
 731                                                  */
 732                                                 ncrash++;
 733                                                 tupgone = true;
 734                                         }
 735                                         else
 736                                         {
 737                                                 elog(NOTICE, "Rel %s: TID %u/%u: InsertTransactionInProgress %u - can't shrink relation",
 738                                                          relname, blkno, offnum, htup->t_xmin);
 739                                                 do_shrinking = false;
 740                                         }
 741                                 }
 742                         }
 743
 744                         /*
 745                          * here we are concerned about tuples with xmin committed
 746                          * and xmax unknown or committed
 747                          */
 748                         if (htup->t_infomask & HEAP_XMIN_COMMITTED &&
 749                                 !(htup->t_infomask & HEAP_XMAX_INVALID))
 750                         {
 751                                 if (htup->t_infomask & HEAP_XMAX_COMMITTED)
 752                                         tupgone = true;
 753                                 else if (TransactionIdDidAbort(htup->t_xmax))
 754                                 {
 755                                         htup->t_infomask |= HEAP_XMAX_INVALID;
 756                                         pgchanged = true;
 757                                 }
 758                                 else if (TransactionIdDidCommit(htup->t_xmax))
 759                                         tupgone = true;
 760                                 else if (!TransactionIdIsInProgress(htup->t_xmax))
 761                                 {
 762                                         /*
 763                                          * Not Aborted, Not Committed, Not in Progress - so it
 764                                          * from crashed process. - vadim 06/02/97
 765                                          */
 766                                         htup->t_infomask |= HEAP_XMAX_INVALID;;
 767                                         pgchanged = true;
 768                                 }
 769                                 else
 770                                 {
 771                                         elog(NOTICE, "Rel %s: TID %u/%u: DeleteTransactionInProgress %u - can't shrink relation",
 772                                                  relname, blkno, offnum, htup->t_xmax);
 773                                         do_shrinking = false;
 774                                 }
 775                         }
 776
 777                         /*
 778                          * It's possibly! But from where it comes ? And should we fix
 779                          * it ?  - vadim 11/28/96
 780                          */
 781                         itemptr = &(htup->t_ctid);
 782                         if (!ItemPointerIsValid(itemptr) ||
 783                                 BlockIdGetBlockNumber(&(itemptr->ip_blkid)) != blkno)
 784                         {
 785                                 elog(NOTICE, "Rel %s: TID %u/%u: TID IN TUPLEHEADER %u/%u IS NOT THE SAME. TUPGONE %d.",
 786                                          relname, blkno, offnum,
 787                                          BlockIdGetBlockNumber(&(itemptr->ip_blkid)),
 788                                          itemptr->ip_posid, tupgone);
 789                         }
 790
 791                         /*
 792                          * Other checks...
 793                          */
 794                         if (htup->t_len != itemid->lp_len)
 795                         {
 796                                 elog(NOTICE, "Rel %s: TID %u/%u: TUPLE_LEN IN PAGEHEADER %u IS NOT THE SAME AS IN TUPLEHEADER %u. TUPGONE %d.",
 797                                          relname, blkno, offnum,
 798                                          itemid->lp_len, htup->t_len, tupgone);
 799                         }
 800                         if (!OidIsValid(htup->t_oid))
 801                         {
 802                                 elog(NOTICE, "Rel %s: TID %u/%u: OID IS INVALID. TUPGONE %d.",
 803                                          relname, blkno, offnum, tupgone);
 804                         }
 805
 806                         if (tupgone)
 807                         {
 808                                 ItemId          lpp;
 809
 810                                 if (tempPage == (Page) NULL)
 811                                 {
 812                                         Size            pageSize;
 813
 814                                         pageSize = PageGetPageSize(page);
 815                                         tempPage = (Page) palloc(pageSize);
 816                                         memmove(tempPage, page, pageSize);
 817                                 }
 818
 819                                 lpp = &(((PageHeader) tempPage)->pd_linp[offnum - 1]);
 820
 821                                 /* mark it unused */
 822                                 lpp->lp_flags &= ~LP_USED;
 823
 824                                 vpc->vpd_voff[vpc->vpd_noff++] = offnum;
 825                                 nvac++;
 826
 827                         }
 828                         else
 829                         {
 830                                 ntups++;
 831                                 notup = false;
 832                                 if (htup->t_len < min_tlen)
 833                                         min_tlen = htup->t_len;
 834                                 if (htup->t_len > max_tlen)
 835                                         max_tlen = htup->t_len;
 836                                 vc_attrstats(onerel, vacrelstats, htup);
 837                         }
 838                 }
 839
 840                 if (pgchanged)
 841                 {
 842                         WriteBuffer(buf);
 843                         dobufrel = false;
 844                         nchpg++;
 845                 }
 846                 else
 847                         dobufrel = true;
 848                 if (tempPage != (Page) NULL)
 849                 {                                               /* Some tuples are gone */
 850                         PageRepairFragmentation(tempPage);
 851                         vpc->vpd_free = ((PageHeader) tempPage)->pd_upper - ((PageHeader) tempPage)->pd_lower;
 852                         frsize += vpc->vpd_free;
 853                         vc_reappage(Vvpl, vpc);
 854                         pfree(tempPage);
 855                         tempPage = (Page) NULL;
 856                 }
 857                 else if (vpc->vpd_noff > 0)
 858                 {                                               /* there are only ~LP_USED line pointers */
 859                         vpc->vpd_free = ((PageHeader) page)->pd_upper - ((PageHeader) page)->pd_lower;
 860                         frsize += vpc->vpd_free;
 861                         vc_reappage(Vvpl, vpc);
 862                 }
 863                 if (dobufrel)
 864                         ReleaseBuffer(buf);
 865                 if (notup)
 866                         nemend++;
 867                 else
 868                         nemend = 0;
 869         }
 870
 871         pfree(vpc);
 872
 873         /* save stats in the rel list for use later */
 874         vacrelstats->ntups = ntups;
 875         vacrelstats->npages = nblocks;
 876 /*        vacrelstats->natts = attr_cnt;*/
 877         if (ntups == 0)
 878                 min_tlen = max_tlen = 0;
 879         vacrelstats->min_tlen = min_tlen;
 880         vacrelstats->max_tlen = max_tlen;
 881
 882         Vvpl->vpl_nemend = nemend;
 883         Fvpl->vpl_nemend = nemend;
 884
 885         /*
 886          * Try to make Fvpl keeping in mind that we can't use free space of
 887          * "empty" end-pages and last page if it reapped.
 888          */
 889         if (do_shrinking && Vvpl->vpl_npages - nemend > 0)
 890         {
 891                 int                     nusf;           /* blocks usefull for re-using */
 892
 893                 nusf = Vvpl->vpl_npages - nemend;
 894                 if ((Vvpl->vpl_pgdesc[nusf - 1])->vpd_blkno == nblocks - nemend - 1)
 895                         nusf--;
 896
 897                 for (i = 0; i < nusf; i++)
 898                 {
 899                         vp = Vvpl->vpl_pgdesc[i];
 900                         if (vc_enough_space(vp, min_tlen))
 901                         {
 902                                 vc_vpinsert(Fvpl, vp);
 903                                 frsusf += vp->vpd_free;
 904                         }
 905                 }
 906         }
 907
 908         getrusage(RUSAGE_SELF, &ru1);
 909
 910         elog(MESSAGE_LEVEL, "Rel %s: Pages %u: Changed %u, Reapped %u, Empty %u, New %u; \
 911 Tup %u: Vac %u, Crash %u, UnUsed %u, MinLen %u, MaxLen %u; Re-using: Free/Avail. Space %u/%u; EndEmpty/Avail. Pages %u/%u. Elapsed %u/%u sec.",
 912                  relname,
 913                  nblocks, nchpg, Vvpl->vpl_npages, nempg, nnepg,
 914                  ntups, nvac, ncrash, nunused, min_tlen, max_tlen,
 915                  frsize, frsusf, nemend, Fvpl->vpl_npages,
 916                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
 917                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
 918
 919 }                                                               /* vc_scanheap */
 920
 921
 922 /*
 923  *      vc_rpfheap() -- try to repaire relation' fragmentation
 924  *
 925  *              This routine marks dead tuples as unused and tries re-use dead space
 926  *              by moving tuples (and inserting indices if needed). It constructs
 927  *              Nvpl list of free-ed pages (moved tuples) and clean indices
 928  *              for them after committing (in hack-manner - without losing locks
 929  *              and freeing memory!) current transaction. It truncates relation
 930  *              if some end-blocks are gone away.
 931  */
 932 static void
 933 vc_rpfheap(VRelStats *vacrelstats, Relation onerel,
 934                    VPageList Vvpl, VPageList Fvpl, int nindices, Relation *Irel)
 935 {
 936         TransactionId myXID;
 937         CommandId       myCID;
 938         Buffer          buf,
 939                                 ToBuf;
 940         int                     nblocks,
 941                                 blkno;
 942         Page            page,
 943                                 ToPage = NULL;
 944         OffsetNumber offnum = 0,
 945                                 maxoff = 0,
 946                                 newoff,
 947                                 moff;
 948         ItemId          itemid,
 949                                 newitemid;
 950         HeapTuple       htup,
 951                                 newtup;
 952         TupleDesc       tupdesc = NULL;
 953         Datum      *idatum = NULL;
 954         char       *inulls = NULL;
 955         InsertIndexResult iresult;
 956         VPageListData Nvpl;
 957         VPageDescr      ToVpd = NULL,
 958                                 Fvplast,
 959                                 Vvplast,
 960                                 vpc,
 961                            *vpp;
 962         int                     ToVpI = 0;
 963         IndDesc    *Idesc,
 964                            *idcur;
 965         int                     Fblklast,
 966                                 Vblklast,
 967                                 i;
 968         Size            tlen;
 969         int                     nmoved,
 970                                 Fnpages,
 971                                 Vnpages;
 972         int                     nchkmvd,
 973                                 ntups;
 974         bool            isempty,
 975                                 dowrite;
 976         struct rusage ru0,
 977                                 ru1;
 978
 979         getrusage(RUSAGE_SELF, &ru0);
 980
 981         myXID = GetCurrentTransactionId();
 982         myCID = GetCurrentCommandId();
 983
 984         if (Irel != (Relation *) NULL)          /* preparation for index' inserts */
 985         {
 986                 vc_mkindesc(onerel, nindices, Irel, &Idesc);
 987                 tupdesc = RelationGetTupleDescriptor(onerel);
 988                 idatum = (Datum *) palloc(INDEX_MAX_KEYS * sizeof(*idatum));
 989                 inulls = (char *) palloc(INDEX_MAX_KEYS * sizeof(*inulls));
 990         }
 991
 992         Nvpl.vpl_npages = 0;
 993         Fnpages = Fvpl->vpl_npages;
 994         Fvplast = Fvpl->vpl_pgdesc[Fnpages - 1];
 995         Fblklast = Fvplast->vpd_blkno;
 996         Assert(Vvpl->vpl_npages > Vvpl->vpl_nemend);
 997         Vnpages = Vvpl->vpl_npages - Vvpl->vpl_nemend;
 998         Vvplast = Vvpl->vpl_pgdesc[Vnpages - 1];
 999         Vblklast = Vvplast->vpd_blkno;
1000         Assert(Vblklast >= Fblklast);
1001         ToBuf = InvalidBuffer;
1002         nmoved = 0;
1003
1004         vpc = (VPageDescr) palloc(sizeof(VPageDescrData) + MaxOffsetNumber * sizeof(OffsetNumber));
1005         vpc->vpd_nusd = vpc->vpd_noff = 0;
1006
1007         nblocks = vacrelstats->npages;
1008         for (blkno = nblocks - Vvpl->vpl_nemend - 1;; blkno--)
1009         {
1010                 /* if it's reapped page and it was used by me - quit */
1011                 if (blkno == Fblklast && Fvplast->vpd_nusd > 0)
1012                         break;
1013
1014                 buf = ReadBuffer(onerel, blkno);
1015                 page = BufferGetPage(buf);
1016
1017                 vpc->vpd_noff = 0;
1018
1019                 isempty = PageIsEmpty(page);
1020
1021                 dowrite = false;
1022                 if (blkno == Vblklast)  /* it's reapped page */
1023                 {
1024                         if (Vvplast->vpd_noff > 0)      /* there are dead tuples */
1025                         {                                       /* on this page - clean */
1026                                 Assert(!isempty);
1027                                 vc_vacpage(page, Vvplast);
1028                                 dowrite = true;
1029                         }
1030                         else
1031                         {
1032                                 Assert(isempty);
1033                         }
1034                         --Vnpages;
1035                         Assert(Vnpages > 0);
1036                         /* get prev reapped page from Vvpl */
1037                         Vvplast = Vvpl->vpl_pgdesc[Vnpages - 1];
1038                         Vblklast = Vvplast->vpd_blkno;
1039                         if (blkno == Fblklast)          /* this page in Fvpl too */
1040                         {
1041                                 --Fnpages;
1042                                 Assert(Fnpages > 0);
1043                                 Assert(Fvplast->vpd_nusd == 0);
1044                                 /* get prev reapped page from Fvpl */
1045                                 Fvplast = Fvpl->vpl_pgdesc[Fnpages - 1];
1046                                 Fblklast = Fvplast->vpd_blkno;
1047                         }
1048                         Assert(Fblklast <= Vblklast);
1049                         if (isempty)
1050                         {
1051                                 ReleaseBuffer(buf);
1052                                 continue;
1053                         }
1054                 }
1055                 else
1056                 {
1057                         Assert(!isempty);
1058                 }
1059
1060                 vpc->vpd_blkno = blkno;
1061                 maxoff = PageGetMaxOffsetNumber(page);
1062                 for (offnum = FirstOffsetNumber;
1063                          offnum <= maxoff;
1064                          offnum = OffsetNumberNext(offnum))
1065                 {
1066                         itemid = PageGetItemId(page, offnum);
1067
1068                         if (!ItemIdIsUsed(itemid))
1069                                 continue;
1070
1071                         htup = (HeapTuple) PageGetItem(page, itemid);
1072                         tlen = htup->t_len;
1073
1074                         /* try to find new page for this tuple */
1075                         if (ToBuf == InvalidBuffer ||
1076                                 !vc_enough_space(ToVpd, tlen))
1077                         {
1078                                 if (ToBuf != InvalidBuffer)
1079                                 {
1080                                         WriteBuffer(ToBuf);
1081                                         ToBuf = InvalidBuffer;
1082
1083                                         /*
1084                                          * If no one tuple can't be added to this page -
1085                                          * remove page from Fvpl. - vadim 11/27/96
1086                                          *
1087                                          * But we can't remove last page - this is our
1088                                          * "show-stopper" !!!   - vadim 02/25/98
1089                                          */
1090                                         if (ToVpd != Fvplast &&
1091                                                 !vc_enough_space(ToVpd, vacrelstats->min_tlen))
1092                                         {
1093                                                 Assert(Fnpages > ToVpI + 1);
1094                                                 memmove(Fvpl->vpl_pgdesc + ToVpI,
1095                                                                 Fvpl->vpl_pgdesc + ToVpI + 1,
1096                                                                 sizeof(VPageDescr *) * (Fnpages - ToVpI - 1));
1097                                                 Fnpages--;
1098                                                 Assert (Fvplast == Fvpl->vpl_pgdesc[Fnpages - 1]);
1099                                         }
1100                                 }
1101                                 for (i = 0; i < Fnpages; i++)
1102                                 {
1103                                         if (vc_enough_space(Fvpl->vpl_pgdesc[i], tlen))
1104                                                 break;
1105                                 }
1106                                 if (i == Fnpages)
1107                                         break;          /* can't move item anywhere */
1108                                 ToVpI = i;
1109                                 ToVpd = Fvpl->vpl_pgdesc[ToVpI];
1110                                 ToBuf = ReadBuffer(onerel, ToVpd->vpd_blkno);
1111                                 ToPage = BufferGetPage(ToBuf);
1112                                 /* if this page was not used before - clean it */
1113                                 if (!PageIsEmpty(ToPage) && ToVpd->vpd_nusd == 0)
1114                                         vc_vacpage(ToPage, ToVpd);
1115                         }
1116
1117                         /* copy tuple */
1118                         newtup = (HeapTuple) palloc(tlen);
1119                         memmove((char *) newtup, (char *) htup, tlen);
1120
1121                         /* store transaction information */
1122                         TransactionIdStore(myXID, &(newtup->t_xmin));
1123                         newtup->t_cmin = myCID;
1124                         StoreInvalidTransactionId(&(newtup->t_xmax));
1125                         /* set xmin to unknown and xmax to invalid */
1126                         newtup->t_infomask &= ~(HEAP_XACT_MASK);
1127                         newtup->t_infomask |= HEAP_XMAX_INVALID;
1128
1129                         /* add tuple to the page */
1130                         newoff = PageAddItem(ToPage, (Item) newtup, tlen,
1131                                                                  InvalidOffsetNumber, LP_USED);
1132                         if (newoff == InvalidOffsetNumber)
1133                         {
1134                                 elog(ERROR, "\
1135 failed to add item with len = %u to page %u (free space %u, nusd %u, noff %u)",
1136                                          tlen, ToVpd->vpd_blkno, ToVpd->vpd_free,
1137                                          ToVpd->vpd_nusd, ToVpd->vpd_noff);
1138                         }
1139                         newitemid = PageGetItemId(ToPage, newoff);
1140                         pfree(newtup);
1141                         newtup = (HeapTuple) PageGetItem(ToPage, newitemid);
1142                         ItemPointerSet(&(newtup->t_ctid), ToVpd->vpd_blkno, newoff);
1143
1144                         /* now logically delete end-tuple */
1145                         TransactionIdStore(myXID, &(htup->t_xmax));
1146                         htup->t_cmax = myCID;
1147                         /* set xmax to unknown */
1148                         htup->t_infomask &= ~(HEAP_XMAX_INVALID | HEAP_XMAX_COMMITTED);
1149
1150                         ToVpd->vpd_nusd++;
1151                         nmoved++;
1152                         ToVpd->vpd_free = ((PageHeader) ToPage)->pd_upper - ((PageHeader) ToPage)->pd_lower;
1153                         vpc->vpd_voff[vpc->vpd_noff++] = offnum;
1154
1155                         /* insert index' tuples if needed */
1156                         if (Irel != (Relation *) NULL)
1157                         {
1158                                 for (i = 0, idcur = Idesc; i < nindices; i++, idcur++)
1159                                 {
1160                                         FormIndexDatum(
1161                                                                    idcur->natts,
1162                                                            (AttrNumber *) &(idcur->tform->indkey[0]),
1163                                                                    newtup,
1164                                                                    tupdesc,
1165                                                                    InvalidBuffer,
1166                                                                    idatum,
1167                                                                    inulls,
1168                                                                    idcur->finfoP);
1169                                         iresult = index_insert(
1170                                                                                    Irel[i],
1171                                                                                    idatum,
1172                                                                                    inulls,
1173                                                                                    &(newtup->t_ctid),
1174                                                                                    onerel);
1175                                         if (iresult)
1176                                                 pfree(iresult);
1177                                 }
1178                         }
1179
1180                 }                                               /* walk along page */
1181
1182                 if (vpc->vpd_noff > 0)  /* some tuples were moved */
1183                 {
1184                         vc_reappage(&Nvpl, vpc);
1185                         WriteBuffer(buf);
1186                 }
1187                 else if (dowrite)
1188                         WriteBuffer(buf);
1189                 else
1190                         ReleaseBuffer(buf);
1191
1192                 if (offnum <= maxoff)
1193                         break;                          /* some item(s) left */
1194
1195         }                                                       /* walk along relation */
1196
1197         blkno++;                                        /* new number of blocks */
1198
1199         if (ToBuf != InvalidBuffer)
1200         {
1201                 Assert(nmoved > 0);
1202                 WriteBuffer(ToBuf);
1203         }
1204
1205         if (nmoved > 0)
1206         {
1207
1208                 /*
1209                  * We have to commit our tuple' movings before we'll truncate
1210                  * relation, but we shouldn't lose our locks. And so - quick hack:
1211                  * flush buffers and record status of current transaction as
1212                  * committed, and continue. - vadim 11/13/96
1213                  */
1214                 FlushBufferPool(!TransactionFlushEnabled());
1215                 TransactionIdCommit(myXID);
1216                 FlushBufferPool(!TransactionFlushEnabled());
1217         }
1218
1219         /*
1220          * Clean uncleaned reapped pages from Vvpl list and set xmin committed
1221          * for inserted tuples
1222          */
1223         nchkmvd = 0;
1224         for (i = 0, vpp = Vvpl->vpl_pgdesc; i < Vnpages; i++, vpp++)
1225         {
1226                 Assert((*vpp)->vpd_blkno < blkno);
1227                 buf = ReadBuffer(onerel, (*vpp)->vpd_blkno);
1228                 page = BufferGetPage(buf);
1229                 if ((*vpp)->vpd_nusd == 0)              /* this page was not used */
1230                 {
1231
1232                         /*
1233                          * noff == 0 in empty pages only - such pages should be
1234                          * re-used
1235                          */
1236                         Assert((*vpp)->vpd_noff > 0);
1237                         vc_vacpage(page, *vpp);
1238                 }
1239                 else
1240 /* this page was used */
1241                 {
1242                         ntups = 0;
1243                         moff = PageGetMaxOffsetNumber(page);
1244                         for (newoff = FirstOffsetNumber;
1245                                  newoff <= moff;
1246                                  newoff = OffsetNumberNext(newoff))
1247                         {
1248                                 itemid = PageGetItemId(page, newoff);
1249                                 if (!ItemIdIsUsed(itemid))
1250                                         continue;
1251                                 htup = (HeapTuple) PageGetItem(page, itemid);
1252                                 if (TransactionIdEquals((TransactionId) htup->t_xmin, myXID))
1253                                 {
1254                                         htup->t_infomask |= HEAP_XMIN_COMMITTED;
1255                                         ntups++;
1256                                 }
1257                         }
1258                         Assert((*vpp)->vpd_nusd == ntups);
1259                         nchkmvd += ntups;
1260                 }
1261                 WriteBuffer(buf);
1262         }
1263         Assert(nmoved == nchkmvd);
1264
1265         getrusage(RUSAGE_SELF, &ru1);
1266
1267         elog(MESSAGE_LEVEL, "Rel %s: Pages: %u --> %u; Tuple(s) moved: %u. \
1268 Elapsed %u/%u sec.",
1269                  (RelationGetRelationName(onerel))->data,
1270                  nblocks, blkno, nmoved,
1271                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1272                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1273
1274         if (Nvpl.vpl_npages > 0)
1275         {
1276                 /* vacuum indices again if needed */
1277                 if (Irel != (Relation *) NULL)
1278                 {
1279                         VPageDescr *vpleft,
1280                                            *vpright,
1281                                                 vpsave;
1282
1283                         /* re-sort Nvpl.vpl_pgdesc */
1284                         for (vpleft = Nvpl.vpl_pgdesc,
1285                                  vpright = Nvpl.vpl_pgdesc + Nvpl.vpl_npages - 1;
1286                                  vpleft < vpright; vpleft++, vpright--)
1287                         {
1288                                 vpsave = *vpleft;
1289                                 *vpleft = *vpright;
1290                                 *vpright = vpsave;
1291                         }
1292                         for (i = 0; i < nindices; i++)
1293                                 vc_vaconeind(&Nvpl, Irel[i], vacrelstats->ntups);
1294                 }
1295
1296                 /*
1297                  * clean moved tuples from last page in Nvpl list if some tuples
1298                  * left there
1299                  */
1300                 if (vpc->vpd_noff > 0 && offnum <= maxoff)
1301                 {
1302                         Assert(vpc->vpd_blkno == blkno - 1);
1303                         buf = ReadBuffer(onerel, vpc->vpd_blkno);
1304                         page = BufferGetPage(buf);
1305                         ntups = 0;
1306                         maxoff = offnum;
1307                         for (offnum = FirstOffsetNumber;
1308                                  offnum < maxoff;
1309                                  offnum = OffsetNumberNext(offnum))
1310                         {
1311                                 itemid = PageGetItemId(page, offnum);
1312                                 if (!ItemIdIsUsed(itemid))
1313                                         continue;
1314                                 htup = (HeapTuple) PageGetItem(page, itemid);
1315                                 Assert(TransactionIdEquals((TransactionId) htup->t_xmax, myXID));
1316                                 itemid->lp_flags &= ~LP_USED;
1317                                 ntups++;
1318                         }
1319                         Assert(vpc->vpd_noff == ntups);
1320                         PageRepairFragmentation(page);
1321                         WriteBuffer(buf);
1322                 }
1323
1324                 /* now - free new list of reapped pages */
1325                 vpp = Nvpl.vpl_pgdesc;
1326                 for (i = 0; i < Nvpl.vpl_npages; i++, vpp++)
1327                         pfree(*vpp);
1328                 pfree(Nvpl.vpl_pgdesc);
1329         }
1330
1331         /* truncate relation */
1332         if (blkno < nblocks)
1333         {
1334                 i = BlowawayRelationBuffers(onerel, blkno);
1335                 if (i < 0)
1336                         elog (FATAL, "VACUUM (vc_rpfheap): BlowawayRelationBuffers returned %d", i);
1337                 blkno = smgrtruncate(DEFAULT_SMGR, onerel, blkno);
1338                 Assert(blkno >= 0);
1339                 vacrelstats->npages = blkno;    /* set new number of blocks */
1340         }
1341
1342         if (Irel != (Relation *) NULL)          /* pfree index' allocations */
1343         {
1344                 pfree(Idesc);
1345                 pfree(idatum);
1346                 pfree(inulls);
1347                 vc_clsindices(nindices, Irel);
1348         }
1349
1350         pfree(vpc);
1351
1352 }                                                               /* vc_rpfheap */
1353
1354 /*
1355  *      vc_vacheap() -- free dead tuples
1356  *
1357  *              This routine marks dead tuples as unused and truncates relation
1358  *              if there are "empty" end-blocks.
1359  */
1360 static void
1361 vc_vacheap(VRelStats *vacrelstats, Relation onerel, VPageList Vvpl)
1362 {
1363         Buffer          buf;
1364         Page            page;
1365         VPageDescr *vpp;
1366         int                     nblocks;
1367         int                     i;
1368
1369         nblocks = Vvpl->vpl_npages;
1370         nblocks -= Vvpl->vpl_nemend;    /* nothing to do with them */
1371
1372         for (i = 0, vpp = Vvpl->vpl_pgdesc; i < nblocks; i++, vpp++)
1373         {
1374                 if ((*vpp)->vpd_noff > 0)
1375                 {
1376                         buf = ReadBuffer(onerel, (*vpp)->vpd_blkno);
1377                         page = BufferGetPage(buf);
1378                         vc_vacpage(page, *vpp);
1379                         WriteBuffer(buf);
1380                 }
1381         }
1382
1383         /* truncate relation if there are some empty end-pages */
1384         if (Vvpl->vpl_nemend > 0)
1385         {
1386                 Assert(vacrelstats->npages >= Vvpl->vpl_nemend);
1387                 nblocks = vacrelstats->npages - Vvpl->vpl_nemend;
1388                 elog(MESSAGE_LEVEL, "Rel %s: Pages: %u --> %u.",
1389                          (RelationGetRelationName(onerel))->data,
1390                          vacrelstats->npages, nblocks);
1391
1392                 /*
1393                  * we have to flush "empty" end-pages (if changed, but who knows
1394                  * it) before truncation
1395                  */
1396                 FlushBufferPool(!TransactionFlushEnabled());
1397
1398                 i = BlowawayRelationBuffers(onerel, nblocks);
1399                 if (i < 0)
1400                         elog (FATAL, "VACUUM (vc_vacheap): BlowawayRelationBuffers returned %d", i);
1401
1402                 nblocks = smgrtruncate(DEFAULT_SMGR, onerel, nblocks);
1403                 Assert(nblocks >= 0);
1404                 vacrelstats->npages = nblocks;  /* set new number of blocks */
1405         }
1406
1407 }                                                               /* vc_vacheap */
1408
1409 /*
1410  *      vc_vacpage() -- free dead tuples on a page
1411  *                                       and repaire its fragmentation.
1412  */
1413 static void
1414 vc_vacpage(Page page, VPageDescr vpd)
1415 {
1416         ItemId          itemid;
1417         int                     i;
1418
1419         Assert(vpd->vpd_nusd == 0);
1420         for (i = 0; i < vpd->vpd_noff; i++)
1421         {
1422                 itemid = &(((PageHeader) page)->pd_linp[vpd->vpd_voff[i] - 1]);
1423                 itemid->lp_flags &= ~LP_USED;
1424         }
1425         PageRepairFragmentation(page);
1426
1427 }                                                               /* vc_vacpage */
1428
1429 /*
1430  *      _vc_scanoneind() -- scan one index relation to update statistic.
1431  *
1432  */
1433 static void
1434 vc_scanoneind(Relation indrel, int nhtups)
1435 {
1436         RetrieveIndexResult res;
1437         IndexScanDesc iscan;
1438         int                     nitups;
1439         int                     nipages;
1440         struct rusage ru0,
1441                                 ru1;
1442
1443         getrusage(RUSAGE_SELF, &ru0);
1444
1445         /* walk through the entire index */
1446         iscan = index_beginscan(indrel, false, 0, (ScanKey) NULL);
1447         nitups = 0;
1448
1449         while ((res = index_getnext(iscan, ForwardScanDirection))
1450                    != (RetrieveIndexResult) NULL)
1451         {
1452                 nitups++;
1453                 pfree(res);
1454         }
1455
1456         index_endscan(iscan);
1457
1458         /* now update statistics in pg_class */
1459         nipages = RelationGetNumberOfBlocks(indrel);
1460         vc_updstats(indrel->rd_id, nipages, nitups, false, NULL);
1461
1462         getrusage(RUSAGE_SELF, &ru1);
1463
1464         elog(MESSAGE_LEVEL, "Ind %s: Pages %u; Tuples %u. Elapsed %u/%u sec.",
1465                  indrel->rd_rel->relname.data, nipages, nitups,
1466                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1467                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1468
1469         if (nitups != nhtups)
1470                 elog(NOTICE, "Ind %s: NUMBER OF INDEX' TUPLES (%u) IS NOT THE SAME AS HEAP' (%u)",
1471                          indrel->rd_rel->relname.data, nitups, nhtups);
1472
1473 }                                                               /* vc_scanoneind */
1474
1475 /*
1476  *      vc_vaconeind() -- vacuum one index relation.
1477  *
1478  *              Vpl is the VPageList of the heap we're currently vacuuming.
1479  *              It's locked. Indrel is an index relation on the vacuumed heap.
1480  *              We don't set locks on the index relation here, since the indexed
1481  *              access methods support locking at different granularities.
1482  *              We let them handle it.
1483  *
1484  *              Finally, we arrange to update the index relation's statistics in
1485  *              pg_class.
1486  */
1487 static void
1488 vc_vaconeind(VPageList vpl, Relation indrel, int nhtups)
1489 {
1490         RetrieveIndexResult res;
1491         IndexScanDesc iscan;
1492         ItemPointer heapptr;
1493         int                     nvac;
1494         int                     nitups;
1495         int                     nipages;
1496         VPageDescr      vp;
1497         struct rusage ru0,
1498                                 ru1;
1499
1500         getrusage(RUSAGE_SELF, &ru0);
1501
1502         /* walk through the entire index */
1503         iscan = index_beginscan(indrel, false, 0, (ScanKey) NULL);
1504         nvac = 0;
1505         nitups = 0;
1506
1507         while ((res = index_getnext(iscan, ForwardScanDirection))
1508                    != (RetrieveIndexResult) NULL)
1509         {
1510                 heapptr = &res->heap_iptr;
1511
1512                 if ((vp = vc_tidreapped(heapptr, vpl)) != (VPageDescr) NULL)
1513                 {
1514 #if 0
1515                         elog(DEBUG, "<%x,%x> -> <%x,%x>",
1516                                  ItemPointerGetBlockNumber(&(res->index_iptr)),
1517                                  ItemPointerGetOffsetNumber(&(res->index_iptr)),
1518                                  ItemPointerGetBlockNumber(&(res->heap_iptr)),
1519                                  ItemPointerGetOffsetNumber(&(res->heap_iptr)));
1520 #endif
1521                         if (vp->vpd_noff == 0)
1522                         {                                       /* this is EmptyPage !!! */
1523                                 elog(NOTICE, "Ind %s: pointer to EmptyPage (blk %u off %u) - fixing",
1524                                          indrel->rd_rel->relname.data,
1525                                          vp->vpd_blkno, ItemPointerGetOffsetNumber(heapptr));
1526                         }
1527                         ++nvac;
1528                         index_delete(indrel, &res->index_iptr);
1529                 }
1530                 else
1531                 {
1532                         nitups++;
1533                 }
1534
1535                 /* be tidy */
1536                 pfree(res);
1537         }
1538
1539         index_endscan(iscan);
1540
1541         /* now update statistics in pg_class */
1542         nipages = RelationGetNumberOfBlocks(indrel);
1543         vc_updstats(indrel->rd_id, nipages, nitups, false, NULL);
1544
1545         getrusage(RUSAGE_SELF, &ru1);
1546
1547         elog(MESSAGE_LEVEL, "Ind %s: Pages %u; Tuples %u: Deleted %u. Elapsed %u/%u sec.",
1548                  indrel->rd_rel->relname.data, nipages, nitups, nvac,
1549                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1550                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1551
1552         if (nitups != nhtups)
1553                 elog(NOTICE, "Ind %s: NUMBER OF INDEX' TUPLES (%u) IS NOT THE SAME AS HEAP' (%u)",
1554                          indrel->rd_rel->relname.data, nitups, nhtups);
1555
1556 }                                                               /* vc_vaconeind */
1557
1558 /*
1559  *      vc_tidreapped() -- is a particular tid reapped?
1560  *
1561  *              vpl->VPageDescr_array is sorted in right order.
1562  */
1563 static VPageDescr
1564 vc_tidreapped(ItemPointer itemptr, VPageList vpl)
1565 {
1566         OffsetNumber ioffno;
1567         OffsetNumber *voff;
1568         VPageDescr      vp,
1569                            *vpp;
1570         VPageDescrData vpd;
1571
1572         vpd.vpd_blkno = ItemPointerGetBlockNumber(itemptr);
1573         ioffno = ItemPointerGetOffsetNumber(itemptr);
1574
1575         vp = &vpd;
1576         vpp = (VPageDescr *) vc_find_eq((char *) (vpl->vpl_pgdesc),
1577                                            vpl->vpl_npages, sizeof(VPageDescr), (char *) &vp,
1578                                                                         vc_cmp_blk);
1579
1580         if (vpp == (VPageDescr *) NULL)
1581                 return ((VPageDescr) NULL);
1582         vp = *vpp;
1583
1584         /* ok - we are on true page */
1585
1586         if (vp->vpd_noff == 0)
1587         {                                                       /* this is EmptyPage !!! */
1588                 return (vp);
1589         }
1590
1591         voff = (OffsetNumber *) vc_find_eq((char *) (vp->vpd_voff),
1592                                         vp->vpd_noff, sizeof(OffsetNumber), (char *) &ioffno,
1593                                                                            vc_cmp_offno);
1594
1595         if (voff == (OffsetNumber *) NULL)
1596                 return ((VPageDescr) NULL);
1597
1598         return (vp);
1599
1600 }                                                               /* vc_tidreapped */
1601
1602 /*
1603  *      vc_attrstats() -- compute column statistics used by the optimzer
1604  *
1605  *      We compute the column min, max, null and non-null counts.
1606  *      Plus we attempt to find the count of the value that occurs most
1607  *      frequently in each column
1608  *      These figures are used to compute the selectivity of the column
1609  *
1610  *      We use a three-bucked cache to get the most frequent item
1611  *      The 'guess' buckets count hits.  A cache miss causes guess1
1612  *      to get the most hit 'guess' item in the most recent cycle, and
1613  *      the new item goes into guess2.  Whenever the total count of hits
1614  *      of a 'guess' entry is larger than 'best', 'guess' becomes 'best'.
1615  *
1616  *      This method works perfectly for columns with unique values, and columns
1617  *      with only two unique values, plus nulls.
1618  *
1619  *      It becomes less perfect as the number of unique values increases and
1620  *      their distribution in the table becomes more random.
1621  *
1622  */
1623 static void
1624 vc_attrstats(Relation onerel, VRelStats *vacrelstats, HeapTuple htup)
1625 {
1626         int                     i,
1627                                 attr_cnt = vacrelstats->va_natts;
1628         VacAttrStats *vacattrstats = vacrelstats->vacattrstats;
1629         TupleDesc       tupDesc = onerel->rd_att;
1630         Datum           value;
1631         bool            isnull;
1632
1633         for (i = 0; i < attr_cnt; i++)
1634         {
1635                 VacAttrStats *stats = &vacattrstats[i];
1636                 bool            value_hit = true;
1637
1638                 value = heap_getattr(htup,
1639                                                          stats->attr->attnum, tupDesc, &isnull);
1640
1641                 if (!VacAttrStatsEqValid(stats))
1642                         continue;
1643
1644                 if (isnull)
1645                         stats->null_cnt++;
1646                 else
1647                 {
1648                         stats->nonnull_cnt++;
1649                         if (stats->initialized == false)
1650                         {
1651                                 vc_bucketcpy(stats->attr, value, &stats->best, &stats->best_len);
1652                                 /* best_cnt gets incremented later */
1653                                 vc_bucketcpy(stats->attr, value, &stats->guess1, &stats->guess1_len);
1654                                 stats->guess1_cnt = stats->guess1_hits = 1;
1655                                 vc_bucketcpy(stats->attr, value, &stats->guess2, &stats->guess2_len);
1656                                 stats->guess2_hits = 1;
1657                                 if (VacAttrStatsLtGtValid(stats))
1658                                 {
1659                                         vc_bucketcpy(stats->attr, value, &stats->max, &stats->max_len);
1660                                         vc_bucketcpy(stats->attr, value, &stats->min, &stats->min_len);
1661                                 }
1662                                 stats->initialized = true;
1663                         }
1664                         if (VacAttrStatsLtGtValid(stats))
1665                         {
1666                                 if ((*fmgr_faddr(&stats->f_cmplt)) (value, stats->min))
1667                                 {
1668                                         vc_bucketcpy(stats->attr, value, &stats->min, &stats->min_len);
1669                                         stats->min_cnt = 0;
1670                                 }
1671                                 if ((*fmgr_faddr(&stats->f_cmpgt)) (value, stats->max))
1672                                 {
1673                                         vc_bucketcpy(stats->attr, value, &stats->max, &stats->max_len);
1674                                         stats->max_cnt = 0;
1675                                 }
1676                                 if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->min))
1677                                         stats->min_cnt++;
1678                                 else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->max))
1679                                         stats->max_cnt++;
1680                         }
1681                         if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->best))
1682                                 stats->best_cnt++;
1683                         else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->guess1))
1684                         {
1685                                 stats->guess1_cnt++;
1686                                 stats->guess1_hits++;
1687                         }
1688                         else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->guess2))
1689                                 stats->guess2_hits++;
1690                         else
1691                                 value_hit = false;
1692
1693                         if (stats->guess2_hits > stats->guess1_hits)
1694                         {
1695                                 swapDatum(stats->guess1, stats->guess2);
1696                                 swapInt(stats->guess1_len, stats->guess2_len);
1697                                 stats->guess1_cnt = stats->guess2_hits;
1698                                 swapLong(stats->guess1_hits, stats->guess2_hits);
1699                         }
1700                         if (stats->guess1_cnt > stats->best_cnt)
1701                         {
1702                                 swapDatum(stats->best, stats->guess1);
1703                                 swapInt(stats->best_len, stats->guess1_len);
1704                                 swapLong(stats->best_cnt, stats->guess1_cnt);
1705                                 stats->guess1_hits = 1;
1706                                 stats->guess2_hits = 1;
1707                         }
1708                         if (!value_hit)
1709                         {
1710                                 vc_bucketcpy(stats->attr, value, &stats->guess2, &stats->guess2_len);
1711                                 stats->guess1_hits = 1;
1712                                 stats->guess2_hits = 1;
1713                         }
1714                 }
1715         }
1716         return;
1717 }
1718
1719 /*
1720  *      vc_bucketcpy() -- update pg_class statistics for one relation
1721  *
1722  */
1723 static void
1724 vc_bucketcpy(AttributeTupleForm attr, Datum value, Datum *bucket, int16 *bucket_len)
1725 {
1726         if (attr->attbyval && attr->attlen != -1)
1727                 *bucket = value;
1728         else
1729         {
1730                 int                     len = (attr->attlen != -1 ? attr->attlen : VARSIZE(value));
1731
1732                 if (len > *bucket_len)
1733                 {
1734                         if (*bucket_len != 0)
1735                                 pfree(DatumGetPointer(*bucket));
1736                         *bucket = PointerGetDatum(palloc(len));
1737                         *bucket_len = len;
1738                 }
1739                 memmove(DatumGetPointer(*bucket), DatumGetPointer(value), len);
1740         }
1741 }
1742
1743 /*
1744  *      vc_updstats() -- update pg_class statistics for one relation
1745  *
1746  *              This routine works for both index and heap relation entries in
1747  *              pg_class.  We violate no-overwrite semantics here by storing new
1748  *              values for ntups, npages, and hasindex directly in the pg_class
1749  *              tuple that's already on the page.  The reason for this is that if
1750  *              we updated these tuples in the usual way, then every tuple in pg_class
1751  *              would be replaced every day.  This would make planning and executing
1752  *              historical queries very expensive.
1753  */
1754 static void
1755 vc_updstats(Oid relid, int npages, int ntups, bool hasindex, VRelStats *vacrelstats)
1756 {
1757         Relation        rd,
1758                                 ad,
1759                                 sd;
1760         HeapScanDesc rsdesc,
1761                                 asdesc;
1762         TupleDesc       sdesc;
1763         HeapTuple       rtup,
1764                                 atup,
1765                                 stup;
1766         Buffer          rbuf,
1767                                 abuf;
1768         Form_pg_class pgcform;
1769         ScanKeyData rskey,
1770                                 askey;
1771         AttributeTupleForm attp;
1772
1773         /*
1774          * update number of tuples and number of pages in pg_class
1775          */
1776         ScanKeyEntryInitialize(&rskey, 0x0, ObjectIdAttributeNumber,
1777                                                    ObjectIdEqualRegProcedure,
1778                                                    ObjectIdGetDatum(relid));
1779
1780         rd = heap_openr(RelationRelationName);
1781         rsdesc = heap_beginscan(rd, false, false, 1, &rskey);
1782
1783         if (!HeapTupleIsValid(rtup = heap_getnext(rsdesc, 0, &rbuf)))
1784                 elog(ERROR, "pg_class entry for relid %d vanished during vacuuming",
1785                          relid);
1786
1787         /* overwrite the existing statistics in the tuple */
1788         vc_setpagelock(rd, BufferGetBlockNumber(rbuf));
1789         pgcform = (Form_pg_class) GETSTRUCT(rtup);
1790         pgcform->reltuples = ntups;
1791         pgcform->relpages = npages;
1792         pgcform->relhasindex = hasindex;
1793
1794         if (vacrelstats != NULL && vacrelstats->va_natts > 0)
1795         {
1796                 VacAttrStats *vacattrstats = vacrelstats->vacattrstats;
1797                 int                     natts = vacrelstats->va_natts;
1798
1799                 ad = heap_openr(AttributeRelationName);
1800                 sd = heap_openr(StatisticRelationName);
1801                 ScanKeyEntryInitialize(&askey, 0, Anum_pg_attribute_attrelid,
1802                                                            F_INT4EQ, relid);
1803
1804                 asdesc = heap_beginscan(ad, false, false, 1, &askey);
1805
1806                 while (HeapTupleIsValid(atup = heap_getnext(asdesc, 0, &abuf)))
1807                 {
1808                         int                     i;
1809                         float32data selratio;           /* average ratio of rows selected
1810                                                                                  * for a random constant */
1811                         VacAttrStats *stats;
1812                         Datum           values[Natts_pg_statistic];
1813                         char            nulls[Natts_pg_statistic];
1814
1815                         attp = (AttributeTupleForm) GETSTRUCT(atup);
1816                         if (attp->attnum <= 0)          /* skip system attributes for now, */
1817                                 /* they are unique anyway */
1818                                 continue;
1819
1820                         for (i = 0; i < natts; i++)
1821                         {
1822                                 if (attp->attnum == vacattrstats[i].attr->attnum)
1823                                         break;
1824                         }
1825                         if (i >= natts)
1826                                 continue;
1827                         stats = &(vacattrstats[i]);
1828
1829                         /* overwrite the existing statistics in the tuple */
1830                         if (VacAttrStatsEqValid(stats))
1831                         {
1832
1833                                 vc_setpagelock(ad, BufferGetBlockNumber(abuf));
1834
1835                                 if (stats->nonnull_cnt + stats->null_cnt == 0 ||
1836                                         (stats->null_cnt <= 1 && stats->best_cnt == 1))
1837                                         selratio = 0;
1838                                 else if (VacAttrStatsLtGtValid(stats) && stats->min_cnt + stats->max_cnt == stats->nonnull_cnt)
1839                                 {
1840                                         double          min_cnt_d = stats->min_cnt,
1841                                                                 max_cnt_d = stats->max_cnt,
1842                                                                 null_cnt_d = stats->null_cnt,
1843                                                                 nonnullcnt_d = stats->nonnull_cnt;              /* prevent overflow */
1844
1845                                         selratio = (min_cnt_d * min_cnt_d + max_cnt_d * max_cnt_d + null_cnt_d * null_cnt_d) /
1846                                                 (nonnullcnt_d + null_cnt_d) / (nonnullcnt_d + null_cnt_d);
1847                                 }
1848                                 else
1849                                 {
1850                                         double          most = (double) (stats->best_cnt > stats->null_cnt ? stats->best_cnt : stats->null_cnt);
1851                                         double          total = ((double) stats->nonnull_cnt) + ((double) stats->null_cnt);
1852
1853                                         /*
1854                                          * we assume count of other values are 20% of best
1855                                          * count in table
1856                                          */
1857                                         selratio = (most * most + 0.20 * most * (total - most)) / total / total;
1858                                 }
1859                                 if (selratio > 1.0)
1860                                         selratio = 1.0;
1861                                 attp->attdisbursion = selratio;
1862                                 WriteNoReleaseBuffer(abuf);
1863
1864                                 /* DO PG_STATISTIC INSERTS */
1865
1866                                 /*
1867                                  * doing system relations, especially pg_statistic is a
1868                                  * problem
1869                                  */
1870                                 if (VacAttrStatsLtGtValid(stats) && stats->initialized  /* &&
1871                                                                                                                                                  * !IsSystemRelationName(
1872                                                                                                                                                  *
1873                                          pgcform->relname.data) */ )
1874                                 {
1875                                         FmgrInfo        out_function;
1876                                         char       *out_string;
1877
1878                                         for (i = 0; i < Natts_pg_statistic; ++i)
1879                                                 nulls[i] = ' ';
1880
1881                                         /* ----------------
1882                                          *      initialize values[]
1883                                          * ----------------
1884                                          */
1885                                         i = 0;
1886                                         values[i++] = (Datum) relid;            /* 1 */
1887                                         values[i++] = (Datum) attp->attnum; /* 2 */
1888                                         values[i++] = (Datum) InvalidOid;       /* 3 */
1889                                         fmgr_info(stats->outfunc, &out_function);
1890                                         out_string = (*fmgr_faddr(&out_function)) (stats->min, stats->attr->atttypid);
1891                                         values[i++] = (Datum) fmgr(TextInRegProcedure, out_string);
1892                                         pfree(out_string);
1893                                         out_string = (char *) (*fmgr_faddr(&out_function)) (stats->max, stats->attr->atttypid);
1894                                         values[i++] = (Datum) fmgr(TextInRegProcedure, out_string);
1895                                         pfree(out_string);
1896
1897                                         sdesc = sd->rd_att;
1898
1899                                         stup = heap_formtuple(sdesc, values, nulls);
1900
1901                                         /* ----------------
1902                                          *      insert the tuple in the relation and get the tuple's oid.
1903                                          * ----------------
1904                                          */
1905                                         heap_insert(sd, stup);
1906                                         pfree(DatumGetPointer(values[3]));
1907                                         pfree(DatumGetPointer(values[4]));
1908                                         pfree(stup);
1909                                 }
1910                         }
1911                 }
1912                 heap_endscan(asdesc);
1913                 heap_close(ad);
1914                 heap_close(sd);
1915         }
1916
1917         /* XXX -- after write, should invalidate relcache in other backends */
1918         WriteNoReleaseBuffer(rbuf); /* heap_endscan release scan' buffers ? */
1919
1920         /*
1921          * invalidating system relations confuses the function cache of
1922          * pg_operator and pg_opclass
1923          */
1924         if (!IsSystemRelationName(pgcform->relname.data))
1925                 RelationInvalidateHeapTuple(rd, rtup);
1926
1927         /* that's all, folks */
1928         heap_endscan(rsdesc);
1929         heap_close(rd);
1930 }
1931
1932 /*
1933  *      vc_delhilowstats() -- delete pg_statistics rows
1934  *
1935  */
1936 static void
1937 vc_delhilowstats(Oid relid, int attcnt, int *attnums)
1938 {
1939         Relation        pgstatistic;
1940         HeapScanDesc pgsscan;
1941         HeapTuple       pgstup;
1942         ScanKeyData pgskey;
1943
1944         pgstatistic = heap_openr(StatisticRelationName);
1945
1946         if (relid != InvalidOid)
1947         {
1948                 ScanKeyEntryInitialize(&pgskey, 0x0, Anum_pg_statistic_starelid,
1949                                                            ObjectIdEqualRegProcedure,
1950                                                            ObjectIdGetDatum(relid));
1951                 pgsscan = heap_beginscan(pgstatistic, false, false, 1, &pgskey);
1952         }
1953         else
1954                 pgsscan = heap_beginscan(pgstatistic, false, false, 0, NULL);
1955
1956         while (HeapTupleIsValid(pgstup = heap_getnext(pgsscan, 0, NULL)))
1957         {
1958                 if (attcnt > 0)
1959                 {
1960                         Form_pg_statistic pgs = (Form_pg_statistic) GETSTRUCT(pgstup);
1961                         int                     i;
1962
1963                         for (i = 0; i < attcnt; i++)
1964                         {
1965                                 if (pgs->staattnum == attnums[i] + 1)
1966                                         break;
1967                         }
1968                         if (i >= attcnt)
1969                                 continue;               /* don't delete it */
1970                 }
1971                 heap_delete(pgstatistic, &pgstup->t_ctid);
1972         }
1973
1974         heap_endscan(pgsscan);
1975         heap_close(pgstatistic);
1976 }
1977
1978 static void
1979 vc_setpagelock(Relation rel, BlockNumber blkno)
1980 {
1981         ItemPointerData itm;
1982
1983         ItemPointerSet(&itm, blkno, 1);
1984
1985         RelationSetLockForWritePage(rel, &itm);
1986 }
1987
1988 /*
1989  *      vc_reappage() -- save a page on the array of reapped pages.
1990  *
1991  *              As a side effect of the way that the vacuuming loop for a given
1992  *              relation works, higher pages come after lower pages in the array
1993  *              (and highest tid on a page is last).
1994  */
1995 static void
1996 vc_reappage(VPageList vpl, VPageDescr vpc)
1997 {
1998         VPageDescr      newvpd;
1999
2000         /* allocate a VPageDescrData entry */
2001         newvpd = (VPageDescr) palloc(sizeof(VPageDescrData) + vpc->vpd_noff * sizeof(OffsetNumber));
2002
2003         /* fill it in */
2004         if (vpc->vpd_noff > 0)
2005                 memmove(newvpd->vpd_voff, vpc->vpd_voff, vpc->vpd_noff * sizeof(OffsetNumber));
2006         newvpd->vpd_blkno = vpc->vpd_blkno;
2007         newvpd->vpd_free = vpc->vpd_free;
2008         newvpd->vpd_nusd = vpc->vpd_nusd;
2009         newvpd->vpd_noff = vpc->vpd_noff;
2010
2011         /* insert this page into vpl list */
2012         vc_vpinsert(vpl, newvpd);
2013
2014 }                                                               /* vc_reappage */
2015
2016 static void
2017 vc_vpinsert(VPageList vpl, VPageDescr vpnew)
2018 {
2019
2020         /* allocate a VPageDescr entry if needed */
2021         if (vpl->vpl_npages == 0)
2022                 vpl->vpl_pgdesc = (VPageDescr *) palloc(100 * sizeof(VPageDescr));
2023         else if (vpl->vpl_npages % 100 == 0)
2024                 vpl->vpl_pgdesc = (VPageDescr *) repalloc(vpl->vpl_pgdesc, (vpl->vpl_npages + 100) * sizeof(VPageDescr));
2025         vpl->vpl_pgdesc[vpl->vpl_npages] = vpnew;
2026         (vpl->vpl_npages)++;
2027
2028 }
2029
2030 static void
2031 vc_free(VRelList vrl)
2032 {
2033         VRelList        p_vrl;
2034         MemoryContext old;
2035         PortalVariableMemory pmem;
2036
2037         pmem = PortalGetVariableMemory(vc_portal);
2038         old = MemoryContextSwitchTo((MemoryContext) pmem);
2039
2040         while (vrl != (VRelList) NULL)
2041         {
2042
2043                 /* free rel list entry */
2044                 p_vrl = vrl;
2045                 vrl = vrl->vrl_next;
2046                 pfree(p_vrl);
2047         }
2048
2049         MemoryContextSwitchTo(old);
2050 }
2051
2052 static char *
2053 vc_find_eq(char *bot, int nelem, int size, char *elm, int (*compar) (char *, char *))
2054 {
2055         int                     res;
2056         int                     last = nelem - 1;
2057         int                     celm = nelem / 2;
2058         bool            last_move,
2059                                 first_move;
2060
2061         last_move = first_move = true;
2062         for (;;)
2063         {
2064                 if (first_move == true)
2065                 {
2066                         res = compar(bot, elm);
2067                         if (res > 0)
2068                                 return (NULL);
2069                         if (res == 0)
2070                                 return (bot);
2071                         first_move = false;
2072                 }
2073                 if (last_move == true)
2074                 {
2075                         res = compar(elm, bot + last * size);
2076                         if (res > 0)
2077                                 return (NULL);
2078                         if (res == 0)
2079                                 return (bot + last * size);
2080                         last_move = false;
2081                 }
2082                 res = compar(elm, bot + celm * size);
2083                 if (res == 0)
2084                         return (bot + celm * size);
2085                 if (res < 0)
2086                 {
2087                         if (celm == 0)
2088                                 return (NULL);
2089                         last = celm - 1;
2090                         celm = celm / 2;
2091                         last_move = true;
2092                         continue;
2093                 }
2094
2095                 if (celm == last)
2096                         return (NULL);
2097
2098                 last = last - celm - 1;
2099                 bot = bot + (celm + 1) * size;
2100                 celm = (last + 1) / 2;
2101                 first_move = true;
2102         }
2103
2104 }                                                               /* vc_find_eq */
2105
2106 static int
2107 vc_cmp_blk(char *left, char *right)
2108 {
2109         BlockNumber lblk,
2110                                 rblk;
2111
2112         lblk = (*((VPageDescr *) left))->vpd_blkno;
2113         rblk = (*((VPageDescr *) right))->vpd_blkno;
2114
2115         if (lblk < rblk)
2116                 return (-1);
2117         if (lblk == rblk)
2118                 return (0);
2119         return (1);
2120
2121 }                                                               /* vc_cmp_blk */
2122
2123 static int
2124 vc_cmp_offno(char *left, char *right)
2125 {
2126
2127         if (*(OffsetNumber *) left < *(OffsetNumber *) right)
2128                 return (-1);
2129         if (*(OffsetNumber *) left == *(OffsetNumber *) right)
2130                 return (0);
2131         return (1);
2132
2133 }                                                               /* vc_cmp_offno */
2134
2135
2136 static void
2137 vc_getindices(Oid relid, int *nindices, Relation **Irel)
2138 {
2139         Relation        pgindex;
2140         Relation        irel;
2141         TupleDesc       pgidesc;
2142         HeapTuple       pgitup;
2143         HeapScanDesc pgiscan;
2144         Datum           d;
2145         int                     i,
2146                                 k;
2147         bool            n;
2148         ScanKeyData pgikey;
2149         Oid                *ioid;
2150
2151         *nindices = i = 0;
2152
2153         ioid = (Oid *) palloc(10 * sizeof(Oid));
2154
2155         /* prepare a heap scan on the pg_index relation */
2156         pgindex = heap_openr(IndexRelationName);
2157         pgidesc = RelationGetTupleDescriptor(pgindex);
2158
2159         ScanKeyEntryInitialize(&pgikey, 0x0, Anum_pg_index_indrelid,
2160                                                    ObjectIdEqualRegProcedure,
2161                                                    ObjectIdGetDatum(relid));
2162
2163         pgiscan = heap_beginscan(pgindex, false, false, 1, &pgikey);
2164
2165         while (HeapTupleIsValid(pgitup = heap_getnext(pgiscan, 0, NULL)))
2166         {
2167                 d = heap_getattr(pgitup, Anum_pg_index_indexrelid,
2168                                                  pgidesc, &n);
2169                 i++;
2170                 if (i % 10 == 0)
2171                         ioid = (Oid *) repalloc(ioid, (i + 10) * sizeof(Oid));
2172                 ioid[i - 1] = DatumGetObjectId(d);
2173         }
2174
2175         heap_endscan(pgiscan);
2176         heap_close(pgindex);
2177
2178         if (i == 0)
2179         {                                                       /* No one index found */
2180                 pfree(ioid);
2181                 return;
2182         }
2183
2184         if (Irel != (Relation **) NULL)
2185                 *Irel = (Relation *) palloc(i * sizeof(Relation));
2186
2187         for (k = 0; i > 0;)
2188         {
2189                 irel = index_open(ioid[--i]);
2190                 if (irel != (Relation) NULL)
2191                 {
2192                         if (Irel != (Relation **) NULL)
2193                                 (*Irel)[k] = irel;
2194                         else
2195                                 index_close(irel);
2196                         k++;
2197                 }
2198                 else
2199                         elog(NOTICE, "CAN't OPEN INDEX %u - SKIP IT", ioid[i]);
2200         }
2201         *nindices = k;
2202         pfree(ioid);
2203
2204         if (Irel != (Relation **) NULL && *nindices == 0)
2205         {
2206                 pfree(*Irel);
2207                 *Irel = (Relation *) NULL;
2208         }
2209
2210 }                                                               /* vc_getindices */
2211
2212
2213 static void
2214 vc_clsindices(int nindices, Relation *Irel)
2215 {
2216
2217         if (Irel == (Relation *) NULL)
2218                 return;
2219
2220         while (nindices--)
2221         {
2222                 index_close(Irel[nindices]);
2223         }
2224         pfree(Irel);
2225
2226 }                                                               /* vc_clsindices */
2227
2228
2229 static void
2230 vc_mkindesc(Relation onerel, int nindices, Relation *Irel, IndDesc **Idesc)
2231 {
2232         IndDesc    *idcur;
2233         HeapTuple       pgIndexTup;
2234         AttrNumber *attnumP;
2235         int                     natts;
2236         int                     i;
2237
2238         *Idesc = (IndDesc *) palloc(nindices * sizeof(IndDesc));
2239
2240         for (i = 0, idcur = *Idesc; i < nindices; i++, idcur++)
2241         {
2242                 pgIndexTup =
2243                         SearchSysCacheTuple(INDEXRELID,
2244                                                                 ObjectIdGetDatum(Irel[i]->rd_id),
2245                                                                 0, 0, 0);
2246                 Assert(pgIndexTup);
2247                 idcur->tform = (IndexTupleForm) GETSTRUCT(pgIndexTup);
2248                 for (attnumP = &(idcur->tform->indkey[0]), natts = 0;
2249                          *attnumP != InvalidAttrNumber && natts != INDEX_MAX_KEYS;
2250                          attnumP++, natts++);
2251                 if (idcur->tform->indproc != InvalidOid)
2252                 {
2253                         idcur->finfoP = &(idcur->finfo);
2254                         FIgetnArgs(idcur->finfoP) = natts;
2255                         natts = 1;
2256                         FIgetProcOid(idcur->finfoP) = idcur->tform->indproc;
2257                         *(FIgetname(idcur->finfoP)) = '\0';
2258                 }
2259                 else
2260                         idcur->finfoP = (FuncIndexInfo *) NULL;
2261
2262                 idcur->natts = natts;
2263         }
2264
2265 }                                                               /* vc_mkindesc */
2266
2267
2268 static bool
2269 vc_enough_space(VPageDescr vpd, Size len)
2270 {
2271
2272         len = DOUBLEALIGN(len);
2273
2274         if (len > vpd->vpd_free)
2275                 return (false);
2276
2277         if (vpd->vpd_nusd < vpd->vpd_noff)      /* there are free itemid(s) */
2278                 return (true);                  /* and len <= free_space */
2279
2280         /* ok. noff_usd >= noff_free and so we'll have to allocate new itemid */
2281         if (len <= vpd->vpd_free - sizeof(ItemIdData))
2282                 return (true);
2283
2284         return (false);
2285
2286 }                                                               /* vc_enough_space */