mirror of
https://github.com/ZDoom/qzdoom.git
synced 2024-11-24 04:51:19 +00:00
fb50df2c63
surprised if this doesn't build in Linux right now. The CMakeLists.txt
were checked with MinGW and NMake, but how they fair under Linux is an
unknown to me at this time.
- Converted most sprintf (and all wsprintf) calls to either mysnprintf or
FStrings, depending on the situation.
- Changed the strings in the wbstartstruct to be FStrings.
- Changed myvsnprintf() to output nothing if count is greater than INT_MAX.
This is so that I can use a series of mysnprintf() calls and advance the
pointer for each one. Once the pointer goes beyond the end of the buffer,
the count will go negative, but since it's an unsigned type it will be
seen as excessively huge instead. This should not be a problem, as there's
no reason for ZDoom to be using text buffers larger than 2 GB anywhere.
- Ripped out the disabled bit from FGameConfigFile::MigrateOldConfig().
- Changed CalcMapName() to return an FString instead of a pointer to a static
buffer.
- Changed startmap in d_main.cpp into an FString.
- Changed CheckWarpTransMap() to take an FString& as the first argument.
- Changed d_mapname in g_level.cpp into an FString.
- Changed DoSubstitution() in ct_chat.cpp to place the substitutions in an
FString.
- Fixed: The MAPINFO parser wrote into the string buffer to construct a map
name when given a Hexen map number. This was fine with the old scanner
code, but only a happy coincidence prevents it from crashing with the new
code
- Added the 'B' conversion specifier to StringFormat::VWorker() for printing
binary numbers.
- Added CMake support for building with MinGW, MSYS, and NMake. Linux support
is probably broken until I get around to booting into Linux again. Niceties
provided over the existing Makefiles they're replacing:
* All command-line builds can use the same build system, rather than having
a separate one for MinGW and another for Linux.
* Microsoft's NMake tool is supported as a target.
* Progress meters.
* Parallel makes work from a fresh checkout without needing to be primed
first with a single-threaded make.
* Porting to other architectures should be simplified, whenever that day
comes.
- Replaced the makewad tool with zipdir. This handles the dependency tracking
itself instead of generating an external makefile to do it, since I couldn't
figure out how to generate a makefile with an external tool and include it
with a CMake-generated makefile. Where makewad used a master list of files
to generate the package file, zipdir just zips the entire contents of one or
more directories.
- Added the gdtoa package from netlib's fp library so that ZDoom's printf-style
formatting can be entirely independant of the CRT.
SVN r1082 (trunk)
110 lines
3.3 KiB
C
110 lines
3.3 KiB
C
/****************************************************************
|
|
|
|
The author of this software is David M. Gay.
|
|
|
|
Copyright (C) 2005 by David M. Gay
|
|
All Rights Reserved
|
|
|
|
Permission to use, copy, modify, and distribute this software and its
|
|
documentation for any purpose and without fee is hereby granted,
|
|
provided that the above copyright notice appear in all copies and that
|
|
both that the copyright notice and this permission notice and warranty
|
|
disclaimer appear in supporting documentation, and that the name of
|
|
the author or any of his current or former employers not be used in
|
|
advertising or publicity pertaining to distribution of the software
|
|
without specific, written prior permission.
|
|
|
|
THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN
|
|
NO EVENT SHALL THE AUTHOR OR ANY OF HIS CURRENT OR FORMER EMPLOYERS BE
|
|
LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY
|
|
DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
|
|
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
|
|
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
|
SOFTWARE.
|
|
|
|
****************************************************************/
|
|
|
|
/* Please send bug reports to David M. Gay (dmg at acm dot org,
|
|
* with " at " changed at "@" and " dot " changed to "."). */
|
|
|
|
/* Program to compute quiet NaNs of various precisions (float, */
|
|
/* double, and perhaps long double) on the current system, */
|
|
/* provided the system uses binary IEEE (P754) arithmetic. */
|
|
/* Note that one system's quiet NaN may be a signaling NaN on */
|
|
/* another system. The IEEE arithmetic standards (P754, P854) */
|
|
/* do not specify how to distinguish signaling NaNs from quiet */
|
|
/* ones, and this detail varies across systems. The computed */
|
|
/* NaN values are encoded in #defines for values for an */
|
|
/* unsigned 32-bit integer type, called Ulong below, and */
|
|
/* (for long double) perhaps as unsigned short values. Once */
|
|
/* upon a time, there were PC compilers for Intel CPUs that */
|
|
/* had sizeof(long double) = 10. Are such compilers still */
|
|
/* distributed? */
|
|
|
|
#include <stdio.h>
|
|
#include "arith.h"
|
|
|
|
#ifndef Long
|
|
#define Long long
|
|
#endif
|
|
|
|
typedef unsigned Long Ulong;
|
|
|
|
#undef HAVE_IEEE
|
|
#ifdef IEEE_8087
|
|
#define _0 1
|
|
#define _1 0
|
|
#define HAVE_IEEE
|
|
#endif
|
|
#ifdef IEEE_MC68k
|
|
#define _0 0
|
|
#define _1 1
|
|
#define HAVE_IEEE
|
|
#endif
|
|
|
|
#define UL (unsigned long)
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
#ifdef HAVE_IEEE
|
|
typedef union {
|
|
float f;
|
|
double d;
|
|
Ulong L[4];
|
|
#ifndef NO_LONG_LONG
|
|
unsigned short u[5];
|
|
long double D;
|
|
#endif
|
|
} U;
|
|
U a, b, c;
|
|
int i;
|
|
|
|
a.L[0] = b.L[0] = 0x7f800000;
|
|
c.f = a.f - b.f;
|
|
printf("#define f_QNAN 0x%lx\n", UL c.L[0]);
|
|
a.L[_0] = b.L[_0] = 0x7ff00000;
|
|
a.L[_1] = b.L[_1] = 0;
|
|
c.d = a.d - b.d; /* quiet NaN */
|
|
printf("#define d_QNAN0 0x%lx\n", UL c.L[0]);
|
|
printf("#define d_QNAN1 0x%lx\n", UL c.L[1]);
|
|
#ifdef NO_LONG_LONG
|
|
for(i = 0; i < 4; i++)
|
|
printf("#define ld_QNAN%d 0xffffffff\n", i);
|
|
for(i = 0; i < 5; i++)
|
|
printf("#define ldus_QNAN%d 0xffff\n", i);
|
|
#else
|
|
b.D = c.D = a.d;
|
|
if (printf("") < 0)
|
|
c.D = 37; /* never executed; just defeat optimization */
|
|
a.L[2] = a.L[3] = 0;
|
|
a.D = b.D - c.D;
|
|
for(i = 0; i < 4; i++)
|
|
printf("#define ld_QNAN%d 0x%lx\n", i, UL a.L[i]);
|
|
for(i = 0; i < 5; i++)
|
|
printf("#define ldus_QNAN%d 0x%x\n", i, a.u[i]);
|
|
#endif
|
|
#endif /* HAVE_IEEE */
|
|
return 0;
|
|
}
|