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
|
/****************************************************************
* *
* Copyright (c) 2016-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. *
* *
****************************************************************/
#ifndef WCS_WT_H_INCLUDED
#define WCS_WT_H_INCLUDED
#define WT_LATCH_TIMEOUT_SEC (4 * 60) /* Define latch timeout as being 4 mins */
#define REINSERT_CR_AT_TAIL(csr, ahead, n, csa, csd, trace_cntr) \
MBSTART { \
n = INSQTI((que_ent_ptr_t)csr, (que_head_ptr_t)ahead); \
if (INTERLOCK_FAIL == n) \
{ \
assert(FALSE); \
SET_TRACEABLE_VAR(cnl->wc_blocked, TRUE); \
BG_TRACE_PRO_ANY(csa, trace_cntr); \
} \
} MBEND
#define BREAK_TWIN(CSR, CSA) \
MBSTART { \
cache_rec_ptr_t cr_new; \
\
assert((CSR)->twin && (CSA)->now_crit); /* We need crit to break twin connections. */ \
assert(!(CSR)->bt_index); /* It has to be an OLDER twin. It cannot be a NEWER twin because \
* as long as the OLDER twin exists in the WIP queue, the NEWER \
* twin write would not have been issued by "wcs_wtstart". \
*/ \
assert(!(CSR)->in_cw_set); /* no other process should be needing this buffer */ \
cr_new = (cache_rec_ptr_t)GDS_ANY_REL2ABS((CSA), (CSR)->twin); /* Get NEWER twin cr */ \
assert((void *)&((cache_rec_ptr_t)GDS_ANY_REL2ABS((CSA), cr_new->twin))->state_que == (void *)(CSR)); \
assert(cr_new->dirty); /* NEWER twin should be in ACTIVE queue */ \
(CSR)->cycle++; /* increment cycle whenever blk number changes (tp_hist needs it) */ \
(CSR)->blk = CR_BLKEMPTY; \
assert(CR_BLKEMPTY != cr_new->blk); /* NEWER twin should have a valid block number */ \
cr_new->twin = (CSR)->twin = 0; /* Break the twin link */ \
cr_new->backup_cr_is_twin = FALSE; \
} MBEND
/* "wcs_wtfini" is called with a second parameter which indicates whether it has to do "is_proc_alive" check or not.
* In places where we know for sure we do not need this check, we pass FALSE. In places where we would benefit from a check
* we pass TRUE but since "wcs_wtfini" is usually called in a "wcs_sleep" loop using "lcnt" variable iterating from 1 to
* SLEEP_ONE_MIN/BUF_OWNER_STUCK, we want to limit the heavyweight nature of the "is_proc_alive" check by doing it only
* 32 times for every SLEEP_ONE_MIN iterations of the loop. Hence the MAX/32 calculation below. This approximates to
* doing the system call once every 2 seconds.
*/
#define CHECK_IS_PROC_ALIVE_FALSE FALSE
#define CHECK_IS_PROC_ALIVE_TRUE TRUE
#define CHECK_IS_PROC_ALIVE_TRUE_OR_FALSE(lcnt, MAX) (0 == (lcnt % (MAX/32)))
#ifdef DEBUG
enum dbg_wtfini_lcnt_t {
dbg_wtfini_db_csh_getn = 32768, /* a value greater than SLEEP_ONE_MIN (= 6000) and UNIX_GETSPACEWAIT (= 12000)
* to distinguish this from other "lcnt".
*/
dbg_wtfini_wcs_recover = 32769,
dbg_wtfini_wcs_get_space1 = 32770,
dbg_wtfini_wcs_get_space2 = 32771,
dbg_wtfini_wcs_wtstart = 32772
};
GBLREF enum dbg_wtfini_lcnt_t dbg_wtfini_lcnt; /* "lcnt" value for WCS_OPS_TRACE tracking purposes */
#endif
typedef struct wtstart_cr_list_struct
{
int numcrs;
int listsize; /* number of items allocated for listcrs[] */
cache_rec_ptr_t *listcrs;
} wtstart_cr_list_t;
int wcs_wt_restart(unix_db_info *udi, cache_state_rec_ptr_t csr);
int wcs_wtfini(gd_region *reg, boolean_t do_is_proc_alive_check, cache_rec_ptr_t cr2flush);
void wcs_wtfini_nocrit(gd_region *reg, wtstart_cr_list_t *cr_list_ptr);
void wcs_wterror(gd_region *reg, int4 save_errno);
int4 wcs_wtstart(gd_region *region, int4 writes, wtstart_cr_list_t *cr_list_ptr, cache_rec_ptr_t cr2flush);
int wcs_wtstart_fini(gd_region *region, int nbuffs, cache_rec_ptr_t cr2flush);
#endif
|
