*/
void
heap_multi_insert(Relation relation, TupleTableSlot **slots, int ntuples,
- CommandId cid, int options, BulkInsertState bistate)
+ CommandId cid, int options, BulkInsertState bistate,
+ bool *insert_indexes)
{
TransactionId xid = GetCurrentTransactionId();
HeapTuple *heaptuples;
slots[i]->tts_tid = heaptuples[i]->t_self;
pgstat_count_heap_insert(relation, ntuples);
+ *insert_indexes = true;
}
/*
static TupleTableSlot *
heapam_tuple_insert(Relation relation, TupleTableSlot *slot, CommandId cid,
- int options, BulkInsertState bistate)
+ int options, BulkInsertState bistate, bool *insert_indexes)
{
bool shouldFree = true;
HeapTuple tuple = ExecFetchSlotHeapTuple(slot, true, &shouldFree);
if (shouldFree)
pfree(tuple);
+ *insert_indexes = true;
+
return slot;
}
* default command ID and not allowing access to the speedup options.
*/
void
-simple_table_tuple_insert(Relation rel, TupleTableSlot *slot)
+simple_table_tuple_insert(Relation rel, TupleTableSlot *slot,
+ bool *insert_indexes)
{
- table_tuple_insert(rel, slot, GetCurrentCommandId(true), 0, NULL);
+ table_tuple_insert(rel, slot, GetCurrentCommandId(true), 0, NULL,
+ insert_indexes);
}
/*
CatalogTuplesMultiInsertWithInfo(Relation heapRel, TupleTableSlot **slot,
int ntuples, CatalogIndexState indstate)
{
+ bool insertIndexes;
+
/* Nothing to do */
if (ntuples <= 0)
return;
heap_multi_insert(heapRel, slot, ntuples,
- GetCurrentCommandId(true), 0, NULL);
+ GetCurrentCommandId(true), 0, NULL, &insertIndexes);
/*
* There is no equivalent to heap_multi_insert for the catalog indexes, so
bool line_buf_valid = cstate->line_buf_valid;
uint64 save_cur_lineno = cstate->cur_lineno;
MemoryContext oldcontext;
+ bool insertIndexes;
Assert(buffer->bistate != NULL);
nused,
mycid,
ti_options,
- buffer->bistate);
+ buffer->bistate,
+ &insertIndexes);
MemoryContextSwitchTo(oldcontext);
for (i = 0; i < nused; i++)
* If there are any indexes, update them for all the inserted
* tuples, and run AFTER ROW INSERT triggers.
*/
- if (resultRelInfo->ri_NumIndices > 0)
+ if (insertIndexes && resultRelInfo->ri_NumIndices > 0)
{
List *recheckIndexes;
}
else
{
+ bool insertIndexes;
+
/* OK, store the tuple and create index entries for it */
table_tuple_insert(resultRelInfo->ri_RelationDesc,
- myslot, mycid, ti_options, bistate);
+ myslot, mycid, ti_options, bistate,
+ &insertIndexes);
- if (resultRelInfo->ri_NumIndices > 0)
+ if (insertIndexes && resultRelInfo->ri_NumIndices > 0)
recheckIndexes = ExecInsertIndexTuples(resultRelInfo,
myslot,
estate,
intorel_receive(TupleTableSlot *slot, DestReceiver *self)
{
DR_intorel *myState = (DR_intorel *) self;
+ bool insertIndexes;
/* Nothing to insert if WITH NO DATA is specified. */
if (!myState->into->skipData)
slot,
myState->output_cid,
myState->ti_options,
- myState->bistate);
+ myState->bistate,
+ &insertIndexes);
}
/* We know this is a newly created relation, so there are no indexes */
transientrel_receive(TupleTableSlot *slot, DestReceiver *self)
{
DR_transientrel *myState = (DR_transientrel *) self;
+ bool insertIndexes;
/*
* Note that the input slot might not be of the type of the target
slot,
myState->output_cid,
myState->ti_options,
- myState->bistate);
+ myState->bistate,
+ &insertIndexes);
/* We know this is a newly created relation, so there are no indexes */
/* Write the tuple out to the new relation */
if (newrel)
+ {
+ bool insertIndexes;
+
table_tuple_insert(newrel, insertslot, mycid,
- ti_options, bistate);
+ ti_options, bistate, &insertIndexes);
+ }
ResetExprContext(econtext);
if (!skip_tuple)
{
List *recheckIndexes = NIL;
+ bool insertIndexes;
/* Compute stored generated columns */
if (rel->rd_att->constr &&
ExecPartitionCheck(resultRelInfo, slot, estate, true);
/* OK, store the tuple and create index entries for it */
- simple_table_tuple_insert(resultRelInfo->ri_RelationDesc, slot);
+ simple_table_tuple_insert(resultRelInfo->ri_RelationDesc, slot,
+ &insertIndexes);
- if (resultRelInfo->ri_NumIndices > 0)
+ if (insertIndexes && resultRelInfo->ri_NumIndices > 0)
recheckIndexes = ExecInsertIndexTuples(resultRelInfo,
slot, estate, false, false,
NULL, NIL, false);
}
else
{
+ bool insertIndexes;
+
/* insert the tuple normally */
slot = table_tuple_insert(resultRelationDesc, slot,
estate->es_output_cid,
- 0, NULL);
+ 0, NULL, &insertIndexes);
/* insert index entries for tuple */
- if (resultRelInfo->ri_NumIndices > 0)
+ if (insertIndexes && resultRelInfo->ri_NumIndices > 0)
recheckIndexes = ExecInsertIndexTuples(resultRelInfo,
slot, estate, false,
false, NULL, NIL,
int options, BulkInsertState bistate);
extern void heap_multi_insert(Relation relation, struct TupleTableSlot **slots,
int ntuples, CommandId cid, int options,
- BulkInsertState bistate);
+ BulkInsertState bistate, bool *insert_indexes);
extern TM_Result heap_delete(Relation relation, ItemPointer tid,
CommandId cid, Snapshot crosscheck, int options,
struct TM_FailureData *tmfd, bool changingPart,
/* see table_tuple_insert() for reference about parameters */
TupleTableSlot *(*tuple_insert) (Relation rel, TupleTableSlot *slot,
CommandId cid, int options,
- struct BulkInsertStateData *bistate);
+ struct BulkInsertStateData *bistate,
+ bool *insert_indexes);
/* see table_tuple_insert_speculative() for reference about parameters */
void (*tuple_insert_speculative) (Relation rel,
/* see table_multi_insert() for reference about parameters */
void (*multi_insert) (Relation rel, TupleTableSlot **slots, int nslots,
- CommandId cid, int options, struct BulkInsertStateData *bistate);
+ CommandId cid, int options, struct BulkInsertStateData *bistate,
+ bool *insert_indexes);
/* see table_tuple_delete() for reference about parameters */
TM_Result (*tuple_delete) (Relation rel,
* behavior) is also just passed through to RelationGetBufferForTuple. If
* `bistate` is provided, table_finish_bulk_insert() needs to be called.
*
+ * The table AM's implementation of tuple_insert should set `*insert_indexes`
+ * to true if it expects the caller to insert the relevant index tuples
+ * (as heap table AM does). It should set `*insert_indexes` to false if
+ * it cares about index inserts itself and doesn't want the caller to do
+ * index inserts.
+ *
* Returns the slot containing the inserted tuple, which may differ from the
* given slot. For instance, the source slot may be VirtualTupleTableSlot, but
* the result slot may correspond to the table AM. On return the slot's
*/
static inline TupleTableSlot *
table_tuple_insert(Relation rel, TupleTableSlot *slot, CommandId cid,
- int options, struct BulkInsertStateData *bistate)
+ int options, struct BulkInsertStateData *bistate,
+ bool *insert_indexes)
{
return rel->rd_tableam->tuple_insert(rel, slot, cid, options,
- bistate);
+ bistate, insert_indexes);
}
/*
*/
static inline void
table_multi_insert(Relation rel, TupleTableSlot **slots, int nslots,
- CommandId cid, int options, struct BulkInsertStateData *bistate)
+ CommandId cid, int options, struct BulkInsertStateData *bistate,
+ bool *insert_indexes)
{
rel->rd_tableam->multi_insert(rel, slots, nslots,
- cid, options, bistate);
+ cid, options, bistate, insert_indexes);
}
/*
* ----------------------------------------------------------------------------
*/
-extern void simple_table_tuple_insert(Relation rel, TupleTableSlot *slot);
+extern void simple_table_tuple_insert(Relation rel, TupleTableSlot *slot,
+ bool *insert_indexes);
extern void simple_table_tuple_delete(Relation rel, ItemPointer tid,
Snapshot snapshot,
TupleTableSlot *oldSlot);