1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509
|
/*
* common.c - functions used by all trigger variants.
*
* Copyright (c) 2007 Marko Kreen, Skype Technologies OÜ
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <postgres.h>
#include <commands/trigger.h>
#include <catalog/pg_type.h>
#include <catalog/pg_namespace.h>
#include <executor/spi.h>
#include <lib/stringinfo.h>
#include <utils/builtins.h>
#include <utils/memutils.h>
#include <utils/inval.h>
#include <utils/hsearch.h>
#include <utils/syscache.h>
#include <utils/rel.h>
#include "common.h"
#include "stringutil.h"
#include "utils/syscache.h"
#include "utils/builtins.h"
/*
* Module tag
*/
#ifdef PG_MODULE_MAGIC
PG_MODULE_MAGIC;
#endif
/*
* primary key info
*/
static bool tbl_cache_invalid;
static MemoryContext tbl_cache_ctx;
static HTAB *tbl_cache_map;
static const char pkey_sql [] =
"SELECT k.attnum, k.attname FROM pg_index i, pg_attribute k"
" WHERE i.indrelid = $1 AND k.attrelid = i.indexrelid"
" AND i.indisprimary AND k.attnum > 0 AND NOT k.attisdropped"
" ORDER BY k.attnum";
static void *pkey_plan;
static void relcache_reset_cb(Datum arg, Oid relid);
/*
* helper for queue insertion.
*
* does not support NULL arguments.
*/
void pgq_simple_insert(const char *queue_name, Datum ev_type, Datum ev_data, Datum ev_extra1, Datum ev_extra2)
{
Datum values[5];
char nulls[5];
static void *plan = NULL;
int res;
if (!plan) {
const char *sql;
Oid types[5] = { TEXTOID, TEXTOID, TEXTOID, TEXTOID, TEXTOID };
sql = "select pgq.insert_event($1, $2, $3, $4, $5, null, null)";
plan = SPI_saveplan(SPI_prepare(sql, 5, types));
if (plan == NULL)
elog(ERROR, "logtriga: SPI_prepare() failed");
}
values[0] = DirectFunctionCall1(textin, (Datum)queue_name);
values[1] = ev_type;
values[2] = ev_data;
values[3] = ev_extra1;
values[4] = ev_extra2;
nulls[0] = ' ';
nulls[1] = ' ';
nulls[2] = ' ';
nulls[3] = ' ';
nulls[4] = ev_extra2 ? ' ' : 'n';
res = SPI_execute_plan(plan, values, nulls, false, 0);
if (res != SPI_OK_SELECT)
elog(ERROR, "call of pgq.insert_event failed");
}
void pgq_insert_tg_event(PgqTriggerEvent *ev)
{
pgq_simple_insert(ev->queue_name,
pgq_finish_varbuf(ev->ev_type),
pgq_finish_varbuf(ev->ev_data),
pgq_finish_varbuf(ev->ev_extra1),
ev->ev_extra2
? pgq_finish_varbuf(ev->ev_extra2)
: (Datum)0);
}
char *pgq_find_table_name(Relation rel)
{
NameData tname = rel->rd_rel->relname;
Oid nsoid = rel->rd_rel->relnamespace;
char namebuf[NAMEDATALEN * 2 + 3];
HeapTuple ns_tup;
Form_pg_namespace ns_struct;
NameData nspname;
/* find namespace info */
ns_tup = SearchSysCache(NAMESPACEOID,
ObjectIdGetDatum(nsoid), 0, 0, 0);
if (!HeapTupleIsValid(ns_tup))
elog(ERROR, "Cannot find namespace %u", nsoid);
ns_struct = (Form_pg_namespace) GETSTRUCT(ns_tup);
nspname = ns_struct->nspname;
/* fill name */
sprintf(namebuf, "%s.%s", NameStr(nspname), NameStr(tname));
ReleaseSysCache(ns_tup);
return pstrdup(namebuf);
}
static void
init_pkey_plan(void)
{
Oid types[1] = { OIDOID };
pkey_plan = SPI_saveplan(SPI_prepare(pkey_sql, 1, types));
if (pkey_plan == NULL)
elog(ERROR, "pgq_triggers: SPI_prepare() failed");
}
static void
init_cache(void)
{
HASHCTL ctl;
int flags;
int max_tables = 128;
/*
* create own context
*/
tbl_cache_ctx = AllocSetContextCreate(TopMemoryContext,
"pgq_triggers table info",
ALLOCSET_SMALL_MINSIZE,
ALLOCSET_SMALL_INITSIZE,
ALLOCSET_SMALL_MAXSIZE);
/*
* init pkey cache.
*/
MemSet(&ctl, 0, sizeof(ctl));
ctl.keysize = sizeof(Oid);
ctl.entrysize = sizeof(struct PgqTableInfo);
ctl.hash = oid_hash;
flags = HASH_ELEM | HASH_FUNCTION;
tbl_cache_map = hash_create("pgq_triggers pkey cache", max_tables, &ctl, flags);
}
/*
* Prepare utility plans and plan cache.
*/
static void
init_module(void)
{
static int callback_init = 0;
/* do full reset if requested */
if (tbl_cache_invalid) {
if (tbl_cache_map)
hash_destroy(tbl_cache_map);
if (tbl_cache_ctx)
MemoryContextDelete(tbl_cache_ctx);
tbl_cache_map = NULL;
tbl_cache_ctx = NULL;
tbl_cache_invalid = false;
}
/* htab can be occasinally dropped */
if (tbl_cache_ctx)
return;
init_cache();
/*
* Init plans.
*/
if (!pkey_plan)
init_pkey_plan();
/* this must be done only once */
if (!callback_init) {
CacheRegisterRelcacheCallback(relcache_reset_cb, (Datum)0);
callback_init = 1;
}
}
/*
* Fill table information in hash table.
*/
static void
fill_tbl_info(Relation rel, struct PgqTableInfo *info)
{
StringInfo pkeys;
Datum values[1];
const char *name = pgq_find_table_name(rel);
TupleDesc desc;
HeapTuple row;
bool isnull;
int res, i, attno;
/* load pkeys */
values[0] = ObjectIdGetDatum(rel->rd_id);
res = SPI_execute_plan(pkey_plan, values, NULL, false, 0);
if (res != SPI_OK_SELECT)
elog(ERROR, "pkey_plan exec failed");
/*
* Fill info
*/
desc = SPI_tuptable->tupdesc;
pkeys = makeStringInfo();
info->n_pkeys = SPI_processed;
info->table_name = MemoryContextStrdup(tbl_cache_ctx, name);
info->pkey_attno = MemoryContextAlloc(tbl_cache_ctx, info->n_pkeys * sizeof(int));
for (i = 0; i < SPI_processed; i++) {
row = SPI_tuptable->vals[i];
attno = DatumGetInt16(SPI_getbinval(row, desc, 1, &isnull));
name = SPI_getvalue(row, desc, 2);
info->pkey_attno[i] = attno;
if (i > 0)
appendStringInfoChar(pkeys, ',');
appendStringInfoString(pkeys, name);
}
info->pkey_list = MemoryContextStrdup(tbl_cache_ctx, pkeys->data);
}
static void
clean_info(struct PgqTableInfo *info, bool found)
{
if (!found)
goto uninitialized;
if (info->table_name)
pfree(info->table_name);
if (info->pkey_attno)
pfree(info->pkey_attno);
if (info->pkey_list)
pfree((void *)info->pkey_list);
uninitialized:
info->table_name = NULL;
info->pkey_attno = NULL;
info->pkey_list = NULL;
info->n_pkeys = 0;
}
/*
* the callback can be launched any time from signal callback,
* only minimal tagging can be done here.
*/
static void relcache_reset_cb(Datum arg, Oid relid)
{
if (relid == InvalidOid) {
tbl_cache_invalid = true;
} else if (tbl_cache_map && !tbl_cache_invalid) {
struct PgqTableInfo *entry;
entry = hash_search(tbl_cache_map, &relid, HASH_FIND, NULL);
if (entry)
entry->invalid = true;
}
}
/*
* fetch insert plan from cache.
*/
struct PgqTableInfo *
pgq_find_table_info(Relation rel)
{
struct PgqTableInfo *entry;
bool found = false;
init_module();
entry = hash_search(tbl_cache_map, &rel->rd_id, HASH_ENTER, &found);
if (!found || entry->invalid) {
clean_info(entry, found);
/*
* During fill_tbl_info() 2 events can happen:
* - table info reset
* - exception
* To survive both, always clean struct and tag
* as invalid but differently from reset.
*/
entry->invalid = 2;
/* find info */
fill_tbl_info(rel, entry);
/*
* If no reset happened, it's valid. Actual reset
* is postponed to next call.
*/
if (entry->invalid == 2)
entry->invalid = false;
}
return entry;
}
static void
parse_newstyle_args(PgqTriggerEvent *ev, TriggerData *tg)
{
int i;
/*
* parse args
*/
ev->skip = false;
ev->queue_name = tg->tg_trigger->tgargs[0];
for (i = 1; i < tg->tg_trigger->tgnargs; i++) {
const char *arg = tg->tg_trigger->tgargs[i];
if (strcmp(arg, "SKIP") == 0)
ev->skip = true;
else if (strncmp(arg, "ignore=", 7) == 0)
ev->ignore_list = arg + 7;
else if (strncmp(arg, "pkey=", 5) == 0)
ev->pkey_list = arg + 5;
else if (strcmp(arg, "backup") == 0)
ev->backup = true;
else
elog(ERROR, "bad param to pgq trigger");
}
/*
* Check if we have pkey
*/
if (ev->op_type == 'U' || ev->op_type == 'D') {
if (ev->pkey_list[0] == 0)
elog(ERROR, "Update/Delete on table without pkey");
}
}
static void
parse_oldstyle_args(PgqTriggerEvent *ev, TriggerData *tg)
{
const char *kpos;
int attcnt, i;
TupleDesc tupdesc = tg->tg_relation->rd_att;
ev->skip = false;
if (tg->tg_trigger->tgnargs < 2 || tg->tg_trigger->tgnargs > 3)
elog(ERROR, "pgq.logtriga must be used with 2 or 3 args");
ev->queue_name = tg->tg_trigger->tgargs[0];
ev->attkind = tg->tg_trigger->tgargs[1];
ev->attkind_len = strlen(ev->attkind);
if (tg->tg_trigger->tgnargs > 2)
ev->table_name = tg->tg_trigger->tgargs[2];
/*
* Count number of active columns
*/
tupdesc = tg->tg_relation->rd_att;
for (i = 0, attcnt = 0; i < tupdesc->natts; i++)
{
if (!tupdesc->attrs[i]->attisdropped)
attcnt++;
}
/*
* look if last pkey column exists
*/
kpos = strrchr(ev->attkind, 'k');
if (kpos == NULL)
elog(ERROR, "need at least one key column");
if (kpos - ev->attkind >= attcnt)
elog(ERROR, "key column does not exist");
}
/*
* parse trigger arguments.
*/
void pgq_prepare_event(struct PgqTriggerEvent *ev, TriggerData *tg, bool newstyle)
{
memset(ev, 0, sizeof(*ev));
/*
* Check trigger calling conventions
*/
if (!TRIGGER_FIRED_AFTER(tg->tg_event))
/* dont care */;
if (!TRIGGER_FIRED_FOR_ROW(tg->tg_event))
elog(ERROR, "pgq trigger must be fired FOR EACH ROW");
if (tg->tg_trigger->tgnargs < 1)
elog(ERROR, "pgq trigger must have destination queue as argument");
/*
* check operation type
*/
if (TRIGGER_FIRED_BY_INSERT(tg->tg_event))
ev->op_type = 'I';
else if (TRIGGER_FIRED_BY_UPDATE(tg->tg_event))
ev->op_type = 'U';
else if (TRIGGER_FIRED_BY_DELETE(tg->tg_event))
ev->op_type = 'D';
else
elog(ERROR, "unknown event for pgq trigger");
/*
* load table info
*/
ev->info = pgq_find_table_info(tg->tg_relation);
ev->table_name = ev->info->table_name;
ev->pkey_list = ev->info->pkey_list;
/*
* parse args
*/
if (newstyle)
parse_newstyle_args(ev, tg);
else
parse_oldstyle_args(ev, tg);
/*
* init data
*/
ev->ev_type = pgq_init_varbuf();
ev->ev_data = pgq_init_varbuf();
ev->ev_extra1 = pgq_init_varbuf();
/*
* Do the backup, if requested.
*/
if (ev->backup) {
ev->ev_extra2 = pgq_init_varbuf();
pgq_urlenc_row(ev, tg, tg->tg_trigtuple, ev->ev_extra2);
}
}
/*
* Check if column should be skipped
*/
bool pgqtriga_skip_col(PgqTriggerEvent *ev, TriggerData *tg, int i, int attkind_idx)
{
TupleDesc tupdesc;
const char *name;
if (ev->attkind) {
if (attkind_idx >= ev->attkind_len)
return true;
return ev->attkind[attkind_idx] == 'i';
} else if (ev->ignore_list) {
tupdesc = tg->tg_relation->rd_att;
if (tupdesc->attrs[i]->attisdropped)
return true;
name = NameStr(tupdesc->attrs[i]->attname);
return pgq_strlist_contains(ev->ignore_list, name);
}
return false;
}
/*
* Check if column is pkey.
*/
bool pgqtriga_is_pkey(PgqTriggerEvent *ev, TriggerData *tg, int i, int attkind_idx)
{
TupleDesc tupdesc;
const char *name;
if (ev->attkind) {
if (attkind_idx >= ev->attkind_len)
return false;
return ev->attkind[attkind_idx] == 'k';
} else if (ev->pkey_list) {
tupdesc = tg->tg_relation->rd_att;
if (tupdesc->attrs[i]->attisdropped)
return false;
name = NameStr(tupdesc->attrs[i]->attname);
return pgq_strlist_contains(ev->pkey_list, name);
}
return false;
}
/*
* Check if trigger action should be skipped.
*/
bool pgq_is_logging_disabled(void)
{
#if defined(PG_VERSION_NUM) && PG_VERSION_NUM >= 80300
if (SessionReplicationRole != SESSION_REPLICATION_ROLE_ORIGIN)
return true;
#endif
return false;
}
|