mirror of
https://github.com/UberGames/lilium-voyager.git
synced 2024-11-10 06:31:47 +00:00
commit
2c225a5a2b
3 changed files with 4 additions and 4 deletions
|
@ -815,7 +815,7 @@ void G_Damage( gentity_t *targ, gentity_t *inflictor, gentity_t *attacker,
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
// the intermission has allready been qualified for, so don't
|
// the intermission has already been qualified for, so don't
|
||||||
// allow any extra scoring
|
// allow any extra scoring
|
||||||
if ( level.intermissionQueued ) {
|
if ( level.intermissionQueued ) {
|
||||||
return;
|
return;
|
||||||
|
|
|
@ -868,7 +868,7 @@ void CM_AddFacetBevels( facet_t *facet ) {
|
||||||
if (CM_PlaneEqual(&planes[facet->surfacePlane], plane, &flipped)) {
|
if (CM_PlaneEqual(&planes[facet->surfacePlane], plane, &flipped)) {
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
// see if the plane is allready present
|
// see if the plane is already present
|
||||||
for ( i = 0 ; i < facet->numBorders ; i++ ) {
|
for ( i = 0 ; i < facet->numBorders ; i++ ) {
|
||||||
if (CM_PlaneEqual(&planes[facet->borderPlanes[i]], plane, &flipped))
|
if (CM_PlaneEqual(&planes[facet->borderPlanes[i]], plane, &flipped))
|
||||||
break;
|
break;
|
||||||
|
@ -932,7 +932,7 @@ void CM_AddFacetBevels( facet_t *facet ) {
|
||||||
if (CM_PlaneEqual(&planes[facet->surfacePlane], plane, &flipped)) {
|
if (CM_PlaneEqual(&planes[facet->surfacePlane], plane, &flipped)) {
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
// see if the plane is allready present
|
// see if the plane is already present
|
||||||
for ( i = 0 ; i < facet->numBorders ; i++ ) {
|
for ( i = 0 ; i < facet->numBorders ; i++ ) {
|
||||||
if (CM_PlaneEqual(&planes[facet->borderPlanes[i]], plane, &flipped)) {
|
if (CM_PlaneEqual(&planes[facet->borderPlanes[i]], plane, &flipped)) {
|
||||||
break;
|
break;
|
||||||
|
|
|
@ -2206,7 +2206,7 @@ static int FS_AddFileToList( char *name, char *list[MAX_FOUND_FILES], int nfiles
|
||||||
}
|
}
|
||||||
for ( i = 0 ; i < nfiles ; i++ ) {
|
for ( i = 0 ; i < nfiles ; i++ ) {
|
||||||
if ( !Q_stricmp( name, list[i] ) ) {
|
if ( !Q_stricmp( name, list[i] ) ) {
|
||||||
return nfiles; // allready in list
|
return nfiles; // already in list
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
list[nfiles] = CopyString( name );
|
list[nfiles] = CopyString( name );
|
||||||
|
|
Loading…
Reference in a new issue