This is an automated email from the git hooks/post-receive script.
smcv pushed a commit to tag 1.51
in repository iortcw.
commit 5ff952f6e9a83d2df83cf9b4c46472fb1fbc0bf6
Author: MAN-AT-ARMS <m4n4t4...@gmail.com>
Date: Wed Jan 25 17:23:27 2017 -0500
All: Don't use mostly obsolete 'register' keyword
---
MP/code/botlib/l_precomp.c | 2 +-
MP/code/game/bg_lib.c | 12 ++++++------
MP/code/qcommon/md5.c | 2 +-
MP/code/qcommon/vm_interpreted.c | 4 ++--
MP/code/renderer/tr_surface.c | 4 ++--
MP/code/tools/lcc/cpp/lex.c | 6 +++---
MP/code/ui/ui_shared.c | 2 +-
SP/code/botlib/l_precomp.c | 2 +-
SP/code/game/bg_lib.c | 18 +++++++++---------
SP/code/qcommon/md5.c | 2 +-
SP/code/qcommon/vm_interpreted.c | 4 ++--
SP/code/renderer/tr_surface.c | 4 ++--
SP/code/tools/lcc/cpp/lex.c | 6 +++---
SP/code/ui/ui_shared.c | 2 +-
14 files changed, 35 insertions(+), 35 deletions(-)
diff --git a/MP/code/botlib/l_precomp.c b/MP/code/botlib/l_precomp.c
index eac3221..f2d756a 100644
--- a/MP/code/botlib/l_precomp.c
+++ b/MP/code/botlib/l_precomp.c
@@ -541,7 +541,7 @@ void PC_PrintDefineHashTable( define_t **definehash ) {
//char primes[16] = {1, 3, 5, 7, 11, 13, 17, 19, 23, 27, 29, 31, 37, 41, 43,
47};
int PC_NameHash( char *name ) {
- int register hash, i;
+ int hash, i;
hash = 0;
for ( i = 0; name[i] != '\0'; i++ )
diff --git a/MP/code/game/bg_lib.c b/MP/code/game/bg_lib.c
index 635c14b..f438a77 100644
--- a/MP/code/game/bg_lib.c
+++ b/MP/code/game/bg_lib.c
@@ -51,12 +51,12 @@ static void swapfunc(char *, char *, int, int);
/*
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
*/
-#define swapcode(TYPE, parmi, parmj, n) { \
- long i = (n) / sizeof (TYPE); \
- register TYPE *pi = (TYPE *) (parmi); \
- register TYPE *pj = (TYPE *) (parmj); \
- do { \
- register TYPE t = *pi; \
+#define swapcode(TYPE, parmi, parmj, n) { \
+ long i = (n) / sizeof (TYPE); \
+ TYPE *pi = (TYPE *) (parmi); \
+ TYPE *pj = (TYPE *) (parmj); \
+ do { \
+ TYPE t = *pi; \
*pi++ = *pj; \
*pj++ = t; \
} while (--i > 0); \
diff --git a/MP/code/qcommon/md5.c b/MP/code/qcommon/md5.c
index 4396fa1..51ef2bb 100644
--- a/MP/code/qcommon/md5.c
+++ b/MP/code/qcommon/md5.c
@@ -80,7 +80,7 @@ static void MD5Init(struct MD5Context *ctx)
static void MD5Transform(uint32_t buf[4],
uint32_t const in[16])
{
- register uint32_t a, b, c, d;
+ uint32_t a, b, c, d;
a = buf[0];
b = buf[1];
diff --git a/MP/code/qcommon/vm_interpreted.c b/MP/code/qcommon/vm_interpreted.c
index aa45fde..f630d05 100644
--- a/MP/code/qcommon/vm_interpreted.c
+++ b/MP/code/qcommon/vm_interpreted.c
@@ -317,8 +317,8 @@ locals from sp
int VM_CallInterpreted( vm_t *vm, int *args ) {
byte stack[OPSTACK_SIZE + 15];
- register int *opStack;
- register uint8_t opStackOfs;
+ int *opStack;
+ uint8_t opStackOfs;
int programCounter;
int programStack;
int stackOnEntry;
diff --git a/MP/code/renderer/tr_surface.c b/MP/code/renderer/tr_surface.c
index e051dac..8f455f1 100644
--- a/MP/code/renderer/tr_surface.c
+++ b/MP/code/renderer/tr_surface.c
@@ -608,8 +608,8 @@ static void VectorArrayNormalize( vec4_t *normals, unsigned
int count ) {
#if idppc
{
- register float half = 0.5;
- register float one = 1.0;
+ float half = 0.5;
+ float one = 1.0;
float *components = (float *)normals;
// Vanilla PPC code, but since PPC has a reciprocal square root
estimate instruction,
diff --git a/MP/code/tools/lcc/cpp/lex.c b/MP/code/tools/lcc/cpp/lex.c
index 8030354..633485e 100644
--- a/MP/code/tools/lcc/cpp/lex.c
+++ b/MP/code/tools/lcc/cpp/lex.c
@@ -299,9 +299,9 @@ fixlex(void)
int
gettokens(Tokenrow *trp, int reset)
{
- register int c, state, oldstate;
- register uchar *ip;
- register Token *tp, *maxp;
+ int c, state, oldstate;
+ uchar *ip;
+ Token *tp, *maxp;
int runelen;
Source *s = cursource;
int nmac = 0;
diff --git a/MP/code/ui/ui_shared.c b/MP/code/ui/ui_shared.c
index 4454893..9a1ef40 100644
--- a/MP/code/ui/ui_shared.c
+++ b/MP/code/ui/ui_shared.c
@@ -4936,7 +4936,7 @@ typedef struct keywordHash_s
} keywordHash_t;
int KeywordHash_Key( char *keyword ) {
- int register hash, i;
+ int hash, i;
hash = 0;
for ( i = 0; keyword[i] != '\0'; i++ ) {
diff --git a/SP/code/botlib/l_precomp.c b/SP/code/botlib/l_precomp.c
index c11d12a..8252908 100644
--- a/SP/code/botlib/l_precomp.c
+++ b/SP/code/botlib/l_precomp.c
@@ -535,7 +535,7 @@ void PC_PrintDefineHashTable( define_t **definehash ) {
//char primes[16] = {1, 3, 5, 7, 11, 13, 17, 19, 23, 27, 29, 31, 37, 41, 43,
47};
int PC_NameHash( char *name ) {
- int register hash, i;
+ int hash, i;
hash = 0;
for ( i = 0; name[i] != '\0'; i++ )
diff --git a/SP/code/game/bg_lib.c b/SP/code/game/bg_lib.c
index e8c2299..19c786c 100644
--- a/SP/code/game/bg_lib.c
+++ b/SP/code/game/bg_lib.c
@@ -77,15 +77,15 @@ static void swapfunc( char *, char *, int, int );
/*
* Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
*/
-#define swapcode( TYPE, parmi, parmj, n ) { \
- long i = ( n ) / sizeof( TYPE ); \
- register TYPE *pi = (TYPE *) ( parmi ); \
- register TYPE *pj = (TYPE *) ( parmj ); \
- do { \
- register TYPE t = *pi; \
- *pi++ = *pj; \
- *pj++ = t; \
- } while ( --i > 0 ); \
+#define swapcode( TYPE, parmi, parmj, n ) { \
+ long i = ( n ) / sizeof( TYPE ); \
+ TYPE *pi = (TYPE *) ( parmi ); \
+ TYPE *pj = (TYPE *) ( parmj ); \
+ do { \
+ TYPE t = *pi; \
+ *pi++ = *pj; \
+ *pj++ = t; \
+ } while ( --i > 0 ); \
}
#define SWAPINIT( a, es ) swaptype = ( (char *)a - (char *)0 ) % sizeof( long
) || \
diff --git a/SP/code/qcommon/md5.c b/SP/code/qcommon/md5.c
index 994083f..d47560e 100644
--- a/SP/code/qcommon/md5.c
+++ b/SP/code/qcommon/md5.c
@@ -78,7 +78,7 @@ static void MD5Init(struct MD5Context *ctx)
static void MD5Transform(uint32_t buf[4],
uint32_t const in[16])
{
- register uint32_t a, b, c, d;
+ uint32_t a, b, c, d;
a = buf[0];
b = buf[1];
diff --git a/SP/code/qcommon/vm_interpreted.c b/SP/code/qcommon/vm_interpreted.c
index aa45fde..f630d05 100644
--- a/SP/code/qcommon/vm_interpreted.c
+++ b/SP/code/qcommon/vm_interpreted.c
@@ -317,8 +317,8 @@ locals from sp
int VM_CallInterpreted( vm_t *vm, int *args ) {
byte stack[OPSTACK_SIZE + 15];
- register int *opStack;
- register uint8_t opStackOfs;
+ int *opStack;
+ uint8_t opStackOfs;
int programCounter;
int programStack;
int stackOnEntry;
diff --git a/SP/code/renderer/tr_surface.c b/SP/code/renderer/tr_surface.c
index 671ac38..536263d 100644
--- a/SP/code/renderer/tr_surface.c
+++ b/SP/code/renderer/tr_surface.c
@@ -608,8 +608,8 @@ static void VectorArrayNormalize( vec4_t *normals, unsigned
int count ) {
#if idppc
{
- register float half = 0.5;
- register float one = 1.0;
+ float half = 0.5;
+ float one = 1.0;
float *components = (float *)normals;
// Vanilla PPC code, but since PPC has a reciprocal square root
estimate instruction,
diff --git a/SP/code/tools/lcc/cpp/lex.c b/SP/code/tools/lcc/cpp/lex.c
index 8030354..633485e 100644
--- a/SP/code/tools/lcc/cpp/lex.c
+++ b/SP/code/tools/lcc/cpp/lex.c
@@ -299,9 +299,9 @@ fixlex(void)
int
gettokens(Tokenrow *trp, int reset)
{
- register int c, state, oldstate;
- register uchar *ip;
- register Token *tp, *maxp;
+ int c, state, oldstate;
+ uchar *ip;
+ Token *tp, *maxp;
int runelen;
Source *s = cursource;
int nmac = 0;
diff --git a/SP/code/ui/ui_shared.c b/SP/code/ui/ui_shared.c
index afd5278..bf62666 100644
--- a/SP/code/ui/ui_shared.c
+++ b/SP/code/ui/ui_shared.c
@@ -4873,7 +4873,7 @@ typedef struct keywordHash_s
} keywordHash_t;
int KeywordHash_Key( char *keyword ) {
- int register hash, i;
+ int hash, i;
hash = 0;
for ( i = 0; keyword[i] != '\0'; i++ ) {
--
Alioth's /usr/local/bin/git-commit-notice on
/srv/git.debian.org/git/pkg-games/iortcw.git
_______________________________________________
Pkg-games-commits mailing list
Pkg-games-commits@lists.alioth.debian.org
http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-games-commits
