qf/quakeforge
0
0
Fork 0
mirror of https://git.code.sf.net/p/quake/quakeforge synced 2025-05-31 00:30:57 +00:00
Code Issues Projects Releases Packages Wiki Activity

Con_Printf -> SV_Printf for some cases that should be

Browse source
This commit is contained in:
Bill Currie 2001-10-27 22:33:42 +00:00
parent 10d83e090a
commit d62c381262
3 changed files with 8 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

2
qw/source/sv_ccmds.c
View file

@ -747,7 +747,7 @@ SV_Ban_f (void)
return; return;
} }
} }
Con_Printf ("Couldn't find user %s\n", Cmd_Argv(1)); SV_Printf ("Couldn't find user %s\n", Cmd_Argv(1));
} }
void void

10
qw/source/sv_main.c
View file

@ -887,7 +887,7 @@ SVC_DirectConnect (void)
SV_Printf ("Spectator %s (%s) connected\n", newcl->name, SV_Printf ("Spectator %s (%s) connected\n", newcl->name,
NET_AdrToString (adr)); NET_AdrToString (adr));
else else
Con_Printf ("Client %s (%s) connected\n", newcl->name, SV_Printf ("Client %s (%s) connected\n", newcl->name,
NET_AdrToString (adr)); NET_AdrToString (adr));
newcl->sendinfo = true; newcl->sendinfo = true;
@ -1624,16 +1624,16 @@ SV_SavePenaltyFilter (client_t *cl, filtertype_t type, double pentime)
for (i = 0; i < numipfilters; i++) for (i = 0; i < numipfilters; i++)
if (ipfilters[i].mask == 32 && SV_IPCompare (ipfilters[i].ip, b) if (ipfilters[i].mask == 32 && SV_IPCompare (ipfilters[i].ip, b)
&& ipfilters[i].type == type) { && ipfilters[i].type == type) {
Con_Printf ("Penalty for user %d already exists\n", cl->userid); SV_Printf ("Penalty for user %d already exists\n", cl->userid);
return; return;
} }
if (numipfilters == MAX_IPFILTERS) { if (numipfilters == MAX_IPFILTERS) {
Con_Printf ("IP filter list is full\n"); SV_Printf ("IP filter list is full\n");
return; return;
} }
Con_Printf ("Penalty saved for user %d\n", cl->userid); SV_Printf ("Penalty saved for user %d\n", cl->userid);
ipfilters[numipfilters].mask = 32; ipfilters[numipfilters].mask = 32;
SV_IPCopy (ipfilters[numipfilters].ip, b); SV_IPCopy (ipfilters[numipfilters].ip, b);
ipfilters[numipfilters].time = pentime; ipfilters[numipfilters].time = pentime;
@ -1653,7 +1653,7 @@ SV_RestorePenaltyFilter (client_t *cl, filtertype_t type)
// search for existing penalty filter of same type // search for existing penalty filter of same type
for (i = 0; i < numipfilters; i++) { for (i = 0; i < numipfilters; i++) {
if (type == ipfilters[i].type && SV_IPCompare (ip, ipfilters[i].ip)) { if (type == ipfilters[i].type && SV_IPCompare (ip, ipfilters[i].ip)) {
Con_Printf ("Penalty restored for user %d\n", cl->userid); SV_Printf ("Penalty restored for user %d\n", cl->userid);
return ipfilters[i].time; return ipfilters[i].time;
} }
} }

4
qw/source/sv_pr_cmds.c
View file

@ -1541,7 +1541,7 @@ PF_rotate_bbox (progs_t *pr)
VectorCopy (v[0], ch->mins); VectorCopy (v[0], ch->mins);
VectorCopy (v[0], ch->maxs); VectorCopy (v[0], ch->maxs);
for (i = 0; i < 8; i++) { for (i = 0; i < 8; i++) {
//Con_Printf ("'%0.1f %0.1f %0.1f'\n", v[i][0], v[i][1], v[i][2]); //SV_Printf ("'%0.1f %0.1f %0.1f'\n", v[i][0], v[i][1], v[i][2]);
for (j = 0; j < 3; j++) { for (j = 0; j < 3; j++) {
ch->mins[j] = min (ch->mins[j], v[i][j]); ch->mins[j] = min (ch->mins[j], v[i][j]);
ch->maxs[j] = max (ch->maxs[j], v[i][j]); ch->maxs[j] = max (ch->maxs[j], v[i][j]);
@ -1559,7 +1559,7 @@ PF_rotate_bbox (progs_t *pr)
offsets[j]); offsets[j]);
hull->planes[i].type = 4; hull->planes[i].type = 4;
VectorCopy (dir[i / 2], hull->planes[i].normal); VectorCopy (dir[i / 2], hull->planes[i].normal);
// Con_Printf ("%f %f %f %f\n", // SV_Printf ("%f %f %f %f\n",
// hull->planes[i].dist, // hull->planes[i].dist,
// hull->planes[i].normal[0], hull->planes[i].normal[1], // hull->planes[i].normal[0], hull->planes[i].normal[1],
// hull->planes[i].normal[2]); // hull->planes[i].normal[2]);