@@ -76,7 +76,7 @@ typedef struct SeqTableData
76
76
77
77
typedef SeqTableData * SeqTable ;
78
78
79
- static HTAB * seqhashtab = NULL ;/* hash table for SeqTable items */
79
+ static HTAB * seqhashtab = NULL ;/* hash table for SeqTable items */
80
80
81
81
/*
82
82
* last_used_seq is updated by nextval() to point to the last used
@@ -1022,16 +1022,17 @@ init_sequence(Oid relid, SeqTable *p_elm, Relation *p_rel)
1022
1022
Relation seqrel ;
1023
1023
bool found ;
1024
1024
1025
+ /* Find or create a hash table entry for this sequence */
1025
1026
if (seqhashtab == NULL )
1026
1027
create_seq_hashtable ();
1027
1028
1028
1029
elm = (SeqTable )hash_search (seqhashtab ,& relid ,HASH_ENTER ,& found );
1029
1030
1030
1031
/*
1031
- *Initalize the new hash table entry if it did not exist already.
1032
+ *Initialize the new hash table entry if it did not exist already.
1032
1033
*
1033
1034
* NOTE: seqtable entries are stored for the life of a backend (unless
1034
- *explictly discarded with DISCARD). If the sequence itself is deleted
1035
+ *explicitly discarded with DISCARD). If the sequence itself is deleted
1035
1036
* then the entry becomes wasted memory, but it's small enough that this
1036
1037
* should not matter.
1037
1038
*/