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
|
/****************************************************************
* *
* Copyright (c) 2001-2017 Fidelity National Information *
* Services, Inc. and/or its subsidiaries. All rights reserved. *
* *
* This source code contains the intellectual property *
* of its copyright holder(s), and is made available *
* under a license. If you do not know the terms of *
* the license, please stop and do not read further. *
* *
****************************************************************/
#include "mdef.h"
#include "gtm_inet.h"
#include "gtm_fcntl.h"
#include "gtm_unistd.h"
#include <sys/sem.h>
#include <sys/mman.h>
#include <errno.h>
#include "gdsroot.h"
#include "gdsblk.h"
#include "gtm_facility.h"
#include "fileinfo.h"
#include "gdsbt.h"
#include "gdsfhead.h"
#include "filestruct.h"
#include "jnl.h"
#include "repl_msg.h"
#include "gtmsource.h"
#include "gtmrecv.h"
#include "iosp.h"
#include "gtm_stdio.h"
#include "gtmio.h"
#include "gtm_string.h"
#include "repl_instance.h"
#include "gtm_logicals.h"
#include "gtm_c_stack_trace.h"
#include "eintr_wrappers.h"
#include "eintr_wrapper_semop.h"
#include "do_semop.h"
#include "ipcrmid.h"
#include "ftok_sems.h"
#include "repl_sem.h"
/* In the present shape, this module is not generic enough. Coded with the view of bringing SEM related code out of
replication module. Could be made more generic.
Handles two semaphore sets one for source and another for receiver server.
FTOK related semaphore for replication is also added here.
*/
GBLREF boolean_t holds_sem[NUM_SEM_SETS][NUM_SRC_SEMS];
static struct sembuf sop[5];
static int sem_set_id[NUM_SEM_SETS] = {0, 0};
static int sem_info_id_map[SEM_NUM_INFOS] = { GETVAL, GETPID };
boolean_t sem_set_exists(int which_set)
{
return(sem_set_id[which_set] > 0);
}
int init_sem_set_source(sem_key_t key, int nsems, permissions_t sem_flags)
{
assert(IPC_PRIVATE == (key_t)key);
assert(SIZEOF(key_t) >= SIZEOF(sem_key_t));
sem_set_id[SOURCE] = semget(key, nsems, sem_flags);
holds_sem[SOURCE][JNL_POOL_ACCESS_SEM] = FALSE;
holds_sem[SOURCE][SRC_SERV_COUNT_SEM] = FALSE;
return sem_set_id[SOURCE];
}
void set_sem_set_src(int semid)
{
sem_set_id[SOURCE] = semid;
holds_sem[SOURCE][JNL_POOL_ACCESS_SEM] = FALSE;
holds_sem[SOURCE][SRC_SERV_COUNT_SEM] = FALSE;
}
int init_sem_set_recvr(sem_key_t key, int nsems, permissions_t sem_flags)
{
int semid;
assert(IPC_PRIVATE == (key_t)key);
assert(SIZEOF(key_t) >= SIZEOF(sem_key_t));
semid = semget(key, nsems, sem_flags);
set_sem_set_recvr(semid);
return sem_set_id[RECV];
}
void set_sem_set_recvr(int semid)
{
sem_set_id[RECV] = semid;
holds_sem[RECV][RECV_POOL_ACCESS_SEM] = FALSE;
holds_sem[RECV][RECV_SERV_COUNT_SEM] = FALSE;
holds_sem[RECV][UPD_PROC_COUNT_SEM] = FALSE;
holds_sem[RECV][RECV_SERV_OPTIONS_SEM] = FALSE;
}
int grab_sem(int set_index, int sem_num)
{
int rc;
assert((int)NUM_SRC_SEMS == (int)NUM_RECV_SEMS); /* holds_sem[][] relies on this as it uses NUM_SRC_SEMS for array bounds */
assert(!holds_sem[set_index][sem_num]);
ASSERT_SET_INDEX;
sop[0].sem_op = 0; /* Wait for 0 */
sop[0].sem_num = sem_num;
sop[1].sem_op = 1; /* lock it */
sop[1].sem_num = sem_num;
sop[0].sem_flg = sop[1].sem_flg = SEM_UNDO;
SEMOP(sem_set_id[set_index], sop, 2, rc, FORCED_WAIT);
if (0 == rc)
holds_sem[set_index][sem_num] = TRUE;
return rc;
}
int incr_sem(int set_index, int sem_num)
{
int rc;
ASSERT_SET_INDEX;
sop[0].sem_op = 1; /* Increment it */
sop[0].sem_num = sem_num;
sop[0].sem_flg = SEM_UNDO;
SEMOP(sem_set_id[set_index], sop, 1, rc, NO_WAIT);
if (0 == rc)
{
/* decr_sem internally calls rel_sem directly which expects that the entry for hold_sem[SOURCE][SRC_SERV_COUNT_SEM]
* is set to TRUE. But, incr_sem doesn't set this entry. This causes decr_sem (done below) to assert fail. to avoid
* the assert, set the hold_sem array to TRUE even if this is an increment operation
*/
holds_sem[set_index][sem_num] = TRUE;
}
return rc;
}
int grab_sem_all_source()
{
int rc;
assert(!holds_sem[SOURCE][JNL_POOL_ACCESS_SEM]);
sop[0].sem_op = 0; /* Wait for 0 */
sop[0].sem_num = JNL_POOL_ACCESS_SEM;
sop[1].sem_op = 1; /* Increment it */
sop[1].sem_num = JNL_POOL_ACCESS_SEM;
sop[2].sem_op = 1; /* Increment it */
sop[2].sem_num = SRC_SERV_COUNT_SEM;
sop[0].sem_flg = sop[1].sem_flg = sop[2].sem_flg = SEM_UNDO;
SEMOP(sem_set_id[SOURCE], sop, 3, rc, FORCED_WAIT);
if (0 == rc)
{
holds_sem[SOURCE][JNL_POOL_ACCESS_SEM] = TRUE;
holds_sem[SOURCE][SRC_SERV_COUNT_SEM] = TRUE;
}
return rc;
}
int grab_sem_all_receive()
{
int rc;
assert(!holds_sem[RECV][RECV_POOL_ACCESS_SEM]);
sop[0].sem_op = 0; /* Wait for 0 */
sop[0].sem_num = RECV_POOL_ACCESS_SEM;
sop[1].sem_op = 1; /* Increment it */
sop[1].sem_num = RECV_POOL_ACCESS_SEM;
sop[2].sem_op = 1; /* Increment it */
sop[2].sem_num = RECV_SERV_COUNT_SEM;
sop[3].sem_op = 1; /* Increment it */
sop[3].sem_num = UPD_PROC_COUNT_SEM;
sop[4].sem_op = 1; /* Increment it */
sop[4].sem_num = RECV_SERV_OPTIONS_SEM;
sop[0].sem_flg = sop[1].sem_flg = sop[2].sem_flg = sop[3].sem_flg = sop[4].sem_flg = SEM_UNDO;
SEMOP(sem_set_id[RECV], sop, 5, rc, FORCED_WAIT);
if (0 == rc)
{
holds_sem[RECV][RECV_POOL_ACCESS_SEM] = TRUE;
holds_sem[RECV][RECV_SERV_COUNT_SEM] = TRUE;
holds_sem[RECV][UPD_PROC_COUNT_SEM] = TRUE;
holds_sem[RECV][RECV_SERV_OPTIONS_SEM] = TRUE;
}
return rc;
}
int grab_sem_immediate(int set_index, int sem_num)
{
int rc;
ASSERT_SET_INDEX;
assert(!holds_sem[set_index][sem_num]);
sop[0].sem_op = 0; /* Wait for 0 */
sop[0].sem_num = sem_num;
sop[1].sem_op = 1; /* Increment it */
sop[1].sem_num = sem_num;
sop[0].sem_flg = sop[1].sem_flg = SEM_UNDO | IPC_NOWAIT;
SEMOP(sem_set_id[set_index], sop, 2, rc, NO_WAIT);
if (0 == rc)
holds_sem[set_index][sem_num] = TRUE;
return rc;
}
int rel_sem(int set_index, int sem_num)
{
int rc;
ASSERT_SET_INDEX;
assert(holds_sem[set_index][sem_num]);
rc = do_semop(sem_set_id[set_index], sem_num, -1, SEM_UNDO);
if (0 == rc)
holds_sem[set_index][sem_num] = FALSE;
return rc;
}
int decr_sem(int set_index, int sem_num)
{
return rel_sem(set_index, sem_num);
}
int rel_sem_immediate(int set_index, int sem_num)
{
int rc;
ASSERT_SET_INDEX;
assert(holds_sem[set_index][sem_num]);
rc = do_semop(sem_set_id[set_index], sem_num, -1, SEM_UNDO | IPC_NOWAIT);
if (0 == rc)
holds_sem[set_index][sem_num] = FALSE;
return rc;
}
int get_sem_info(int set_index, int sem_num, sem_info_type info_id)
/* Cannot be used to get info which require an additional argument. See man semctl */
{
ASSERT_SET_INDEX;
return(semctl(sem_set_id[set_index], sem_num, sem_info_id_map[info_id]));
}
int remove_sem_set(int set_index)
{
int rc, i;
ASSERT_SET_INDEX;
rc = sem_rmid(sem_set_id[set_index]);
if (!rc) /* successful removal of sem set */
{
sem_set_id[set_index] = 0;
for (i = 0; i < NUM_SRC_SEMS; i++)
holds_sem[set_index][i] = FALSE;
}
return rc;
}
|