/****************************************************************
 *								*
 *	Copyright 2001, 2013 Fidelity Information Services, Inc	*
 *								*
 *	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 "gdsroot.h"
#include "gtm_facility.h"
#include "fileinfo.h"
#include "gdsbt.h"
#include "gdsblk.h"
#include "gdsfhead.h"
#include "gdscc.h"
#include "gdsbml.h"
#include "probe.h"
#include "sec_shr_map_build.h"
#include "min_max.h"

int sec_shr_map_build(sgmnt_addrs *csa, uint4 *array, unsigned char *base_addr, cw_set_element *cs, trans_num ctn, int bplmap)
{
	uint4			setbit;
	unsigned char		*ptr;
	uint4			bitnum, ret, prev;
#ifdef UNIX
	uint4			(*bml_func)();
#else	/* gtmsecshr on VMS uses a very minimal set of modules so we dont want to pull in bml_*() functions there
	 * and hence avoid using function pointers
	 */
	uint4			bml_func;
	uint4			bml_busy = 1, bml_free = 2, bml_recycled = 3;
#endif
#ifdef DEBUG
	int4			prev_bitnum, actual_cnt = 0;
#endif

	assert(csa->now_crit || (ctn < csa->hdr->trans_hist.curr_tn));
	assert(!csa->now_crit || (ctn == csa->hdr->trans_hist.curr_tn));
	((blk_hdr *)base_addr)->tn = ctn;
	base_addr += SIZEOF(blk_hdr);
	if (!GTM_PROBE(bplmap / 8, base_addr, WRITE))
	{
		assert(FALSE);
		return FALSE;
	}
	/* The following PROBE's are needed before DETERMINE_BML_FUNC, as the macro uses these pointers. */
	if (!GTM_PROBE(SIZEOF(sgmnt_addrs), csa, READ))
	{
		assert(FALSE);
		return FALSE;
	}
	if (!(GTM_PROBE(NODE_LOCAL_SIZE_DBS, csa->nl, WRITE)))
	{
		assert(FALSE);
		return FALSE;
	}
	if (!GTM_PROBE(SIZEOF(sgmnt_data), csa->hdr, READ))
	{
		assert(FALSE);
		return FALSE;
	}
	DETERMINE_BML_FUNC(bml_func, cs, csa);
	DEBUG_ONLY(prev_bitnum = -1;)
	for (;;)
	{
		if (!GTM_PROBE(SIZEOF(*array), array, READ))
		{
			assert(FALSE);
			return FALSE;
		}
		bitnum = *array;
		assert((uint4)bitnum < csa->hdr->bplmap);	/* check that bitnum is positive and within 0 to bplmap */
		if (0 == bitnum)
		{
			assert(actual_cnt == cs->reference_cnt);
			return TRUE;
		}
		assert((int4)bitnum > prev_bitnum);	/* assert that blocks are sorted in the update array */
		DEBUG_ONLY(prev_bitnum = (int4)bitnum);
		setbit = bitnum * BML_BITS_PER_BLK;
		ptr = base_addr + setbit / 8;
		if (!GTM_PROBE(SIZEOF(*ptr), ptr, WRITE))
		{
			assert(FALSE);
			return FALSE;
		}
		setbit &= 7;
		if (bml_busy == bml_func)
		{
			*ptr &= ~(3 << setbit);	/* mark block as BUSY (00) */
			DEBUG_ONLY(actual_cnt++);
		} else
		{
			DEBUG_ONLY(
				prev = ((*ptr >> setbit) & 1);	/* prev is 0 is block WAS busy and 0 otherwise */
				if (!prev)
					actual_cnt--;
			)
			if (bml_recycled == bml_func)
				*ptr |= (3 << setbit);	/* mark block as RECYCLED (11) */
			else
			{	/* mark block as FREE (01) */
				*ptr &= ~(3 << setbit);	/* first mark block as BUSY (00) */
				*ptr |= (1 << setbit);	/* then  mark block as FREE (01) */
			}
		}
		++array;
	}
}