X-Git-Url: http://de.git.xonotic.org/?p=xonotic%2Fdarkplaces.git;a=blobdiff_plain;f=world.c;h=1945d9066905546373c094a5c0e9d13909ece83e;hp=5880c7cfe8352242822da1f6d75264170a26bb4b;hb=ed6a552a09b67a9499b772b7a60c4e425d7090a4;hpb=6622dc0f50e46953e458b1b30505d2545ae5902b diff --git a/world.c b/world.c index 5880c7cf..1945d906 100644 --- a/world.c +++ b/world.c @@ -25,288 +25,134 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. entities never clip against themselves, or their owner -line of sight checks trace->crosscontent, but bullets don't +line of sight checks trace->inopen and trace->inwater, but bullets don't */ -/* -typedef struct link_s +cvar_t sv_debugmove = {CVAR_NOTIFY, "sv_debugmove", "0"}; +cvar_t sv_areagrid_mingridsize = {CVAR_NOTIFY, "sv_areagrid_mingridsize", "64"}; + +void SV_AreaStats_f(void); + +void SV_World_Init(void) { - struct link_s *prev, *next; -} link_t; -*/ + Cvar_RegisterVariable(&sv_debugmove); + Cvar_RegisterVariable(&sv_areagrid_mingridsize); + Cmd_AddCommand("sv_areastats", SV_AreaStats_f); + Collision_Init(); +} + +typedef struct +{ + // bounding box of entire move area + vec3_t boxmins, boxmaxs; + + // size of the moving object + vec3_t mins, maxs; + // size when clipping against monsters + vec3_t mins2, maxs2; -void ClearLink (link_t *l); -void RemoveLink (link_t *l); -void InsertLinkBefore (link_t *l, link_t *before); -void InsertLinkAfter (link_t *l, link_t *after); + // start and end origin of move + vec3_t start, end; -// (type *)STRUCT_FROM_LINK(link_t *link, type, member) -// ent = STRUCT_FROM_LINK(link,entity_t,order) -// FIXME: remove this mess! -//#define STRUCT_FROM_LINK(l,t,m) ((t *)((byte *)l - (int)&(((t *)0)->m))) + // trace results + trace_t trace; -#define EDICT_FROM_AREA(l) ((edict_t *)((byte *)l - (int)&(((edict_t *)0)->area))) + // type of move (like ignoring monsters, or similar) + int type; + + // the edict that is moving (if any) + edict_t *passedict; +} +moveclip_t; //============================================================================ // ClearLink is used for new headnodes -void ClearLink (link_t *l) +static void ClearLink (link_t *l) { + l->entitynumber = 0; l->prev = l->next = l; } -void RemoveLink (link_t *l) +static void RemoveLink (link_t *l) { l->next->prev = l->prev; l->prev->next = l->next; } -void InsertLinkBefore (link_t *l, link_t *before) +static void InsertLinkBefore (link_t *l, link_t *before, int entitynumber) { + l->entitynumber = entitynumber; l->next = before; l->prev = before->prev; l->prev->next = l; l->next->prev = l; } -void InsertLinkAfter (link_t *l, link_t *after) -{ - l->next = after->next; - l->prev = after; - l->prev->next = l; - l->next->prev = l; -} - - -typedef struct -{ - vec3_t boxmins, boxmaxs;// enclose the test object along entire move - float *mins, *maxs; // size of the moving object - vec3_t mins2, maxs2; // size when clipping against mosnters - float *start, *end; - trace_t trace; - int type; - edict_t *passedict; -} moveclip_t; /* =============================================================================== -HULL BOXES +ENTITY AREA CHECKING =============================================================================== */ +int sv_areagrid_stats_calls = 0; +int sv_areagrid_stats_nodechecks = 0; +int sv_areagrid_stats_entitychecks = 0; -static hull_t box_hull; -static dclipnode_t box_clipnodes[6]; -static mplane_t box_planes[6]; - -/* -=================== -SV_InitBoxHull - -Set up the planes and clipnodes so that the six floats of a bounding box -can just be stored out and get a proper hull_t structure. -=================== -*/ -void SV_InitBoxHull (void) +void SV_AreaStats_f(void) { - int i; - int side; - - box_hull.clipnodes = box_clipnodes; - box_hull.planes = box_planes; - box_hull.firstclipnode = 0; - box_hull.lastclipnode = 5; - - for (i=0 ; i<6 ; i++) - { - box_clipnodes[i].planenum = i; - - side = i&1; - - box_clipnodes[i].children[side] = CONTENTS_EMPTY; - if (i != 5) - box_clipnodes[i].children[side^1] = i + 1; - else - box_clipnodes[i].children[side^1] = CONTENTS_SOLID; - - box_planes[i].type = i>>1; - box_planes[i].normal[i>>1] = 1; - } - + Con_Printf("areagrid check stats: %d calls %d nodes (%f per call) %d entities (%f per call)\n", sv_areagrid_stats_calls, sv_areagrid_stats_nodechecks, (double) sv_areagrid_stats_nodechecks / (double) sv_areagrid_stats_calls, sv_areagrid_stats_entitychecks, (double) sv_areagrid_stats_entitychecks / (double) sv_areagrid_stats_calls); + sv_areagrid_stats_calls = 0; + sv_areagrid_stats_nodechecks = 0; + sv_areagrid_stats_entitychecks = 0; } - -/* -=================== -SV_HullForBox - -To keep everything totally uniform, bounding boxes are turned into small -BSP trees instead of being compared directly. -=================== -*/ -hull_t *SV_HullForBox (vec3_t mins, vec3_t maxs) +typedef struct areagrid_s { - box_planes[0].dist = maxs[0]; - box_planes[1].dist = mins[0]; - box_planes[2].dist = maxs[1]; - box_planes[3].dist = mins[1]; - box_planes[4].dist = maxs[2]; - box_planes[5].dist = mins[2]; - - return &box_hull; + link_t trigger_edicts; + link_t solid_edicts; } +areagrid_t; +#define AREA_GRID 512 +#define AREA_GRIDNODES (AREA_GRID * AREA_GRID) +static areagrid_t sv_areagrid[AREA_GRIDNODES], sv_areagrid_outside; +static vec3_t sv_areagrid_bias, sv_areagrid_scale, sv_areagrid_mins, sv_areagrid_maxs, sv_areagrid_size; +static int sv_areagrid_marknumber = 1; -/* -================ -SV_HullForEntity - -Returns a hull that can be used for testing or clipping an object of mins/maxs -size. -Offset is filled in to contain the adjustment that must be added to the -testing object's origin to get a point to use with the returned hull. -================ -*/ -hull_t *SV_HullForEntity (edict_t *ent, vec3_t mins, vec3_t maxs, vec3_t offset) +void SV_CreateAreaGrid (vec3_t mins, vec3_t maxs) { - model_t *model; - vec3_t size; - vec3_t hullmins, hullmaxs; - hull_t *hull; - -// decide which clipping hull to use, based on the size - if (ent->v.solid == SOLID_BSP) - { // explicit hulls in the BSP model - if (ent->v.movetype != MOVETYPE_PUSH) - Host_Error ("SOLID_BSP without MOVETYPE_PUSH"); - - model = sv.models[ (int)ent->v.modelindex ]; - Mod_CheckLoaded(model); - - // LordHavoc: fixed SOLID_BSP error message - if (!model || model->type != mod_brush) - { - Con_Printf ("SOLID_BSP with a non bsp model, entity dump:\n"); - ED_Print (ent); - Host_Error ("SOLID_BSP with a non bsp model\n"); - } - - VectorSubtract (maxs, mins, size); - // LordHavoc: FIXME!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! - if (sv.worldmodel->ishlbsp) - { - if (size[0] < 3) - hull = &model->hulls[0]; // 0x0x0 - else if (size[0] <= 32) - { - if (size[2] < 54) // pick the nearest of 36 or 72 - hull = &model->hulls[3]; // 32x32x36 - else - hull = &model->hulls[1]; // 32x32x72 - } - else - hull = &model->hulls[2]; // 64x64x64 - } - else - { - if (size[0] < 3) - hull = &model->hulls[0]; // 0x0x0 - else if (size[0] <= 32) - hull = &model->hulls[1]; // 32x32x56 - else - hull = &model->hulls[2]; // 64x64x88 - } - -// calculate an offset value to center the origin - VectorSubtract (hull->clip_mins, mins, offset); - VectorAdd (offset, ent->v.origin, offset); - } - else - { // create a temp hull from bounding box sizes - - VectorSubtract (ent->v.mins, maxs, hullmins); - VectorSubtract (ent->v.maxs, mins, hullmaxs); - hull = SV_HullForBox (hullmins, hullmaxs); - - VectorCopy (ent->v.origin, offset); - } - - - return hull; -} - -/* -=============================================================================== - -ENTITY AREA CHECKING - -=============================================================================== -*/ - -typedef struct areanode_s -{ - int axis; // -1 = leaf node - float dist; - struct areanode_s *children[2]; - link_t trigger_edicts; - link_t solid_edicts; -} areanode_t; - -#define AREA_DEPTH 4 -#define AREA_NODES 32 - -static areanode_t sv_areanodes[AREA_NODES]; -static int sv_numareanodes; - -/* -=============== -SV_CreateAreaNode - -=============== -*/ -areanode_t *SV_CreateAreaNode (int depth, vec3_t mins, vec3_t maxs) -{ - areanode_t *anode; - vec3_t size; - vec3_t mins1, maxs1, mins2, maxs2; - - anode = &sv_areanodes[sv_numareanodes]; - sv_numareanodes++; - - ClearLink (&anode->trigger_edicts); - ClearLink (&anode->solid_edicts); - - if (depth == AREA_DEPTH) - { - anode->axis = -1; - anode->children[0] = anode->children[1] = NULL; - return anode; - } - - VectorSubtract (maxs, mins, size); - if (size[0] > size[1]) - anode->axis = 0; - else - anode->axis = 1; - - anode->dist = 0.5 * (maxs[anode->axis] + mins[anode->axis]); - VectorCopy (mins, mins1); - VectorCopy (mins, mins2); - VectorCopy (maxs, maxs1); - VectorCopy (maxs, maxs2); - - maxs1[anode->axis] = mins2[anode->axis] = anode->dist; - - anode->children[0] = SV_CreateAreaNode (depth+1, mins2, maxs2); - anode->children[1] = SV_CreateAreaNode (depth+1, mins1, maxs1); - - return anode; + int i; + ClearLink (&sv_areagrid_outside.trigger_edicts); + ClearLink (&sv_areagrid_outside.solid_edicts); + // choose either the world box size, or a larger box to ensure the grid isn't too fine + sv_areagrid_size[0] = max(maxs[0] - mins[0], AREA_GRID * sv_areagrid_mingridsize.value); + sv_areagrid_size[1] = max(maxs[1] - mins[1], AREA_GRID * sv_areagrid_mingridsize.value); + sv_areagrid_size[2] = max(maxs[2] - mins[2], AREA_GRID * sv_areagrid_mingridsize.value); + // figure out the corners of such a box, centered at the center of the world box + sv_areagrid_mins[0] = (mins[0] + maxs[0] - sv_areagrid_size[0]) * 0.5f; + sv_areagrid_mins[1] = (mins[1] + maxs[1] - sv_areagrid_size[1]) * 0.5f; + sv_areagrid_mins[2] = (mins[2] + maxs[2] - sv_areagrid_size[2]) * 0.5f; + sv_areagrid_maxs[0] = (mins[0] + maxs[0] + sv_areagrid_size[0]) * 0.5f; + sv_areagrid_maxs[1] = (mins[1] + maxs[1] + sv_areagrid_size[1]) * 0.5f; + sv_areagrid_maxs[2] = (mins[2] + maxs[2] + sv_areagrid_size[2]) * 0.5f; + // now calculate the actual useful info from that + VectorNegate(sv_areagrid_mins, sv_areagrid_bias); + sv_areagrid_scale[0] = AREA_GRID / sv_areagrid_size[0]; + sv_areagrid_scale[1] = AREA_GRID / sv_areagrid_size[1]; + sv_areagrid_scale[2] = AREA_GRID / sv_areagrid_size[2]; + for (i = 0;i < AREA_GRIDNODES;i++) + { + ClearLink (&sv_areagrid[i].trigger_edicts); + ClearLink (&sv_areagrid[i].solid_edicts); + } + Con_DPrintf("sv_areagrid settings: divisions %ix%ix1 : box %f %f %f : %f %f %f size %f %f %f grid %f %f %f (mingrid %f)\n", AREA_GRID, AREA_GRID, sv_areagrid_mins[0], sv_areagrid_mins[1], sv_areagrid_mins[2], sv_areagrid_maxs[0], sv_areagrid_maxs[1], sv_areagrid_maxs[2], sv_areagrid_size[0], sv_areagrid_size[1], sv_areagrid_size[2], 1.0f / sv_areagrid_scale[0], 1.0f / sv_areagrid_scale[1], 1.0f / sv_areagrid_scale[2], sv_areagrid_mingridsize.value); } /* @@ -317,12 +163,8 @@ SV_ClearWorld */ void SV_ClearWorld (void) { - SV_InitBoxHull (); - - memset (sv_areanodes, 0, sizeof(sv_areanodes)); - sv_numareanodes = 0; Mod_CheckLoaded(sv.worldmodel); - SV_CreateAreaNode (0, sv.worldmodel->normalmins, sv.worldmodel->normalmaxs); + SV_CreateAreaGrid(sv.worldmodel->normalmins, sv.worldmodel->normalmaxs); } @@ -334,78 +176,118 @@ SV_UnlinkEdict */ void SV_UnlinkEdict (edict_t *ent) { - if (!ent->area.prev) - return; // not linked in anywhere - RemoveLink (&ent->area); - ent->area.prev = ent->area.next = NULL; + int i; + for (i = 0;i < ENTITYGRIDAREAS;i++) + { + if (ent->e->areagrid[i].prev) + { + RemoveLink (&ent->e->areagrid[i]); + ent->e->areagrid[i].prev = ent->e->areagrid[i].next = NULL; + } + } } -/* -==================== -SV_TouchLinks -==================== -*/ -void SV_TouchLinks ( edict_t *ent, areanode_t *node ) +void SV_TouchAreaGrid(edict_t *ent) { - link_t *l, *next; - edict_t *touch; - int old_self, old_other; - -loc0: -// touch linked edicts - for (l = node->trigger_edicts.next ; l != &node->trigger_edicts ; l = next) - { - next = l->next; - touch = EDICT_FROM_AREA(l); - if (touch == ent) + link_t *l; + edict_t *touch; + areagrid_t *grid; + int old_self, old_other, igrid[3], igridmins[3], igridmaxs[3]; + int i, numtouchedicts; + unsigned short touchedictnumbers[MAX_EDICTS]; + + sv_areagrid_marknumber++; + igridmins[0] = (int) ((ent->v->absmin[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]); + igridmins[1] = (int) ((ent->v->absmin[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]); + //igridmins[2] = (int) ((ent->v->absmin[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]); + igridmaxs[0] = (int) ((ent->v->absmax[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1; + igridmaxs[1] = (int) ((ent->v->absmax[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1; + //igridmaxs[2] = (int) ((ent->v->absmax[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1; + igridmins[0] = max(0, igridmins[0]); + igridmins[1] = max(0, igridmins[1]); + //igridmins[2] = max(0, igridmins[2]); + igridmaxs[0] = min(AREA_GRID, igridmaxs[0]); + igridmaxs[1] = min(AREA_GRID, igridmaxs[1]); + //igridmaxs[2] = min(AREA_GRID, igridmaxs[2]); + + // build a list of edicts to touch, because the link loop can be corrupted + // by SV_IncreaseEdicts called during touch functions + numtouchedicts = 0; + for (l = sv_areagrid_outside.trigger_edicts.next;l != &sv_areagrid_outside.trigger_edicts;l = l->next) + touchedictnumbers[numtouchedicts++] = l->entitynumber; + + for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++) + { + grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0]; + for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++) + for (l = grid->trigger_edicts.next;l != &grid->trigger_edicts;l = l->next) + touchedictnumbers[numtouchedicts++] = l->entitynumber; + } + + old_self = pr_global_struct->self; + old_other = pr_global_struct->other; + for (i = 0;i < numtouchedicts && !ent->e->free;i++) + { + touch = EDICT_NUM_UNSIGNED(touchedictnumbers[i]); + if (ent->v->absmin[0] > touch->v->absmax[0] + || ent->v->absmax[0] < touch->v->absmin[0] + || ent->v->absmin[1] > touch->v->absmax[1] + || ent->v->absmax[1] < touch->v->absmin[1] + || ent->v->absmin[2] > touch->v->absmax[2] + || ent->v->absmax[2] < touch->v->absmin[2]) continue; - if (!touch->v.touch || touch->v.solid != SOLID_TRIGGER) + if (touch == ent) continue; - if (ent->v.absmin[0] > touch->v.absmax[0] - || ent->v.absmin[1] > touch->v.absmax[1] - || ent->v.absmin[2] > touch->v.absmax[2] - || ent->v.absmax[0] < touch->v.absmin[0] - || ent->v.absmax[1] < touch->v.absmin[1] - || ent->v.absmax[2] < touch->v.absmin[2]) + if (!touch->v->touch || touch->v->solid != SOLID_TRIGGER) continue; - old_self = pr_global_struct->self; - old_other = pr_global_struct->other; - pr_global_struct->self = EDICT_TO_PROG(touch); pr_global_struct->other = EDICT_TO_PROG(ent); pr_global_struct->time = sv.time; - PR_ExecuteProgram (touch->v.touch, ""); - - pr_global_struct->self = old_self; - pr_global_struct->other = old_other; + PR_ExecuteProgram (touch->v->touch, ""); } + pr_global_struct->self = old_self; + pr_global_struct->other = old_other; +} -// recurse down both sides - if (node->axis == -1) +void SV_LinkEdict_AreaGrid(edict_t *ent) +{ + areagrid_t *grid; + int igrid[3], igridmins[3], igridmaxs[3], gridnum, entitynumber = NUM_FOR_EDICT(ent); + + if (entitynumber <= 0 || entitynumber >= sv.max_edicts || EDICT_NUM(entitynumber) != ent) + Host_Error("SV_LinkEdict_AreaGrid: invalid edict %p (sv.edicts is %p, edict compared to sv.edicts is %i)\n", ent, sv.edicts, entitynumber); + + igridmins[0] = (int) ((ent->v->absmin[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]); + igridmins[1] = (int) ((ent->v->absmin[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]); + //igridmins[2] = (int) ((ent->v->absmin[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]); + igridmaxs[0] = (int) ((ent->v->absmax[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1; + igridmaxs[1] = (int) ((ent->v->absmax[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1; + //igridmaxs[2] = (int) ((ent->v->absmax[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1; + if (igridmins[0] < 0 || igridmaxs[0] > AREA_GRID || igridmins[1] < 0 || igridmaxs[1] > AREA_GRID || ((igridmaxs[0] - igridmins[0]) * (igridmaxs[1] - igridmins[1])) > ENTITYGRIDAREAS) + { + // wow, something outside the grid, store it as such + if (ent->v->solid == SOLID_TRIGGER) + InsertLinkBefore (&ent->e->areagrid[0], &sv_areagrid_outside.trigger_edicts, entitynumber); + else + InsertLinkBefore (&ent->e->areagrid[0], &sv_areagrid_outside.solid_edicts, entitynumber); return; - - // LordHavoc: optimized recursion -// if (ent->v.absmax[node->axis] > node->dist) SV_TouchLinks (ent, node->children[0]); -// if (ent->v.absmin[node->axis] < node->dist) SV_TouchLinks (ent, node->children[1]); - if (ent->v.absmax[node->axis] > node->dist) - { - if (ent->v.absmin[node->axis] < node->dist) - SV_TouchLinks(ent, node->children[1]); // order reversed to reduce code - node = node->children[0]; - goto loc0; } - else + + gridnum = 0; + for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++) { - if (ent->v.absmin[node->axis] < node->dist) + grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0]; + for (igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++, gridnum++) { - node = node->children[1]; - goto loc0; + if (ent->v->solid == SOLID_TRIGGER) + InsertLinkBefore (&ent->e->areagrid[gridnum], &grid->trigger_edicts, entitynumber); + else + InsertLinkBefore (&ent->e->areagrid[gridnum], &grid->solid_edicts, entitynumber); } } } - /* =============== SV_LinkEdict @@ -414,105 +296,96 @@ SV_LinkEdict */ void SV_LinkEdict (edict_t *ent, qboolean touch_triggers) { - areanode_t *node; + model_t *model; - if (ent->area.prev) + if (ent->e->areagrid[0].prev) SV_UnlinkEdict (ent); // unlink from old position - + if (ent == sv.edicts) return; // don't add the world - if (ent->free) + if (ent->e->free) return; // set the abs box -// LordHavoc: enabling rotating bmodels - if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2])) + if (ent->v->solid == SOLID_BSP) { - // expand for rotation - float max, v; - int i; - - max = DotProduct(ent->v.mins, ent->v.mins); - v = DotProduct(ent->v.maxs, ent->v.maxs); - if (max < v) - max = v; - max = sqrt(max); - /* - max = 0; - for (i=0 ; i<3 ; i++) + int modelindex = ent->v->modelindex; + if (modelindex < 0 || modelindex > MAX_MODELS) { - v = fabs(ent->v.mins[i]); - if (max < v) - max = v; - v = fabs(ent->v.maxs[i]); - if (max < v) - max = v; + Con_DPrintf("edict %i: SOLID_BSP with invalid modelindex!\n", NUM_FOR_EDICT(ent)); + modelindex = 0; } - */ - for (i=0 ; i<3 ; i++) + model = sv.models[modelindex]; + if (model != NULL) + { + Mod_CheckLoaded(model); + if (!model->TraceBox) + Con_DPrintf("edict %i: SOLID_BSP with non-collidable model\n", NUM_FOR_EDICT(ent)); + + if (ent->v->angles[0] || ent->v->angles[2] || ent->v->avelocity[0] || ent->v->avelocity[2]) + { + VectorAdd(ent->v->origin, model->rotatedmins, ent->v->absmin); + VectorAdd(ent->v->origin, model->rotatedmaxs, ent->v->absmax); + } + else if (ent->v->angles[1] || ent->v->avelocity[1]) + { + VectorAdd(ent->v->origin, model->yawmins, ent->v->absmin); + VectorAdd(ent->v->origin, model->yawmaxs, ent->v->absmax); + } + else + { + VectorAdd(ent->v->origin, model->normalmins, ent->v->absmin); + VectorAdd(ent->v->origin, model->normalmaxs, ent->v->absmax); + } + } + else { - ent->v.absmin[i] = ent->v.origin[i] - max; - ent->v.absmax[i] = ent->v.origin[i] + max; + // SOLID_BSP with no model is valid, mainly because some QC setup code does so temporarily + VectorAdd(ent->v->origin, ent->v->mins, ent->v->absmin); + VectorAdd(ent->v->origin, ent->v->maxs, ent->v->absmax); } } else { - VectorAdd (ent->v.origin, ent->v.mins, ent->v.absmin); - VectorAdd (ent->v.origin, ent->v.maxs, ent->v.absmax); + VectorAdd(ent->v->origin, ent->v->mins, ent->v->absmin); + VectorAdd(ent->v->origin, ent->v->maxs, ent->v->absmax); } // // to make items easier to pick up and allow them to be grabbed off // of shelves, the abs sizes are expanded // - if ((int)ent->v.flags & FL_ITEM) + if ((int)ent->v->flags & FL_ITEM) { - ent->v.absmin[0] -= 15; - ent->v.absmin[1] -= 15; - ent->v.absmax[0] += 15; - ent->v.absmax[1] += 15; + ent->v->absmin[0] -= 15; + ent->v->absmin[1] -= 15; + ent->v->absmin[2] -= 1; + ent->v->absmax[0] += 15; + ent->v->absmax[1] += 15; + ent->v->absmax[2] += 1; } else { // because movement is clipped an epsilon away from an actual edge, // we must fully check even when bounding boxes don't quite touch - ent->v.absmin[0] -= 1; - ent->v.absmin[1] -= 1; - ent->v.absmin[2] -= 1; - ent->v.absmax[0] += 1; - ent->v.absmax[1] += 1; - ent->v.absmax[2] += 1; + ent->v->absmin[0] -= 1; + ent->v->absmin[1] -= 1; + ent->v->absmin[2] -= 1; + ent->v->absmax[0] += 1; + ent->v->absmax[1] += 1; + ent->v->absmax[2] += 1; } - if (ent->v.solid == SOLID_NOT) + if (ent->v->solid == SOLID_NOT) return; -// find the first node that the ent's box crosses - node = sv_areanodes; - while (1) - { - if (node->axis == -1) - break; - if (ent->v.absmin[node->axis] > node->dist) - node = node->children[0]; - else if (ent->v.absmax[node->axis] < node->dist) - node = node->children[1]; - else - break; // crosses the node - } - -// link it in - - if (ent->v.solid == SOLID_TRIGGER) - InsertLinkBefore (&ent->area, &node->trigger_edicts); - else - InsertLinkBefore (&ent->area, &node->solid_edicts); + SV_LinkEdict_AreaGrid(ent); // if touch_triggers, touch all entities at this node and descend for more if (touch_triggers) - SV_TouchLinks ( ent, sv_areanodes ); + SV_TouchAreaGrid(ent); } @@ -525,20 +398,6 @@ POINT TESTING IN HULLS =============================================================================== */ -/* -================== -SV_HullPointContents - -================== -*/ -int SV_HullPointContents (hull_t *hull, int num, vec3_t p) -{ - while (num >= 0) - num = hull->clipnodes[num].children[(hull->planes[hull->clipnodes[num].planenum].type < 3 ? p[hull->planes[hull->clipnodes[num].planenum].type] : DotProduct (hull->planes[hull->clipnodes[num].planenum].normal, p)) < hull->planes[hull->clipnodes[num].planenum].dist]; - - return num; -} - /* ============ SV_TestEntityPosition @@ -546,16 +405,9 @@ SV_TestEntityPosition This could be a lot more efficient... ============ */ -edict_t *SV_TestEntityPosition (edict_t *ent) +int SV_TestEntityPosition (edict_t *ent) { - trace_t trace; - - trace = SV_Move (ent->v.origin, ent->v.mins, ent->v.maxs, ent->v.origin, MOVE_NORMAL, ent); - - if (trace.startsolid) - return sv.edicts; - - return NULL; + return SV_Move (ent->v->origin, ent->v->mins, ent->v->maxs, ent->v->origin, MOVE_NORMAL, ent).startsolid; } @@ -567,654 +419,189 @@ LINE TESTING IN HULLS =============================================================================== */ -// 1/32 epsilon to keep floating point happy -//#define DIST_EPSILON (0.03125) -#define DIST_EPSILON (0.125) - -#define HULLCHECKSTATE_EMPTY 0 -#define HULLCHECKSTATE_SOLID 1 -#define HULLCHECKSTATE_DONE 2 - -// LordHavoc: FIXME: this is not thread safe, if threading matters here, pass -// this as a struct to RecursiveHullCheck, RecursiveHullCheck_Impact, etc... -RecursiveHullCheckTraceInfo_t RecursiveHullCheckInfo; -#define RHC RecursiveHullCheckInfo +/* +================== +SV_ClipMoveToEntity -void SV_RecursiveHullCheck_Impact (mplane_t *plane, int side) +Handles selection or creation of a clipping hull, and offseting (and +eventually rotation) of the end points +================== +*/ +trace_t SV_ClipMoveToEntity(edict_t *ent, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int movetype) { - // LordHavoc: using doubles for extra accuracy - double t1, t2, frac; - - // LordHavoc: now that we have found the impact, recalculate the impact - // point from scratch for maximum accuracy, with an epsilon bias on the - // surface distance - frac = plane->dist; - if (side) - { - frac -= DIST_EPSILON; - VectorNegate (plane->normal, RHC.trace->plane.normal); - RHC.trace->plane.dist = -plane->dist; - } - else - { - frac += DIST_EPSILON; - VectorCopy (plane->normal, RHC.trace->plane.normal); - RHC.trace->plane.dist = plane->dist; - } - - if (plane->type < 3) - { - t1 = RHC.start[plane->type] - frac; - t2 = RHC.start[plane->type] + RHC.dist[plane->type] - frac; - } - else - { - t1 = plane->normal[0] * RHC.start[0] + plane->normal[1] * RHC.start[1] + plane->normal[2] * RHC.start[2] - frac; - t2 = plane->normal[0] * (RHC.start[0] + RHC.dist[0]) + plane->normal[1] * (RHC.start[1] + RHC.dist[1]) + plane->normal[2] * (RHC.start[2] + RHC.dist[2]) - frac; - } - - frac = t1 / (t1 - t2); - frac = bound(0.0f, frac, 1.0f); + trace_t trace; + model_t *model = NULL; + matrix4x4_t matrix, imatrix; + float tempnormal[3], starttransformed[3], endtransformed[3]; + float starttransformedmins[3], starttransformedmaxs[3], endtransformedmins[3], endtransformedmaxs[3]; - RHC.trace->fraction = frac; - RHC.trace->endpos[0] = RHC.start[0] + frac * RHC.dist[0]; - RHC.trace->endpos[1] = RHC.start[1] + frac * RHC.dist[1]; - RHC.trace->endpos[2] = RHC.start[2] + frac * RHC.dist[2]; -} + memset(&trace, 0, sizeof(trace)); + trace.fraction = trace.realfraction = 1; + VectorCopy(end, trace.endpos); -int SV_RecursiveHullCheck (int num, float p1f, float p2f, vec3_t p1, vec3_t p2) -{ - dclipnode_t *node; - vec3_t mid; - int side; - float midf; - // LordHavoc: FIXME: this is not thread safe... if threading matters here, - // remove the static prefixes - static int ret; - static mplane_t *plane; - static float t1, t2, frac; - - // LordHavoc: a goto! everyone flee in terror... :) -loc0: - // check for empty - if (num < 0) + if ((int) ent->v->solid == SOLID_BSP || movetype == MOVE_HITMODEL) { - RHC.trace->endcontents = num; - if (RHC.trace->startcontents) + unsigned int modelindex = ent->v->modelindex; + // if the modelindex is 0, it shouldn't be SOLID_BSP! + if (modelindex == 0) { - if (num == RHC.trace->startcontents) - RHC.trace->allsolid = false; - else - { - // if the first leaf is solid, set startsolid - if (RHC.trace->allsolid) - RHC.trace->startsolid = true; - return HULLCHECKSTATE_SOLID; - } - return HULLCHECKSTATE_EMPTY; + Con_DPrintf("SV_ClipMoveToEntity: edict %i: SOLID_BSP with no model\n", NUM_FOR_EDICT(ent)); + return trace; } - else + if (modelindex >= MAX_MODELS) { - if (num != CONTENTS_SOLID) - { - RHC.trace->allsolid = false; - if (num == CONTENTS_EMPTY) - RHC.trace->inopen = true; - else - RHC.trace->inwater = true; - } - else - { - // if the first leaf is solid, set startsolid - if (RHC.trace->allsolid) - RHC.trace->startsolid = true; - return HULLCHECKSTATE_SOLID; - } - return HULLCHECKSTATE_EMPTY; + Con_DPrintf("SV_ClipMoveToEntity: edict %i: SOLID_BSP with invalid modelindex\n", NUM_FOR_EDICT(ent)); + return trace; } - } - - // find the point distances - node = RHC.hull->clipnodes + num; - - plane = RHC.hull->planes + node->planenum; - if (plane->type < 3) - { - t1 = p1[plane->type] - plane->dist; - t2 = p2[plane->type] - plane->dist; - } - else - { - t1 = DotProduct (plane->normal, p1) - plane->dist; - t2 = DotProduct (plane->normal, p2) - plane->dist; - } - - // LordHavoc: rearranged the side/frac code - if (t1 >= 0) - { - if (t2 >= 0) + model = sv.models[modelindex]; + if (modelindex != 0 && model == NULL) { - num = node->children[0]; - goto loc0; + Con_DPrintf("SV_ClipMoveToEntity: edict %i: SOLID_BSP with invalid modelindex\n", NUM_FOR_EDICT(ent)); + return trace; } - // put the crosspoint DIST_EPSILON pixels on the near side - side = 0; - } - else - { - if (t2 < 0) - { - num = node->children[1]; - goto loc0; - } - // put the crosspoint DIST_EPSILON pixels on the near side - side = 1; - } - frac = t1 / (t1 - t2); - frac = bound(0.0f, frac, 1.0f); - - midf = p1f + ((p2f - p1f) * frac); - mid[0] = RHC.start[0] + midf * RHC.dist[0]; - mid[1] = RHC.start[1] + midf * RHC.dist[1]; - mid[2] = RHC.start[2] + midf * RHC.dist[2]; - - // front side first - ret = SV_RecursiveHullCheck (node->children[side], p1f, midf, p1, mid); - if (ret != HULLCHECKSTATE_EMPTY) - return ret; // solid or done - ret = SV_RecursiveHullCheck (node->children[!side], midf, p2f, mid, p2); - if (ret != HULLCHECKSTATE_SOLID) - return ret; // empty or done - - // front is air and back is solid, this is the impact point... - SV_RecursiveHullCheck_Impact(RHC.hull->planes + node->planenum, side); - - return HULLCHECKSTATE_DONE; -} - -/* -qboolean SV_RecursiveHullCheckContentBoundary (hull_t *hull, int num, float p1f, float p2f, vec3_t p1, vec3_t p2, trace_t *trace) -{ - dclipnode_t *node; - mplane_t *plane; - float t1, t2; - float frac; - int i; - vec3_t mid; - int side; - float midf; - - // LordHavoc: a goto! everyone flee in terror... :) -loc0: -// check for empty - if (num < 0) - { - if (num != trace->startcontents) - trace->startsolid = true; - else - trace->allsolid = false; - return true; // empty - } - -// find the point distances - node = hull->clipnodes + num; - plane = hull->planes + node->planenum; - - if (plane->type < 3) - { - t1 = p1[plane->type] - plane->dist; - t2 = p2[plane->type] - plane->dist; - } - else - { - t1 = DotProduct (plane->normal, p1) - plane->dist; - t2 = DotProduct (plane->normal, p2) - plane->dist; - } - - // LordHavoc: rearranged the side/frac code - // LordHavoc: recursion optimization - if (t1 >= 0) - { - if (t2 >= 0) + Mod_CheckLoaded(model); + if ((int) ent->v->solid == SOLID_BSP) { - num = node->children[0]; - goto loc0; + if (!model->TraceBox) + { + Con_DPrintf("SV_ClipMoveToEntity: edict %i: SOLID_BSP with a non-collidable model\n", NUM_FOR_EDICT(ent)); + return trace; + } + //if (ent->v->movetype != MOVETYPE_PUSH) + //{ + // Con_DPrintf("SV_ClipMoveToEntity: edict %i: SOLID_BSP without MOVETYPE_PUSH\n", NUM_FOR_EDICT(ent)); + // return trace; + //} } - // put the crosspoint DIST_EPSILON pixels on the near side - side = 0; + Matrix4x4_CreateFromQuakeEntity(&matrix, ent->v->origin[0], ent->v->origin[1], ent->v->origin[2], ent->v->angles[0], ent->v->angles[1], ent->v->angles[2], 1); } else - { - if (t2 < 0) - { - num = node->children[1]; - goto loc0; - } - // put the crosspoint DIST_EPSILON pixels on the near side - side = 1; - } - - frac = t1 / (t1 - t2); - frac = bound(0.0f, frac, 1.0f); - - midf = p1f + ((p2f - p1f) * frac); - mid[0] = p1[0] + ((p2[0] - p1[0]) * frac); - mid[1] = p1[1] + ((p2[1] - p1[1]) * frac); - mid[2] = p1[2] + ((p2[2] - p1[2]) * frac); - -// move up to the node - if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) ) - return false; + Matrix4x4_CreateTranslate(&matrix, ent->v->origin[0], ent->v->origin[1], ent->v->origin[2]); -*/ - /* -#ifdef PARANOID - if (SV_HullPointContents (pm_hullmodel, mid, node->children[side]) != trace->startcontents) - { - Con_Printf ("mid PointInHullSolid\n"); - return false; - } + Matrix4x4_Invert_Simple(&imatrix, &matrix); + Matrix4x4_Transform(&imatrix, start, starttransformed); + Matrix4x4_Transform(&imatrix, end, endtransformed); +#if COLLISIONPARANOID >= 3 + Con_Printf("trans(%f %f %f -> %f %f %f, %f %f %f -> %f %f %f)", start[0], start[1], start[2], starttransformed[0], starttransformed[1], starttransformed[2], end[0], end[1], end[2], endtransformed[0], endtransformed[1], endtransformed[2]); #endif - */ -/* - - // LordHavoc: warning to the clumsy, this recursion can not be optimized because mid would need to be duplicated on a stack - if (SV_HullPointContents (hull, node->children[side^1], mid) == trace->startcontents) -// go past the node - return SV_RecursiveHullCheck (hull, node->children[side^1], midf, p2f, mid, p2, trace); - - if (trace->allsolid) - return false; // never got out of the solid area -//================== -// the other side of the node is solid, this is the impact point -//================== - if (!side) + if (model && model->TraceBox) { - VectorCopy (plane->normal, trace->plane.normal); - trace->plane.dist = plane->dist; + int frame; + frame = (int)ent->v->frame; + frame = bound(0, frame, (model->numframes - 1)); + VectorAdd(starttransformed, maxs, starttransformedmaxs); + VectorAdd(endtransformed, maxs, endtransformedmaxs); + VectorAdd(starttransformed, mins, starttransformedmins); + VectorAdd(endtransformed, mins, endtransformedmins); + model->TraceBox(model, frame, &trace, starttransformedmins, starttransformedmaxs, endtransformedmins, endtransformedmaxs, SUPERCONTENTS_SOLID); } else - { - VectorNegate (plane->normal, trace->plane.normal); - trace->plane.dist = -plane->dist; - } + Collision_ClipTrace_Box(&trace, ent->v->mins, ent->v->maxs, starttransformed, mins, maxs, endtransformed, SUPERCONTENTS_SOLID, SUPERCONTENTS_SOLID); -*/ - /* - while (SV_HullPointContents (hull, hull->firstclipnode, mid) != trace->startcontents) + if (trace.fraction < 1) { - // shouldn't really happen, but does occasionally - frac -= 0.1; - if (frac < 0) - { - trace->fraction = midf; - VectorCopy (mid, trace->endpos); - Con_DPrintf ("backup past 0\n"); - return false; - } - midf = p1f + (p2f - p1f)*frac; - mid[0] = p1[0] + frac*(p2[0] - p1[0]); - mid[1] = p1[1] + frac*(p2[1] - p1[1]); - mid[2] = p1[2] + frac*(p2[2] - p1[2]); + VectorLerp(start, trace.fraction, end, trace.endpos); + VectorCopy(trace.plane.normal, tempnormal); + Matrix4x4_Transform3x3(&matrix, tempnormal, trace.plane.normal); + // FIXME: should recalc trace.plane.dist } - */ -/* - - frac = t1; - if (side) - frac += DIST_EPSILON; else - frac -= DIST_EPSILON; - - frac /= (t1 - t2); - frac = bound(0.0f, frac, 1.0f); - - trace->fraction = p1f + (p2f - p1f)*frac; - trace->endpos[0] = p1[0] + frac*(p2[0] - p1[0]); - trace->endpos[1] = p1[1] + frac*(p2[1] - p1[1]); - trace->endpos[2] = p1[2] + frac*(p2[2] - p1[2]); - - return false; -} -*/ - -/* -// FIXME: this is broken and I'm not interested in figuring out what is broken about it right now -qboolean SV_TestLine (hull_t *hull, int num, vec3_t p1, vec3_t p2) -{ - dclipnode_t *node; - mplane_t *plane; - float t1, t2, frac; - vec3_t mid; - int side; - -loc0: -// check for empty - if (num < 0) - return num != CONTENTS_SOLID; - - if (num < hull->firstclipnode || num > hull->lastclipnode) - Sys_Error ("SV_RecursiveHullCheck: bad node number"); - -// -// find the point distances -// - node = hull->clipnodes + num; - if (node->children[0] < 0) - { - if (node->children[0] == CONTENTS_SOLID) - return false; - if (node->children[1] < 0) - return node->children[1] != CONTENTS_SOLID; - } - else if (node->children[1] == CONTENTS_SOLID) - return false; - - plane = hull->planes + node->planenum; - - if (plane->type < 3) - { - t1 = p1[plane->type] - plane->dist; - t2 = p2[plane->type] - plane->dist; - } - else - { - t1 = DotProduct (plane->normal, p1) - plane->dist; - t2 = DotProduct (plane->normal, p2) - plane->dist; - } - - if (t1 >= 0) - { - if (t2 >= 0) - { - num = node->children[0]; - goto loc0; - } - side = 0; - } - else - { - if (t2 < 0) - { - num = node->children[1]; - goto loc0; - } - side = 1; - } - - if (node->children[side] < 0) - { - if (node->children[side] == CONTENTS_SOLID) - return false; - - if (node->children[!side] < 0) - return node->children[!side] != CONTENTS_SOLID; - else - { - frac = t1 / (t1 - t2); - frac = bound(0, frac, 1); - - mid[0] = p1[0] + frac*(p2[0] - p1[0]); - mid[1] = p1[1] + frac*(p2[1] - p1[1]); - mid[2] = p1[2] + frac*(p2[2] - p1[2]); - - return SV_TestLine(hull, node->children[!side], mid, p2); - } - } - else - { - if (node->children[!side] < 0) - { - if (node->children[!side] == CONTENTS_SOLID) - return false; - - frac = t1 / (t1 - t2); - frac = bound(0, frac, 1); - - mid[0] = p1[0] + frac*(p2[0] - p1[0]); - mid[1] = p1[1] + frac*(p2[1] - p1[1]); - mid[2] = p1[2] + frac*(p2[2] - p1[2]); - - return SV_TestLine(hull, node->children[side], p1, mid); - } - else - { - frac = t1 / (t1 - t2); - frac = bound(0, frac, 1); - - mid[0] = p1[0] + frac*(p2[0] - p1[0]); - mid[1] = p1[1] + frac*(p2[1] - p1[1]); - mid[2] = p1[2] + frac*(p2[2] - p1[2]); - - if (SV_TestLine(hull, node->children[side], p1, mid)) - return SV_TestLine(hull, node->children[!side], mid, p2); - else - return false; - } - } -} -*/ - - -/* -================== -SV_ClipMoveToEntity - -Handles selection or creation of a clipping hull, and offseting (and -eventually rotation) of the end points -================== -*/ -trace_t SV_ClipMoveToEntity (edict_t *ent, vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end) -{ - trace_t trace; - vec3_t offset; - vec3_t start_l, end_l; - hull_t *hull; - -// fill in a default trace - memset (&trace, 0, sizeof(trace_t)); - trace.fraction = 1; - trace.allsolid = true; - VectorCopy (end, trace.endpos); - -// get the clipping hull - hull = SV_HullForEntity (ent, mins, maxs, offset); - - VectorSubtract (start, offset, start_l); - VectorSubtract (end, offset, end_l); - -// LordHavoc: enabling rotating bmodels - // rotate start and end into the models frame of reference - if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2])) - { - vec3_t forward, right, up; - vec3_t temp; - - AngleVectors (ent->v.angles, forward, right, up); - - VectorCopy (start_l, temp); - start_l[0] = DotProduct (temp, forward); - start_l[1] = -DotProduct (temp, right); - start_l[2] = DotProduct (temp, up); - - VectorCopy (end_l, temp); - end_l[0] = DotProduct (temp, forward); - end_l[1] = -DotProduct (temp, right); - end_l[2] = DotProduct (temp, up); - } - -// trace a line through the appropriate clipping hull - VectorCopy(start_l, RecursiveHullCheckInfo.start); - VectorSubtract(end_l, start_l, RecursiveHullCheckInfo.dist); - RecursiveHullCheckInfo.hull = hull; - RecursiveHullCheckInfo.trace = &trace; - SV_RecursiveHullCheck (hull->firstclipnode, 0, 1, start_l, end_l); - -// LordHavoc: enabling rotating bmodels - // rotate endpos back to world frame of reference - if (ent->v.solid == SOLID_BSP && (ent->v.angles[0] || ent->v.angles[1] || ent->v.angles[2])) - { - vec3_t a; - vec3_t forward, right, up; - vec3_t temp; - - if (trace.fraction != 1) - { - VectorNegate (ent->v.angles, a); - AngleVectors (a, forward, right, up); - - VectorCopy (trace.endpos, temp); - trace.endpos[0] = DotProduct (temp, forward); - trace.endpos[1] = -DotProduct (temp, right); - trace.endpos[2] = DotProduct (temp, up); - - VectorCopy (trace.plane.normal, temp); - trace.plane.normal[0] = DotProduct (temp, forward); - trace.plane.normal[1] = -DotProduct (temp, right); - trace.plane.normal[2] = DotProduct (temp, up); - } - } - -// fix trace up by the offset - if (trace.fraction != 1) - VectorAdd (trace.endpos, offset, trace.endpos); - -// did we clip the move? - if (trace.fraction < 1 || trace.startsolid ) - trace.ent = ent; + VectorCopy(end, trace.endpos); return trace; } //=========================================================================== -/* -==================== -SV_ClipToLinks - -Mins and maxs enclose the entire area swept by the move -==================== -*/ -void SV_ClipToLinks ( areanode_t *node, moveclip_t *clip ) +void SV_ClipToNode(moveclip_t *clip, link_t *list) { - link_t *l, *next; - edict_t *touch; - trace_t trace; + link_t *l, *next; + edict_t *touch; + trace_t trace; -loc0: -// touch linked edicts - for (l = node->solid_edicts.next ; l != &node->solid_edicts ; l = next) + sv_areagrid_stats_nodechecks++; + for (l = list->next;l != list;l = next) { next = l->next; - touch = EDICT_FROM_AREA(l); - if (touch->v.solid == SOLID_NOT) + touch = EDICT_NUM(l->entitynumber); + if (touch->e->areagridmarknumber == sv_areagrid_marknumber) continue; - if (touch == clip->passedict) - continue; - if (touch->v.solid == SOLID_TRIGGER) - Sys_Error ("Trigger in clipping list"); + touch->e->areagridmarknumber = sv_areagrid_marknumber; + sv_areagrid_stats_entitychecks++; - if (clip->type == MOVE_NOMONSTERS && touch->v.solid != SOLID_BSP) + // LordHavoc: this box comparison isn't much use with the high resolution areagrid + /* + if (clip->boxmins[0] > touch->v->absmax[0] + || clip->boxmaxs[0] < touch->v->absmin[0] + || clip->boxmins[1] > touch->v->absmax[1] + || clip->boxmaxs[1] < touch->v->absmin[1] + || clip->boxmins[2] > touch->v->absmax[2] + || clip->boxmaxs[2] < touch->v->absmin[2]) continue; + */ - if (clip->boxmins[0] > touch->v.absmax[0] - || clip->boxmins[1] > touch->v.absmax[1] - || clip->boxmins[2] > touch->v.absmax[2] - || clip->boxmaxs[0] < touch->v.absmin[0] - || clip->boxmaxs[1] < touch->v.absmin[1] - || clip->boxmaxs[2] < touch->v.absmin[2]) + if (clip->type == MOVE_NOMONSTERS && touch->v->solid != SOLID_BSP) continue; - if (clip->passedict != NULL && clip->passedict->v.size[0] && !touch->v.size[0]) - continue; // points never interact + if (touch->v->solid == SOLID_NOT) + continue; - // might intersect, so do an exact clip - if (clip->trace.allsolid) - return; if (clip->passedict) { - if (PROG_TO_EDICT(touch->v.owner) == clip->passedict) + if (touch == clip->passedict) + continue; + if (!clip->passedict->v->size[0] && !touch->v->size[0]) + continue; // points never interact + if (PROG_TO_EDICT(touch->v->owner) == clip->passedict) continue; // don't clip against own missiles - if (PROG_TO_EDICT(clip->passedict->v.owner) == touch) + if (PROG_TO_EDICT(clip->passedict->v->owner) == touch) continue; // don't clip against owner // LordHavoc: corpse code - if (clip->passedict->v.solid == SOLID_CORPSE && touch->v.solid == SOLID_SLIDEBOX) + if (clip->passedict->v->solid == SOLID_CORPSE && (touch->v->solid == SOLID_SLIDEBOX || touch->v->solid == SOLID_CORPSE)) continue; - if (clip->passedict->v.solid == SOLID_SLIDEBOX && touch->v.solid == SOLID_CORPSE) + if (clip->passedict->v->solid == SOLID_SLIDEBOX && touch->v->solid == SOLID_CORPSE) continue; } - if ((int)touch->v.flags & FL_MONSTER) - trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins2, clip->maxs2, clip->end); - else - trace = SV_ClipMoveToEntity (touch, clip->start, clip->mins, clip->maxs, clip->end); - if (trace.allsolid || trace.startsolid || trace.fraction < clip->trace.fraction) + if (touch->v->solid == SOLID_TRIGGER) { - trace.ent = touch; - if (clip->trace.startsolid) - { - clip->trace = trace; - clip->trace.startsolid = true; - } - else - clip->trace = trace; + ED_Print(touch); + Host_Error ("Trigger in clipping list"); } - else if (trace.startsolid) - clip->trace.startsolid = true; - } - -// recurse down both sides - if (node->axis == -1) - return; - - // LordHavoc: optimized recursion -// if (clip->boxmaxs[node->axis] > node->dist) SV_ClipToLinks(node->children[0], clip); -// if (clip->boxmins[node->axis] < node->dist) SV_ClipToLinks(node->children[1], clip); - if (clip->boxmaxs[node->axis] > node->dist) - { - if (clip->boxmins[node->axis] < node->dist) - SV_ClipToLinks(node->children[1], clip); - node = node->children[0]; - goto loc0; - } - else if (clip->boxmins[node->axis] < node->dist) - { - node = node->children[1]; - goto loc0; - } -} - -/* -================== -SV_MoveBounds -================== -*/ -void SV_MoveBounds (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, vec3_t boxmins, vec3_t boxmaxs) -{ -#if 0 -// debug to test against everything -boxmins[0] = boxmins[1] = boxmins[2] = -9999; -boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999; -#else - int i; - - for (i=0 ; i<3 ; i++) - { - if (end[i] > start[i]) + // might interact, so do an exact clip + if ((int)touch->v->flags & FL_MONSTER) + trace = SV_ClipMoveToEntity(touch, clip->start, clip->mins2, clip->maxs2, clip->end, clip->type); + else + trace = SV_ClipMoveToEntity(touch, clip->start, clip->mins, clip->maxs, clip->end, clip->type); + // LordHavoc: take the 'best' answers from the new trace and combine with existing data + if (trace.allsolid) + clip->trace.allsolid = true; + if (trace.startsolid) { - boxmins[i] = start[i] + mins[i] - 1; - boxmaxs[i] = end[i] + maxs[i] + 1; + clip->trace.startsolid = true; + if (clip->trace.realfraction == 1) + clip->trace.ent = touch; } - else + // don't set this except on the world, because it can easily confuse + // monsters underwater if there's a bmodel involved in the trace + // (inopen && inwater is how they check water visibility) + //if (trace.inopen) + // clip->trace.inopen = true; + if (trace.inwater) + clip->trace.inwater = true; + if (trace.realfraction < clip->trace.realfraction) { - boxmins[i] = end[i] + mins[i] - 1; - boxmaxs[i] = start[i] + maxs[i] + 1; + clip->trace.fraction = trace.fraction; + clip->trace.realfraction = trace.realfraction; + VectorCopy(trace.endpos, clip->trace.endpos); + clip->trace.plane = trace.plane; + clip->trace.ent = touch; } + clip->trace.startsupercontents |= trace.startsupercontents; } -#endif } /* @@ -1222,42 +609,130 @@ boxmaxs[0] = boxmaxs[1] = boxmaxs[2] = 9999; SV_Move ================== */ -trace_t SV_Move (vec3_t start, vec3_t mins, vec3_t maxs, vec3_t end, int type, edict_t *passedict) +#if COLLISIONPARANOID >= 1 +trace_t SV_Move_(const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int type, edict_t *passedict) +#else +trace_t SV_Move(const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int type, edict_t *passedict) +#endif { - moveclip_t clip; - int i; - - memset ( &clip, 0, sizeof ( moveclip_t ) ); - -// clip to world - clip.trace = SV_ClipMoveToEntity ( sv.edicts, start, mins, maxs, end ); - - clip.start = start; - clip.end = end; - clip.mins = mins; - clip.maxs = maxs; + moveclip_t clip; + vec3_t hullmins, hullmaxs; + areagrid_t *grid; + int i, igrid[3], igridmins[3], igridmaxs[3]; + + // if the passedict is world, make it NULL (to avoid two checks each time) + if (passedict == sv.edicts) + passedict = NULL; + + memset(&clip, 0, sizeof(moveclip_t)); + + VectorCopy(start, clip.start); + VectorCopy(end, clip.end); + VectorCopy(mins, clip.mins); + VectorCopy(maxs, clip.maxs); + VectorCopy(mins, clip.mins2); + VectorCopy(maxs, clip.maxs2); clip.type = type; clip.passedict = passedict; +#if COLLISIONPARANOID >= 3 + Con_Printf("move(%f %f %f,%f %f %f)", clip.start[0], clip.start[1], clip.start[2], clip.end[0], clip.end[1], clip.end[2]); +#endif + + // clip to world + clip.trace = SV_ClipMoveToEntity(sv.edicts, clip.start, clip.mins, clip.maxs, clip.end, clip.type); + if (clip.trace.startsolid || clip.trace.fraction < 1) + clip.trace.ent = sv.edicts; + if (clip.type == MOVE_WORLDONLY) + return clip.trace; - if (type == MOVE_MISSILE) + if (clip.type == MOVE_MISSILE) { - for (i=0 ; i<3 ; i++) + // LordHavoc: modified this, was = -15, now -= 15 + for (i = 0;i < 3;i++) { - clip.mins2[i] = -15; - clip.maxs2[i] = 15; + clip.mins2[i] -= 15; + clip.maxs2[i] += 15; } } + + // get adjusted box for bmodel collisions if the world is q1bsp or hlbsp + if (sv.worldmodel && sv.worldmodel->brush.RoundUpToHullSize) + sv.worldmodel->brush.RoundUpToHullSize(sv.worldmodel, clip.mins, clip.maxs, hullmins, hullmaxs); else { - VectorCopy (mins, clip.mins2); - VectorCopy (maxs, clip.maxs2); + VectorCopy(clip.mins, hullmins); + VectorCopy(clip.maxs, hullmaxs); + } + + // create the bounding box of the entire move + for (i = 0;i < 3;i++) + { + clip.boxmins[i] = min(clip.start[i], clip.trace.endpos[i]) + min(hullmins[i], clip.mins2[i]) - 1; + clip.boxmaxs[i] = max(clip.start[i], clip.trace.endpos[i]) + max(hullmaxs[i], clip.maxs2[i]) + 1; + } + + // debug override to test against everything + if (sv_debugmove.integer) + { + clip.boxmins[0] = clip.boxmins[1] = clip.boxmins[2] = -999999999; + clip.boxmaxs[0] = clip.boxmaxs[1] = clip.boxmaxs[2] = 999999999; } -// create the bounding box of the entire move - SV_MoveBounds ( start, clip.mins2, clip.maxs2, end, clip.boxmins, clip.boxmaxs ); + // clip to enttiies + sv_areagrid_stats_calls++; + sv_areagrid_marknumber++; + igridmins[0] = (int) ((clip.boxmins[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]); + igridmins[1] = (int) ((clip.boxmins[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]); + //igridmins[2] = (int) ((clip->boxmins[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]); + igridmaxs[0] = (int) ((clip.boxmaxs[0] + sv_areagrid_bias[0]) * sv_areagrid_scale[0]) + 1; + igridmaxs[1] = (int) ((clip.boxmaxs[1] + sv_areagrid_bias[1]) * sv_areagrid_scale[1]) + 1; + //igridmaxs[2] = (int) ((clip->boxmaxs[2] + sv_areagrid_bias[2]) * sv_areagrid_scale[2]) + 1; + igridmins[0] = max(0, igridmins[0]); + igridmins[1] = max(0, igridmins[1]); + //igridmins[2] = max(0, igridmins[2]); + igridmaxs[0] = min(AREA_GRID, igridmaxs[0]); + igridmaxs[1] = min(AREA_GRID, igridmaxs[1]); + //igridmaxs[2] = min(AREA_GRID, igridmaxs[2]); + + if (sv_areagrid_outside.solid_edicts.next != &sv_areagrid_outside.solid_edicts) + SV_ClipToNode(&clip, &sv_areagrid_outside.solid_edicts); -// clip to entities - SV_ClipToLinks ( sv_areanodes, &clip ); + for (igrid[1] = igridmins[1];igrid[1] < igridmaxs[1];igrid[1]++) + for (grid = sv_areagrid + igrid[1] * AREA_GRID + igridmins[0], igrid[0] = igridmins[0];igrid[0] < igridmaxs[0];igrid[0]++, grid++) + if (grid->solid_edicts.next != &grid->solid_edicts) + SV_ClipToNode(&clip, &grid->solid_edicts); return clip.trace; } + +#if COLLISIONPARANOID >= 1 +trace_t SV_Move(const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int type, edict_t *passedict) +{ + int endstuck; + trace_t trace; + vec3_t temp; + trace = SV_Move_(start, mins, maxs, end, type, passedict); + if (passedict) + { + VectorCopy(trace.endpos, temp); + endstuck = SV_Move_(temp, mins, maxs, temp, type, passedict).startsolid; +#if COLLISIONPARANOID < 3 + if (trace.startsolid || endstuck) +#endif + Con_Printf("%s{e%i:%f %f %f:%f %f %f:%f:%f %f %f%s%s}\n", (trace.startsolid || endstuck) ? "\002" : "", passedict ? passedict - sv.edicts : -1, passedict->v->origin[0], passedict->v->origin[1], passedict->v->origin[2], end[0] - passedict->v->origin[0], end[1] - passedict->v->origin[1], end[2] - passedict->v->origin[2], trace.fraction, trace.endpos[0] - passedict->v->origin[0], trace.endpos[1] - passedict->v->origin[1], trace.endpos[2] - passedict->v->origin[2], trace.startsolid ? " startstuck" : "", endstuck ? " endstuck" : ""); + } + return trace; +} +#endif + +int SV_PointSuperContents(const vec3_t point) +{ + return SV_Move(point, vec3_origin, vec3_origin, point, sv_gameplayfix_swiminbmodels.integer ? MOVE_NOMONSTERS : MOVE_WORLDONLY, NULL).startsupercontents; +} + +int SV_PointQ1Contents(const vec3_t point) +{ + return Mod_Q1BSP_NativeContentsFromSuperContents(NULL, SV_PointSuperContents(point)); +} + +