//-------------------------------------------------------------------------
// Desc: Class for displaying an file hash table in HTML on a web page.
// Tabs: 3
//
// Copyright (c) 2001-2003,2005-2006 Novell, Inc. All Rights Reserved.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of version 2 of the GNU General Public
// License as published by the Free Software Foundation.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, contact Novell, Inc.
//
// To contact Novell about this file by physical or electronic mail,
// you may find current contact information at www.novell.com
//
// $Id: imonfhsh.cpp 12329 2006-01-20 17:49:30 -0700 (Fri, 20 Jan 2006) ahodgkinson $
//-------------------------------------------------------------------------
#include "flaimsys.h"
/****************************************************************************
Desc: This function implements the display method of the F_FileHashTblPage
class.
*****************************************************************************/
RCODE F_FileHashTblPage::display(
FLMUINT uiNumParams,
const char ** ppszParams)
{
RCODE rc = FERR_OK;
FLMINT iIndex;
FLMINT iSindex;
FLMINT iNindex;
FLMBOOL found = FALSE;
FBUCKET_p pFileHashTbl;
FLMBOOL buckets[FILE_HASH_ENTRIES];
FLMINT next[FILE_HASH_ENTRIES];
FLMBOOL bRefresh;
stdHdr();
fnPrintf( m_pHRequest, HTML_DOCTYPE);
fnPrintf( m_pHRequest, "\n");
// Determine if we are being requested to refresh this page or not.
if ((bRefresh = DetectParameter( uiNumParams,
ppszParams,
"Refresh")) == TRUE)
{
fnPrintf(
m_pHRequest,
""
""
"gv_FlmSysData.pFileHashTbl\n",
m_pszURLString);
}
else
{
fnPrintf(
m_pHRequest,
"gv_FlmSysData.pFileHashTbl\n");
}
printStyle();
fnPrintf( m_pHRequest, "\n");
// Insert a new table into the page to display the gv_FlmSysData fields
fnPrintf( m_pHRequest, "\n");
printTableStart( "File Hash Table", 1, 100);
printTableEnd();
if (gv_FlmSysData.pFileHashTbl == NULL)
{
fnPrintf( m_pHRequest, "No File Hash Table entries exist. "
"Please ensure that a database has been opened."
"\n");
}
else
{
for (pFileHashTbl = gv_FlmSysData.pFileHashTbl, iIndex=0;
iIndex < FILE_HASH_ENTRIES;
iIndex++)
{
buckets[iIndex] = (pFileHashTbl[iIndex].pFirstInBucket) ?
TRUE : FALSE;
}
for (iIndex=0; iIndex < FILE_HASH_ENTRIES; iIndex++)
{
if (buckets[iIndex])
{
// We need to look for a next valid index to match with this one
// for when the "Next Bucket" button is pressed.
for (iNindex = (iIndex+1 < FILE_HASH_ENTRIES ? iIndex+1 : 0);
iNindex != iIndex ; )
{
if (buckets[iNindex])
{
break;
}
else
{
iNindex = (iNindex+1 < FILE_HASH_ENTRIES ? iNindex+1 : 0);
}
}
// We will either have a valid next iIndex, or we will be pointing
// to the same index, which means there is only one valid index
// altogether. So that is okay too.
next[iIndex] = iNindex;
}
}
// Let's check to make sure we actually got at least one valid index.
for (iIndex = 0; iIndex < FILE_HASH_ENTRIES; iIndex++)
{
if (buckets[iIndex])
{
found = TRUE;
break;
}
}
if (!found)
{
fnPrintf( m_pHRequest, "No File Hash Table entries exist. "
"Please ensure that a database has been opened."
"\n");
}
else
{
fnPrintf( m_pHRequest, "\n");
// Prepare the javascript functions...
fnPrintf( m_pHRequest, "\n");
}
}
fnPrintf( m_pHRequest, "\n");
fnEmit();
return( rc);
}