2014-03-11 09:38 UTC+0100 Przemyslaw Czerpak (druzus/at/poczta.onet.pl)
* include/hbdbsort.h
* include/hbrddcdx.h
* include/hbrddnsx.h
* include/hbrddntx.h
* include/hbsxfunc.h
* src/rdd/dbfcdx/dbfcdx1.c
* src/rdd/dbffpt/dbffpt1.c
* src/rdd/dbfnsx/dbfnsx1.c
* src/rdd/dbfntx/dbfntx1.c
* src/rdd/dbsql.c
* src/rdd/hbdbsort.c
* src/rdd/hbsix/sxcompr.c
* src/rdd/hbsix/sxsem.c
* changed hb_fs*() API to hb_file*() API
This commit is contained in:
@@ -61,7 +61,7 @@ HB_EXTERN_BEGIN
|
||||
|
||||
typedef struct _DBQUICKSORT
|
||||
{
|
||||
HB_FHANDLE hFile;
|
||||
PHB_FILE pFile;
|
||||
char szTempName[ HB_PATH_MAX ];
|
||||
HB_BYTE * pBuffer;
|
||||
HB_BYTE * pSwapBufferA;
|
||||
|
||||
@@ -419,30 +419,30 @@ typedef CDXSWAPPAGE * LPCDXSWAPPAGE;
|
||||
|
||||
typedef struct
|
||||
{
|
||||
LPCDXTAG pTag; /* current Tag */
|
||||
HB_FHANDLE hTempFile; /* handle to temporary file */
|
||||
char * szTempFileName; /* temporary file name */
|
||||
int keyLen; /* key length */
|
||||
HB_BYTE bTrl; /* filler char for shorter keys */
|
||||
HB_BOOL fUnique; /* HB_TRUE if index is unique */
|
||||
HB_BOOL fReindex; /* HB_TRUE if reindexing is in process */
|
||||
HB_ULONG ulMaxRec; /* the highest record number */
|
||||
HB_ULONG ulTotKeys; /* total number of keys indexed */
|
||||
HB_ULONG ulKeys; /* keys in curently created page */
|
||||
HB_ULONG ulPages; /* number of pages */
|
||||
HB_ULONG ulCurPage; /* current page */
|
||||
HB_ULONG ulPgKeys; /* maximum number of key in page memory buffer */
|
||||
HB_ULONG ulMaxKey; /* maximum number of keys in single page */
|
||||
HB_BYTE * pKeyPool; /* memory buffer for current page then for pages */
|
||||
LPCDXSWAPPAGE pSwapPage; /* list of pages */
|
||||
LPCDXPAGE NodeList[ CDX_STACKSIZE ]; /* Stack of pages */
|
||||
LPCDXTAG pTag; /* current Tag */
|
||||
PHB_FILE pTempFile; /* handle to temporary file */
|
||||
char * szTempFileName; /* temporary file name */
|
||||
int keyLen; /* key length */
|
||||
HB_BYTE bTrl; /* filler char for shorter keys */
|
||||
HB_BOOL fUnique; /* HB_TRUE if index is unique */
|
||||
HB_BOOL fReindex; /* HB_TRUE if reindexing is in process */
|
||||
HB_ULONG ulMaxRec; /* the highest record number */
|
||||
HB_ULONG ulTotKeys; /* total number of keys indexed */
|
||||
HB_ULONG ulKeys; /* keys in curently created page */
|
||||
HB_ULONG ulPages; /* number of pages */
|
||||
HB_ULONG ulCurPage; /* current page */
|
||||
HB_ULONG ulPgKeys; /* maximum number of key in page memory buffer */
|
||||
HB_ULONG ulMaxKey; /* maximum number of keys in single page */
|
||||
HB_BYTE * pKeyPool; /* memory buffer for current page then for pages */
|
||||
LPCDXSWAPPAGE pSwapPage; /* list of pages */
|
||||
LPCDXPAGE NodeList[ CDX_STACKSIZE ]; /* Stack of pages */
|
||||
HB_ULONG ulFirst;
|
||||
HB_ULONG * pSortedPages;
|
||||
HB_BYTE pLastKey[ CDX_MAXKEY ]; /* last key val */
|
||||
HB_BYTE pLastKey[ CDX_MAXKEY ]; /* last key val */
|
||||
HB_ULONG ulLastRec;
|
||||
HB_BYTE * pRecBuff;
|
||||
#ifndef HB_CDX_PACKTRAIL
|
||||
int iLastTrl; /* last key trailing spaces */
|
||||
int iLastTrl; /* last key trailing spaces */
|
||||
#endif
|
||||
} CDXSORTINFO;
|
||||
typedef CDXSORTINFO * LPCDXSORTINFO;
|
||||
|
||||
@@ -520,36 +520,36 @@ typedef NSXSWAPPAGE * LPNSXSWAPPAGE;
|
||||
|
||||
typedef struct
|
||||
{
|
||||
LPTAGINFO pTag; /* current Tag */
|
||||
HB_FHANDLE hTempFile; /* handle to temporary file */
|
||||
char * szTempFileName; /* temporary file name */
|
||||
int keyLen; /* key length */
|
||||
HB_UCHAR trailChar; /* index key trail character */
|
||||
HB_UCHAR recSize; /* record size in leaf keys */
|
||||
HB_BOOL fUnique; /* HB_TRUE if index is unique */
|
||||
HB_BOOL fReindex; /* HB_TRUE if reindexing is in process */
|
||||
HB_ULONG ulMaxRec; /* the highest record number */
|
||||
HB_ULONG ulTotKeys; /* total number of keys indexed */
|
||||
HB_ULONG ulKeys; /* keys in curently created page */
|
||||
HB_ULONG ulPages; /* number of pages */
|
||||
HB_ULONG ulCurPage; /* current page */
|
||||
HB_ULONG ulPgKeys; /* maximum number of key in page memory buffer */
|
||||
HB_ULONG ulMaxKey; /* maximum number of keys in single page */
|
||||
HB_UCHAR * pKeyPool; /* memory buffer for current page then for pages */
|
||||
HB_UCHAR * pStartKey; /* begining of key pool after sorting */
|
||||
LPNSXSWAPPAGE pSwapPage; /* list of pages */
|
||||
LPPAGEINFO NodeList[ NSX_STACKSIZE ]; /* Stack of pages */
|
||||
HB_ULONG ulFirst;
|
||||
HB_ULONG * pSortedPages;
|
||||
HB_UCHAR pLastKey[ NSX_MAXKEYLEN ]; /* last key val */
|
||||
HB_ULONG ulLastRec;
|
||||
HB_ULONG ulLastLeaf; /* last non empty leaf page written to tag */
|
||||
LPTAGINFO pTag; /* current Tag */
|
||||
PHB_FILE pTempFile; /* handle to temporary file */
|
||||
char * szTempFileName; /* temporary file name */
|
||||
int keyLen; /* key length */
|
||||
HB_UCHAR trailChar; /* index key trail character */
|
||||
HB_UCHAR recSize; /* record size in leaf keys */
|
||||
HB_BOOL fUnique; /* HB_TRUE if index is unique */
|
||||
HB_BOOL fReindex; /* HB_TRUE if reindexing is in process */
|
||||
HB_ULONG ulMaxRec; /* the highest record number */
|
||||
HB_ULONG ulTotKeys; /* total number of keys indexed */
|
||||
HB_ULONG ulKeys; /* keys in curently created page */
|
||||
HB_ULONG ulPages; /* number of pages */
|
||||
HB_ULONG ulCurPage; /* current page */
|
||||
HB_ULONG ulPgKeys; /* maximum number of key in page memory buffer */
|
||||
HB_ULONG ulMaxKey; /* maximum number of keys in single page */
|
||||
HB_UCHAR * pKeyPool; /* memory buffer for current page then for pages */
|
||||
HB_UCHAR * pStartKey; /* begining of key pool after sorting */
|
||||
LPNSXSWAPPAGE pSwapPage; /* list of pages */
|
||||
LPPAGEINFO NodeList[ NSX_STACKSIZE ]; /* Stack of pages */
|
||||
HB_ULONG ulFirst;
|
||||
HB_ULONG * pSortedPages;
|
||||
HB_UCHAR pLastKey[ NSX_MAXKEYLEN ]; /* last key val */
|
||||
HB_ULONG ulLastRec;
|
||||
HB_ULONG ulLastLeaf; /* last non empty leaf page written to tag */
|
||||
|
||||
HB_UCHAR * pBuffIO; /* index IO buffer */
|
||||
HB_ULONG ulSizeIO; /* size of IO buffer in index pages */
|
||||
HB_ULONG ulPagesIO; /* number of index pages in buffer */
|
||||
HB_ULONG ulFirstIO; /* first page in buffer */
|
||||
HB_ULONG ulLastIO; /* last page in buffer */
|
||||
HB_UCHAR * pBuffIO; /* index IO buffer */
|
||||
HB_ULONG ulSizeIO; /* size of IO buffer in index pages */
|
||||
HB_ULONG ulPagesIO; /* number of index pages in buffer */
|
||||
HB_ULONG ulFirstIO; /* first page in buffer */
|
||||
HB_ULONG ulLastIO; /* last page in buffer */
|
||||
} NSXSORTINFO;
|
||||
typedef NSXSORTINFO * LPNSXSORTINFO;
|
||||
|
||||
|
||||
@@ -303,7 +303,7 @@ typedef NTXSWAPPAGE * LPNTXSWAPPAGE;
|
||||
typedef struct
|
||||
{
|
||||
LPTAGINFO pTag; /* current Tag */
|
||||
HB_FHANDLE hTempFile; /* handle to temporary file */
|
||||
PHB_FILE pTempFile; /* handle to temporary file */
|
||||
char * szTempFileName; /* temporary file name */
|
||||
int keyLen; /* key length */
|
||||
HB_BOOL fUnique; /* HB_TRUE if index is unique */
|
||||
|
||||
@@ -66,8 +66,8 @@ void hb_sxDeCrypt( const char * pSrc, char * pDst, const char * pKeyVal, HB_SIZE
|
||||
|
||||
HB_BOOL hb_LZSSxDecompressMem( const char * pSrcBuf, HB_SIZE nSrcLen, char * pDstBuf, HB_SIZE nDstLen );
|
||||
HB_BOOL hb_LZSSxCompressMem( const char * pSrcBuf, HB_SIZE nSrcLen, char * pDstBuf, HB_SIZE nDstLen, HB_SIZE * pnSize );
|
||||
HB_BOOL hb_LZSSxCompressFile( HB_FHANDLE hInput, HB_FHANDLE hOutput, HB_SIZE * pnSize );
|
||||
HB_BOOL hb_LZSSxDecompressFile( HB_FHANDLE hInput, HB_FHANDLE hOutput );
|
||||
HB_BOOL hb_LZSSxCompressFile( PHB_FILE pInput, PHB_FILE pOutput, HB_SIZE * pnSize );
|
||||
HB_BOOL hb_LZSSxDecompressFile( PHB_FILE pInput, PHB_FILE pOutput );
|
||||
|
||||
HB_EXTERN_END
|
||||
|
||||
|
||||
Reference in New Issue
Block a user