// // Common non-engine code/data for EDuke32 and Mapster32 // #include "compat.h" #include "build.h" #include "scriptfile.h" #include "cache1d.h" #include "kplib.h" #include "baselayer.h" #include "names.h" #include "common.h" #include "common_game.h" int32_t g_gameType = GAMEFLAG_DUKE; // grp/con/def handling const char *defaultgamegrp[GAMECOUNT] = { "DUKE3D.GRP", "NAM.GRP", "NAPALM.GRP", "WW2GI.GRP" }; const char *defaultdeffilename[GAMECOUNT] = { "duke3d.def", "nam.def", "napalm.def", "ww2gi.def" }; const char *defaultconfilename = "GAME.CON"; const char *defaultgameconfilename[GAMECOUNT] = { "EDUKE.CON", "NAM.CON", "NAPALM.CON", "WW2GI.CON" }; // g_grpNamePtr can ONLY point to a malloc'd block (length BMAX_PATH) char *g_grpNamePtr = NULL; // g_defNamePtr can ONLY point to a malloc'd block (length BMAX_PATH) char *g_defNamePtr = NULL; // g_scriptNamePtr can ONLY point to a malloc'd block (length BMAX_PATH) char *g_scriptNamePtr = NULL; void clearGrpNamePtr(void) { if (g_grpNamePtr != NULL) Bfree(g_grpNamePtr); // g_grpNamePtr assumed to be assigned to right after } void clearDefNamePtr(void) { if (g_defNamePtr != NULL) Bfree(g_defNamePtr); // g_defNamePtr assumed to be assigned to right after } void clearScriptNamePtr(void) { if (g_scriptNamePtr != NULL) Bfree(g_scriptNamePtr); // g_scriptNamePtr assumed to be assigned to right after } const char *G_DefaultGrpFile(void) { if (DUKE) return defaultgamegrp[GAME_DUKE]; // order is important for the following three because GAMEFLAG_NAM overlaps all else if (NAPALM) return defaultgamegrp[GAME_NAPALM]; else if (WW2GI) return defaultgamegrp[GAME_WW2GI]; else if (NAM) return defaultgamegrp[GAME_NAM]; return defaultgamegrp[0]; } const char *G_DefaultDefFile(void) { if (DUKE) return defaultdeffilename[GAME_DUKE]; else if (WW2GI) return defaultdeffilename[GAME_WW2GI]; else if (NAPALM) { if (!testkopen(defaultdeffilename[GAME_NAPALM],0) && testkopen(defaultdeffilename[GAME_NAM],0)) return defaultdeffilename[GAME_NAM]; // NAM/Napalm Sharing else return defaultdeffilename[GAME_NAPALM]; } else if (NAM) { if (!testkopen(defaultdeffilename[GAME_NAM],0) && testkopen(defaultdeffilename[GAME_NAPALM],0)) return defaultdeffilename[GAME_NAPALM]; // NAM/Napalm Sharing else return defaultdeffilename[GAME_NAM]; } return defaultdeffilename[0]; } const char *G_DefaultConFile(void) { if (DUKE && testkopen(defaultgameconfilename[GAME_DUKE],0)) return defaultgameconfilename[GAME_DUKE]; else if (WW2GI && testkopen(defaultgameconfilename[GAME_WW2GI],0)) return defaultgameconfilename[GAME_WW2GI]; else if (NAPALM) { if (!testkopen(defaultgameconfilename[GAME_NAPALM],0)) { if (testkopen(defaultgameconfilename[GAME_NAM],0)) return defaultgameconfilename[GAME_NAM]; // NAM/Napalm Sharing } else return defaultgameconfilename[GAME_NAPALM]; } else if (NAM) { if (!testkopen(defaultgameconfilename[GAME_NAM],0)) { if (testkopen(defaultgameconfilename[GAME_NAPALM],0)) return defaultgameconfilename[GAME_NAPALM]; // NAM/Napalm Sharing } else return defaultgameconfilename[GAME_NAM]; } return defaultconfilename; } const char *G_GrpFile(void) { if (g_grpNamePtr == NULL) return G_DefaultGrpFile(); else return g_grpNamePtr; } const char *G_DefFile(void) { if (g_defNamePtr == NULL) return G_DefaultDefFile(); else return g_defNamePtr; } const char *G_ConFile(void) { if (g_scriptNamePtr == NULL) return G_DefaultConFile(); else return g_scriptNamePtr; } ////////// void G_MultiPskyInit(void) { int32_t i; // new-style multi-psky handling pskymultilist[0] = MOONSKY1; pskymultilist[1] = BIGORBIT1; pskymultilist[2] = LA; pskymultiyscale[0] = 32768; pskymultiyscale[1] = 32768; pskymultiyscale[2] = 16384+1024; for (i=0; i<3; ++i) { pskymultibits[i] = 3; Bmemset(pskymultioff[i], 0, sizeof(pskymultioff[i])); } // KEEPINSYNC with Polymer MAX OFFSET = 4 // MOONSKY1 // earth mountain mountain sun pskymultioff[0][6]=1; pskymultioff[0][1]=2; pskymultioff[0][4]=2; pskymultioff[0][2]=3; // BIGORBIT1 // orbit // earth1 2 3 moon/sun pskymultioff[1][5]=1; pskymultioff[1][6]=2; pskymultioff[1][7]=3; pskymultioff[1][2]=4; // LA // la city // earth1 2 3 moon/sun pskymultioff[2][0]=1; pskymultioff[2][1]=2; pskymultioff[2][2]=1; pskymultioff[2][3]=3; pskymultioff[2][4]=4; pskymultioff[2][5]=0; pskymultioff[2][6]=2; pskymultioff[2][7]=3; pskynummultis = 3; // default in game: parallaxyscale = 32768; } ////////// struct strllist *CommandPaths, *CommandGrps; void G_AddGroup(const char *buffer) { char buf[BMAX_PATH]; struct strllist *s = (struct strllist *)Bcalloc(1,sizeof(struct strllist)); Bstrcpy(buf, buffer); if (Bstrchr(buf,'.') == 0) Bstrcat(buf,".grp"); s->str = Bstrdup(buf); if (CommandGrps) { struct strllist *t; for (t = CommandGrps; t->next; t=t->next) ; t->next = s; return; } CommandGrps = s; } void G_AddPath(const char *buffer) { struct strllist *s = (struct strllist *)Bcalloc(1,sizeof(struct strllist)); s->str = Bstrdup(buffer); if (CommandPaths) { struct strllist *t; for (t = CommandPaths; t->next; t=t->next) ; t->next = s; return; } CommandPaths = s; } ////////// int32_t getatoken(scriptfile *sf, const tokenlist *tl, int32_t ntokens) { char *tok; int32_t i; if (!sf) return T_ERROR; tok = scriptfile_gettoken(sf); if (!tok) return T_EOF; for (i=ntokens-1; i>=0; i--) { if (!Bstrcasecmp(tok, tl[i].text)) return tl[i].tokenid; } return T_ERROR; } ////////// // returns: 1 if file could be opened, 0 else int32_t testkopen(const char *filename, char searchfirst) { int32_t fd = kopen4load(filename, searchfirst); if (fd >= 0) kclose(fd); return (fd >= 0); } // checks from path and in ZIPs, returns 1 if NOT found int32_t check_file_exist(const char *fn) { int32_t opsm = pathsearchmode; char *tfn; pathsearchmode = 1; if (findfrompath(fn,&tfn) < 0) { char buf[BMAX_PATH]; Bstrcpy(buf,fn); kzfindfilestart(buf); if (!kzfindfile(buf)) { initprintf("Error: file \"%s\" does not exist\n",fn); pathsearchmode = opsm; return 1; } } else Bfree(tfn); pathsearchmode = opsm; return 0; } //// FILE NAME / DIRECTORY LISTS //// void fnlist_clearnames(fnlist_t *fnl) { klistfree(fnl->finddirs); klistfree(fnl->findfiles); fnl->finddirs = fnl->findfiles = NULL; fnl->numfiles = fnl->numdirs = 0; } // dirflags, fileflags: // -1 means "don't get dirs/files", // otherwise ORed to flags for respective klistpath int32_t fnlist_getnames(fnlist_t *fnl, const char *dirname, const char *pattern, int32_t dirflags, int32_t fileflags) { CACHE1D_FIND_REC *r; fnlist_clearnames(fnl); if (dirflags != -1) fnl->finddirs = klistpath(dirname, "*", CACHE1D_FIND_DIR|dirflags); if (fileflags != -1) fnl->findfiles = klistpath(dirname, pattern, CACHE1D_FIND_FILE|fileflags); for (r=fnl->finddirs; r; r=r->next) fnl->numdirs++; for (r=fnl->findfiles; r; r=r->next) fnl->numfiles++; return(0); } // loads all group (grp, zip, pk3/4) files in the given directory void G_LoadGroupsInDir(const char *dirname) { static const char *extensions[4] = { "*.grp", "*.zip", "*.pk3", "*.pk4" }; char buf[BMAX_PATH]; int32_t i; fnlist_t fnlist = FNLIST_INITIALIZER; for (i=0; i<4; i++) { CACHE1D_FIND_REC *rec; fnlist_getnames(&fnlist, dirname, extensions[i], -1, 0); for (rec=fnlist.findfiles; rec; rec=rec->next) { Bsnprintf(buf, sizeof(buf), "%s/%s", dirname, rec->name); initprintf("Using group file \"%s\".\n", buf); initgroupfile(buf); } fnlist_clearnames(&fnlist); } } void G_DoAutoload(const char *dirname) { char buf[BMAX_PATH]; Bsnprintf(buf, sizeof(buf), "autoload/%s", dirname); G_LoadGroupsInDir(buf); } //// // returns a buffer of size BMAX_PATH char *dup_filename(const char *fn) { char *buf = (char *)Bmalloc(BMAX_PATH); return Bstrncpyz(buf, fn, BMAX_PATH); } // Copy FN to WBUF and append an extension if it's not there, which is checked // case-insensitively. // Returns: 1 if not all characters could be written to WBUF, 0 else. int32_t maybe_append_ext(char *wbuf, int32_t wbufsiz, const char *fn, const char *ext) { const int32_t slen=Bstrlen(fn), extslen=Bstrlen(ext); const int32_t haveext = (slen>=extslen && Bstrcasecmp(&fn[slen-extslen], ext)==0); Bassert((intptr_t)wbuf != (intptr_t)fn); // no aliasing // If 'fn' has no extension suffixed, append one. return (Bsnprintf(wbuf, wbufsiz, "%s%s", fn, haveext ? "" : ext) >= wbufsiz); } // Approximations to 2D and 3D Euclidean distances. Initial EDuke32 SVN import says // in jmact/mathutil.c: "Ken's reverse-engineering job". // Note that jmact/mathutil.c contains practically the same code, but where the // individual x/y(/z) distances are passed instead. int32_t ldist(const spritetype *s1, const spritetype *s2) { int32_t x = klabs(s1->x-s2->x); int32_t y = klabs(s1->y-s2->y); if (x>1); return (x - (x>>5) - (x>>7) + (t>>2) + (t>>6)); } } int32_t dist(const spritetype *s1, const spritetype *s2) { int32_t x = klabs(s1->x-s2->x); int32_t y = klabs(s1->y-s2->y); int32_t z = klabs((s1->z-s2->z)>>4); if (x>4) + (t>>2) + (t>>3)); } } // Clear OSD background void COMMON_clearbackground(int32_t numcols, int32_t numrows) { UNREFERENCED_PARAMETER(numcols); # ifdef USE_OPENGL if (rendmode>=3 && qsetmode==200) { setpolymost2dview(); bglColor4f(0,0,0,0.67f); bglEnable(GL_BLEND); bglRectd(0,0, xdim,8*numrows+8); bglColor4f(0,0,0,1); bglRectd(0,8*numrows+4, xdim,8*numrows+8); return; } # endif CLEARLINES2D(0, min(ydim, numrows*8+8), editorcolors[16]); }