135 lines
3.9 KiB
C
135 lines
3.9 KiB
C
/****************************************************************
|
|
* *
|
|
* Copyright 2001, 2009 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. *
|
|
* *
|
|
****************************************************************/
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* MODULE NAME: PATCH_M_REST
|
|
*
|
|
* CALLING SEQUENCE: void dse_m_rest (blk, bml_list, bml_size)
|
|
* block_id blk;
|
|
* unsigned char *bml_list;
|
|
* int4 bml_size;
|
|
*
|
|
* DESCRIPTION: This is a recursive routine kicked off by PATCH_MAPS
|
|
* in the RESTORE_ALL function. It reconstructs a
|
|
* a local copy of all the local bit maps.
|
|
*
|
|
* HISTORY:
|
|
*
|
|
*******************************************************************************/
|
|
|
|
#include "mdef.h"
|
|
|
|
#include "gtm_string.h"
|
|
|
|
#include "gdsroot.h"
|
|
#include "gtm_facility.h"
|
|
#include "fileinfo.h"
|
|
#include "gdsbt.h"
|
|
#include "gdsfhead.h"
|
|
#include "gdsblk.h"
|
|
#include "copy.h"
|
|
#include "util.h"
|
|
#include "gdsbml.h"
|
|
#include "dse.h"
|
|
|
|
/* Include prototypes */
|
|
#include "t_qread.h"
|
|
|
|
GBLREF sgmnt_addrs *cs_addrs;
|
|
|
|
#define MAX_UTIL_LEN 64
|
|
|
|
void dse_m_rest (
|
|
block_id blk, /* block number */
|
|
unsigned char *bml_list, /* start of local list of local bit maps */
|
|
int4 bml_size, /* size of each entry in *bml_list */
|
|
sm_vuint_ptr_t blks_ptr, /* total free blocks */
|
|
bool in_dir_tree)
|
|
{
|
|
sm_uc_ptr_t bp, b_top, rp, r_top, bml_ptr, np, ptr;
|
|
unsigned char util_buff[MAX_UTIL_LEN];
|
|
block_id next;
|
|
int util_len;
|
|
int4 dummy_int;
|
|
cache_rec_ptr_t dummy_cr;
|
|
int4 bml_index;
|
|
short level, rsize;
|
|
int4 bplmap;
|
|
error_def(ERR_DSEBLKRDFAIL);
|
|
if(!(bp = t_qread (blk, &dummy_int, &dummy_cr)))
|
|
rts_error(VARLSTCNT(1) ERR_DSEBLKRDFAIL);
|
|
if (((blk_hdr_ptr_t) bp)->bsiz > cs_addrs->hdr->blk_size)
|
|
b_top = bp + cs_addrs->hdr->blk_size;
|
|
else if (((blk_hdr_ptr_t) bp)->bsiz < SIZEOF(blk_hdr))
|
|
b_top = bp + SIZEOF(blk_hdr);
|
|
else
|
|
b_top = bp + ((blk_hdr_ptr_t) bp)->bsiz;
|
|
|
|
level = ((blk_hdr_ptr_t)bp)->levl;
|
|
bplmap = cs_addrs->hdr->bplmap;
|
|
|
|
for (rp = bp + SIZEOF(blk_hdr); rp < b_top ;rp = r_top)
|
|
{ if (in_dir_tree || level > 1) /* reread block because it may have been flushed from read */
|
|
{ if (!(np = t_qread(blk,&dummy_int,&dummy_cr))) /* cache due to LRU buffer scheme and reads in recursive */
|
|
rts_error(VARLSTCNT(1) ERR_DSEBLKRDFAIL); /* calls to dse_m_rest. */
|
|
if (np != bp)
|
|
{ b_top = np + (b_top - bp);
|
|
rp = np + (rp - bp);
|
|
r_top = np + (r_top - bp);
|
|
bp = np;
|
|
}
|
|
}
|
|
GET_SHORT(rsize,&((rec_hdr_ptr_t)rp)->rsiz);
|
|
r_top = rp + rsize;
|
|
if (r_top > b_top)
|
|
r_top = b_top;
|
|
if (r_top - rp < (SIZEOF(rec_hdr) + SIZEOF(block_id)))
|
|
break;
|
|
if (in_dir_tree && level == 0)
|
|
{
|
|
for (ptr = rp + SIZEOF(rec_hdr); ; )
|
|
{
|
|
if (*ptr++ == 0 && *ptr++ == 0)
|
|
break;
|
|
}
|
|
GET_LONG(next,ptr);
|
|
}
|
|
else
|
|
GET_LONG(next,r_top - SIZEOF(block_id));
|
|
if (next < 0 || next >= cs_addrs->ti->total_blks ||
|
|
(next / bplmap * bplmap == next))
|
|
{ memcpy(util_buff,"Invalid pointer in block ",25);
|
|
util_len = 25;
|
|
util_len += i2hex_nofill(blk, &util_buff[util_len], 8);
|
|
memcpy(&util_buff[util_len], " record offset ",15);
|
|
util_len += 15;
|
|
util_len += i2hex_nofill((int)(rp - bp), &util_buff[util_len], 4);
|
|
util_buff[util_len] = 0;
|
|
util_out_print((char*)util_buff,TRUE);
|
|
continue;
|
|
}
|
|
bml_index = next / bplmap;
|
|
bml_ptr = bml_list + bml_index * bml_size;
|
|
if (bml_busy(next - next / bplmap * bplmap, bml_ptr + SIZEOF(blk_hdr)))
|
|
{ *blks_ptr = *blks_ptr - 1;
|
|
if (((blk_hdr_ptr_t) bp)->levl > 1)
|
|
{ dse_m_rest (next, bml_list, bml_size, blks_ptr, in_dir_tree);
|
|
}
|
|
else if (in_dir_tree)
|
|
{ assert(((blk_hdr_ptr_t) bp)->levl == 0 || ((blk_hdr_ptr_t) bp)->levl == 1);
|
|
dse_m_rest (next, bml_list, bml_size, blks_ptr, ((blk_hdr_ptr_t)bp)->levl);
|
|
}
|
|
}
|
|
}
|
|
return;
|
|
}
|