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.63 1998/02/26 04:31:03 momjian 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                                                 /*
 730                                                  * Not Aborted, Not Committed, Not in Progress -
 731                                                  * so it's from crashed process. - vadim 11/26/96
 732                                                  */
 733                                                 ncrash++;
 734                                                 tupgone = true;
 735                                         }
 736                                         else
 737                                         {
 738                                                 elog(NOTICE, "Rel %s: TID %u/%u: InsertTransactionInProgress %u - can't shrink relation",
 739                                                          relname, blkno, offnum, htup->t_xmin);
 740                                                 do_shrinking = false;
 741                                         }
 742                                 }
 743                         }
 744
 745                         /*
 746                          * here we are concerned about tuples with xmin committed and
 747                          * xmax unknown or committed
 748                          */
 749                         if (htup->t_infomask & HEAP_XMIN_COMMITTED &&
 750                                 !(htup->t_infomask & HEAP_XMAX_INVALID))
 751                         {
 752                                 if (htup->t_infomask & HEAP_XMAX_COMMITTED)
 753                                         tupgone = true;
 754                                 else if (TransactionIdDidAbort(htup->t_xmax))
 755                                 {
 756                                         htup->t_infomask |= HEAP_XMAX_INVALID;
 757                                         pgchanged = true;
 758                                 }
 759                                 else if (TransactionIdDidCommit(htup->t_xmax))
 760                                         tupgone = true;
 761                                 else if (!TransactionIdIsInProgress(htup->t_xmax))
 762                                 {
 763
 764                                         /*
 765                                          * Not Aborted, Not Committed, Not in Progress - so it
 766                                          * from crashed process. - vadim 06/02/97
 767                                          */
 768                                         htup->t_infomask |= HEAP_XMAX_INVALID;;
 769                                         pgchanged = true;
 770                                 }
 771                                 else
 772                                 {
 773                                         elog(NOTICE, "Rel %s: TID %u/%u: DeleteTransactionInProgress %u - can't shrink relation",
 774                                                  relname, blkno, offnum, htup->t_xmax);
 775                                         do_shrinking = false;
 776                                 }
 777                         }
 778
 779                         /*
 780                          * It's possibly! But from where it comes ? And should we fix
 781                          * it ?  - vadim 11/28/96
 782                          */
 783                         itemptr = &(htup->t_ctid);
 784                         if (!ItemPointerIsValid(itemptr) ||
 785                                 BlockIdGetBlockNumber(&(itemptr->ip_blkid)) != blkno)
 786                         {
 787                                 elog(NOTICE, "Rel %s: TID %u/%u: TID IN TUPLEHEADER %u/%u IS NOT THE SAME. TUPGONE %d.",
 788                                          relname, blkno, offnum,
 789                                          BlockIdGetBlockNumber(&(itemptr->ip_blkid)),
 790                                          itemptr->ip_posid, tupgone);
 791                         }
 792
 793                         /*
 794                          * Other checks...
 795                          */
 796                         if (htup->t_len != itemid->lp_len)
 797                         {
 798                                 elog(NOTICE, "Rel %s: TID %u/%u: TUPLE_LEN IN PAGEHEADER %u IS NOT THE SAME AS IN TUPLEHEADER %u. TUPGONE %d.",
 799                                          relname, blkno, offnum,
 800                                          itemid->lp_len, htup->t_len, tupgone);
 801                         }
 802                         if (!OidIsValid(htup->t_oid))
 803                         {
 804                                 elog(NOTICE, "Rel %s: TID %u/%u: OID IS INVALID. TUPGONE %d.",
 805                                          relname, blkno, offnum, tupgone);
 806                         }
 807
 808                         if (tupgone)
 809                         {
 810                                 ItemId          lpp;
 811
 812                                 if (tempPage == (Page) NULL)
 813                                 {
 814                                         Size            pageSize;
 815
 816                                         pageSize = PageGetPageSize(page);
 817                                         tempPage = (Page) palloc(pageSize);
 818                                         memmove(tempPage, page, pageSize);
 819                                 }
 820
 821                                 lpp = &(((PageHeader) tempPage)->pd_linp[offnum - 1]);
 822
 823                                 /* mark it unused */
 824                                 lpp->lp_flags &= ~LP_USED;
 825
 826                                 vpc->vpd_voff[vpc->vpd_noff++] = offnum;
 827                                 nvac++;
 828
 829                         }
 830                         else
 831                         {
 832                                 ntups++;
 833                                 notup = false;
 834                                 if (htup->t_len < min_tlen)
 835                                         min_tlen = htup->t_len;
 836                                 if (htup->t_len > max_tlen)
 837                                         max_tlen = htup->t_len;
 838                                 vc_attrstats(onerel, vacrelstats, htup);
 839                         }
 840                 }
 841
 842                 if (pgchanged)
 843                 {
 844                         WriteBuffer(buf);
 845                         dobufrel = false;
 846                         nchpg++;
 847                 }
 848                 else
 849                         dobufrel = true;
 850                 if (tempPage != (Page) NULL)
 851                 {                                               /* Some tuples are gone */
 852                         PageRepairFragmentation(tempPage);
 853                         vpc->vpd_free = ((PageHeader) tempPage)->pd_upper - ((PageHeader) tempPage)->pd_lower;
 854                         frsize += vpc->vpd_free;
 855                         vc_reappage(Vvpl, vpc);
 856                         pfree(tempPage);
 857                         tempPage = (Page) NULL;
 858                 }
 859                 else if (vpc->vpd_noff > 0)
 860                 {                                               /* there are only ~LP_USED line pointers */
 861                         vpc->vpd_free = ((PageHeader) page)->pd_upper - ((PageHeader) page)->pd_lower;
 862                         frsize += vpc->vpd_free;
 863                         vc_reappage(Vvpl, vpc);
 864                 }
 865                 if (dobufrel)
 866                         ReleaseBuffer(buf);
 867                 if (notup)
 868                         nemend++;
 869                 else
 870                         nemend = 0;
 871         }
 872
 873         pfree(vpc);
 874
 875         /* save stats in the rel list for use later */
 876         vacrelstats->ntups = ntups;
 877         vacrelstats->npages = nblocks;
 878 /*        vacrelstats->natts = attr_cnt;*/
 879         if (ntups == 0)
 880                 min_tlen = max_tlen = 0;
 881         vacrelstats->min_tlen = min_tlen;
 882         vacrelstats->max_tlen = max_tlen;
 883
 884         Vvpl->vpl_nemend = nemend;
 885         Fvpl->vpl_nemend = nemend;
 886
 887         /*
 888          * Try to make Fvpl keeping in mind that we can't use free space of
 889          * "empty" end-pages and last page if it reapped.
 890          */
 891         if (do_shrinking && Vvpl->vpl_npages - nemend > 0)
 892         {
 893                 int                     nusf;           /* blocks usefull for re-using */
 894
 895                 nusf = Vvpl->vpl_npages - nemend;
 896                 if ((Vvpl->vpl_pgdesc[nusf - 1])->vpd_blkno == nblocks - nemend - 1)
 897                         nusf--;
 898
 899                 for (i = 0; i < nusf; i++)
 900                 {
 901                         vp = Vvpl->vpl_pgdesc[i];
 902                         if (vc_enough_space(vp, min_tlen))
 903                         {
 904                                 vc_vpinsert(Fvpl, vp);
 905                                 frsusf += vp->vpd_free;
 906                         }
 907                 }
 908         }
 909
 910         getrusage(RUSAGE_SELF, &ru1);
 911
 912         elog(MESSAGE_LEVEL, "Rel %s: Pages %u: Changed %u, Reapped %u, Empty %u, New %u; \
 913 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.",
 914                  relname,
 915                  nblocks, nchpg, Vvpl->vpl_npages, nempg, nnepg,
 916                  ntups, nvac, ncrash, nunused, min_tlen, max_tlen,
 917                  frsize, frsusf, nemend, Fvpl->vpl_npages,
 918                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
 919                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
 920
 921 }       /* vc_scanheap */
 922
 923
 924 /*
 925  *      vc_rpfheap() -- try to repaire relation' fragmentation
 926  *
 927  *              This routine marks dead tuples as unused and tries re-use dead space
 928  *              by moving tuples (and inserting indices if needed). It constructs
 929  *              Nvpl list of free-ed pages (moved tuples) and clean indices
 930  *              for them after committing (in hack-manner - without losing locks
 931  *              and freeing memory!) current transaction. It truncates relation
 932  *              if some end-blocks are gone away.
 933  */
 934 static void
 935 vc_rpfheap(VRelStats *vacrelstats, Relation onerel,
 936                    VPageList Vvpl, VPageList Fvpl, int nindices, Relation *Irel)
 937 {
 938         TransactionId myXID;
 939         CommandId       myCID;
 940         Buffer          buf,
 941                                 ToBuf;
 942         int                     nblocks,
 943                                 blkno;
 944         Page            page,
 945                                 ToPage = NULL;
 946         OffsetNumber offnum = 0,
 947                                 maxoff = 0,
 948                                 newoff,
 949                                 moff;
 950         ItemId          itemid,
 951                                 newitemid;
 952         HeapTuple       htup,
 953                                 newtup;
 954         TupleDesc       tupdesc = NULL;
 955         Datum      *idatum = NULL;
 956         char       *inulls = NULL;
 957         InsertIndexResult iresult;
 958         VPageListData Nvpl;
 959         VPageDescr      ToVpd = NULL,
 960                                 Fvplast,
 961                                 Vvplast,
 962                                 vpc,
 963                            *vpp;
 964         int                     ToVpI = 0;
 965         IndDesc    *Idesc,
 966                            *idcur;
 967         int                     Fblklast,
 968                                 Vblklast,
 969                                 i;
 970         Size            tlen;
 971         int                     nmoved,
 972                                 Fnpages,
 973                                 Vnpages;
 974         int                     nchkmvd,
 975                                 ntups;
 976         bool            isempty,
 977                                 dowrite;
 978         struct rusage ru0,
 979                                 ru1;
 980
 981         getrusage(RUSAGE_SELF, &ru0);
 982
 983         myXID = GetCurrentTransactionId();
 984         myCID = GetCurrentCommandId();
 985
 986         if (Irel != (Relation *) NULL)          /* preparation for index' inserts */
 987         {
 988                 vc_mkindesc(onerel, nindices, Irel, &Idesc);
 989                 tupdesc = RelationGetTupleDescriptor(onerel);
 990                 idatum = (Datum *) palloc(INDEX_MAX_KEYS * sizeof(*idatum));
 991                 inulls = (char *) palloc(INDEX_MAX_KEYS * sizeof(*inulls));
 992         }
 993
 994         Nvpl.vpl_npages = 0;
 995         Fnpages = Fvpl->vpl_npages;
 996         Fvplast = Fvpl->vpl_pgdesc[Fnpages - 1];
 997         Fblklast = Fvplast->vpd_blkno;
 998         Assert(Vvpl->vpl_npages > Vvpl->vpl_nemend);
 999         Vnpages = Vvpl->vpl_npages - Vvpl->vpl_nemend;
1000         Vvplast = Vvpl->vpl_pgdesc[Vnpages - 1];
1001         Vblklast = Vvplast->vpd_blkno;
1002         Assert(Vblklast >= Fblklast);
1003         ToBuf = InvalidBuffer;
1004         nmoved = 0;
1005
1006         vpc = (VPageDescr) palloc(sizeof(VPageDescrData) + MaxOffsetNumber * sizeof(OffsetNumber));
1007         vpc->vpd_nusd = vpc->vpd_noff = 0;
1008
1009         nblocks = vacrelstats->npages;
1010         for (blkno = nblocks - Vvpl->vpl_nemend - 1;; blkno--)
1011         {
1012                 /* if it's reapped page and it was used by me - quit */
1013                 if (blkno == Fblklast && Fvplast->vpd_nusd > 0)
1014                         break;
1015
1016                 buf = ReadBuffer(onerel, blkno);
1017                 page = BufferGetPage(buf);
1018
1019                 vpc->vpd_noff = 0;
1020
1021                 isempty = PageIsEmpty(page);
1022
1023                 dowrite = false;
1024                 if (blkno == Vblklast)  /* it's reapped page */
1025                 {
1026                         if (Vvplast->vpd_noff > 0)      /* there are dead tuples */
1027                         {                                       /* on this page - clean */
1028                                 Assert(!isempty);
1029                                 vc_vacpage(page, Vvplast);
1030                                 dowrite = true;
1031                         }
1032                         else
1033                         {
1034                                 Assert(isempty);
1035                         }
1036                         --Vnpages;
1037                         Assert(Vnpages > 0);
1038                         /* get prev reapped page from Vvpl */
1039                         Vvplast = Vvpl->vpl_pgdesc[Vnpages - 1];
1040                         Vblklast = Vvplast->vpd_blkno;
1041                         if (blkno == Fblklast)          /* this page in Fvpl too */
1042                         {
1043                                 --Fnpages;
1044                                 Assert(Fnpages > 0);
1045                                 Assert(Fvplast->vpd_nusd == 0);
1046                                 /* get prev reapped page from Fvpl */
1047                                 Fvplast = Fvpl->vpl_pgdesc[Fnpages - 1];
1048                                 Fblklast = Fvplast->vpd_blkno;
1049                         }
1050                         Assert(Fblklast <= Vblklast);
1051                         if (isempty)
1052                         {
1053                                 ReleaseBuffer(buf);
1054                                 continue;
1055                         }
1056                 }
1057                 else
1058                 {
1059                         Assert(!isempty);
1060                 }
1061
1062                 vpc->vpd_blkno = blkno;
1063                 maxoff = PageGetMaxOffsetNumber(page);
1064                 for (offnum = FirstOffsetNumber;
1065                          offnum <= maxoff;
1066                          offnum = OffsetNumberNext(offnum))
1067                 {
1068                         itemid = PageGetItemId(page, offnum);
1069
1070                         if (!ItemIdIsUsed(itemid))
1071                                 continue;
1072
1073                         htup = (HeapTuple) PageGetItem(page, itemid);
1074                         tlen = htup->t_len;
1075
1076                         /* try to find new page for this tuple */
1077                         if (ToBuf == InvalidBuffer ||
1078                                 !vc_enough_space(ToVpd, tlen))
1079                         {
1080                                 if (ToBuf != InvalidBuffer)
1081                                 {
1082                                         WriteBuffer(ToBuf);
1083                                         ToBuf = InvalidBuffer;
1084
1085                                         /*
1086                                          * If no one tuple can't be added to this page -
1087                                          * remove page from Fvpl. - vadim 11/27/96
1088                                          *
1089                                          * But we can't remove last page - this is our
1090                                          * "show-stopper" !!!   - vadim 02/25/98
1091                                          */
1092                                         if (ToVpd != Fvplast &&
1093                                                 !vc_enough_space(ToVpd, vacrelstats->min_tlen))
1094                                         {
1095                                                 Assert(Fnpages > ToVpI + 1);
1096                                                 memmove(Fvpl->vpl_pgdesc + ToVpI,
1097                                                                 Fvpl->vpl_pgdesc + ToVpI + 1,
1098                                                    sizeof(VPageDescr *) * (Fnpages - ToVpI - 1));
1099                                                 Fnpages--;
1100                                                 Assert(Fvplast == Fvpl->vpl_pgdesc[Fnpages - 1]);
1101                                         }
1102                                 }
1103                                 for (i = 0; i < Fnpages; i++)
1104                                 {
1105                                         if (vc_enough_space(Fvpl->vpl_pgdesc[i], tlen))
1106                                                 break;
1107                                 }
1108                                 if (i == Fnpages)
1109                                         break;          /* can't move item anywhere */
1110                                 ToVpI = i;
1111                                 ToVpd = Fvpl->vpl_pgdesc[ToVpI];
1112                                 ToBuf = ReadBuffer(onerel, ToVpd->vpd_blkno);
1113                                 ToPage = BufferGetPage(ToBuf);
1114                                 /* if this page was not used before - clean it */
1115                                 if (!PageIsEmpty(ToPage) && ToVpd->vpd_nusd == 0)
1116                                         vc_vacpage(ToPage, ToVpd);
1117                         }
1118
1119                         /* copy tuple */
1120                         newtup = (HeapTuple) palloc(tlen);
1121                         memmove((char *) newtup, (char *) htup, tlen);
1122
1123                         /* store transaction information */
1124                         TransactionIdStore(myXID, &(newtup->t_xmin));
1125                         newtup->t_cmin = myCID;
1126                         StoreInvalidTransactionId(&(newtup->t_xmax));
1127                         /* set xmin to unknown and xmax to invalid */
1128                         newtup->t_infomask &= ~(HEAP_XACT_MASK);
1129                         newtup->t_infomask |= HEAP_XMAX_INVALID;
1130
1131                         /* add tuple to the page */
1132                         newoff = PageAddItem(ToPage, (Item) newtup, tlen,
1133                                                                  InvalidOffsetNumber, LP_USED);
1134                         if (newoff == InvalidOffsetNumber)
1135                         {
1136                                 elog(ERROR, "\
1137 failed to add item with len = %u to page %u (free space %u, nusd %u, noff %u)",
1138                                          tlen, ToVpd->vpd_blkno, ToVpd->vpd_free,
1139                                          ToVpd->vpd_nusd, ToVpd->vpd_noff);
1140                         }
1141                         newitemid = PageGetItemId(ToPage, newoff);
1142                         pfree(newtup);
1143                         newtup = (HeapTuple) PageGetItem(ToPage, newitemid);
1144                         ItemPointerSet(&(newtup->t_ctid), ToVpd->vpd_blkno, newoff);
1145
1146                         /* now logically delete end-tuple */
1147                         TransactionIdStore(myXID, &(htup->t_xmax));
1148                         htup->t_cmax = myCID;
1149                         /* set xmax to unknown */
1150                         htup->t_infomask &= ~(HEAP_XMAX_INVALID | HEAP_XMAX_COMMITTED);
1151
1152                         ToVpd->vpd_nusd++;
1153                         nmoved++;
1154                         ToVpd->vpd_free = ((PageHeader) ToPage)->pd_upper - ((PageHeader) ToPage)->pd_lower;
1155                         vpc->vpd_voff[vpc->vpd_noff++] = offnum;
1156
1157                         /* insert index' tuples if needed */
1158                         if (Irel != (Relation *) NULL)
1159                         {
1160                                 for (i = 0, idcur = Idesc; i < nindices; i++, idcur++)
1161                                 {
1162                                         FormIndexDatum(
1163                                                                    idcur->natts,
1164                                                            (AttrNumber *) &(idcur->tform->indkey[0]),
1165                                                                    newtup,
1166                                                                    tupdesc,
1167                                                                    InvalidBuffer,
1168                                                                    idatum,
1169                                                                    inulls,
1170                                                                    idcur->finfoP);
1171                                         iresult = index_insert(
1172                                                                                    Irel[i],
1173                                                                                    idatum,
1174                                                                                    inulls,
1175                                                                                    &(newtup->t_ctid),
1176                                                                                    onerel);
1177                                         if (iresult)
1178                                                 pfree(iresult);
1179                                 }
1180                         }
1181
1182                 }                                               /* walk along page */
1183
1184                 if (vpc->vpd_noff > 0)  /* some tuples were moved */
1185                 {
1186                         vc_reappage(&Nvpl, vpc);
1187                         WriteBuffer(buf);
1188                 }
1189                 else if (dowrite)
1190                         WriteBuffer(buf);
1191                 else
1192                         ReleaseBuffer(buf);
1193
1194                 if (offnum <= maxoff)
1195                         break;                          /* some item(s) left */
1196
1197         }                                                       /* walk along relation */
1198
1199         blkno++;                                        /* new number of blocks */
1200
1201         if (ToBuf != InvalidBuffer)
1202         {
1203                 Assert(nmoved > 0);
1204                 WriteBuffer(ToBuf);
1205         }
1206
1207         if (nmoved > 0)
1208         {
1209
1210                 /*
1211                  * We have to commit our tuple' movings before we'll truncate
1212                  * relation, but we shouldn't lose our locks. And so - quick hack:
1213                  * flush buffers and record status of current transaction as
1214                  * committed, and continue. - vadim 11/13/96
1215                  */
1216                 FlushBufferPool(!TransactionFlushEnabled());
1217                 TransactionIdCommit(myXID);
1218                 FlushBufferPool(!TransactionFlushEnabled());
1219         }
1220
1221         /*
1222          * Clean uncleaned reapped pages from Vvpl list and set xmin committed
1223          * for inserted tuples
1224          */
1225         nchkmvd = 0;
1226         for (i = 0, vpp = Vvpl->vpl_pgdesc; i < Vnpages; i++, vpp++)
1227         {
1228                 Assert((*vpp)->vpd_blkno < blkno);
1229                 buf = ReadBuffer(onerel, (*vpp)->vpd_blkno);
1230                 page = BufferGetPage(buf);
1231                 if ((*vpp)->vpd_nusd == 0)              /* this page was not used */
1232                 {
1233
1234                         /*
1235                          * noff == 0 in empty pages only - such pages should be
1236                          * re-used
1237                          */
1238                         Assert((*vpp)->vpd_noff > 0);
1239                         vc_vacpage(page, *vpp);
1240                 }
1241                 else
1242 /* this page was used */
1243                 {
1244                         ntups = 0;
1245                         moff = PageGetMaxOffsetNumber(page);
1246                         for (newoff = FirstOffsetNumber;
1247                                  newoff <= moff;
1248                                  newoff = OffsetNumberNext(newoff))
1249                         {
1250                                 itemid = PageGetItemId(page, newoff);
1251                                 if (!ItemIdIsUsed(itemid))
1252                                         continue;
1253                                 htup = (HeapTuple) PageGetItem(page, itemid);
1254                                 if (TransactionIdEquals((TransactionId) htup->t_xmin, myXID))
1255                                 {
1256                                         htup->t_infomask |= HEAP_XMIN_COMMITTED;
1257                                         ntups++;
1258                                 }
1259                         }
1260                         Assert((*vpp)->vpd_nusd == ntups);
1261                         nchkmvd += ntups;
1262                 }
1263                 WriteBuffer(buf);
1264         }
1265         Assert(nmoved == nchkmvd);
1266
1267         getrusage(RUSAGE_SELF, &ru1);
1268
1269         elog(MESSAGE_LEVEL, "Rel %s: Pages: %u --> %u; Tuple(s) moved: %u. \
1270 Elapsed %u/%u sec.",
1271                  (RelationGetRelationName(onerel))->data,
1272                  nblocks, blkno, nmoved,
1273                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1274                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1275
1276         if (Nvpl.vpl_npages > 0)
1277         {
1278                 /* vacuum indices again if needed */
1279                 if (Irel != (Relation *) NULL)
1280                 {
1281                         VPageDescr *vpleft,
1282                                            *vpright,
1283                                                 vpsave;
1284
1285                         /* re-sort Nvpl.vpl_pgdesc */
1286                         for (vpleft = Nvpl.vpl_pgdesc,
1287                                  vpright = Nvpl.vpl_pgdesc + Nvpl.vpl_npages - 1;
1288                                  vpleft < vpright; vpleft++, vpright--)
1289                         {
1290                                 vpsave = *vpleft;
1291                                 *vpleft = *vpright;
1292                                 *vpright = vpsave;
1293                         }
1294                         for (i = 0; i < nindices; i++)
1295                                 vc_vaconeind(&Nvpl, Irel[i], vacrelstats->ntups);
1296                 }
1297
1298                 /*
1299                  * clean moved tuples from last page in Nvpl list if some tuples
1300                  * left there
1301                  */
1302                 if (vpc->vpd_noff > 0 && offnum <= maxoff)
1303                 {
1304                         Assert(vpc->vpd_blkno == blkno - 1);
1305                         buf = ReadBuffer(onerel, vpc->vpd_blkno);
1306                         page = BufferGetPage(buf);
1307                         ntups = 0;
1308                         maxoff = offnum;
1309                         for (offnum = FirstOffsetNumber;
1310                                  offnum < maxoff;
1311                                  offnum = OffsetNumberNext(offnum))
1312                         {
1313                                 itemid = PageGetItemId(page, offnum);
1314                                 if (!ItemIdIsUsed(itemid))
1315                                         continue;
1316                                 htup = (HeapTuple) PageGetItem(page, itemid);
1317                                 Assert(TransactionIdEquals((TransactionId) htup->t_xmax, myXID));
1318                                 itemid->lp_flags &= ~LP_USED;
1319                                 ntups++;
1320                         }
1321                         Assert(vpc->vpd_noff == ntups);
1322                         PageRepairFragmentation(page);
1323                         WriteBuffer(buf);
1324                 }
1325
1326                 /* now - free new list of reapped pages */
1327                 vpp = Nvpl.vpl_pgdesc;
1328                 for (i = 0; i < Nvpl.vpl_npages; i++, vpp++)
1329                         pfree(*vpp);
1330                 pfree(Nvpl.vpl_pgdesc);
1331         }
1332
1333         /* truncate relation */
1334         if (blkno < nblocks)
1335         {
1336                 i = BlowawayRelationBuffers(onerel, blkno);
1337                 if (i < 0)
1338                         elog(FATAL, "VACUUM (vc_rpfheap): BlowawayRelationBuffers returned %d", i);
1339                 blkno = smgrtruncate(DEFAULT_SMGR, onerel, blkno);
1340                 Assert(blkno >= 0);
1341                 vacrelstats->npages = blkno;    /* set new number of blocks */
1342         }
1343
1344         if (Irel != (Relation *) NULL)          /* pfree index' allocations */
1345         {
1346                 pfree(Idesc);
1347                 pfree(idatum);
1348                 pfree(inulls);
1349                 vc_clsindices(nindices, Irel);
1350         }
1351
1352         pfree(vpc);
1353
1354 }       /* vc_rpfheap */
1355
1356 /*
1357  *      vc_vacheap() -- free dead tuples
1358  *
1359  *              This routine marks dead tuples as unused and truncates relation
1360  *              if there are "empty" end-blocks.
1361  */
1362 static void
1363 vc_vacheap(VRelStats *vacrelstats, Relation onerel, VPageList Vvpl)
1364 {
1365         Buffer          buf;
1366         Page            page;
1367         VPageDescr *vpp;
1368         int                     nblocks;
1369         int                     i;
1370
1371         nblocks = Vvpl->vpl_npages;
1372         nblocks -= Vvpl->vpl_nemend;/* nothing to do with them */
1373
1374         for (i = 0, vpp = Vvpl->vpl_pgdesc; i < nblocks; i++, vpp++)
1375         {
1376                 if ((*vpp)->vpd_noff > 0)
1377                 {
1378                         buf = ReadBuffer(onerel, (*vpp)->vpd_blkno);
1379                         page = BufferGetPage(buf);
1380                         vc_vacpage(page, *vpp);
1381                         WriteBuffer(buf);
1382                 }
1383         }
1384
1385         /* truncate relation if there are some empty end-pages */
1386         if (Vvpl->vpl_nemend > 0)
1387         {
1388                 Assert(vacrelstats->npages >= Vvpl->vpl_nemend);
1389                 nblocks = vacrelstats->npages - Vvpl->vpl_nemend;
1390                 elog(MESSAGE_LEVEL, "Rel %s: Pages: %u --> %u.",
1391                          (RelationGetRelationName(onerel))->data,
1392                          vacrelstats->npages, nblocks);
1393
1394                 /*
1395                  * we have to flush "empty" end-pages (if changed, but who knows
1396                  * it) before truncation
1397                  */
1398                 FlushBufferPool(!TransactionFlushEnabled());
1399
1400                 i = BlowawayRelationBuffers(onerel, nblocks);
1401                 if (i < 0)
1402                         elog(FATAL, "VACUUM (vc_vacheap): BlowawayRelationBuffers returned %d", i);
1403
1404                 nblocks = smgrtruncate(DEFAULT_SMGR, onerel, nblocks);
1405                 Assert(nblocks >= 0);
1406                 vacrelstats->npages = nblocks;  /* set new number of blocks */
1407         }
1408
1409 }       /* vc_vacheap */
1410
1411 /*
1412  *      vc_vacpage() -- free dead tuples on a page
1413  *                                       and repaire its fragmentation.
1414  */
1415 static void
1416 vc_vacpage(Page page, VPageDescr vpd)
1417 {
1418         ItemId          itemid;
1419         int                     i;
1420
1421         Assert(vpd->vpd_nusd == 0);
1422         for (i = 0; i < vpd->vpd_noff; i++)
1423         {
1424                 itemid = &(((PageHeader) page)->pd_linp[vpd->vpd_voff[i] - 1]);
1425                 itemid->lp_flags &= ~LP_USED;
1426         }
1427         PageRepairFragmentation(page);
1428
1429 }       /* vc_vacpage */
1430
1431 /*
1432  *      _vc_scanoneind() -- scan one index relation to update statistic.
1433  *
1434  */
1435 static void
1436 vc_scanoneind(Relation indrel, int nhtups)
1437 {
1438         RetrieveIndexResult res;
1439         IndexScanDesc iscan;
1440         int                     nitups;
1441         int                     nipages;
1442         struct rusage ru0,
1443                                 ru1;
1444
1445         getrusage(RUSAGE_SELF, &ru0);
1446
1447         /* walk through the entire index */
1448         iscan = index_beginscan(indrel, false, 0, (ScanKey) NULL);
1449         nitups = 0;
1450
1451         while ((res = index_getnext(iscan, ForwardScanDirection))
1452                    != (RetrieveIndexResult) NULL)
1453         {
1454                 nitups++;
1455                 pfree(res);
1456         }
1457
1458         index_endscan(iscan);
1459
1460         /* now update statistics in pg_class */
1461         nipages = RelationGetNumberOfBlocks(indrel);
1462         vc_updstats(indrel->rd_id, nipages, nitups, false, NULL);
1463
1464         getrusage(RUSAGE_SELF, &ru1);
1465
1466         elog(MESSAGE_LEVEL, "Ind %s: Pages %u; Tuples %u. Elapsed %u/%u sec.",
1467                  indrel->rd_rel->relname.data, nipages, nitups,
1468                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1469                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1470
1471         if (nitups != nhtups)
1472                 elog(NOTICE, "Ind %s: NUMBER OF INDEX' TUPLES (%u) IS NOT THE SAME AS HEAP' (%u)",
1473                          indrel->rd_rel->relname.data, nitups, nhtups);
1474
1475 }       /* vc_scanoneind */
1476
1477 /*
1478  *      vc_vaconeind() -- vacuum one index relation.
1479  *
1480  *              Vpl is the VPageList of the heap we're currently vacuuming.
1481  *              It's locked. Indrel is an index relation on the vacuumed heap.
1482  *              We don't set locks on the index relation here, since the indexed
1483  *              access methods support locking at different granularities.
1484  *              We let them handle it.
1485  *
1486  *              Finally, we arrange to update the index relation's statistics in
1487  *              pg_class.
1488  */
1489 static void
1490 vc_vaconeind(VPageList vpl, Relation indrel, int nhtups)
1491 {
1492         RetrieveIndexResult res;
1493         IndexScanDesc iscan;
1494         ItemPointer heapptr;
1495         int                     nvac;
1496         int                     nitups;
1497         int                     nipages;
1498         VPageDescr      vp;
1499         struct rusage ru0,
1500                                 ru1;
1501
1502         getrusage(RUSAGE_SELF, &ru0);
1503
1504         /* walk through the entire index */
1505         iscan = index_beginscan(indrel, false, 0, (ScanKey) NULL);
1506         nvac = 0;
1507         nitups = 0;
1508
1509         while ((res = index_getnext(iscan, ForwardScanDirection))
1510                    != (RetrieveIndexResult) NULL)
1511         {
1512                 heapptr = &res->heap_iptr;
1513
1514                 if ((vp = vc_tidreapped(heapptr, vpl)) != (VPageDescr) NULL)
1515                 {
1516 #if 0
1517                         elog(DEBUG, "<%x,%x> -> <%x,%x>",
1518                                  ItemPointerGetBlockNumber(&(res->index_iptr)),
1519                                  ItemPointerGetOffsetNumber(&(res->index_iptr)),
1520                                  ItemPointerGetBlockNumber(&(res->heap_iptr)),
1521                                  ItemPointerGetOffsetNumber(&(res->heap_iptr)));
1522 #endif
1523                         if (vp->vpd_noff == 0)
1524                         {                                       /* this is EmptyPage !!! */
1525                                 elog(NOTICE, "Ind %s: pointer to EmptyPage (blk %u off %u) - fixing",
1526                                          indrel->rd_rel->relname.data,
1527                                          vp->vpd_blkno, ItemPointerGetOffsetNumber(heapptr));
1528                         }
1529                         ++nvac;
1530                         index_delete(indrel, &res->index_iptr);
1531                 }
1532                 else
1533                 {
1534                         nitups++;
1535                 }
1536
1537                 /* be tidy */
1538                 pfree(res);
1539         }
1540
1541         index_endscan(iscan);
1542
1543         /* now update statistics in pg_class */
1544         nipages = RelationGetNumberOfBlocks(indrel);
1545         vc_updstats(indrel->rd_id, nipages, nitups, false, NULL);
1546
1547         getrusage(RUSAGE_SELF, &ru1);
1548
1549         elog(MESSAGE_LEVEL, "Ind %s: Pages %u; Tuples %u: Deleted %u. Elapsed %u/%u sec.",
1550                  indrel->rd_rel->relname.data, nipages, nitups, nvac,
1551                  ru1.ru_stime.tv_sec - ru0.ru_stime.tv_sec,
1552                  ru1.ru_utime.tv_sec - ru0.ru_utime.tv_sec);
1553
1554         if (nitups != nhtups)
1555                 elog(NOTICE, "Ind %s: NUMBER OF INDEX' TUPLES (%u) IS NOT THE SAME AS HEAP' (%u)",
1556                          indrel->rd_rel->relname.data, nitups, nhtups);
1557
1558 }       /* vc_vaconeind */
1559
1560 /*
1561  *      vc_tidreapped() -- is a particular tid reapped?
1562  *
1563  *              vpl->VPageDescr_array is sorted in right order.
1564  */
1565 static VPageDescr
1566 vc_tidreapped(ItemPointer itemptr, VPageList vpl)
1567 {
1568         OffsetNumber ioffno;
1569         OffsetNumber *voff;
1570         VPageDescr      vp,
1571                            *vpp;
1572         VPageDescrData vpd;
1573
1574         vpd.vpd_blkno = ItemPointerGetBlockNumber(itemptr);
1575         ioffno = ItemPointerGetOffsetNumber(itemptr);
1576
1577         vp = &vpd;
1578         vpp = (VPageDescr *) vc_find_eq((char *) (vpl->vpl_pgdesc),
1579                                            vpl->vpl_npages, sizeof(VPageDescr), (char *) &vp,
1580                                                                         vc_cmp_blk);
1581
1582         if (vpp == (VPageDescr *) NULL)
1583                 return ((VPageDescr) NULL);
1584         vp = *vpp;
1585
1586         /* ok - we are on true page */
1587
1588         if (vp->vpd_noff == 0)
1589         {                                                       /* this is EmptyPage !!! */
1590                 return (vp);
1591         }
1592
1593         voff = (OffsetNumber *) vc_find_eq((char *) (vp->vpd_voff),
1594                                         vp->vpd_noff, sizeof(OffsetNumber), (char *) &ioffno,
1595                                                                            vc_cmp_offno);
1596
1597         if (voff == (OffsetNumber *) NULL)
1598                 return ((VPageDescr) NULL);
1599
1600         return (vp);
1601
1602 }       /* vc_tidreapped */
1603
1604 /*
1605  *      vc_attrstats() -- compute column statistics used by the optimzer
1606  *
1607  *      We compute the column min, max, null and non-null counts.
1608  *      Plus we attempt to find the count of the value that occurs most
1609  *      frequently in each column
1610  *      These figures are used to compute the selectivity of the column
1611  *
1612  *      We use a three-bucked cache to get the most frequent item
1613  *      The 'guess' buckets count hits.  A cache miss causes guess1
1614  *      to get the most hit 'guess' item in the most recent cycle, and
1615  *      the new item goes into guess2.  Whenever the total count of hits
1616  *      of a 'guess' entry is larger than 'best', 'guess' becomes 'best'.
1617  *
1618  *      This method works perfectly for columns with unique values, and columns
1619  *      with only two unique values, plus nulls.
1620  *
1621  *      It becomes less perfect as the number of unique values increases and
1622  *      their distribution in the table becomes more random.
1623  *
1624  */
1625 static void
1626 vc_attrstats(Relation onerel, VRelStats *vacrelstats, HeapTuple htup)
1627 {
1628         int                     i,
1629                                 attr_cnt = vacrelstats->va_natts;
1630         VacAttrStats *vacattrstats = vacrelstats->vacattrstats;
1631         TupleDesc       tupDesc = onerel->rd_att;
1632         Datum           value;
1633         bool            isnull;
1634
1635         for (i = 0; i < attr_cnt; i++)
1636         {
1637                 VacAttrStats *stats = &vacattrstats[i];
1638                 bool            value_hit = true;
1639
1640                 value = heap_getattr(htup,
1641                                                          stats->attr->attnum, tupDesc, &isnull);
1642
1643                 if (!VacAttrStatsEqValid(stats))
1644                         continue;
1645
1646                 if (isnull)
1647                         stats->null_cnt++;
1648                 else
1649                 {
1650                         stats->nonnull_cnt++;
1651                         if (stats->initialized == false)
1652                         {
1653                                 vc_bucketcpy(stats->attr, value, &stats->best, &stats->best_len);
1654                                 /* best_cnt gets incremented later */
1655                                 vc_bucketcpy(stats->attr, value, &stats->guess1, &stats->guess1_len);
1656                                 stats->guess1_cnt = stats->guess1_hits = 1;
1657                                 vc_bucketcpy(stats->attr, value, &stats->guess2, &stats->guess2_len);
1658                                 stats->guess2_hits = 1;
1659                                 if (VacAttrStatsLtGtValid(stats))
1660                                 {
1661                                         vc_bucketcpy(stats->attr, value, &stats->max, &stats->max_len);
1662                                         vc_bucketcpy(stats->attr, value, &stats->min, &stats->min_len);
1663                                 }
1664                                 stats->initialized = true;
1665                         }
1666                         if (VacAttrStatsLtGtValid(stats))
1667                         {
1668                                 if ((*fmgr_faddr(&stats->f_cmplt)) (value, stats->min))
1669                                 {
1670                                         vc_bucketcpy(stats->attr, value, &stats->min, &stats->min_len);
1671                                         stats->min_cnt = 0;
1672                                 }
1673                                 if ((*fmgr_faddr(&stats->f_cmpgt)) (value, stats->max))
1674                                 {
1675                                         vc_bucketcpy(stats->attr, value, &stats->max, &stats->max_len);
1676                                         stats->max_cnt = 0;
1677                                 }
1678                                 if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->min))
1679                                         stats->min_cnt++;
1680                                 else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->max))
1681                                         stats->max_cnt++;
1682                         }
1683                         if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->best))
1684                                 stats->best_cnt++;
1685                         else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->guess1))
1686                         {
1687                                 stats->guess1_cnt++;
1688                                 stats->guess1_hits++;
1689                         }
1690                         else if ((*fmgr_faddr(&stats->f_cmpeq)) (value, stats->guess2))
1691                                 stats->guess2_hits++;
1692                         else
1693                                 value_hit = false;
1694
1695                         if (stats->guess2_hits > stats->guess1_hits)
1696                         {
1697                                 swapDatum(stats->guess1, stats->guess2);
1698                                 swapInt(stats->guess1_len, stats->guess2_len);
1699                                 stats->guess1_cnt = stats->guess2_hits;
1700                                 swapLong(stats->guess1_hits, stats->guess2_hits);
1701                         }
1702                         if (stats->guess1_cnt > stats->best_cnt)
1703                         {
1704                                 swapDatum(stats->best, stats->guess1);
1705                                 swapInt(stats->best_len, stats->guess1_len);
1706                                 swapLong(stats->best_cnt, stats->guess1_cnt);
1707                                 stats->guess1_hits = 1;
1708                                 stats->guess2_hits = 1;
1709                         }
1710                         if (!value_hit)
1711                         {
1712                                 vc_bucketcpy(stats->attr, value, &stats->guess2, &stats->guess2_len);
1713                                 stats->guess1_hits = 1;
1714                                 stats->guess2_hits = 1;
1715                         }
1716                 }
1717         }
1718         return;
1719 }
1720
1721 /*
1722  *      vc_bucketcpy() -- update pg_class statistics for one relation
1723  *
1724  */
1725 static void
1726 vc_bucketcpy(AttributeTupleForm attr, Datum value, Datum *bucket, int16 *bucket_len)
1727 {
1728         if (attr->attbyval && attr->attlen != -1)
1729                 *bucket = value;
1730         else
1731         {
1732                 int                     len = (attr->attlen != -1 ? attr->attlen : VARSIZE(value));
1733
1734                 if (len > *bucket_len)
1735                 {
1736                         if (*bucket_len != 0)
1737                                 pfree(DatumGetPointer(*bucket));
1738                         *bucket = PointerGetDatum(palloc(len));
1739                         *bucket_len = len;
1740                 }
1741                 memmove(DatumGetPointer(*bucket), DatumGetPointer(value), len);
1742         }
1743 }
1744
1745 /*
1746  *      vc_updstats() -- update pg_class statistics for one relation
1747  *
1748  *              This routine works for both index and heap relation entries in
1749  *              pg_class.  We violate no-overwrite semantics here by storing new
1750  *              values for ntups, npages, and hasindex directly in the pg_class
1751  *              tuple that's already on the page.  The reason for this is that if
1752  *              we updated these tuples in the usual way, then every tuple in pg_class
1753  *              would be replaced every day.  This would make planning and executing
1754  *              historical queries very expensive.
1755  */
1756 static void
1757 vc_updstats(Oid relid, int npages, int ntups, bool hasindex, VRelStats *vacrelstats)
1758 {
1759         Relation        rd,
1760                                 ad,
1761                                 sd;
1762         HeapScanDesc rsdesc,
1763                                 asdesc;
1764         TupleDesc       sdesc;
1765         HeapTuple       rtup,
1766                                 atup,
1767                                 stup;
1768         Buffer          rbuf,
1769                                 abuf;
1770         Form_pg_class pgcform;
1771         ScanKeyData rskey,
1772                                 askey;
1773         AttributeTupleForm attp;
1774
1775         /*
1776          * update number of tuples and number of pages in pg_class
1777          */
1778         ScanKeyEntryInitialize(&rskey, 0x0, ObjectIdAttributeNumber,
1779                                                    ObjectIdEqualRegProcedure,
1780                                                    ObjectIdGetDatum(relid));
1781
1782         rd = heap_openr(RelationRelationName);
1783         rsdesc = heap_beginscan(rd, false, false, 1, &rskey);
1784
1785         if (!HeapTupleIsValid(rtup = heap_getnext(rsdesc, 0, &rbuf)))
1786                 elog(ERROR, "pg_class entry for relid %d vanished during vacuuming",
1787                          relid);
1788
1789         /* overwrite the existing statistics in the tuple */
1790         vc_setpagelock(rd, BufferGetBlockNumber(rbuf));
1791         pgcform = (Form_pg_class) GETSTRUCT(rtup);
1792         pgcform->reltuples = ntups;
1793         pgcform->relpages = npages;
1794         pgcform->relhasindex = hasindex;
1795
1796         if (vacrelstats != NULL && vacrelstats->va_natts > 0)
1797         {
1798                 VacAttrStats *vacattrstats = vacrelstats->vacattrstats;
1799                 int                     natts = vacrelstats->va_natts;
1800
1801                 ad = heap_openr(AttributeRelationName);
1802                 sd = heap_openr(StatisticRelationName);
1803                 ScanKeyEntryInitialize(&askey, 0, Anum_pg_attribute_attrelid,
1804                                                            F_INT4EQ, relid);
1805
1806                 asdesc = heap_beginscan(ad, false, false, 1, &askey);
1807
1808                 while (HeapTupleIsValid(atup = heap_getnext(asdesc, 0, &abuf)))
1809                 {
1810                         int                     i;
1811                         float32data selratio;           /* average ratio of rows selected
1812                                                                                  * for a random constant */
1813                         VacAttrStats *stats;
1814                         Datum           values[Natts_pg_statistic];
1815                         char            nulls[Natts_pg_statistic];
1816
1817                         attp = (AttributeTupleForm) GETSTRUCT(atup);
1818                         if (attp->attnum <= 0)          /* skip system attributes for now, */
1819                                 /* they are unique anyway */
1820                                 continue;
1821
1822                         for (i = 0; i < natts; i++)
1823                         {
1824                                 if (attp->attnum == vacattrstats[i].attr->attnum)
1825                                         break;
1826                         }
1827                         if (i >= natts)
1828                                 continue;
1829                         stats = &(vacattrstats[i]);
1830
1831                         /* overwrite the existing statistics in the tuple */
1832                         if (VacAttrStatsEqValid(stats))
1833                         {
1834
1835                                 vc_setpagelock(ad, BufferGetBlockNumber(abuf));
1836
1837                                 if (stats->nonnull_cnt + stats->null_cnt == 0 ||
1838                                         (stats->null_cnt <= 1 && stats->best_cnt == 1))
1839                                         selratio = 0;
1840                                 else if (VacAttrStatsLtGtValid(stats) && stats->min_cnt + stats->max_cnt == stats->nonnull_cnt)
1841                                 {
1842                                         double          min_cnt_d = stats->min_cnt,
1843                                                                 max_cnt_d = stats->max_cnt,
1844                                                                 null_cnt_d = stats->null_cnt,
1845                                                                 nonnullcnt_d = stats->nonnull_cnt;              /* prevent overflow */
1846
1847                                         selratio = (min_cnt_d * min_cnt_d + max_cnt_d * max_cnt_d + null_cnt_d * null_cnt_d) /
1848                                                 (nonnullcnt_d + null_cnt_d) / (nonnullcnt_d + null_cnt_d);
1849                                 }
1850                                 else
1851                                 {
1852                                         double          most = (double) (stats->best_cnt > stats->null_cnt ? stats->best_cnt : stats->null_cnt);
1853                                         double          total = ((double) stats->nonnull_cnt) + ((double) stats->null_cnt);
1854
1855                                         /*
1856                                          * we assume count of other values are 20% of best
1857                                          * count in table
1858                                          */
1859                                         selratio = (most * most + 0.20 * most * (total - most)) / total / total;
1860                                 }
1861                                 if (selratio > 1.0)
1862                                         selratio = 1.0;
1863                                 attp->attdisbursion = selratio;
1864                                 WriteNoReleaseBuffer(abuf);
1865
1866                                 /* DO PG_STATISTIC INSERTS */
1867
1868                                 /*
1869                                  * doing system relations, especially pg_statistic is a
1870                                  * problem
1871                                  */
1872                                 if (VacAttrStatsLtGtValid(stats) && stats->initialized  /* &&
1873                                                                                                                                                  * !IsSystemRelationName(
1874                                                                                                                                                  *
1875                                          pgcform->relname.data) */ )
1876                                 {
1877                                         FmgrInfo        out_function;
1878                                         char       *out_string;
1879
1880                                         for (i = 0; i < Natts_pg_statistic; ++i)
1881                                                 nulls[i] = ' ';
1882
1883                                         /* ----------------
1884                                          *      initialize values[]
1885                                          * ----------------
1886                                          */
1887                                         i = 0;
1888                                         values[i++] = (Datum) relid;            /* 1 */
1889                                         values[i++] = (Datum) attp->attnum; /* 2 */
1890                                         values[i++] = (Datum) InvalidOid;       /* 3 */
1891                                         fmgr_info(stats->outfunc, &out_function);
1892                                         out_string = (*fmgr_faddr(&out_function)) (stats->min, stats->attr->atttypid);
1893                                         values[i++] = (Datum) fmgr(TextInRegProcedure, out_string);
1894                                         pfree(out_string);
1895                                         out_string = (char *) (*fmgr_faddr(&out_function)) (stats->max, stats->attr->atttypid);
1896                                         values[i++] = (Datum) fmgr(TextInRegProcedure, out_string);
1897                                         pfree(out_string);
1898
1899                                         sdesc = sd->rd_att;
1900
1901                                         stup = heap_formtuple(sdesc, values, nulls);
1902
1903                                         /* ----------------
1904                                          *      insert the tuple in the relation and get the tuple's oid.
1905                                          * ----------------
1906                                          */
1907                                         heap_insert(sd, stup);
1908                                         pfree(DatumGetPointer(values[3]));
1909                                         pfree(DatumGetPointer(values[4]));
1910                                         pfree(stup);
1911                                 }
1912                         }
1913                 }
1914                 heap_endscan(asdesc);
1915                 heap_close(ad);
1916                 heap_close(sd);
1917         }
1918
1919         /* XXX -- after write, should invalidate relcache in other backends */
1920         WriteNoReleaseBuffer(rbuf); /* heap_endscan release scan' buffers ? */
1921
1922         /*
1923          * invalidating system relations confuses the function cache of
1924          * pg_operator and pg_opclass
1925          */
1926         if (!IsSystemRelationName(pgcform->relname.data))
1927                 RelationInvalidateHeapTuple(rd, rtup);
1928
1929         /* that's all, folks */
1930         heap_endscan(rsdesc);
1931         heap_close(rd);
1932 }
1933
1934 /*
1935  *      vc_delhilowstats() -- delete pg_statistics rows
1936  *
1937  */
1938 static void
1939 vc_delhilowstats(Oid relid, int attcnt, int *attnums)
1940 {
1941         Relation        pgstatistic;
1942         HeapScanDesc pgsscan;
1943         HeapTuple       pgstup;
1944         ScanKeyData pgskey;
1945
1946         pgstatistic = heap_openr(StatisticRelationName);
1947
1948         if (relid != InvalidOid)
1949         {
1950                 ScanKeyEntryInitialize(&pgskey, 0x0, Anum_pg_statistic_starelid,
1951                                                            ObjectIdEqualRegProcedure,
1952                                                            ObjectIdGetDatum(relid));
1953                 pgsscan = heap_beginscan(pgstatistic, false, false, 1, &pgskey);
1954         }
1955         else
1956                 pgsscan = heap_beginscan(pgstatistic, false, false, 0, NULL);
1957
1958         while (HeapTupleIsValid(pgstup = heap_getnext(pgsscan, 0, NULL)))
1959         {
1960                 if (attcnt > 0)
1961                 {
1962                         Form_pg_statistic pgs = (Form_pg_statistic) GETSTRUCT(pgstup);
1963                         int                     i;
1964
1965                         for (i = 0; i < attcnt; i++)
1966                         {
1967                                 if (pgs->staattnum == attnums[i] + 1)
1968                                         break;
1969                         }
1970                         if (i >= attcnt)
1971                                 continue;               /* don't delete it */
1972                 }
1973                 heap_delete(pgstatistic, &pgstup->t_ctid);
1974         }
1975
1976         heap_endscan(pgsscan);
1977         heap_close(pgstatistic);
1978 }
1979
1980 static void
1981 vc_setpagelock(Relation rel, BlockNumber blkno)
1982 {
1983         ItemPointerData itm;
1984
1985         ItemPointerSet(&itm, blkno, 1);
1986
1987         RelationSetLockForWritePage(rel, &itm);
1988 }
1989
1990 /*
1991  *      vc_reappage() -- save a page on the array of reapped pages.
1992  *
1993  *              As a side effect of the way that the vacuuming loop for a given
1994  *              relation works, higher pages come after lower pages in the array
1995  *              (and highest tid on a page is last).
1996  */
1997 static void
1998 vc_reappage(VPageList vpl, VPageDescr vpc)
1999 {
2000         VPageDescr      newvpd;
2001
2002         /* allocate a VPageDescrData entry */
2003         newvpd = (VPageDescr) palloc(sizeof(VPageDescrData) + vpc->vpd_noff * sizeof(OffsetNumber));
2004
2005         /* fill it in */
2006         if (vpc->vpd_noff > 0)
2007                 memmove(newvpd->vpd_voff, vpc->vpd_voff, vpc->vpd_noff * sizeof(OffsetNumber));
2008         newvpd->vpd_blkno = vpc->vpd_blkno;
2009         newvpd->vpd_free = vpc->vpd_free;
2010         newvpd->vpd_nusd = vpc->vpd_nusd;
2011         newvpd->vpd_noff = vpc->vpd_noff;
2012
2013         /* insert this page into vpl list */
2014         vc_vpinsert(vpl, newvpd);
2015
2016 }       /* vc_reappage */
2017
2018 static void
2019 vc_vpinsert(VPageList vpl, VPageDescr vpnew)
2020 {
2021
2022         /* allocate a VPageDescr entry if needed */
2023         if (vpl->vpl_npages == 0)
2024                 vpl->vpl_pgdesc = (VPageDescr *) palloc(100 * sizeof(VPageDescr));
2025         else if (vpl->vpl_npages % 100 == 0)
2026                 vpl->vpl_pgdesc = (VPageDescr *) repalloc(vpl->vpl_pgdesc, (vpl->vpl_npages + 100) * sizeof(VPageDescr));
2027         vpl->vpl_pgdesc[vpl->vpl_npages] = vpnew;
2028         (vpl->vpl_npages)++;
2029
2030 }
2031
2032 static void
2033 vc_free(VRelList vrl)
2034 {
2035         VRelList        p_vrl;
2036         MemoryContext old;
2037         PortalVariableMemory pmem;
2038
2039         pmem = PortalGetVariableMemory(vc_portal);
2040         old = MemoryContextSwitchTo((MemoryContext) pmem);
2041
2042         while (vrl != (VRelList) NULL)
2043         {
2044
2045                 /* free rel list entry */
2046                 p_vrl = vrl;
2047                 vrl = vrl->vrl_next;
2048                 pfree(p_vrl);
2049         }
2050
2051         MemoryContextSwitchTo(old);
2052 }
2053
2054 static char *
2055 vc_find_eq(char *bot, int nelem, int size, char *elm, int (*compar) (char *, char *))
2056 {
2057         int                     res;
2058         int                     last = nelem - 1;
2059         int                     celm = nelem / 2;
2060         bool            last_move,
2061                                 first_move;
2062
2063         last_move = first_move = true;
2064         for (;;)
2065         {
2066                 if (first_move == true)
2067                 {
2068                         res = compar(bot, elm);
2069                         if (res > 0)
2070                                 return (NULL);
2071                         if (res == 0)
2072                                 return (bot);
2073                         first_move = false;
2074                 }
2075                 if (last_move == true)
2076                 {
2077                         res = compar(elm, bot + last * size);
2078                         if (res > 0)
2079                                 return (NULL);
2080                         if (res == 0)
2081                                 return (bot + last * size);
2082                         last_move = false;
2083                 }
2084                 res = compar(elm, bot + celm * size);
2085                 if (res == 0)
2086                         return (bot + celm * size);
2087                 if (res < 0)
2088                 {
2089                         if (celm == 0)
2090                                 return (NULL);
2091                         last = celm - 1;
2092                         celm = celm / 2;
2093                         last_move = true;
2094                         continue;
2095                 }
2096
2097                 if (celm == last)
2098                         return (NULL);
2099
2100                 last = last - celm - 1;
2101                 bot = bot + (celm + 1) * size;
2102                 celm = (last + 1) / 2;
2103                 first_move = true;
2104         }
2105
2106 }       /* vc_find_eq */
2107
2108 static int
2109 vc_cmp_blk(char *left, char *right)
2110 {
2111         BlockNumber lblk,
2112                                 rblk;
2113
2114         lblk = (*((VPageDescr *) left))->vpd_blkno;
2115         rblk = (*((VPageDescr *) right))->vpd_blkno;
2116
2117         if (lblk < rblk)
2118                 return (-1);
2119         if (lblk == rblk)
2120                 return (0);
2121         return (1);
2122
2123 }       /* vc_cmp_blk */
2124
2125 static int
2126 vc_cmp_offno(char *left, char *right)
2127 {
2128
2129         if (*(OffsetNumber *) left < *(OffsetNumber *) right)
2130                 return (-1);
2131         if (*(OffsetNumber *) left == *(OffsetNumber *) right)
2132                 return (0);
2133         return (1);
2134
2135 }       /* vc_cmp_offno */
2136
2137
2138 static void
2139 vc_getindices(Oid relid, int *nindices, Relation **Irel)
2140 {
2141         Relation        pgindex;
2142         Relation        irel;
2143         TupleDesc       pgidesc;
2144         HeapTuple       pgitup;
2145         HeapScanDesc pgiscan;
2146         Datum           d;
2147         int                     i,
2148                                 k;
2149         bool            n;
2150         ScanKeyData pgikey;
2151         Oid                *ioid;
2152
2153         *nindices = i = 0;
2154
2155         ioid = (Oid *) palloc(10 * sizeof(Oid));
2156
2157         /* prepare a heap scan on the pg_index relation */
2158         pgindex = heap_openr(IndexRelationName);
2159         pgidesc = RelationGetTupleDescriptor(pgindex);
2160
2161         ScanKeyEntryInitialize(&pgikey, 0x0, Anum_pg_index_indrelid,
2162                                                    ObjectIdEqualRegProcedure,
2163                                                    ObjectIdGetDatum(relid));
2164
2165         pgiscan = heap_beginscan(pgindex, false, false, 1, &pgikey);
2166
2167         while (HeapTupleIsValid(pgitup = heap_getnext(pgiscan, 0, NULL)))
2168         {
2169                 d = heap_getattr(pgitup, Anum_pg_index_indexrelid,
2170                                                  pgidesc, &n);
2171                 i++;
2172                 if (i % 10 == 0)
2173                         ioid = (Oid *) repalloc(ioid, (i + 10) * sizeof(Oid));
2174                 ioid[i - 1] = DatumGetObjectId(d);
2175         }
2176
2177         heap_endscan(pgiscan);
2178         heap_close(pgindex);
2179
2180         if (i == 0)
2181         {                                                       /* No one index found */
2182                 pfree(ioid);
2183                 return;
2184         }
2185
2186         if (Irel != (Relation **) NULL)
2187                 *Irel = (Relation *) palloc(i * sizeof(Relation));
2188
2189         for (k = 0; i > 0;)
2190         {
2191                 irel = index_open(ioid[--i]);
2192                 if (irel != (Relation) NULL)
2193                 {
2194                         if (Irel != (Relation **) NULL)
2195                                 (*Irel)[k] = irel;
2196                         else
2197                                 index_close(irel);
2198                         k++;
2199                 }
2200                 else
2201                         elog(NOTICE, "CAN't OPEN INDEX %u - SKIP IT", ioid[i]);
2202         }
2203         *nindices = k;
2204         pfree(ioid);
2205
2206         if (Irel != (Relation **) NULL && *nindices == 0)
2207         {
2208                 pfree(*Irel);
2209                 *Irel = (Relation *) NULL;
2210         }
2211
2212 }       /* vc_getindices */
2213
2214
2215 static void
2216 vc_clsindices(int nindices, Relation *Irel)
2217 {
2218
2219         if (Irel == (Relation *) NULL)
2220                 return;
2221
2222         while (nindices--)
2223         {
2224                 index_close(Irel[nindices]);
2225         }
2226         pfree(Irel);
2227
2228 }       /* vc_clsindices */
2229
2230
2231 static void
2232 vc_mkindesc(Relation onerel, int nindices, Relation *Irel, IndDesc **Idesc)
2233 {
2234         IndDesc    *idcur;
2235         HeapTuple       pgIndexTup;
2236         AttrNumber *attnumP;
2237         int                     natts;
2238         int                     i;
2239
2240         *Idesc = (IndDesc *) palloc(nindices * sizeof(IndDesc));
2241
2242         for (i = 0, idcur = *Idesc; i < nindices; i++, idcur++)
2243         {
2244                 pgIndexTup =
2245                         SearchSysCacheTuple(INDEXRELID,
2246                                                                 ObjectIdGetDatum(Irel[i]->rd_id),
2247                                                                 0, 0, 0);
2248                 Assert(pgIndexTup);
2249                 idcur->tform = (IndexTupleForm) GETSTRUCT(pgIndexTup);
2250                 for (attnumP = &(idcur->tform->indkey[0]), natts = 0;
2251                          *attnumP != InvalidAttrNumber && natts != INDEX_MAX_KEYS;
2252                          attnumP++, natts++);
2253                 if (idcur->tform->indproc != InvalidOid)
2254                 {
2255                         idcur->finfoP = &(idcur->finfo);
2256                         FIgetnArgs(idcur->finfoP) = natts;
2257                         natts = 1;
2258                         FIgetProcOid(idcur->finfoP) = idcur->tform->indproc;
2259                         *(FIgetname(idcur->finfoP)) = '\0';
2260                 }
2261                 else
2262                         idcur->finfoP = (FuncIndexInfo *) NULL;
2263
2264                 idcur->natts = natts;
2265         }
2266
2267 }       /* vc_mkindesc */
2268
2269
2270 static bool
2271 vc_enough_space(VPageDescr vpd, Size len)
2272 {
2273
2274         len = DOUBLEALIGN(len);
2275
2276         if (len > vpd->vpd_free)
2277                 return (false);
2278
2279         if (vpd->vpd_nusd < vpd->vpd_noff)      /* there are free itemid(s) */
2280                 return (true);                  /* and len <= free_space */
2281
2282         /* ok. noff_usd >= noff_free and so we'll have to allocate new itemid */
2283         if (len <= vpd->vpd_free - sizeof(ItemIdData))
2284                 return (true);
2285
2286         return (false);
2287
2288 }       /* vc_enough_space */