|
|
|
/*
|
|
|
|
con_utils.c - console helpers
|
|
|
|
Copyright (C) 2008 Uncle Mike
|
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "common.h"
|
|
|
|
#include "client.h"
|
|
|
|
#include "const.h"
|
|
|
|
#include "kbutton.h"
|
|
|
|
|
|
|
|
extern convar_t *con_gamemaps;
|
|
|
|
|
|
|
|
#define CON_MAXCMDS 4096 // auto-complete intermediate list
|
|
|
|
|
|
|
|
typedef struct autocomplete_list_s
|
|
|
|
{
|
|
|
|
const char *name;
|
|
|
|
int arg; // argument number to handle
|
|
|
|
qboolean (*func)( const char *s, char *name, int length );
|
|
|
|
} autocomplete_list_t;
|
|
|
|
|
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
// console auto-complete
|
|
|
|
string shortestMatch;
|
|
|
|
field_t *completionField; // con.input or dedicated server fake field-line
|
|
|
|
const char *completionString;
|
|
|
|
const char *completionBuffer;
|
|
|
|
char *cmds[CON_MAXCMDS];
|
|
|
|
int matchCount;
|
|
|
|
} con_autocomplete_t;
|
|
|
|
|
|
|
|
static con_autocomplete_t con;
|
|
|
|
|
|
|
|
/*
|
|
|
|
=======================================================================
|
|
|
|
|
|
|
|
FILENAME AUTOCOMPLETION
|
|
|
|
|
|
|
|
=======================================================================
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_ListMaps
|
|
|
|
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
int Cmd_ListMaps( search_t *t, char *lastmapname, size_t len )
|
|
|
|
{
|
|
|
|
byte buf[MAX_SYSPATH]; // 1 kb
|
|
|
|
file_t *f;
|
|
|
|
int i, nummaps;
|
|
|
|
string mapname, message, compiler, generator;
|
|
|
|
|
|
|
|
for( i = 0, nummaps = 0; i < t->numfilenames; i++ )
|
|
|
|
{
|
|
|
|
char entfilename[MAX_QPATH];
|
|
|
|
const char *ext = COM_FileExtension( t->filenames[i] );
|
|
|
|
int ver = -1, lumpofs = 0, lumplen = 0;
|
|
|
|
char *ents = NULL, *pfile;
|
|
|
|
int version = 0;
|
|
|
|
string version_description;
|
|
|
|
|
|
|
|
if( Q_stricmp( ext, "bsp" )) continue;
|
|
|
|
Q_strncpy( message, "^1error^7", sizeof( message ));
|
|
|
|
compiler[0] = '\0';
|
|
|
|
generator[0] = '\0';
|
|
|
|
|
|
|
|
f = FS_Open( t->filenames[i], "rb", con_gamemaps->value );
|
|
|
|
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
dheader_t *header;
|
|
|
|
dextrahdr_t *hdrext;
|
|
|
|
|
|
|
|
memset( buf, 0, sizeof( buf ));
|
|
|
|
FS_Read( f, buf, sizeof( buf ));
|
|
|
|
header = (dheader_t *)buf;
|
|
|
|
ver = header->version;
|
|
|
|
|
|
|
|
// check all the lumps and some other errors
|
|
|
|
if( Mod_TestBmodelLumps( t->filenames[i], buf, true ))
|
|
|
|
{
|
|
|
|
lumpofs = header->lumps[LUMP_ENTITIES].fileofs;
|
|
|
|
lumplen = header->lumps[LUMP_ENTITIES].filelen;
|
|
|
|
ver = header->version;
|
|
|
|
}
|
|
|
|
|
|
|
|
hdrext = (dextrahdr_t *)((byte *)buf + sizeof( dheader_t ));
|
|
|
|
if( hdrext->id == IDEXTRAHEADER ) version = hdrext->version;
|
|
|
|
|
|
|
|
Q_strncpy( entfilename, t->filenames[i], sizeof( entfilename ));
|
|
|
|
COM_StripExtension( entfilename );
|
|
|
|
COM_DefaultExtension( entfilename, ".ent" );
|
|
|
|
ents = (char *)FS_LoadFile( entfilename, NULL, true );
|
|
|
|
|
|
|
|
if( !ents && lumplen >= 10 )
|
|
|
|
{
|
|
|
|
FS_Seek( f, lumpofs, SEEK_SET );
|
|
|
|
ents = (char *)Mem_Calloc( host.mempool, lumplen + 1 );
|
|
|
|
FS_Read( f, ents, lumplen );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( ents )
|
|
|
|
{
|
|
|
|
// if there are entities to parse, a missing message key just
|
|
|
|
// means there is no title, so clear the message string now
|
|
|
|
char token[2048];
|
|
|
|
|
|
|
|
message[0] = 0; // remove 'error'
|
|
|
|
pfile = ents;
|
|
|
|
|
|
|
|
while(( pfile = COM_ParseFile( pfile, token )) != NULL )
|
|
|
|
{
|
|
|
|
if( !Q_strcmp( token, "{" )) continue;
|
|
|
|
else if( !Q_strcmp( token, "}" )) break;
|
|
|
|
else if( !Q_strcmp( token, "message" ))
|
|
|
|
{
|
|
|
|
// get the message contents
|
|
|
|
pfile = COM_ParseFile( pfile, message );
|
|
|
|
}
|
|
|
|
else if( !Q_strcmp( token, "compiler" ) || !Q_strcmp( token, "_compiler" ))
|
|
|
|
{
|
|
|
|
// get the message contents
|
|
|
|
pfile = COM_ParseFile( pfile, compiler );
|
|
|
|
}
|
|
|
|
else if( !Q_strcmp( token, "generator" ) || !Q_strcmp( token, "_generator" ))
|
|
|
|
{
|
|
|
|
// get the message contents
|
|
|
|
pfile = COM_ParseFile( pfile, generator );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Mem_Free( ents );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( f ) FS_Close(f);
|
|
|
|
COM_FileBase( t->filenames[i], mapname );
|
|
|
|
|
|
|
|
switch( ver )
|
|
|
|
{
|
|
|
|
case Q1BSP_VERSION:
|
|
|
|
Q_strncpy( version_description, "Quake", sizeof( version_description ));
|
|
|
|
break;
|
|
|
|
case QBSP2_VERSION:
|
|
|
|
Q_strncpy( version_description, "Darkplaces BSP2", sizeof( version_description ));
|
|
|
|
break;
|
|
|
|
case HLBSP_VERSION:
|
|
|
|
switch( version )
|
|
|
|
{
|
|
|
|
case 1: Q_strncpy( version_description, "XashXT old format", sizeof( version_description )); break;
|
|
|
|
case 2: Q_strncpy( version_description, "Paranoia 2: Savior", sizeof( version_description )); break;
|
|
|
|
case 4: Q_strncpy( version_description, "Half-Life extended", sizeof( version_description )); break;
|
|
|
|
default: Q_strncpy( version_description, "Half-Life", sizeof( version_description )); break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default: Q_strncpy( version_description, "??", sizeof( version_description )); break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "%16s (%s) ^3%s^7 ^2%s %s^7\n", mapname, version_description, message, compiler, generator );
|
|
|
|
nummaps++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( lastmapname && len )
|
|
|
|
Q_strncpy( lastmapname, mapname, len );
|
|
|
|
|
|
|
|
return nummaps;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetMapList
|
|
|
|
|
|
|
|
Prints or complete map filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetMapList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, nummaps;
|
|
|
|
|
|
|
|
t = FS_Search( va( "maps/%s*.bsp", s ), true, con_gamemaps->value );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
nummaps = Cmd_ListMaps( t, matchbuf, sizeof( matchbuf ));
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %d maps found.\n", nummaps );
|
|
|
|
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetDemoList
|
|
|
|
|
|
|
|
Prints or complete demo filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetDemoList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numdems;
|
|
|
|
|
|
|
|
// lookup only in gamedir
|
|
|
|
t = FS_Search( va( "%s*.dem", s ), true, true );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0, numdems = 0; i < t->numfilenames; i++ )
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "dem" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numdems++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i demos found.\n", numdems );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetMovieList
|
|
|
|
|
|
|
|
Prints or complete movie filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetMovieList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, nummovies;
|
|
|
|
|
|
|
|
t = FS_Search( va( "media/%s*.avi", s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for(i = 0, nummovies = 0; i < t->numfilenames; i++)
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "avi" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
nummovies++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i movies found.\n", nummovies );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetMusicList
|
|
|
|
|
|
|
|
Prints or complete background track filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetMusicList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numtracks;
|
|
|
|
|
|
|
|
t = FS_Search( va( "media/%s*.*", s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for(i = 0, numtracks = 0; i < t->numfilenames; i++)
|
|
|
|
{
|
|
|
|
const char *ext = COM_FileExtension( t->filenames[i] );
|
|
|
|
|
|
|
|
if( Q_stricmp( ext, "wav" ) && Q_stricmp( ext, "mp3" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numtracks++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i soundtracks found.\n", numtracks );
|
|
|
|
Mem_Free(t);
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetSavesList
|
|
|
|
|
|
|
|
Prints or complete savegame filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetSavesList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numsaves;
|
|
|
|
|
|
|
|
t = FS_Search( va( "%s%s*.sav", DEFAULT_SAVE_DIRECTORY, s ), true, true ); // lookup only in gamedir
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0, numsaves = 0; i < t->numfilenames; i++ )
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "sav" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numsaves++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i saves found.\n", numsaves );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetConfigList
|
|
|
|
|
|
|
|
Prints or complete .cfg filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetConfigList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numconfigs;
|
|
|
|
|
|
|
|
t = FS_Search( va( "%s*.cfg", s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0, numconfigs = 0; i < t->numfilenames; i++ )
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "cfg" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numconfigs++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i configs found.\n", numconfigs );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetSoundList
|
|
|
|
|
|
|
|
Prints or complete sound filename
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetSoundList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numsounds;
|
|
|
|
|
|
|
|
t = FS_Search( va( "%s%s*.*", DEFAULT_SOUNDPATH, s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
Q_strncpy( matchbuf, t->filenames[0] + sizeof( DEFAULT_SOUNDPATH ) - 1, MAX_STRING );
|
|
|
|
COM_StripExtension( matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for(i = 0, numsounds = 0; i < t->numfilenames; i++)
|
|
|
|
{
|
|
|
|
const char *ext = COM_FileExtension( t->filenames[i] );
|
|
|
|
|
|
|
|
if( Q_stricmp( ext, "wav" ) && Q_stricmp( ext, "mp3" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
Q_strncpy( matchbuf, t->filenames[i] + sizeof( DEFAULT_SOUNDPATH ) - 1, MAX_STRING );
|
|
|
|
COM_StripExtension( matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numsounds++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i sounds found.\n", numsounds );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if !XASH_DEDICATED
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetItemsList
|
|
|
|
|
|
|
|
Prints or complete item classname (weapons only)
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetItemsList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numitems;
|
|
|
|
|
|
|
|
if( !clgame.itemspath[0] ) return false; // not in game yet
|
|
|
|
t = FS_Search( va( "%s/%s*.txt", clgame.itemspath, s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for(i = 0, numitems = 0; i < t->numfilenames; i++)
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "txt" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numitems++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i items found.\n", numitems );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetKeysList
|
|
|
|
|
|
|
|
Autocomplete for bind command
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetKeysList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
size_t i, numkeys;
|
|
|
|
string keys[256];
|
|
|
|
string matchbuf;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
// compare keys list with current keyword
|
|
|
|
len = Q_strlen( s );
|
|
|
|
|
|
|
|
for( i = 0, numkeys = 0; i < 255; i++ )
|
|
|
|
{
|
|
|
|
const char *keyname = Key_KeynumToString( i );
|
|
|
|
|
|
|
|
if(( *s == '*' ) || !Q_strnicmp( keyname, s, len))
|
|
|
|
Q_strcpy( keys[numkeys++], keyname );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !numkeys ) return false;
|
|
|
|
Q_strncpy( matchbuf, keys[0], sizeof( matchbuf ));
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( numkeys == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0; i < numkeys; i++ )
|
|
|
|
{
|
|
|
|
Q_strncpy( matchbuf, keys[i], sizeof( matchbuf ));
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %lu keys found.\n", numkeys );
|
|
|
|
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
#endif // XASH_DEDICATED
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Con_AddCommandToList
|
|
|
|
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
static void Con_AddCommandToList( const char *s, const char *unused1, const char *unused2, void *_autocompleteList )
|
|
|
|
{
|
|
|
|
con_autocomplete_t *list = (con_autocomplete_t*)_autocompleteList;
|
|
|
|
|
|
|
|
if( *s == '@' ) return; // never show system cvars or cmds
|
|
|
|
if( list->matchCount >= CON_MAXCMDS ) return; // list is full
|
|
|
|
|
|
|
|
if( Q_strnicmp( s, list->completionString, Q_strlen( list->completionString ) ) )
|
|
|
|
return; // no match
|
|
|
|
|
|
|
|
list->cmds[list->matchCount++] = copystring( s );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=================
|
|
|
|
Con_SortCmds
|
|
|
|
=================
|
|
|
|
*/
|
|
|
|
static int Con_SortCmds( const void *arg1, const void *arg2 )
|
|
|
|
{
|
|
|
|
return Q_stricmp( *(const char **)arg1, *(const char **)arg2 );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetCommandsList
|
|
|
|
|
|
|
|
Autocomplete for bind command
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetCommandsList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
string matchbuf;
|
|
|
|
con_autocomplete_t list; // local autocomplete list
|
|
|
|
|
|
|
|
memset( &list, 0, sizeof( list ));
|
|
|
|
|
|
|
|
list.completionString = s;
|
|
|
|
|
|
|
|
// skip backslash
|
|
|
|
while( *list.completionString && (*list.completionString == '\\' || *list.completionString == '/') )
|
|
|
|
list.completionString++;
|
|
|
|
|
|
|
|
if( !COM_CheckStringEmpty( list.completionString ) )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// find matching commands and variables
|
|
|
|
Cmd_LookupCmds( NULL, &list, (setpair_t)Con_AddCommandToList );
|
|
|
|
Cvar_LookupVars( 0, NULL, &list, (setpair_t)Con_AddCommandToList );
|
|
|
|
|
|
|
|
if( !list.matchCount ) return false;
|
|
|
|
Q_strncpy( matchbuf, list.cmds[0], sizeof( matchbuf ));
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( list.matchCount == 1 ) return true;
|
|
|
|
|
|
|
|
qsort( list.cmds, list.matchCount, sizeof( char* ), Con_SortCmds );
|
|
|
|
|
|
|
|
for( i = 0; i < list.matchCount; i++ )
|
|
|
|
{
|
|
|
|
Q_strncpy( matchbuf, list.cmds[i], sizeof( matchbuf ));
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i commands found.\n", list.matchCount );
|
|
|
|
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for( i = 0; i < list.matchCount; i++ )
|
|
|
|
{
|
|
|
|
if( list.cmds[i] != NULL )
|
|
|
|
{
|
|
|
|
Mem_Free( list.cmds[i] );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetCustomList
|
|
|
|
|
|
|
|
Prints or complete .HPK filenames
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetCustomList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
search_t *t;
|
|
|
|
string matchbuf;
|
|
|
|
int i, numitems;
|
|
|
|
|
|
|
|
t = FS_Search( va( "%s*.hpk", s ), true, false );
|
|
|
|
if( !t ) return false;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[0], matchbuf );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( t->numfilenames == 1 ) return true;
|
|
|
|
|
|
|
|
for(i = 0, numitems = 0; i < t->numfilenames; i++)
|
|
|
|
{
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "hpk" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
COM_FileBase( t->filenames[i], matchbuf );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
numitems++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i items found.\n", numitems );
|
|
|
|
Mem_Free( t );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetGameList
|
|
|
|
|
|
|
|
Prints or complete gamedir name
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetGamesList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
int i, numgamedirs;
|
|
|
|
string gamedirs[MAX_MODS];
|
|
|
|
string matchbuf;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
// stand-alone games doesn't have cmd "game"
|
|
|
|
if( !Cmd_Exists( "game" ))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// compare gamelist with current keyword
|
|
|
|
len = Q_strlen( s );
|
|
|
|
|
|
|
|
for( i = 0, numgamedirs = 0; i < SI.numgames; i++ )
|
|
|
|
{
|
|
|
|
if(( *s == '*' ) || !Q_strnicmp( SI.games[i]->gamefolder, s, len))
|
|
|
|
Q_strcpy( gamedirs[numgamedirs++], SI.games[i]->gamefolder );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !numgamedirs ) return false;
|
|
|
|
Q_strncpy( matchbuf, gamedirs[0], MAX_STRING );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( numgamedirs == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0; i < numgamedirs; i++ )
|
|
|
|
{
|
|
|
|
Q_strncpy( matchbuf, gamedirs[i], MAX_STRING );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i games found.\n", numgamedirs );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=====================================
|
|
|
|
Cmd_GetCDList
|
|
|
|
|
|
|
|
Prints or complete CD command name
|
|
|
|
=====================================
|
|
|
|
*/
|
|
|
|
qboolean Cmd_GetCDList( const char *s, char *completedname, int length )
|
|
|
|
{
|
|
|
|
int i, numcdcommands;
|
|
|
|
string cdcommands[8];
|
|
|
|
string matchbuf;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
const char *cd_command[] =
|
|
|
|
{
|
|
|
|
"info",
|
|
|
|
"loop",
|
|
|
|
"off",
|
|
|
|
"on",
|
|
|
|
"pause",
|
|
|
|
"play",
|
|
|
|
"resume",
|
|
|
|
"stop",
|
|
|
|
};
|
|
|
|
|
|
|
|
// compare CD command list with current keyword
|
|
|
|
len = Q_strlen( s );
|
|
|
|
|
|
|
|
for( i = 0, numcdcommands = 0; i < 8; i++ )
|
|
|
|
{
|
|
|
|
if(( *s == '*' ) || !Q_strnicmp( cd_command[i], s, len))
|
|
|
|
Q_strcpy( cdcommands[numcdcommands++], cd_command[i] );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !numcdcommands ) return false;
|
|
|
|
Q_strncpy( matchbuf, cdcommands[0], MAX_STRING );
|
|
|
|
if( completedname && length )
|
|
|
|
Q_strncpy( completedname, matchbuf, length );
|
|
|
|
if( numcdcommands == 1 ) return true;
|
|
|
|
|
|
|
|
for( i = 0; i < numcdcommands; i++ )
|
|
|
|
{
|
|
|
|
Q_strncpy( matchbuf, cdcommands[i], MAX_STRING );
|
|
|
|
Con_Printf( "%16s\n", matchbuf );
|
|
|
|
}
|
|
|
|
|
|
|
|
Con_Printf( "\n^3 %i commands found.\n", numcdcommands );
|
|
|
|
|
|
|
|
// cut shortestMatch to the amount common with s
|
|
|
|
if( completedname && length )
|
|
|
|
{
|
|
|
|
for( i = 0; matchbuf[i]; i++ )
|
|
|
|
{
|
|
|
|
if( Q_tolower( completedname[i] ) != Q_tolower( matchbuf[i] ))
|
|
|
|
completedname[i] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
qboolean Cmd_CheckMapsList_R( qboolean fRefresh, qboolean onlyingamedir )
|
|
|
|
{
|
|
|
|
qboolean use_filter = false;
|
|
|
|
byte buf[MAX_SYSPATH];
|
|
|
|
string mpfilter;
|
|
|
|
char *buffer;
|
|
|
|
string result;
|
|
|
|
int i, size;
|
|
|
|
search_t *t;
|
|
|
|
file_t *f;
|
|
|
|
|
|
|
|
if( FS_FileSize( "maps.lst", onlyingamedir ) > 0 && !fRefresh )
|
|
|
|
return true; // exist
|
|
|
|
|
|
|
|
// setup mpfilter
|
|
|
|
size = Q_snprintf( mpfilter, sizeof( mpfilter ), "maps/%s", GI->mp_filter );
|
|
|
|
t = FS_Search( "maps/*.bsp", false, onlyingamedir );
|
|
|
|
|
|
|
|
if( !t )
|
|
|
|
{
|
|
|
|
if( onlyingamedir )
|
|
|
|
{
|
|
|
|
// mod doesn't contain any maps (probably this is a bot)
|
|
|
|
return Cmd_CheckMapsList_R( fRefresh, false );
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer = Mem_Calloc( host.mempool, t->numfilenames * 2 * sizeof( result ));
|
|
|
|
use_filter = COM_CheckStringEmpty( GI->mp_filter ) ? true : false;
|
|
|
|
|
|
|
|
for( i = 0; i < t->numfilenames; i++ )
|
|
|
|
{
|
|
|
|
char *ents = NULL, *pfile;
|
|
|
|
int lumpofs = 0, lumplen = 0;
|
|
|
|
string mapname, message, entfilename;
|
|
|
|
|
|
|
|
if( Q_stricmp( COM_FileExtension( t->filenames[i] ), "bsp" ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if( use_filter && Q_stristr( t->filenames[i], mpfilter ))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
f = FS_Open( t->filenames[i], "rb", onlyingamedir );
|
|
|
|
COM_FileBase( t->filenames[i], mapname );
|
|
|
|
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
int num_spawnpoints = 0;
|
|
|
|
dheader_t *header;
|
|
|
|
|
|
|
|
memset( buf, 0, MAX_SYSPATH );
|
|
|
|
FS_Read( f, buf, MAX_SYSPATH );
|
|
|
|
header = (dheader_t *)buf;
|
|
|
|
|
|
|
|
// check all the lumps and some other errors
|
|
|
|
if( !Mod_TestBmodelLumps( t->filenames[i], buf, true ))
|
|
|
|
{
|
|
|
|
FS_Close( f );
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// after call Mod_TestBmodelLumps we gurantee what map is valid
|
|
|
|
lumpofs = header->lumps[LUMP_ENTITIES].fileofs;
|
|
|
|
lumplen = header->lumps[LUMP_ENTITIES].filelen;
|
|
|
|
|
|
|
|
Q_strncpy( entfilename, t->filenames[i], sizeof( entfilename ));
|
|
|
|
COM_StripExtension( entfilename );
|
|
|
|
COM_DefaultExtension( entfilename, ".ent" );
|
|
|
|
ents = (char *)FS_LoadFile( entfilename, NULL, true );
|
|
|
|
|
|
|
|
if( !ents && lumplen >= 10 )
|
|
|
|
{
|
|
|
|
FS_Seek( f, lumpofs, SEEK_SET );
|
|
|
|
ents = Z_Calloc( lumplen + 1 );
|
|
|
|
FS_Read( f, ents, lumplen );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( ents )
|
|
|
|
{
|
|
|
|
// if there are entities to parse, a missing message key just
|
|
|
|
// means there is no title, so clear the message string now
|
|
|
|
char token[MAX_TOKEN];
|
|
|
|
qboolean worldspawn = true;
|
|
|
|
|
|
|
|
Q_strncpy( message, "No Title", MAX_STRING );
|
|
|
|
pfile = ents;
|
|
|
|
|
|
|
|
while(( pfile = COM_ParseFile( pfile, token )) != NULL )
|
|
|
|
{
|
|
|
|
if( token[0] == '}' && worldspawn )
|
|
|
|
worldspawn = false;
|
|
|
|
else if( !Q_strcmp( token, "message" ) && worldspawn )
|
|
|
|
{
|
|
|
|
// get the message contents
|
|
|
|
pfile = COM_ParseFile( pfile, message );
|
|
|
|
}
|
|
|
|
else if( !Q_strcmp( token, "classname" ))
|
|
|
|
{
|
|
|
|
pfile = COM_ParseFile( pfile, token );
|
|
|
|
if( !Q_strcmp( token, GI->mp_entity ) || use_filter )
|
|
|
|
num_spawnpoints++;
|
|
|
|
}
|
|
|
|
if( num_spawnpoints ) break; // valid map
|
|
|
|
}
|
|
|
|
Mem_Free( ents );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( f ) FS_Close( f );
|
|
|
|
|
|
|
|
if( num_spawnpoints )
|
|
|
|
{
|
|
|
|
// format: mapname "maptitle"\n
|
|
|
|
Q_sprintf( result, "%s \"%s\"\n", mapname, message );
|
|
|
|
Q_strcat( buffer, result ); // add new string
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( t ) Mem_Free( t ); // free search result
|
|
|
|
size = Q_strlen( buffer );
|
|
|
|
|
|
|
|
if( !size )
|
|
|
|
{
|
|
|
|
if( buffer ) Mem_Free( buffer );
|
|
|
|
|
|
|
|
if( onlyingamedir )
|
|
|
|
return Cmd_CheckMapsList_R( fRefresh, false );
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// write generated maps.lst
|
|
|
|
if( FS_WriteFile( "maps.lst", buffer, size))
|
|
|
|
{
|
|
|
|
if( buffer ) Mem_Free( buffer );
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
int GAME_EXPORT Cmd_CheckMapsList( int fRefresh )
|
|
|
|
{
|
|
|
|
return Cmd_CheckMapsList_R( fRefresh, true );
|
|
|
|
}
|
|
|
|
|
|
|
|
autocomplete_list_t cmd_list[] =
|
|
|
|
{
|
|
|
|
{ "map_background", 1, Cmd_GetMapList },
|
|
|
|
{ "changelevel2", 1, Cmd_GetMapList },
|
|
|
|
{ "changelevel", 1, Cmd_GetMapList },
|
|
|
|
{ "playdemo", 1, Cmd_GetDemoList, },
|
|
|
|
{ "timedemo", 1, Cmd_GetDemoList, },
|
|
|
|
{ "playvol", 1, Cmd_GetSoundList },
|
|
|
|
{ "hpkval", 1, Cmd_GetCustomList },
|
|
|
|
{ "hpklist", 1, Cmd_GetCustomList },
|
|
|
|
{ "hpkextract", 1, Cmd_GetCustomList },
|
|
|
|
{ "entpatch", 1, Cmd_GetMapList },
|
|
|
|
{ "music", 1, Cmd_GetMusicList, },
|
|
|
|
{ "movie", 1, Cmd_GetMovieList },
|
|
|
|
{ "exec", 1, Cmd_GetConfigList },
|
|
|
|
#if !XASH_DEDICATED
|
|
|
|
{ "give", 1, Cmd_GetItemsList },
|
|
|
|
{ "drop", 1, Cmd_GetItemsList },
|
|
|
|
{ "bind", 1, Cmd_GetKeysList },
|
|
|
|
{ "unbind", 1, Cmd_GetKeysList },
|
|
|
|
{ "bind", 2, Cmd_GetCommandsList },
|
|
|
|
#endif
|
|
|
|
{ "game", 1, Cmd_GetGamesList },
|
|
|
|
{ "save", 1, Cmd_GetSavesList },
|
|
|
|
{ "load", 1, Cmd_GetSavesList },
|
|
|
|
{ "play", 1, Cmd_GetSoundList },
|
|
|
|
{ "map", 1, Cmd_GetMapList },
|
|
|
|
{ "cd", 1, Cmd_GetCDList },
|
|
|
|
{ NULL }, // termiantor
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Cmd_CheckName
|
|
|
|
|
|
|
|
compare first argument with string
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
static qboolean Cmd_CheckName( const char *name )
|
|
|
|
{
|
|
|
|
if( !Q_stricmp( Cmd_Argv( 0 ), name ))
|
|
|
|
return true;
|
|
|
|
if( !Q_stricmp( Cmd_Argv( 0 ), va( "\\%s", name )))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
============
|
|
|
|
Cmd_AutocompleteName
|
|
|
|
|
|
|
|
Autocomplete filename
|
|
|
|
for various cmds
|
|
|
|
============
|
|
|
|
*/
|
|
|
|
qboolean Cmd_AutocompleteName( const char *source, int arg, char *buffer, size_t bufsize )
|
|
|
|
{
|
|
|
|
autocomplete_list_t *list;
|
|
|
|
|
|
|
|
for( list = cmd_list; list->name; list++ )
|
|
|
|
{
|
|
|
|
if( list->arg == arg && Cmd_CheckName( list->name ))
|
|
|
|
return list->func( source, buffer, bufsize );
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Con_PrintCmdMatches
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
static void Con_PrintCmdMatches( const char *s, const char *unused1, const char *m, void *unused2 )
|
|
|
|
{
|
|
|
|
if( !Q_strnicmp( s, con.shortestMatch, Q_strlen( con.shortestMatch ) ) )
|
|
|
|
{
|
|
|
|
if( COM_CheckString( m ) ) Con_Printf( " %s ^3\"%s\"\n", s, m );
|
|
|
|
else Con_Printf( " %s\n", s ); // variable or command without description
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Con_PrintCvarMatches
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
static void Con_PrintCvarMatches( const char *s, const char *value, const char *m, void *unused2 )
|
|
|
|
{
|
|
|
|
if( !Q_strnicmp( s, con.shortestMatch, Q_strlen( con.shortestMatch ) ) )
|
|
|
|
{
|
|
|
|
if( COM_CheckString( m ) ) Con_Printf( " %s (%s) ^3\"%s\"\n", s, value, m );
|
|
|
|
else Con_Printf( " %s (%s)\n", s, value ); // variable or command without description
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Con_ConcatRemaining
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
static void Con_ConcatRemaining( const char *src, const char *start )
|
|
|
|
{
|
|
|
|
const char *arg;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
arg = Q_strstr( src, start );
|
|
|
|
|
|
|
|
if( !arg )
|
|
|
|
{
|
|
|
|
for( i = 1; i < Cmd_Argc(); i++ )
|
|
|
|
{
|
|
|
|
Q_strncat( con.completionField->buffer, " ", sizeof( con.completionField->buffer ) );
|
|
|
|
arg = Cmd_Argv( i );
|
|
|
|
while( *arg )
|
|
|
|
{
|
|
|
|
if( *arg == ' ' )
|
|
|
|
{
|
|
|
|
Q_strncat( con.completionField->buffer, "\"", sizeof( con.completionField->buffer ) );
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
arg++;
|
|
|
|
}
|
|
|
|
|
|
|
|
Q_strncat( con.completionField->buffer, Cmd_Argv( i ), sizeof( con.completionField->buffer ) );
|
|
|
|
if( *arg == ' ' ) Q_strncat( con.completionField->buffer, "\"", sizeof( con.completionField->buffer ) );
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
arg += Q_strlen( start );
|
|
|
|
Q_strncat( con.completionField->buffer, arg, sizeof( con.completionField->buffer ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Con_CompleteCommand
|
|
|
|
|
|
|
|
perform Tab expansion
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
void Con_CompleteCommand( field_t *field )
|
|
|
|
{
|
|
|
|
field_t temp;
|
|
|
|
string filename;
|
|
|
|
qboolean nextcmd;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
// setup the completion field
|
|
|
|
con.completionField = field;
|
|
|
|
|
|
|
|
// only look at the first token for completion purposes
|
|
|
|
Cmd_TokenizeString( con.completionField->buffer );
|
|
|
|
|
|
|
|
nextcmd = (con.completionField->buffer[Q_strlen( con.completionField->buffer ) - 1] == ' ') ? true : false;
|
|
|
|
|
|
|
|
con.completionString = Cmd_Argv( 0 );
|
|
|
|
|
|
|
|
// skip backslash
|
|
|
|
while( *con.completionString && (*con.completionString == '\\' || *con.completionString == '/') )
|
|
|
|
con.completionString++;
|
|
|
|
|
|
|
|
if( !COM_CheckStringEmpty( con.completionString ) )
|
|
|
|
return;
|
|
|
|
|
|
|
|
// free the old autocomplete list
|
|
|
|
for( i = 0; i < con.matchCount; i++ )
|
|
|
|
{
|
|
|
|
if( con.cmds[i] != NULL )
|
|
|
|
{
|
|
|
|
Mem_Free( con.cmds[i] );
|
|
|
|
con.cmds[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
con.matchCount = 0;
|
|
|
|
con.shortestMatch[0] = 0;
|
|
|
|
|
|
|
|
// find matching commands and variables
|
|
|
|
Cmd_LookupCmds( NULL, &con, (setpair_t)Con_AddCommandToList );
|
|
|
|
Cvar_LookupVars( 0, NULL, &con, (setpair_t)Con_AddCommandToList );
|
|
|
|
|
|
|
|
if( !con.matchCount ) return; // no matches
|
|
|
|
|
|
|
|
memcpy( &temp, con.completionField, sizeof( field_t ) );
|
|
|
|
|
|
|
|
// autocomplete second arg
|
|
|
|
if( (Cmd_Argc() >= 2) || ((Cmd_Argc() == 1) && nextcmd) )
|
|
|
|
{
|
|
|
|
con.completionBuffer = Cmd_Argv( Cmd_Argc() - 1 );
|
|
|
|
|
|
|
|
// skip backslash
|
|
|
|
while( *con.completionBuffer && (*con.completionBuffer == '\\' || *con.completionBuffer == '/') )
|
|
|
|
con.completionBuffer++;
|
|
|
|
|
|
|
|
if( !COM_CheckStringEmpty( con.completionBuffer ) )
|
|
|
|
return;
|
|
|
|
|
|
|
|
if( Cmd_AutocompleteName( con.completionBuffer, Cmd_Argc() - 1, filename, sizeof( filename ) ) )
|
|
|
|
{
|
|
|
|
con.completionField->buffer[0] = 0;
|
|
|
|
|
|
|
|
for( i = 0; i < Cmd_Argc() - 1; i++ )
|
|
|
|
{
|
|
|
|
Q_strncat( con.completionField->buffer, Cmd_Argv( i ), sizeof( con.completionField->buffer ));
|
|
|
|
Q_strncat( con.completionField->buffer, " ", sizeof( con.completionField->buffer ));
|
|
|
|
}
|
|
|
|
Q_strncat( con.completionField->buffer, filename, sizeof( con.completionField->buffer ));
|
|
|
|
con.completionField->cursor = Q_strlen( con.completionField->buffer );
|
|
|
|
}
|
|
|
|
|
|
|
|
// don't adjusting cursor pos if we nothing found
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( con.matchCount == 1 )
|
|
|
|
{
|
|
|
|
Q_sprintf( con.completionField->buffer, "\\%s", con.cmds[0] );
|
|
|
|
if( Cmd_Argc() == 1 ) Q_strncat( con.completionField->buffer, " ", sizeof( con.completionField->buffer ) );
|
|
|
|
else Con_ConcatRemaining( temp.buffer, con.completionString );
|
|
|
|
con.completionField->cursor = Q_strlen( con.completionField->buffer );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
char *first, *last;
|
|
|
|
int len = 0;
|
|
|
|
|
|
|
|
qsort( con.cmds, con.matchCount, sizeof( char* ), Con_SortCmds );
|
|
|
|
|
|
|
|
// find the number of matching characters between the first and
|
|
|
|
// the last element in the list and copy it
|
|
|
|
first = con.cmds[0];
|
|
|
|
last = con.cmds[con.matchCount - 1];
|
|
|
|
|
|
|
|
while( *first && *last && Q_tolower( *first ) == Q_tolower( *last ) )
|
|
|
|
{
|
|
|
|
first++;
|
|
|
|
last++;
|
|
|
|
|
|
|
|
con.shortestMatch[len] = con.cmds[0][len];
|
|
|
|
len++;
|
|
|
|
}
|
|
|
|
con.shortestMatch[len] = 0;
|
|
|
|
|
|
|
|
// multiple matches, complete to shortest
|
|
|
|
Q_sprintf( con.completionField->buffer, "\\%s", con.shortestMatch );
|
|
|
|
con.completionField->cursor = Q_strlen( con.completionField->buffer );
|
|
|
|
Con_ConcatRemaining( temp.buffer, con.completionString );
|
|
|
|
|
|
|
|
Con_Printf( "]%s\n", con.completionField->buffer );
|
|
|
|
|
|
|
|
// run through again, printing matches
|
|
|
|
Cmd_LookupCmds( NULL, NULL, (setpair_t)Con_PrintCmdMatches );
|
|
|
|
Cvar_LookupVars( 0, NULL, NULL, (setpair_t)Con_PrintCvarMatches );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
=========
|
|
|
|
Cmd_AutoComplete
|
|
|
|
|
|
|
|
NOTE: input string must be equal or longer than MAX_STRING
|
|
|
|
=========
|
|
|
|
*/
|
|
|
|
void Cmd_AutoComplete( char *complete_string )
|
|
|
|
{
|
|
|
|
field_t input;
|
|
|
|
|
|
|
|
if( !complete_string || !*complete_string )
|
|
|
|
return;
|
|
|
|
|
|
|
|
// setup input
|
|
|
|
Q_strncpy( input.buffer, complete_string, sizeof( input.buffer ) );
|
|
|
|
input.cursor = input.scroll = 0;
|
|
|
|
|
|
|
|
Con_CompleteCommand( &input );
|
|
|
|
|
|
|
|
// setup output
|
|
|
|
if( input.buffer[0] == '\\' || input.buffer[0] == '/' )
|
|
|
|
Q_strncpy( complete_string, input.buffer + 1, sizeof( input.buffer ) );
|
|
|
|
else Q_strncpy( complete_string, input.buffer, sizeof( input.buffer ) );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
============
|
|
|
|
Cmd_AutoCompleteClear
|
|
|
|
|
|
|
|
============
|
|
|
|
*/
|
|
|
|
void Cmd_AutoCompleteClear( void )
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
// free the old autocomplete list
|
|
|
|
for( i = 0; i < con.matchCount; i++ )
|
|
|
|
{
|
|
|
|
if( con.cmds[i] != NULL )
|
|
|
|
{
|
|
|
|
Mem_Free( con.cmds[i] );
|
|
|
|
con.cmds[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
con.matchCount = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
============
|
|
|
|
Cmd_WriteVariables
|
|
|
|
|
|
|
|
Appends lines containing "set variable value" for all variables
|
|
|
|
with the archive flag set to true.
|
|
|
|
============
|
|
|
|
*/
|
|
|
|
static void Cmd_WriteOpenGLCvar( const char *name, const char *string, const char *desc, void *f )
|
|
|
|
{
|
|
|
|
if( !COM_CheckString( desc ))
|
|
|
|
return; // ignore cvars without description (fantom variables)
|
|
|
|
FS_Printf( f, "%s \"%s\"\n", name, string );
|
|
|
|
}
|
|
|
|
|
|
|
|
static void Cmd_WriteHelp(const char *name, const char *unused, const char *desc, void *f )
|
|
|
|
{
|
|
|
|
int length;
|
|
|
|
|
|
|
|
if( !desc || !Q_strcmp( desc, "" ))
|
|
|
|
return; // ignore fantom cmds
|
|
|
|
if( name[0] == '+' || name[0] == '-' )
|
|
|
|
return; // key bindings
|
|
|
|
|
|
|
|
length = 3 - (Q_strlen( name ) / 10); // Asm_Ed default tab stop is 10
|
|
|
|
|
|
|
|
if( length == 3 ) FS_Printf( f, "%s\t\t\t\"%s\"\n", name, desc );
|
|
|
|
if( length == 2 ) FS_Printf( f, "%s\t\t\"%s\"\n", name, desc );
|
|
|
|
if( length == 1 ) FS_Printf( f, "%s\t\"%s\"\n", name, desc );
|
|
|
|
if( length == 0 ) FS_Printf( f, "%s \"%s\"\n", name, desc );
|
|
|
|
}
|
|
|
|
|
|
|
|
void Cmd_WriteOpenGLVariables( file_t *f )
|
|
|
|
{
|
|
|
|
Cvar_LookupVars( FCVAR_GLCONFIG, NULL, f, (setpair_t)Cmd_WriteOpenGLCvar );
|
|
|
|
}
|
|
|
|
|
|
|
|
#if !XASH_DEDICATED
|
|
|
|
void Host_FinalizeConfig( file_t *f, const char *config )
|
|
|
|
{
|
|
|
|
string backup, newcfg;
|
|
|
|
|
|
|
|
Q_snprintf( backup, sizeof( backup ), "%s.bak", config );
|
|
|
|
Q_snprintf( newcfg, sizeof( newcfg ), "%s.new", config );
|
|
|
|
|
|
|
|
FS_Printf( f, "// end of %s\n", config );
|
|
|
|
FS_Close( f );
|
|
|
|
FS_Delete( backup );
|
|
|
|
FS_Rename( config, backup );
|
|
|
|
FS_Delete( config );
|
|
|
|
FS_Rename( newcfg, config );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Host_WriteConfig
|
|
|
|
|
|
|
|
Writes key bindings and archived cvars to config.cfg
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
void Host_WriteConfig( void )
|
|
|
|
{
|
|
|
|
kbutton_t *mlook = NULL;
|
|
|
|
kbutton_t *jlook = NULL;
|
|
|
|
file_t *f;
|
|
|
|
|
|
|
|
if( !clgame.hInstance || Sys_CheckParm( "-nowriteconfig" ) ) return;
|
|
|
|
|
|
|
|
|
|
|
|
f = FS_Open( "config.cfg.new", "w", false );
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
Con_Reportf( "Host_WriteConfig()\n" );
|
|
|
|
FS_Printf( f, "//=======================================================================\n");
|
|
|
|
FS_Printf( f, "//\t\t\tCopyright XashXT Group & Flying With Gauss %s (C)\n", Q_timestamp( TIME_YEAR_ONLY ));
|
|
|
|
FS_Printf( f, "//\t\t\tconfig.cfg - archive of cvars\n" );
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
Key_WriteBindings( f );
|
|
|
|
Cvar_WriteVariables( f, FCVAR_ARCHIVE );
|
|
|
|
Info_WriteVars( f );
|
|
|
|
|
|
|
|
if( clgame.hInstance )
|
|
|
|
{
|
|
|
|
mlook = (kbutton_t *)clgame.dllFuncs.KB_Find( "in_mlook" );
|
|
|
|
jlook = (kbutton_t *)clgame.dllFuncs.KB_Find( "in_jlook" );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( mlook && ( mlook->state & 1 ))
|
|
|
|
FS_Printf( f, "+mlook\n" );
|
|
|
|
|
|
|
|
if( jlook && ( jlook->state & 1 ))
|
|
|
|
FS_Printf( f, "+jlook\n" );
|
|
|
|
|
|
|
|
FS_Printf( f, "exec userconfig.cfg\n" );
|
|
|
|
|
|
|
|
Host_FinalizeConfig( f, "config.cfg" );
|
|
|
|
}
|
|
|
|
else Con_DPrintf( S_ERROR "Couldn't write config.cfg.\n" );
|
|
|
|
|
|
|
|
NET_SaveMasters();
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Host_WriteServerConfig
|
|
|
|
|
|
|
|
save serverinfo variables into server.cfg (using for dedicated server too)
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
void GAME_EXPORT Host_WriteServerConfig( const char *name )
|
|
|
|
{
|
|
|
|
file_t *f;
|
|
|
|
string newconfigfile;
|
|
|
|
|
|
|
|
Q_snprintf( newconfigfile, MAX_STRING, "%s.new", name );
|
|
|
|
|
|
|
|
SV_InitGameProgs(); // collect user variables
|
|
|
|
|
|
|
|
// FIXME: move this out until menu parser is done
|
|
|
|
CSCR_LoadDefaultCVars( "settings.scr" );
|
|
|
|
|
|
|
|
if(( f = FS_Open( newconfigfile, "w", false )) != NULL )
|
|
|
|
{
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
FS_Printf( f, "//\t\t\tCopyright XashXT Group & Flying With Gauss %s (C)\n", Q_timestamp( TIME_YEAR_ONLY ));
|
|
|
|
FS_Printf( f, "//\t\tgame.cfg - multiplayer server temporare config\n" );
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
|
|
|
|
Cvar_WriteVariables( f, FCVAR_SERVER );
|
|
|
|
CSCR_WriteGameCVars( f, "settings.scr" );
|
|
|
|
|
|
|
|
Host_FinalizeConfig( f, name );
|
|
|
|
}
|
|
|
|
else Con_DPrintf( S_ERROR "Couldn't write %s.\n", name );
|
|
|
|
|
|
|
|
SV_FreeGameProgs(); // release progs with all variables
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Host_WriteOpenGLConfig
|
|
|
|
|
|
|
|
save opengl variables into opengl.cfg
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
void Host_WriteOpenGLConfig( void )
|
|
|
|
{
|
|
|
|
string name;
|
|
|
|
file_t *f;
|
|
|
|
|
|
|
|
if( Sys_CheckParm( "-nowriteconfig" ) )
|
|
|
|
return;
|
|
|
|
|
|
|
|
Q_snprintf( name, sizeof( name ), "%s.cfg", ref.dllFuncs.R_GetConfigName() );
|
|
|
|
|
|
|
|
|
|
|
|
f = FS_Open( va( "%s.new", name ), "w", false );
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
Con_Reportf( "Host_WriteGLConfig()\n" );
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
FS_Printf( f, "//\t\t\tCopyright XashXT Group & Flying With Gauss %s (C)\n", Q_timestamp( TIME_YEAR_ONLY ));
|
|
|
|
FS_Printf( f, "//\t\t %s - archive of renderer implementation cvars\n", name );
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
FS_Printf( f, "\n" );
|
|
|
|
Cmd_WriteOpenGLVariables( f );
|
|
|
|
|
|
|
|
Host_FinalizeConfig( f, name );
|
|
|
|
}
|
|
|
|
else Con_DPrintf( S_ERROR "can't update %s.\n", name );
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
===============
|
|
|
|
Host_WriteVideoConfig
|
|
|
|
|
|
|
|
save render variables into video.cfg
|
|
|
|
===============
|
|
|
|
*/
|
|
|
|
void Host_WriteVideoConfig( void )
|
|
|
|
{
|
|
|
|
file_t *f;
|
|
|
|
|
|
|
|
if( Sys_CheckParm( "-nowriteconfig" ) )
|
|
|
|
return;
|
|
|
|
|
|
|
|
f = FS_Open( "video.cfg.new", "w", false );
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
Con_Reportf( "Host_WriteVideoConfig()\n" );
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
FS_Printf( f, "//\t\t\tCopyright XashXT Group & Flying With Gauss %s (C)\n", Q_timestamp( TIME_YEAR_ONLY ));
|
|
|
|
FS_Printf( f, "//\t\tvideo.cfg - archive of renderer variables\n");
|
|
|
|
FS_Printf( f, "//=======================================================================\n" );
|
|
|
|
Cvar_WriteVariables( f, FCVAR_RENDERINFO );
|
|
|
|
Host_FinalizeConfig( f, "video.cfg" );
|
|
|
|
}
|
|
|
|
else Con_DPrintf( S_ERROR "can't update video.cfg.\n" );
|
|
|
|
}
|
|
|
|
#endif // XASH_DEDICATED
|
|
|
|
|
|
|
|
void Key_EnumCmds_f( void )
|
|
|
|
{
|
|
|
|
file_t *f;
|
|
|
|
|
|
|
|
FS_AllowDirectPaths( true );
|
|
|
|
if( FS_FileExists( "../help.txt", false ))
|
|
|
|
{
|
|
|
|
Con_Printf( "help.txt already exist\n" );
|
|
|
|
FS_AllowDirectPaths( false );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
f = FS_Open( "../help.txt", "w", false );
|
|
|
|
if( f )
|
|
|
|
{
|
|
|
|
FS_Printf( f, "//=======================================================================\n");
|
|
|
|
FS_Printf( f, "//\t\t\tCopyright XashXT Group & Flying With Gauss %s (C)\n", Q_timestamp( TIME_YEAR_ONLY ));
|
|
|
|
FS_Printf( f, "//\t\thelp.txt - xash commands and console variables\n");
|
|
|
|
FS_Printf( f, "//=======================================================================\n");
|
|
|
|
|
|
|
|
FS_Printf( f, "\n\n\t\t\tconsole variables\n\n");
|
|
|
|
Cvar_LookupVars( 0, NULL, f, (setpair_t)Cmd_WriteHelp );
|
|
|
|
FS_Printf( f, "\n\n\t\t\tconsole commands\n\n");
|
|
|
|
Cmd_LookupCmds( NULL, f, (setpair_t)Cmd_WriteHelp );
|
|
|
|
FS_Printf( f, "\n\n");
|
|
|
|
FS_Close( f );
|
|
|
|
Con_Printf( "help.txt created\n" );
|
|
|
|
}
|
|
|
|
else Con_Printf( S_ERROR "couldn't write help.txt.\n");
|
|
|
|
FS_AllowDirectPaths( false );
|
|
|
|
}
|