aboutsummaryrefslogtreecommitdiff
path: root/engines/cge/btfile.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'engines/cge/btfile.cpp')
-rw-r--r--engines/cge/btfile.cpp226
1 files changed, 89 insertions, 137 deletions
diff --git a/engines/cge/btfile.cpp b/engines/cge/btfile.cpp
index 7c61157eba..b5e59e0988 100644
--- a/engines/cge/btfile.cpp
+++ b/engines/cge/btfile.cpp
@@ -25,173 +25,125 @@
* Copyright (c) 1994-1995 Janus B. Wisniewski and L.K. Avalon
*/
-#include "cge/btfile.h"
-//#include <alloc.h>
+#include "cge/btfile.h"
#include "common/system.h"
#include "common/str.h"
-#include <string.h>
+#include <string.h>
namespace CGE {
-#ifndef BT_SIZE
- #define BT_SIZE K(1)
+#ifndef BT_SIZE
+#define BT_SIZE K(1)
#endif
-#ifndef BT_KEYLEN
- #define BT_KEYLEN 13
+#ifndef BT_KEYLEN
+#define BT_KEYLEN 13
#endif
-
-
-
-
-BTFILE::BTFILE (const char * name, IOMODE mode, CRYPT * crpt)
-: IOHAND(name, mode, crpt)
-{
- int i;
- for (i = 0; i < BT_LEVELS; i ++)
- {
- Buff[i].Page = new BT_PAGE;
- Buff[i].PgNo = BT_NONE;
- Buff[i].Indx = -1;
- Buff[i].Updt = FALSE;
- if (Buff[i].Page == NULL)
- error("No core");
- }
+BTFILE::BTFILE(const char *name, IOMODE mode, CRYPT *crpt)
+ : IOHAND(name, mode, crpt) {
+ for (int i = 0; i < BT_LEVELS; i ++) {
+ Buff[i].Page = new BT_PAGE;
+ Buff[i].PgNo = BT_NONE;
+ Buff[i].Indx = -1;
+ Buff[i].Updt = FALSE;
+ if (Buff[i].Page == NULL)
+ error("No core");
+ }
}
-
-
-
-
-
-
-
-BTFILE::~BTFILE (void)
-{
- int i;
- for (i = 0; i < BT_LEVELS; i ++)
- {
- PutPage(i);
- delete Buff[i].Page;
- }
+BTFILE::~BTFILE(void) {
+ for (int i = 0; i < BT_LEVELS; i ++) {
+ PutPage(i);
+ delete Buff[i].Page;
+ }
}
-
-
-
-
-void BTFILE::PutPage (int lev, bool hard)
-{
- if (hard || Buff[lev].Updt)
- {
- Seek(Buff[lev].PgNo * sizeof(BT_PAGE));
- Write((uint8 *) Buff[lev].Page, sizeof(BT_PAGE));
- Buff[lev].Updt = FALSE;
- }
+void BTFILE::PutPage(int lev, bool hard) {
+ if (hard || Buff[lev].Updt) {
+ Seek(Buff[lev].PgNo * sizeof(BT_PAGE));
+ Write((uint8 *) Buff[lev].Page, sizeof(BT_PAGE));
+ Buff[lev].Updt = FALSE;
+ }
}
-
-
-
-
-BT_PAGE * BTFILE::GetPage (int lev, uint16 pgn)
-{
- if (Buff[lev].PgNo != pgn)
- {
- uint32 pos = pgn * sizeof(BT_PAGE);
- PutPage(lev);
- Buff[lev].PgNo = pgn;
- if (Size() > pos)
- {
- Seek((uint32) pgn * sizeof(BT_PAGE));
- Read((uint8 *) Buff[lev].Page, sizeof(BT_PAGE));
- Buff[lev].Updt = FALSE;
+BT_PAGE *BTFILE::GetPage(int lev, uint16 pgn) {
+ if (Buff[lev].PgNo != pgn) {
+ uint32 pos = pgn * sizeof(BT_PAGE);
+ PutPage(lev);
+ Buff[lev].PgNo = pgn;
+ if (Size() > pos) {
+ Seek((uint32) pgn * sizeof(BT_PAGE));
+ Read((uint8 *) Buff[lev].Page, sizeof(BT_PAGE));
+ Buff[lev].Updt = FALSE;
+ } else {
+ Buff[lev].Page->Hea.Count = 0;
+ Buff[lev].Page->Hea.Down = BT_NONE;
+ memset(Buff[lev].Page->Data, '\0', sizeof(Buff[lev].Page->Data));
+ Buff[lev].Updt = TRUE;
+ }
+ Buff[lev].Indx = -1;
}
- else
- {
- Buff[lev].Page->Hea.Count = 0;
- Buff[lev].Page->Hea.Down = BT_NONE;
- memset(Buff[lev].Page->Data, '\0', sizeof(Buff[lev].Page->Data));
- Buff[lev].Updt = TRUE;
- }
- Buff[lev].Indx = -1;
- }
- return Buff[lev].Page;
+ return Buff[lev].Page;
}
-
-
-
-BT_KEYPACK * BTFILE::Find (const char * key)
-{
- int lev = 0;
- uint16 nxt = BT_ROOT;
- while (! Error)
- {
- BT_PAGE * pg = GetPage(lev, nxt);
- // search
- if (pg->Hea.Down != BT_NONE)
- {
- int i;
- for (i = 0; i < pg->Hea.Count; i ++)
- if (memicmp(key, pg->Inn[i].Key, BT_KEYLEN) < 0)
- break;
- nxt = (i) ? pg->Inn[i-1].Down : pg->Hea.Down;
- Buff[lev].Indx = i-1;
- ++ lev;
+BT_KEYPACK *BTFILE::Find(const char *key) {
+ int lev = 0;
+ uint16 nxt = BT_ROOT;
+ while (! Error) {
+ BT_PAGE *pg = GetPage(lev, nxt);
+ // search
+ if (pg->Hea.Down != BT_NONE) {
+ int i;
+ for (i = 0; i < pg->Hea.Count; i ++)
+ if (memicmp(key, pg->Inn[i].Key, BT_KEYLEN) < 0)
+ break;
+ nxt = (i) ? pg->Inn[i - 1].Down : pg->Hea.Down;
+ Buff[lev].Indx = i - 1;
+ ++ lev;
+ } else {
+ int i;
+ for (i = 0; i < pg->Hea.Count - 1; i ++)
+ if (scumm_stricmp((const char *)key, (const char *)pg->Lea[i].Key) <= 0)
+ break;
+ Buff[lev].Indx = i;
+ return &pg->Lea[i];
+ }
}
- else
- {
- int i;
- for (i = 0; i < pg->Hea.Count-1; i ++)
- if (scumm_stricmp((const char*)key, (const char*)pg->Lea[i].Key) <= 0)
- break;
- Buff[lev].Indx = i;
- return &pg->Lea[i];
- }
- }
- return NULL;
+ return NULL;
}
-
-
-int keycomp (const void * k1, const void * k2)
-{
- return memicmp(k1, k2, BT_KEYLEN);
+int keycomp(const void *k1, const void *k2) {
+ return memicmp(k1, k2, BT_KEYLEN);
}
-
-void BTFILE::Make(BT_KEYPACK * keypack, uint16 count)
-{
- #if BT_LEVELS != 2
- #error This tiny BTREE implementation works with exactly 2 levels!
- #endif
- _fqsort(keypack, count, sizeof(*keypack), keycomp);
- uint16 n = 0;
- BT_PAGE * Root = GetPage(0, n ++),
- * Leaf = GetPage(1, n);
- Root->Hea.Down = n;
- PutPage(0, TRUE);
- while (count --)
- {
- if (Leaf->Hea.Count >= ArrayCount(Leaf->Lea))
- {
- PutPage(1, TRUE); // save filled page
- Leaf = GetPage(1, ++n); // take empty page
- memcpy(Root->Inn[Root->Hea.Count].Key, keypack->Key, BT_KEYLEN);
- Root->Inn[Root->Hea.Count ++].Down = n;
- Buff[0].Updt = TRUE;
+void BTFILE::Make(BT_KEYPACK *keypack, uint16 count) {
+#if BT_LEVELS != 2
+#error This tiny BTREE implementation works with exactly 2 levels!
+#endif
+ _fqsort(keypack, count, sizeof(*keypack), keycomp);
+ uint16 n = 0;
+ BT_PAGE *Root = GetPage(0, n++),
+ *Leaf = GetPage(1, n);
+ Root->Hea.Down = n;
+ PutPage(0, TRUE);
+ while (count --) {
+ if (Leaf->Hea.Count >= ArrayCount(Leaf->Lea)) {
+ PutPage(1, TRUE); // save filled page
+ Leaf = GetPage(1, ++n); // take empty page
+ memcpy(Root->Inn[Root->Hea.Count].Key, keypack->Key, BT_KEYLEN);
+ Root->Inn[Root->Hea.Count ++].Down = n;
+ Buff[0].Updt = TRUE;
+ }
+ Leaf->Lea[Leaf->Hea.Count ++] = * (keypack ++);
+ Buff[1].Updt = TRUE;
}
- Leaf->Lea[Leaf->Hea.Count ++] = * (keypack ++);
- Buff[1].Updt = TRUE;
- }
}
} // End of namespace CGE
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-12 00:26:55 +0000