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
|
/****************************************************************
* *
* Copyright (c) 2001-2019 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 "mlkdef.h"
#include "mmemory.h"
#include "is_proc_alive.h"
#include "mlk_shrblk_find.h"
#include "mlk_shrblk_create.h"
#include "gdsroot.h"
#include "gtm_facility.h"
#include "fileinfo.h"
#include "gdsbt.h"
#include "gdsfhead.h"
#include "mlk_wake_pending.h"
GBLREF uint4 process_id;
boolean_t mlk_find_blocking_child_lock(mlk_pvtblk *p, mlk_shrblk_ptr_t child, UINTPTR_T auxown);
boolean_t mlk_find_blocking_child_lock(mlk_pvtblk *p, mlk_shrblk_ptr_t child, UINTPTR_T auxown)
{
mlk_shrblk_ptr_t d, dhead, d1;
boolean_t blocked;
blocked = FALSE;
for (dhead = d = child, d1 = NULL ; dhead != d1 && !blocked ; d = d1 = (mlk_shrblk_ptr_t)R2A(d->rsib))
{
/* There is similar code below to check if the process that owns the lock still exists.
* Any change in this part of the code should be propogated to those segments too.
*/
if (d->owner && (d->owner != process_id || d->auxowner != auxown))
{ /* If owned and not owned by us check if owner is alive */
if (is_proc_alive(d->owner, IMAGECNT(d->image_count)))
{ /* Signal that this lock request is blocked by this node */
p->blocked = d;
p->blk_sequence = d->sequence;
blocked = TRUE;
} else
{ /* Owner is dead so release this node */
d->owner = 0;
d->auxowner = 0;
}
}
if (!blocked && d->children)
{
CHECK_SHRBLKPTR(d->children, p->pvtctl);
blocked = mlk_find_blocking_child_lock(p, (mlk_shrblk_ptr_t)R2A(d->children), auxown);
}
}
return blocked;
}
mlk_shrblk_ptr_t mlk_shrhash_find(mlk_pvtblk *p, int subnum, unsigned char *subval, unsigned char sublen, mlk_shrblk_ptr_t parent);
/**
* Searches the shrblk's for the shrblk belonging to the given pvtblk; if it doesn't find it, it creates it
*
* @param [in] p private block which contains the lock name
* @param [out] ret will contain the address of shrblk for the last subscript of the given lock
* @param [in] auxown who this lock is being requested on behalf of
* @returns 0 if success, or 1 if we are blocked from getting that lock for some reason
*/
boolean_t mlk_shrblk_find(mlk_pvtblk *p, mlk_shrblk_ptr_t *ret, UINTPTR_T auxown)
{
boolean_t blocked;
int i, j, slen;
mlk_ctldata_ptr_t ctl;
mlk_ctldata ctl_bak;
mlk_prcblk_ptr_t pr;
mlk_shrblk_ptr_t pnt, d, d0, d1, dhead;
mlk_shrsub_ptr_t dsub;
ptroff_t *chld_of_pnt;
unsigned char *cp;
uint4 yield_pid;
mlk_shrblk_ptr_t dh;
DCL_THREADGBL_ACCESS;
blocked = FALSE;
/* Note: If ever this function returns with "blocked" set to "TRUE",
* make sure TREF(mlk_yield_pid) is initialized appropriately.
*/
*ret = 0;
SETUP_THREADGBL_ACCESS;
MLK_PVTBLK_SUBHASH_SYNC(p);
for (pnt = NULL , chld_of_pnt = (ptroff_t *)&p->pvtctl.ctl->blkroot , i = p->subscript_cnt , cp = p->value ;
i > 0 ; i-- , pnt = d , chld_of_pnt = (ptroff_t *)&d->children, cp += slen)
{
slen = *cp++;
if (!*chld_of_pnt)
{
assert(NULL == mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt));
if (!(d = mlk_shrblk_create(p, cp, slen, pnt, chld_of_pnt, i)))
{
assert(NULL == mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt));
CHECK_SHRBLKPTR(p->pvtctl.ctl->blkroot, p->pvtctl);
return TRUE;
}
assert((dh = mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt)) == d);
assert(d->value != 0);
A2R(d->lsib, d);
CHECK_SHRBLKPTR(d->lsib, p->pvtctl);
A2R(d->rsib, d);
CHECK_SHRBLKPTR(d->rsib, p->pvtctl);
CHECK_SHRBLKPTR(p->pvtctl.ctl->blkroot, p->pvtctl);
} else
{
d = mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt);
if (NULL != d)
{ /* We found the right node */
assertpro(d->rsib != 0);
if (d->owner)
{
if (d->owner != process_id || d->auxowner != auxown)
{ /* If owned and not owned by us check if owner is alive */
if (is_proc_alive(d->owner, IMAGECNT(d->image_count)))
{ /* Signal that this lock request is blocked by this node */
p->blocked = d;
p->blk_sequence = d->sequence;
TREF(mlk_yield_pid) = 0;
blocked = TRUE;
} else
{ /* Owner is dead so release this node */
d->owner = 0;
d->auxowner = 0;
}
}
} else if ((MLK_FAIRNESS_DISABLED != TREF(mlk_yield_pid)) && d->pending)
{ /* If not owned by us, but there is another process waiting for it at the start of
* the wait queue, then yield to it once. If we find the same process at the start
* of the wait queue again, then dont yield anymore to avoid starvation. If we find
* a different pid though, note it down and give it a fresh new chance. Since
* additions to the wait queue happen at the end, we will eventually get our turn
* this way (won't starve). Fairness algorithm will not kick in if it is disabled
* which is indicated by setting TREF(mlk_yield_pid) to MLK_FAIRNESS_DISABLED.
*/
pr = (mlk_prcblk_ptr_t)R2A(d->pending);
yield_pid = TREF(mlk_yield_pid);
assert(yield_pid != process_id);
assert(pr->process_id);
if ((pr->process_id != yield_pid) && (process_id != pr->process_id))
{
p->blocked = d;
p->blk_sequence = d->sequence;
TREF(mlk_yield_pid) = pr->process_id;
blocked = TRUE;
/* Give the first waiting process a nudge to wake up */
ctl = p->pvtctl.ctl;
mlk_wake_pending(&p->pvtctl, d);
}
}
} else
{ /* Add a new shrblk node to the end of the list */
assert(*chld_of_pnt != 0);
CHECK_SHRBLKPTR(*chld_of_pnt, p->pvtctl);
d = (mlk_shrblk_ptr_t)R2A(*chld_of_pnt);
assertpro(d->lsib);
assertpro(d->lsib != INVALID_LSIB_MARKER);
d0 = d;
d1 = (mlk_shrblk_ptr_t)R2A(d->lsib);
if (!(d = mlk_shrblk_create(p, cp, slen, pnt, NULL, i)))
{
assert(NULL == mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt));
return TRUE; /* resource starve -- no room for new shrblk */
}
assert((dh = mlk_shrhash_find(p, p->subscript_cnt - i, cp, slen, pnt)) == d);
A2R(d->rsib, d0);
CHECK_SHRBLKPTR(d->rsib, p->pvtctl);
d->lsib = 0;
if (d1)
A2R(d->lsib, d1);
CHECK_SHRBLKPTR(d->lsib, p->pvtctl);
A2R(d0->lsib, d);
CHECK_SHRBLKPTR(d0->lsib, p->pvtctl);
if (d1)
A2R(d1->rsib, d);
CHECK_SHRBLKPTR(d1->rsib, p->pvtctl);
}
}
/* When we get to the last "subscript", it's node is our lock target */
if (i == 1)
*ret = d;
}
if (*chld_of_pnt && !blocked)
{ /* look at the subtree owners to see if we will be blocked by someone underneath */
blocked = mlk_find_blocking_child_lock(p, (mlk_shrblk_ptr_t)R2A(*chld_of_pnt), auxown);
TREF(mlk_yield_pid) = 0; /* clear this just in case "blocked" came back as TRUE */
}
/* We successfully got shrblks/shrhashes for all nodes of the lock, so clear its fail count. */
p->pvtctl.hash_fail_cnt = 0;
return blocked;
}
mlk_shrblk_ptr_t mlk_shrhash_find(mlk_pvtblk *p, int subnum, unsigned char *subval, unsigned char sublen, mlk_shrblk_ptr_t parent)
{
mlk_shrblk_ptr_t res = NULL, search_shrblk;
mlk_shrsub_ptr_t search_sub;
int bi, si;
uint4 hash, num_buckets;
mlk_shrhash_map_t usedmap;
mlk_shrhash_ptr_t shrhash, bucket, search_bucket;
assert(LOCK_CRIT_HELD(p->pvtctl.csa));
shrhash = p->pvtctl.shrhash;
num_buckets = p->pvtctl.shrhash_size;
assert(p->hash_seed == p->pvtctl.ctl->hash_seed);
hash = MLK_PVTBLK_SUBHASH(p, subnum);
bi = hash % num_buckets;
bucket = &shrhash[bi];
usedmap = bucket->usedmap;
for (si = bi ; 0 != usedmap ; (si = (si + 1) % num_buckets), (usedmap >>= 1))
{
if (0 == (usedmap & 1U))
continue;
search_bucket = &shrhash[si];
if (search_bucket->hash != hash)
continue;
assert(0 != search_bucket->shrblk_idx);
search_shrblk = MLK_SHRHASH_SHRBLK(p->pvtctl, search_bucket);
/* if the parents don't match (either both null, or one null and the other not, or both non-null but
* non-matching then we continue
*/
if (!((NULL == parent) && (0 == search_shrblk->parent))
&& ((0 == search_shrblk->parent) || ((mlk_shrblk_ptr_t)R2A(search_shrblk->parent) != parent)))
continue;
search_sub = (mlk_shrsub_ptr_t)R2A(search_shrblk->value);
if (0 != memvcmp(subval, sublen, search_sub->data, search_sub->length))
continue;
res = search_shrblk;
assert(hash == res->hash);
break;
}
return res;
}
|