|
| 1 | +/* ------------------------------------------------------------------------ |
| 2 | + * |
| 3 | + * common.c |
| 4 | + * Common code for ParGRES extension |
| 5 | + * |
| 6 | + * Copyright (c) 2018, Postgres Professional |
| 7 | + * |
| 8 | + * ------------------------------------------------------------------------ |
| 9 | + */ |
| 10 | + |
| 11 | +#include "postgres.h" |
| 12 | + |
| 13 | +#include "access/heapam.h" |
| 14 | +#include "access/htup_details.h" |
| 15 | +#include "access/genam.h" |
| 16 | +#include "access/sysattr.h" |
| 17 | +#include "access/xact.h" |
| 18 | +#include "catalog/indexing.h" |
| 19 | +#include "catalog/pg_extension.h" |
| 20 | +#include "commands/extension.h" |
| 21 | +#include "utils/fmgroids.h" |
| 22 | + |
| 23 | +#include "common.h" |
| 24 | + |
| 25 | + |
| 26 | +/* GUC variables */ |
| 27 | +int node_number; |
| 28 | +int nodes_at_cluster; |
| 29 | +char *pargres_hosts_string = NULL; |
| 30 | +char *pargres_ports_string = NULL; |
| 31 | +int eports_pool_size = 100; |
| 32 | + |
| 33 | +int CoordNode = -1; |
| 34 | +bool PargresInitialized = false; |
| 35 | +PortStack *PORTS; |
| 36 | + |
| 37 | + |
| 38 | +Oid |
| 39 | +get_pargres_schema(void) |
| 40 | +{ |
| 41 | + Oid result; |
| 42 | + Relation rel; |
| 43 | + SysScanDesc scandesc; |
| 44 | + HeapTuple tuple; |
| 45 | + ScanKeyData entry[1]; |
| 46 | + Oid ext_oid; |
| 47 | + |
| 48 | + /* It's impossible to fetch pg_pathman's schema now */ |
| 49 | + if (!IsTransactionState()) |
| 50 | + return InvalidOid; |
| 51 | + |
| 52 | + ext_oid = get_extension_oid("pargres", true); |
| 53 | + if (ext_oid == InvalidOid) |
| 54 | + return InvalidOid; /* exit if pg_pathman does not exist */ |
| 55 | + |
| 56 | + ScanKeyInit(&entry[0], |
| 57 | + ObjectIdAttributeNumber, |
| 58 | + BTEqualStrategyNumber, F_OIDEQ, |
| 59 | + ObjectIdGetDatum(ext_oid)); |
| 60 | + |
| 61 | + rel = heap_open(ExtensionRelationId, AccessShareLock); |
| 62 | + scandesc = systable_beginscan(rel, ExtensionOidIndexId, true, |
| 63 | + NULL, 1, entry); |
| 64 | + |
| 65 | + tuple = systable_getnext(scandesc); |
| 66 | + |
| 67 | + /* We assume that there can be at most one matching tuple */ |
| 68 | + if (HeapTupleIsValid(tuple)) |
| 69 | + result = ((Form_pg_extension) GETSTRUCT(tuple))->extnamespace; |
| 70 | + else |
| 71 | + result = InvalidOid; |
| 72 | + |
| 73 | + systable_endscan(scandesc); |
| 74 | + |
| 75 | + heap_close(rel, AccessShareLock); |
| 76 | + |
| 77 | + return result; |
| 78 | +} |
| 79 | + |
| 80 | +void |
| 81 | +STACK_Init(PortStack *stack, int range_min, int size) |
| 82 | +{ |
| 83 | + int i; |
| 84 | + |
| 85 | + LWLockAcquire(&stack->lock, LW_EXCLUSIVE); |
| 86 | + |
| 87 | + stack->size = size; |
| 88 | + stack->index = 0; |
| 89 | + for (i = 0; i < stack->size; i++) |
| 90 | + stack->values[i] = range_min + i; |
| 91 | + |
| 92 | + LWLockRelease(&stack->lock); |
| 93 | +} |
| 94 | + |
| 95 | +int |
| 96 | +STACK_Pop(PortStack *stack) |
| 97 | +{ |
| 98 | + int value; |
| 99 | + |
| 100 | + LWLockAcquire(&stack->lock, LW_EXCLUSIVE); |
| 101 | + |
| 102 | + Assert(stack->index < stack->size); |
| 103 | + value = stack->values[stack->index++]; |
| 104 | + |
| 105 | + LWLockRelease(&stack->lock); |
| 106 | + return value; |
| 107 | +} |
| 108 | + |
| 109 | +void |
| 110 | +STACK_Push(PortStack *stack, int value) |
| 111 | +{ |
| 112 | + LWLockAcquire(&stack->lock, LW_EXCLUSIVE); |
| 113 | + |
| 114 | + Assert(stack->index > 0); |
| 115 | + stack->values[--stack->index] = value; |
| 116 | + |
| 117 | + LWLockRelease(&stack->lock); |
| 118 | +} |
0 commit comments