1 /*-------------------------------------------------------------------------
4 * routines to support running postgres in 'bootstrap' mode
5 * bootstrap mode is used to create the initial template database
7 * Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
11 * $Header: /cvsroot/pgsql/src/backend/bootstrap/bootstrap.c,v 1.150 2003/05/02 21:59:31 momjian Exp $
13 *-------------------------------------------------------------------------
25 #define BOOTSTRAP_INCLUDE /* mask out stuff in tcop/tcopprot.h */
27 #include "access/genam.h"
28 #include "access/heapam.h"
29 #include "access/xlog.h"
30 #include "bootstrap/bootstrap.h"
31 #include "catalog/catname.h"
32 #include "catalog/index.h"
33 #include "catalog/pg_type.h"
34 #include "executor/executor.h"
35 #include "libpq/pqsignal.h"
36 #include "miscadmin.h"
37 #include "storage/freespace.h"
38 #include "storage/ipc.h"
39 #include "storage/proc.h"
40 #include "tcop/tcopprot.h"
41 #include "utils/builtins.h"
42 #include "utils/fmgroids.h"
43 #include "utils/guc.h"
44 #include "utils/lsyscache.h"
45 #include "utils/relcache.h"
48 #define ALLOC(t, c) ((t *) calloc((unsigned)(c), sizeof(t)))
51 extern int Int_yyparse(void);
52 static hashnode *AddStr(char *str, int strlength, int mderef);
53 static Form_pg_attribute AllocateAttribute(void);
54 static bool BootstrapAlreadySeen(Oid id);
55 static int CompHash(char *str, int len);
56 static hashnode *FindStr(char *str, int length, hashnode *mderef);
57 static Oid gettype(char *type);
58 static void cleanup(void);
65 Relation boot_reldesc; /* current relation descriptor */
68 * In the lexical analyzer, we need to get the reference number quickly from
69 * the string, and the string from the reference number. Thus we have
70 * as our data structure a hash table, where the hashing key taken from
71 * the particular string. The hash table is chained. One of the fields
72 * of the hash table node is an index into the array of character pointers.
73 * The unique index number that every string is assigned is simply the
74 * position of its string pointer in the array of string pointers.
77 #define STRTABLESIZE 10000
78 #define HASHTABLESIZE 503
80 /* Hash function numbers */
85 char *strtable[STRTABLESIZE];
86 hashnode *hashtable[HASHTABLESIZE];
88 static int strtable_end = -1; /* Tells us last occupied string space */
91 * Basic information associated with each type. This is used before
94 * XXX several of these input/output functions do catalog scans
95 * (e.g., F_REGPROCIN scans pg_proc). this obviously creates some
96 * order dependencies in the catalog creation process.
100 char name[NAMEDATALEN];
108 static struct typinfo Procid[] = {
109 {"bool", BOOLOID, 0, 1, F_BOOLIN, F_BOOLOUT},
110 {"bytea", BYTEAOID, 0, -1, F_BYTEAIN, F_BYTEAOUT},
111 {"char", CHAROID, 0, 1, F_CHARIN, F_CHAROUT},
112 {"name", NAMEOID, 0, NAMEDATALEN, F_NAMEIN, F_NAMEOUT},
113 {"int2", INT2OID, 0, 2, F_INT2IN, F_INT2OUT},
114 {"int2vector", INT2VECTOROID, 0, INDEX_MAX_KEYS * 2, F_INT2VECTORIN, F_INT2VECTOROUT},
115 {"int4", INT4OID, 0, 4, F_INT4IN, F_INT4OUT},
116 {"regproc", REGPROCOID, 0, 4, F_REGPROCIN, F_REGPROCOUT},
117 {"regclass", REGCLASSOID, 0, 4, F_REGCLASSIN, F_REGCLASSOUT},
118 {"regtype", REGTYPEOID, 0, 4, F_REGTYPEIN, F_REGTYPEOUT},
119 {"text", TEXTOID, 0, -1, F_TEXTIN, F_TEXTOUT},
120 {"oid", OIDOID, 0, 4, F_OIDIN, F_OIDOUT},
121 {"tid", TIDOID, 0, 6, F_TIDIN, F_TIDOUT},
122 {"xid", XIDOID, 0, 4, F_XIDIN, F_XIDOUT},
123 {"cid", CIDOID, 0, 4, F_CIDIN, F_CIDOUT},
124 {"oidvector", OIDVECTOROID, 0, INDEX_MAX_KEYS * 4, F_OIDVECTORIN, F_OIDVECTOROUT},
125 {"smgr", 210, 0, 2, F_SMGRIN, F_SMGROUT},
126 {"_int4", 1007, INT4OID, -1, F_ARRAY_IN, F_ARRAY_OUT},
127 {"_aclitem", 1034, 1033, -1, F_ARRAY_IN, F_ARRAY_OUT}
130 static int n_types = sizeof(Procid) / sizeof(struct typinfo);
135 FormData_pg_type am_typ;
138 static struct typmap **Typ = (struct typmap **) NULL;
139 static struct typmap *Ap = (struct typmap *) NULL;
141 static int Warnings = 0;
142 static char Blanks[MAXATTR];
144 static char *relname; /* current relation name */
146 Form_pg_attribute attrtypes[MAXATTR]; /* points to attribute info */
147 static Datum values[MAXATTR]; /* corresponding attribute values */
148 int numattr; /* number of attributes for cur. rel */
150 static MemoryContext nogc = NULL; /* special no-gc mem context */
156 * At bootstrap time, we first declare all the indices to be built, and
157 * then build them. The IndexList structure stores enough information
158 * to allow us to build the indices after they've been declared.
161 typedef struct _IndexList
166 struct _IndexList *il_next;
169 static IndexList *ILHead = (IndexList *) NULL;
172 /* ----------------------------------------------------------------
174 * ----------------------------------------------------------------
178 * error handling / abort routines
189 usage help for the bootstrap backen
196 " postgres -boot [-d level] [-D datadir] [-F] [-o file] [-x num] dbname\n"
197 " -d 1-5 debug mode\n"
198 " -D datadir data directory\n"
199 " -F turn off fsync\n"
200 " -o file send debug output to file\n"
201 " -x num internal use\n"));
209 BootstrapMain(int argc, char *argv[])
210 /* ----------------------------------------------------------------
211 * The main loop for handling the backend in bootstrap mode
212 * the bootstrap mode is used to initialize the template database
213 * the bootstrap backend doesn't speak SQL, but instead expects
214 * commands in a special bootstrap language.
216 * The arguments passed in to BootstrapMain are the run-time arguments
217 * without the argument '-boot', the caller is required to have
218 * removed -boot from the run-time args
219 * ----------------------------------------------------------------
225 int xlogop = BS_XLOG_NOP;
226 char *potential_DataDir = NULL;
232 MyProcPid = getpid();
235 * Fire up essential subsystems: error and memory management
237 * If we are running under the postmaster, this is done already.
239 if (!IsUnderPostmaster)
243 * process command arguments
246 /* Set defaults, to be overriden by explicit options below */
248 if (!IsUnderPostmaster)
250 InitializeGUCOptions();
251 potential_DataDir = getenv("PGDATA"); /* Null if no PGDATA
255 while ((flag = getopt(argc, argv, "B:d:D:Fo:px:")) != -1)
260 potential_DataDir = optarg;
264 /* Turn on debugging for the bootstrap process. */
265 char *debugstr = palloc(strlen("debug") + strlen(optarg) + 1);
267 sprintf(debugstr, "debug%s", optarg);
268 SetConfigOption("log_min_messages", debugstr,
269 PGC_POSTMASTER, PGC_S_ARGV);
270 SetConfigOption("client_min_messages", debugstr,
271 PGC_POSTMASTER, PGC_S_ARGV);
277 SetConfigOption("fsync", "false", PGC_POSTMASTER, PGC_S_ARGV);
280 StrNCpy(OutputFileName, optarg, MAXPGPATH);
283 xlogop = atoi(optarg);
286 /* indicates fork from postmaster */
289 SetConfigOption("shared_buffers", optarg, PGC_POSTMASTER, PGC_S_ARGV);
297 if (argc - optind != 1)
300 dbName = argv[optind];
304 if (!IsUnderPostmaster)
306 if (!potential_DataDir)
309 gettext("%s does not know where to find the database system data.\n"
310 "You must specify the directory that contains the database system\n"
311 "either by specifying the -D invocation option or by setting the\n"
312 "PGDATA environment variable.\n\n"),
316 SetDataDir(potential_DataDir);
319 /* Validate we have been given a reasonable-looking DataDir */
321 ValidatePgVersion(DataDir);
323 if (IsUnderPostmaster)
326 * Properly accept or ignore signals the postmaster might send us
328 pqsignal(SIGHUP, SIG_IGN);
329 pqsignal(SIGINT, SIG_IGN); /* ignore query-cancel */
330 pqsignal(SIGTERM, die);
331 pqsignal(SIGQUIT, quickdie);
332 pqsignal(SIGALRM, SIG_IGN);
333 pqsignal(SIGPIPE, SIG_IGN);
334 pqsignal(SIGUSR1, SIG_IGN);
335 pqsignal(SIGUSR2, SIG_IGN);
338 * Reset some signals that are accepted by postmaster but not here
340 pqsignal(SIGCHLD, SIG_DFL);
341 pqsignal(SIGTTIN, SIG_DFL);
342 pqsignal(SIGTTOU, SIG_DFL);
343 pqsignal(SIGCONT, SIG_DFL);
344 pqsignal(SIGWINCH, SIG_DFL);
347 * Unblock signals (they were blocked when the postmaster forked
350 PG_SETMASK(&UnBlockSig);
354 /* Set up appropriately for interactive use */
355 pqsignal(SIGHUP, die);
356 pqsignal(SIGINT, die);
357 pqsignal(SIGTERM, die);
358 pqsignal(SIGQUIT, die);
361 * Create lockfile for data directory.
363 if (!CreateDataDirLockFile(DataDir, false))
367 SetProcessingMode(BootstrapProcessing);
368 IgnoreSystemIndexes(true);
374 if (IsUnderPostmaster)
375 InitDummyProcess(); /* needed to get LWLocks */
380 SetProcessingMode(NormalProcessing);
388 case BS_XLOG_BOOTSTRAP:
393 case BS_XLOG_CHECKPOINT:
395 CreateCheckPoint(false, false);
396 SetSavedRedoRecPtr(); /* pass redo ptr back to
398 proc_exit(0); /* done */
400 case BS_XLOG_STARTUP:
403 proc_exit(0); /* done */
405 case BS_XLOG_SHUTDOWN:
408 proc_exit(0); /* done */
411 elog(PANIC, "Unsupported XLOG op %d", xlogop);
415 SetProcessingMode(BootstrapProcessing);
418 * backend initialization
420 InitPostgres(dbName, NULL);
422 for (i = 0; i < MAXATTR; i++)
424 attrtypes[i] = (Form_pg_attribute) NULL;
427 for (i = 0; i < STRTABLESIZE; ++i)
429 for (i = 0; i < HASHTABLESIZE; ++i)
433 * abort processing resumes here
435 if (sigsetjmp(Warn_restart, 1) != 0)
438 AbortCurrentTransaction();
446 * the sed script boot.sed renamed yyparse to Int_yyparse for the
447 * bootstrap parser to avoid conflicts with the normal SQL parser
451 SetProcessingMode(NormalProcessing);
452 CreateCheckPoint(true, true);
453 SetProcessingMode(BootstrapProcessing);
455 /* clean up processing */
456 StartTransactionCommand(true);
459 /* not reached, here to make compiler happy */
464 /* ----------------------------------------------------------------
465 * MANUAL BACKEND INTERACTIVE INTERFACE COMMANDS
466 * ----------------------------------------------------------------
474 boot_openrel(char *relname)
482 if (strlen(relname) >= NAMEDATALEN - 1)
483 relname[NAMEDATALEN - 1] = '\0';
485 if (Typ == (struct typmap **) NULL)
487 rel = heap_openr(TypeRelationName, NoLock);
488 scan = heap_beginscan(rel, SnapshotNow, 0, (ScanKey) NULL);
490 while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL)
493 app = Typ = ALLOC(struct typmap *, i + 1);
495 *app++ = ALLOC(struct typmap, 1);
496 *app = (struct typmap *) NULL;
497 scan = heap_beginscan(rel, SnapshotNow, 0, (ScanKey) NULL);
499 while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL)
501 (*app)->am_oid = HeapTupleGetOid(tup);
502 memcpy((char *) &(*app)->am_typ,
503 (char *) GETSTRUCT(tup),
504 sizeof((*app)->am_typ));
508 heap_close(rel, NoLock);
511 if (boot_reldesc != NULL)
514 elog(DEBUG3, "open relation %s, attrsize %d", relname ? relname : "(null)",
515 (int) ATTRIBUTE_TUPLE_SIZE);
517 boot_reldesc = heap_openr(relname, NoLock);
518 numattr = boot_reldesc->rd_rel->relnatts;
519 for (i = 0; i < numattr; i++)
521 if (attrtypes[i] == NULL)
522 attrtypes[i] = AllocateAttribute();
523 memmove((char *) attrtypes[i],
524 (char *) boot_reldesc->rd_att->attrs[i],
525 ATTRIBUTE_TUPLE_SIZE);
528 Form_pg_attribute at = attrtypes[i];
530 elog(DEBUG3, "create attribute %d name %s len %d num %d type %u",
531 i, NameStr(at->attname), at->attlen, at->attnum,
548 if (strcmp(RelationGetRelationName(boot_reldesc), name) != 0)
549 elog(ERROR, "closerel: close of '%s' when '%s' was expected",
550 name, relname ? relname : "(null)");
553 elog(ERROR, "closerel: close of '%s' before any relation was opened",
557 if (boot_reldesc == NULL)
558 elog(ERROR, "no open relation to close");
561 elog(DEBUG3, "close relation %s", relname ? relname : "(null)");
562 heap_close(boot_reldesc, NoLock);
563 boot_reldesc = (Relation) NULL;
572 * define a <field,type> pair
573 * if there are n fields in a relation to be created, this routine
574 * will be called n times
578 DefineAttr(char *name, char *type, int attnum)
583 if (boot_reldesc != NULL)
585 elog(LOG, "warning: no open relations allowed with 'create' command");
589 if (attrtypes[attnum] == (Form_pg_attribute) NULL)
590 attrtypes[attnum] = AllocateAttribute();
591 MemSet(attrtypes[attnum], 0, ATTRIBUTE_TUPLE_SIZE);
593 namestrcpy(&attrtypes[attnum]->attname, name);
594 elog(DEBUG3, "column %s %s", NameStr(attrtypes[attnum]->attname), type);
595 attrtypes[attnum]->attnum = attnum + 1; /* fillatt */
597 typeoid = gettype(type);
599 if (Typ != (struct typmap **) NULL)
601 attrtypes[attnum]->atttypid = Ap->am_oid;
602 attlen = attrtypes[attnum]->attlen = Ap->am_typ.typlen;
603 attrtypes[attnum]->attbyval = Ap->am_typ.typbyval;
604 attrtypes[attnum]->attstorage = Ap->am_typ.typstorage;
605 attrtypes[attnum]->attalign = Ap->am_typ.typalign;
609 attrtypes[attnum]->atttypid = Procid[typeoid].oid;
610 attlen = attrtypes[attnum]->attlen = Procid[typeoid].len;
613 * Cheat like mad to fill in these items from the length only.
614 * This only has to work for types that appear in Procid[].
619 attrtypes[attnum]->attbyval = true;
620 attrtypes[attnum]->attstorage = 'p';
621 attrtypes[attnum]->attalign = 'c';
624 attrtypes[attnum]->attbyval = true;
625 attrtypes[attnum]->attstorage = 'p';
626 attrtypes[attnum]->attalign = 's';
629 attrtypes[attnum]->attbyval = true;
630 attrtypes[attnum]->attstorage = 'p';
631 attrtypes[attnum]->attalign = 'i';
634 attrtypes[attnum]->attbyval = false;
635 attrtypes[attnum]->attstorage = 'x';
636 attrtypes[attnum]->attalign = 'i';
639 /* TID and fixed-length arrays, such as oidvector */
640 attrtypes[attnum]->attbyval = false;
641 attrtypes[attnum]->attstorage = 'p';
642 attrtypes[attnum]->attalign = 'i';
646 attrtypes[attnum]->attcacheoff = -1;
647 attrtypes[attnum]->atttypmod = -1;
648 attrtypes[attnum]->attislocal = true;
651 * Mark as "not null" if type is fixed-width and prior columns are
652 * too. This corresponds to case where column can be accessed directly
653 * via C struct declaration.
659 for (i = 0; i < attnum; i++)
661 if (attrtypes[i]->attlen <= 0)
665 attrtypes[attnum]->attnotnull = true;
673 * If objectid is not zero, it is a specific OID to assign to the tuple.
674 * Otherwise, an OID will be assigned (if necessary) by heap_insert.
678 InsertOneTuple(Oid objectid)
684 elog(DEBUG3, "inserting row oid %u, %d columns", objectid, numattr);
686 tupDesc = CreateTupleDesc(numattr,
687 RelationGetForm(boot_reldesc)->relhasoids,
689 tuple = heap_formtuple(tupDesc, values, Blanks);
690 if (objectid != (Oid) 0)
691 HeapTupleSetOid(tuple, objectid);
692 pfree(tupDesc); /* just free's tupDesc, not the attrtypes */
694 simple_heap_insert(boot_reldesc, tuple);
695 heap_freetuple(tuple);
696 elog(DEBUG3, "row inserted");
699 * Reset blanks for next tuple
701 for (i = 0; i < numattr; i++)
710 InsertOneValue(char *value, int i)
716 AssertArg(i >= 0 || i < MAXATTR);
718 elog(DEBUG3, "inserting column %d value '%s'", i, value);
720 if (Typ != (struct typmap **) NULL)
724 elog(DEBUG3, "Typ != NULL");
726 while (*app && (*app)->am_oid != boot_reldesc->rd_att->attrs[i]->atttypid)
731 elog(FATAL, "unable to find atttypid %u in Typ list",
732 boot_reldesc->rd_att->attrs[i]->atttypid);
734 values[i] = OidFunctionCall3(ap->am_typ.typinput,
735 CStringGetDatum(value),
736 ObjectIdGetDatum(ap->am_typ.typelem),
738 prt = DatumGetCString(OidFunctionCall3(ap->am_typ.typoutput,
740 ObjectIdGetDatum(ap->am_typ.typelem),
742 elog(DEBUG3, " -> %s", prt);
747 for (typeindex = 0; typeindex < n_types; typeindex++)
749 if (Procid[typeindex].oid == attrtypes[i]->atttypid)
752 if (typeindex >= n_types)
753 elog(ERROR, "type oid %u not found", attrtypes[i]->atttypid);
754 elog(DEBUG3, "Typ == NULL, typeindex = %u", typeindex);
755 values[i] = OidFunctionCall3(Procid[typeindex].inproc,
756 CStringGetDatum(value),
757 ObjectIdGetDatum(Procid[typeindex].elem),
759 prt = DatumGetCString(OidFunctionCall3(Procid[typeindex].outproc,
761 ObjectIdGetDatum(Procid[typeindex].elem),
763 elog(DEBUG3, " -> %s", prt);
766 elog(DEBUG3, "inserted");
776 elog(DEBUG3, "inserting column %d NULL", i);
777 Assert(i >= 0 || i < MAXATTR);
778 values[i] = PointerGetDatum(NULL);
782 #define MORE_THAN_THE_NUMBER_OF_CATALOGS 256
785 BootstrapAlreadySeen(Oid id)
787 static Oid seenArray[MORE_THAN_THE_NUMBER_OF_CATALOGS];
788 static int nseen = 0;
794 for (i = 0; i < nseen; i++)
796 if (seenArray[i] == id)
804 seenArray[nseen] = id;
817 static int beenhere = 0;
823 elog(FATAL, "Memory manager fault: cleanup called twice.\n");
826 if (boot_reldesc != NULL)
828 CommitTransactionCommand(true);
835 * NB: this is really ugly; it will return an integer index into Procid[],
836 * and not an OID at all, until the first reference to a type not known in
837 * Procid[]. At that point it will read and cache pg_type in the Typ array,
838 * and subsequently return a real OID (and set the global pointer Ap to
839 * point at the found row in Typ). So caller must check whether Typ is
840 * still NULL to determine what the return value is!
852 if (Typ != (struct typmap **) NULL)
854 for (app = Typ; *app != (struct typmap *) NULL; app++)
856 if (strncmp(NameStr((*app)->am_typ.typname), type, NAMEDATALEN) == 0)
859 return (*app)->am_oid;
865 for (i = 0; i < n_types; i++)
867 if (strncmp(type, Procid[i].name, NAMEDATALEN) == 0)
870 elog(DEBUG3, "external type: %s", type);
871 rel = heap_openr(TypeRelationName, NoLock);
872 scan = heap_beginscan(rel, SnapshotNow, 0, (ScanKey) NULL);
874 while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL)
877 app = Typ = ALLOC(struct typmap *, i + 1);
879 *app++ = ALLOC(struct typmap, 1);
880 *app = (struct typmap *) NULL;
881 scan = heap_beginscan(rel, SnapshotNow, 0, (ScanKey) NULL);
883 while ((tup = heap_getnext(scan, ForwardScanDirection)) != NULL)
885 (*app)->am_oid = HeapTupleGetOid(tup);
886 memmove((char *) &(*app++)->am_typ,
887 (char *) GETSTRUCT(tup),
888 sizeof((*app)->am_typ));
891 heap_close(rel, NoLock);
892 return gettype(type);
894 elog(ERROR, "Error: unknown type '%s'.\n", type);
896 /* not reached, here to make compiler happy */
904 static Form_pg_attribute
905 AllocateAttribute(void)
907 Form_pg_attribute attribute = (Form_pg_attribute) malloc(ATTRIBUTE_TUPLE_SIZE);
909 if (!PointerIsValid(attribute))
910 elog(FATAL, "AllocateAttribute: malloc failed");
911 MemSet(attribute, 0, ATTRIBUTE_TUPLE_SIZE);
918 * XXX arrays of "basetype" are always "_basetype".
919 * this is an evil hack inherited from rel. 3.1.
920 * XXX array dimension is thrown away because we
921 * don't support fixed-dimension arrays. again,
924 * the string passed in must have a '[' character in it
926 * the string returned is a pointer to static storage and should NOT
927 * be freed by the CALLER.
931 MapArrayTypeName(char *s)
935 static char newStr[NAMEDATALEN]; /* array type names < NAMEDATALEN
938 if (s == NULL || s[0] == '\0')
943 for (i = 0; i < NAMEDATALEN - 1 && s[i] != '['; i++, j++)
953 * returns the string table position of the identifier
954 * passed to it. We add it to the table if we can't find it.
958 EnterString(char *str)
965 node = FindStr(str, len, 0);
970 node = AddStr(str, len, 0);
977 * when given an idnum into the 'string-table' return the string
978 * associated with the idnum
982 LexIDStr(int ident_num)
984 return strtable[ident_num];
991 * Compute a hash function for a given string. We look at the first,
992 * the last, and the middle character of a string to try to get spread
993 * the strings out. The function is rather arbitrary, except that we
994 * are mod'ing by a prime number.
998 CompHash(char *str, int len)
1002 result = (NUM * str[0] + NUMSQR * str[len - 1] + NUMCUBE * str[(len - 1) / 2]);
1004 return result % HASHTABLESIZE;
1011 * This routine looks for the specified string in the hash
1012 * table. It returns a pointer to the hash node found,
1013 * or NULL if the string is not in the table.
1017 FindStr(char *str, int length, hashnode *mderef)
1021 node = hashtable[CompHash(str, length)];
1022 while (node != NULL)
1025 * We must differentiate between string constants that might have
1026 * the same value as a identifier and the identifier itself.
1028 if (!strcmp(str, strtable[node->strnum]))
1030 return node; /* no need to check */
1035 /* Couldn't find it in the list */
1042 * This function adds the specified string, along with its associated
1043 * data, to the hash table and the string table. We return the node
1044 * so that the calling routine can find out the unique id that AddStr
1045 * has assigned to this string.
1049 AddStr(char *str, int strlength, int mderef)
1057 if (++strtable_end == STRTABLESIZE)
1059 /* Error, string table overflow, so we Punt */
1061 "There are too many string constants and identifiers for the compiler to handle.");
1067 * Some of the utilites (eg, define type, create relation) assume that
1068 * the string they're passed is a NAMEDATALEN. We get array bound
1069 * read violations from purify if we don't allocate at least
1070 * NAMEDATALEN bytes for strings of this sort. Because we're lazy, we
1071 * allocate at least NAMEDATALEN bytes all the time.
1074 if ((len = strlength + 1) < NAMEDATALEN)
1077 strtable[strtable_end] = malloc((unsigned) len);
1078 strcpy(strtable[strtable_end], str);
1080 /* Now put a node in the hash table */
1082 newnode = (hashnode *) malloc(sizeof(hashnode) * 1);
1083 newnode->strnum = strtable_end;
1084 newnode->next = NULL;
1086 /* Find out where it goes */
1088 hashresult = CompHash(str, strlength);
1089 if (hashtable[hashresult] == NULL)
1090 hashtable[hashresult] = newnode;
1092 { /* There is something in the list */
1093 trail = hashtable[hashresult];
1095 while (temp != NULL)
1100 trail->next = newnode;
1108 * index_register() -- record an index that has been set up for building
1111 * At bootstrap time, we define a bunch of indices on system catalogs.
1112 * We postpone actually building the indices until just before we're
1113 * finished with initialization, however. This is because more classes
1114 * and indices may be defined, and we want to be sure that all of them
1115 * are present in the index.
1118 index_register(Oid heap,
1120 IndexInfo *indexInfo)
1123 MemoryContext oldcxt;
1126 * XXX mao 10/31/92 -- don't gc index reldescs, associated info at
1127 * bootstrap time. we'll declare the indices now, but want to create
1132 nogc = AllocSetContextCreate((MemoryContext) NULL,
1134 ALLOCSET_DEFAULT_MINSIZE,
1135 ALLOCSET_DEFAULT_INITSIZE,
1136 ALLOCSET_DEFAULT_MAXSIZE);
1138 oldcxt = MemoryContextSwitchTo(nogc);
1140 newind = (IndexList *) palloc(sizeof(IndexList));
1141 newind->il_heap = heap;
1142 newind->il_ind = ind;
1143 newind->il_info = (IndexInfo *) palloc(sizeof(IndexInfo));
1145 memcpy(newind->il_info, indexInfo, sizeof(IndexInfo));
1146 /* predicate will likely be null, but may as well copy it */
1147 newind->il_info->ii_Predicate = (List *)
1148 copyObject(indexInfo->ii_Predicate);
1149 newind->il_info->ii_PredicateState = NIL;
1151 newind->il_next = ILHead;
1154 MemoryContextSwitchTo(oldcxt);
1160 for (; ILHead != (IndexList *) NULL; ILHead = ILHead->il_next)
1165 heap = heap_open(ILHead->il_heap, NoLock);
1166 ind = index_open(ILHead->il_ind);
1167 index_build(heap, ind, ILHead->il_info);
1170 * In normal processing mode, index_build would close the heap and
1171 * index, but in bootstrap mode it will not.
1175 * All of the rest of this routine is needed only because in
1176 * bootstrap processing we don't increment xact id's. The normal
1177 * DefineIndex code replaces a pg_class tuple with updated info
1178 * including the relhasindex flag (which we need to have updated).
1179 * Unfortunately, there are always two indices defined on each
1180 * catalog causing us to update the same pg_class tuple twice for
1181 * each catalog getting an index during bootstrap resulting in the
1182 * ghost tuple problem (see heap_update). To get around this we
1183 * change the relhasindex field ourselves in this routine keeping
1184 * track of what catalogs we already changed so that we don't
1185 * modify those tuples twice. The normal mechanism for updating
1186 * pg_class is disabled during bootstrap.
1190 if (!BootstrapAlreadySeen(RelationGetRelid(heap)))
1191 UpdateStats(RelationGetRelid(heap), 0);
1193 /* XXX Probably we ought to close the heap and index here? */