2 Copyright (C) 1999-2006 Id Software, Inc. and contributors.
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 // q_shared.c -- stateless support routines that are included in each code dll
26 ============================================================================
30 ============================================================================
33 // malloc / free all in one place for debugging
34 extern "C" void *Com_Allocate( int bytes );
35 extern "C" void Com_Dealloc( void *ptr );
37 void Com_InitGrowList( growList_t *list, int maxElements ) {
38 list->maxElements = maxElements;
39 list->currentElements = 0;
40 list->elements = (void **)Com_Allocate( list->maxElements * sizeof( void * ) );
43 int Com_AddToGrowList( growList_t *list, void *data ) {
46 if ( list->currentElements != list->maxElements ) {
47 list->elements[list->currentElements] = data;
48 return list->currentElements++;
51 // grow, reallocate and move
54 if ( list->maxElements < 0 ) {
55 Com_Error( ERR_FATAL, "Com_AddToGrowList: maxElements = %i", list->maxElements );
58 if ( list->maxElements == 0 ) {
59 // initialize the list to hold 100 elements
60 Com_InitGrowList( list, 100 );
61 return Com_AddToGrowList( list, data );
64 list->maxElements *= 2;
66 Com_DPrintf( "Resizing growlist to %i maxElements\n", list->maxElements );
68 list->elements = (void **)Com_Allocate( list->maxElements * sizeof( void * ) );
70 if ( !list->elements ) {
71 Com_Error( ERR_DROP, "Growlist alloc failed" );
74 memcpy( list->elements, old, list->currentElements * sizeof( void * ) );
78 return Com_AddToGrowList( list, data );
81 void *Com_GrowListElement( const growList_t *list, int index ) {
82 if ( index < 0 || index >= list->currentElements ) {
83 Com_Error( ERR_DROP, "Com_GrowListElement: %i out of range of %i",
84 index, list->currentElements );
86 return list->elements[index];
89 int Com_IndexForGrowListElement( const growList_t *list, const void *element ) {
92 for ( i = 0 ; i < list->currentElements ; i++ ) {
93 if ( list->elements[i] == element ) {
100 //============================================================================
103 float Com_Clamp( float min, float max, float value ) {
118 const char *Com_StringContains( const char *str1, const char *str2, int casesensitive ) {
121 len = strlen( str1 ) - strlen( str2 );
122 for ( i = 0; i <= len; i++, str1++ ) {
123 for ( j = 0; str2[j]; j++ ) {
124 if ( casesensitive ) {
125 if ( str1[j] != str2[j] ) {
130 if ( toupper( str1[j] ) != toupper( str2[j] ) ) {
147 int Com_Filter( const char *filter, const char *name, int casesensitive ){
148 char buf[MAX_TOKEN_CHARS];
153 if ( *filter == '*' ) {
155 for ( i = 0; *filter; i++ ) {
156 if ( *filter == '*' || *filter == '?' ) {
163 if ( strlen( buf ) ) {
164 ptr = Com_StringContains( name, buf, casesensitive );
168 name = ptr + strlen( buf );
171 else if ( *filter == '?' ) {
175 else if ( *filter == '[' && *( filter + 1 ) == '[' ) {
178 else if ( *filter == '[' ) {
181 while ( *filter && !found ) {
182 if ( *filter == ']' && *( filter + 1 ) != ']' ) {
185 if ( *( filter + 1 ) == '-' && *( filter + 2 ) && ( *( filter + 2 ) != ']' || *( filter + 3 ) == ']' ) ) {
186 if ( casesensitive ) {
187 if ( *name >= *filter && *name <= *( filter + 2 ) ) {
192 if ( toupper( *name ) >= toupper( *filter ) &&
193 toupper( *name ) <= toupper( *( filter + 2 ) ) ) {
200 if ( casesensitive ) {
201 if ( *filter == *name ) {
206 if ( toupper( *filter ) == toupper( *name ) ) {
217 if ( *filter == ']' && *( filter + 1 ) != ']' ) {
226 if ( casesensitive ) {
227 if ( *filter != *name ) {
232 if ( toupper( *filter ) != toupper( *name ) ) {
250 int Com_HashString( const char *fname ) {
257 while ( fname[i] != '\0' ) {
258 letter = tolower( fname[i] );
259 if ( letter == '.' ) {
260 break; // don't include extension
262 if ( letter == '\\' ) {
263 letter = '/'; // damn path names
265 hash += (long)( letter ) * ( i + 119 );
268 hash &= ( FILE_HASH_SIZE - 1 );
278 char *Com_SkipPath( char *pathname ){
284 if ( *pathname == '/' ) {
297 void Com_StripExtension( const char *in, char *out ) {
298 while ( *in && *in != '.' ) {
310 void Com_DefaultExtension( char *path, int maxSize, const char *extension ) {
311 char oldPath[MAX_QPATH];
315 // if path doesn't have a .EXT, append extension
316 // (extension should include the .)
318 src = path + strlen( path ) - 1;
320 while ( *src != '/' && src != path ) {
322 return; // it has an extension
327 Q_strncpyz( oldPath, path, sizeof( oldPath ) );
328 Com_sprintf( path, maxSize, "%s%s", oldPath, extension );
332 ============================================================================
336 ============================================================================
339 // can't just use function pointers, or dll linkage can
340 // mess up when qcommon is included in multiple places
341 static short ( *_BigShort )( short l );
342 static short ( *_LittleShort )( short l );
343 static int ( *_BigLong )( int l );
344 static int ( *_LittleLong )( int l );
345 static float ( *_BigFloat )( float l );
346 static float ( *_LittleFloat )( float l );
348 short BigShort( short l ){return _BigShort( l ); }
349 short LittleShort( short l ) {return _LittleShort( l ); }
350 int BigLong( int l ) {return _BigLong( l ); }
351 int LittleLong( int l ) {return _LittleLong( l ); }
352 float BigFloat( float l ) {return _BigFloat( l ); }
353 float LittleFloat( float l ) {return _LittleFloat( l ); }
355 short ShortSwap( short l ){
359 b2 = ( l >> 8 ) & 255;
361 return ( b1 << 8 ) + b2;
364 short ShortNoSwap( short l ){
368 int LongSwap( int l ){
372 b2 = ( l >> 8 ) & 255;
373 b3 = ( l >> 16 ) & 255;
374 b4 = ( l >> 24 ) & 255;
376 return ( (int)b1 << 24 ) + ( (int)b2 << 16 ) + ( (int)b3 << 8 ) + b4;
379 int LongNoSwap( int l ){
383 float FloatSwap( float f ){
392 dat2.b[0] = dat1.b[3];
393 dat2.b[1] = dat1.b[2];
394 dat2.b[2] = dat1.b[1];
395 dat2.b[3] = dat1.b[0];
399 float FloatNoSwap( float f ){
408 void Swap_Init( void ){
409 byte swaptest[2] = {1,0};
411 // set the byte swapping variables in a portable manner
412 if ( *(short *)swaptest == 1 ) {
413 _BigShort = ShortSwap;
414 _LittleShort = ShortNoSwap;
416 _LittleLong = LongNoSwap;
417 _BigFloat = FloatSwap;
418 _LittleFloat = FloatNoSwap;
422 _BigShort = ShortNoSwap;
423 _LittleShort = ShortSwap;
424 _BigLong = LongNoSwap;
425 _LittleLong = LongSwap;
426 _BigFloat = FloatNoSwap;
427 _LittleFloat = FloatSwap;
437 int Com_ParseInfos( const char *buf, int max, char infos[][MAX_INFO_STRING] ) {
440 char key[MAX_TOKEN_CHARS];
445 token = Com_Parse( &buf );
449 if ( strcmp( token, "{" ) ) {
450 Com_Printf( "Missing { in info file\n" );
454 if ( count == max ) {
455 Com_Printf( "Max infos exceeded\n" );
461 token = Com_Parse( &buf );
463 Com_Printf( "Unexpected end of info file\n" );
466 if ( !strcmp( token, "}" ) ) {
469 Q_strncpyz( key, token, sizeof( key ) );
471 token = Com_ParseOnLine( &buf );
475 Info_SetValueForKey( infos[count], key, token );
486 ============================================================================
488 LIBRARY REPLACEMENT FUNCTIONS
490 ============================================================================
493 int Q_isprint( int c ){
494 if ( c >= 0x20 && c <= 0x7E ) {
500 int Q_islower( int c ){
501 if ( c >= 'a' && c <= 'z' ) {
507 int Q_isupper( int c ){
508 if ( c >= 'A' && c <= 'Z' ) {
514 int Q_isalpha( int c ){
515 if ( ( c >= 'a' && c <= 'z' ) || ( c >= 'A' && c <= 'Z' ) ) {
521 char* Q_strrchr( const char* string, int c ){
524 char *sp = (char *)0;
546 Safe strncpy that ensures a trailing zero
549 void Q_strncpyz( char *dest, const char *src, std::size_t destsize ) {
551 Com_Error( ERR_FATAL, "Q_strncpyz: NULL src" );
553 if ( destsize < 1 ) {
554 Com_Error( ERR_FATAL,"Q_strncpyz: destsize < 1" );
557 strncpy( dest, src, destsize - 1 );
558 dest[destsize - 1] = 0;
561 int Q_stricmpn( const char *s1, const char *s2, int n ) {
569 return 0; // strings are equal until end point
573 if ( c1 >= 'a' && c1 <= 'z' ) {
576 if ( c2 >= 'a' && c2 <= 'z' ) {
580 return c1 < c2 ? -1 : 1;
585 return 0; // strings are equal
588 int Q_strncmp( const char *s1, const char *s2, int n ) {
596 return 0; // strings are equal until end point
600 return c1 < c2 ? -1 : 1;
604 return 0; // strings are equal
607 int Q_stricmp( const char *s1, const char *s2 ) {
608 return Q_stricmpn( s1, s2, 99999 );
612 char *Q_strlwr( char *s1 ) {
623 char *Q_strupr( char *s1 ) {
635 // never goes past bounds or leaves without a terminating 0
636 void Q_strcat( char *dest, std::size_t size, const char *src ) {
637 auto l1 = strlen( dest );
639 Com_Error( ERR_FATAL, "Q_strcat: already overflowed" );
641 Q_strncpyz( dest + l1, src, size - l1 );
645 int Q_PrintStrlen( const char *string ) {
656 if ( Q_IsColorString( p ) ) {
668 char *Q_CleanStr( char *string ) {
675 while ( ( c = *s ) != 0 ) {
676 if ( Q_IsColorString( s ) ) {
679 else if ( c >= 0x20 && c <= 0x7E ) {
690 void QDECL Com_sprintf( char *dest, std::size_t size, const char *fmt, ... ) {
692 char bigbuffer[32000]; // big, but small enough to fit in PPC stack
694 va_start( argptr,fmt );
695 int ret = vsprintf( bigbuffer,fmt,argptr );
698 Com_Error(ERR_FATAL, "Com_sprintf: vsprintf failed");
700 auto len = static_cast<size_t>(ret);
701 if ( len >= sizeof( bigbuffer ) ) {
702 Com_Error( ERR_FATAL, "Com_sprintf: overflowed bigbuffer" );
705 Com_Printf( "Com_sprintf: overflow of %i in %i\n", len, size );
707 Q_strncpyz( dest, bigbuffer, size );
715 does a varargs printf into a temp buffer, so I don't need to have
716 varargs versions of all text functions.
717 FIXME: make this buffer size safe someday
720 char *QDECL va( const char *format, ... ) {
722 static char string[2][32000]; // in case va is called by nested functions
723 static int index = 0;
726 buf = string[index & 1];
729 va_start( argptr, format );
730 vsprintf( buf, format,argptr );
738 =====================================================================
742 =====================================================================
749 Searches the string for the given
750 key and returns the associated value, or an empty string.
751 FIXME: overflow check?
754 const char *Info_ValueForKey( const char *s, const char *key ) {
755 char pkey[MAX_INFO_KEY];
756 static char value[2][MAX_INFO_VALUE]; // use two buffers so compares
757 // work without stomping on each other
758 static int valueindex = 0;
765 if ( strlen( s ) >= MAX_INFO_STRING ) {
766 Com_Error( ERR_DROP, "Info_ValueForKey: oversize infostring" );
786 o = value[valueindex];
788 while ( *s != '\\' && *s )
794 if ( !Q_stricmp( key, pkey ) ) {
795 return value[valueindex];
812 Used to itterate through all the key/value pairs in an info string
815 void Info_NextPair( const char *( *head ), char key[MAX_INFO_KEY], char value[MAX_INFO_VALUE] ) {
828 while ( *s != '\\' ) {
840 while ( *s != '\\' && *s ) {
854 void Info_RemoveKey( char *s, const char *key ) {
856 char pkey[MAX_INFO_KEY];
857 char value[MAX_INFO_VALUE];
860 if ( strlen( s ) >= MAX_INFO_STRING ) {
861 Com_Error( ERR_DROP, "Info_RemoveKey: oversize infostring" );
864 if ( strchr( key, '\\' ) ) {
886 while ( *s != '\\' && *s )
895 if ( !strcmp( key, pkey ) ) {
896 strcpy( start, s ); // remove this part
912 Some characters are illegal in info strings because they
913 can mess up the server's parsing
916 qboolean Info_Validate( const char *s ) {
917 if ( strchr( s, '\"' ) ) {
920 if ( strchr( s, ';' ) ) {
930 Changes or adds a key/value pair
933 void Info_SetValueForKey( char *s, const char *key, const char *value ) {
934 char newi[MAX_INFO_STRING];
936 if ( strlen( s ) >= MAX_INFO_STRING ) {
937 Com_Error( ERR_DROP, "Info_SetValueForKey: oversize infostring" );
940 if ( strchr( key, '\\' ) || strchr( value, '\\' ) ) {
941 Com_Printf( "Can't use keys or values with a \\\n" );
945 if ( strchr( key, ';' ) || strchr( value, ';' ) ) {
946 Com_Printf( "Can't use keys or values with a semicolon\n" );
950 if ( strchr( key, '\"' ) || strchr( value, '\"' ) ) {
951 Com_Printf( "Can't use keys or values with a \"\n" );
955 Info_RemoveKey( s, key );
956 if ( !value || !strlen( value ) ) {
960 Com_sprintf( newi, sizeof( newi ), "\\%s\\%s", key, value );
962 if ( strlen( newi ) + strlen( s ) > MAX_INFO_STRING ) {
963 Com_Printf( "Info string length exceeded\n" );
970 //====================================================================
978 int ParseHex( const char *text ) {
983 while ( ( c = *text++ ) != 0 ) {
984 if ( c >= '0' && c <= '9' ) {
985 value = value * 16 + c - '0';
988 if ( c >= 'a' && c <= 'f' ) {
989 value = value * 16 + 10 + c - 'a';
992 if ( c >= 'A' && c <= 'F' ) {
993 value = value * 16 + 10 + c - 'A';