Quake III Arena: code/botlib/be_aas

Define Documentation

#define AAS_MAX_REACHABILITYSIZE 65536

Definition at line 54 of file be_aas_reach.c.

Referenced by AAS_SetupReachabilityHeap().

#define AREA_WEAPONJUMP 8192

Definition at line 63 of file be_aas_reach.c.

#define REACHABILITYAREASPERCYCLE 15

Definition at line 56 of file be_aas_reach.c.

00489 { 00490 aas_lreachability_t *r; 00491 00492 if (!nextreachability) return NULL; 00493 //make sure the error message only shows up once 00494 if (!nextreachability->next) AAS_Error("AAS_MAX_REACHABILITYSIZE"); 00495 // 00496 r = nextreachability; 00497 nextreachability = nextreachability->next; 00498 numlreachabilities++; 00499 return r; 00500 } //end of the function AAS_AllocReachability

00540 { 00541 int i; 00542 float total; 00543 aas_area_t *area; 00544 aas_face_t *face; 00545 00546 total = 0; 00547 area = &aasworld.areas[areanum]; 00548 for (i = 0; i < area->numfaces; i++) 00549 { 00550 face = &aasworld.faces[abs(aasworld.faceindex[area->firstface + i])]; 00551 if (!(face->faceflags & FACE_GROUND)) continue; 00552 // 00553 total += AAS_FaceArea(face); 00554 } //end for 00555 return total; 00556 } //end of the function AAS_AreaGroundFaceArea

00524 { 00525 if (areanum < 0 || areanum >= aasworld.numareas) 00526 { 00527 AAS_Error("AAS_AreaReachability: areanum %d out of range", areanum); 00528 return 0; 00529 } //end if 00530 return aasworld.areasettings[areanum].numreachableareas; 00531 } //end of the function AAS_AreaReachability

00146 { 00147 int i, edgenum, facenum, side; 00148 vec_t d, a, volume; 00149 vec3_t corner; 00150 aas_plane_t *plane; 00151 aas_edge_t *edge; 00152 aas_face_t *face; 00153 aas_area_t *area; 00154 00155 area = &aasworld.areas[areanum]; 00156 facenum = aasworld.faceindex[area->firstface]; 00157 face = &aasworld.faces[abs(facenum)]; 00158 edgenum = aasworld.edgeindex[face->firstedge]; 00159 edge = &aasworld.edges[abs(edgenum)]; 00160 // 00161 VectorCopy(aasworld.vertexes[edge->v[0]], corner); 00162 00163 //make tetrahedrons to all other faces 00164 volume = 0; 00165 for (i = 0; i < area->numfaces; i++) 00166 { 00167 facenum = abs(aasworld.faceindex[area->firstface + i]); 00168 face = &aasworld.faces[facenum]; 00169 side = face->backarea != areanum; 00170 plane = &aasworld.planes[face->planenum ^ side]; 00171 d = -(DotProduct (corner, plane->normal) - plane->dist); 00172 a = AAS_FaceArea(face); 00173 volume += d * a; 00174 } //end for 00175 00176 volume /= 3; 00177 return volume; 00178 } //end of the function AAS_AreaVolume

00361 { 00362 int areanum, i, j, k, l; 00363 aas_link_t *areas; 00364 vec3_t absmins, absmaxs; 00365 //vec3_t bbmins, bbmaxs; 00366 vec3_t start, end; 00367 aas_trace_t trace; 00368 00369 if (!aasworld.loaded) 00370 { 00371 botimport.Print(PRT_ERROR, "AAS_BestReachableArea: aas not loaded\n"); 00372 return 0; 00373 } //end if 00374 //find a point in an area 00375 VectorCopy(origin, start); 00376 areanum = AAS_PointAreaNum(start); 00377 //while no area found fudge around a little 00378 for (i = 0; i < 5 && !areanum; i++) 00379 { 00380 for (j = 0; j < 5 && !areanum; j++) 00381 { 00382 for (k = -1; k <= 1 && !areanum; k++) 00383 { 00384 for (l = -1; l <= 1 && !areanum; l++) 00385 { 00386 VectorCopy(origin, start); 00387 start[0] += (float) j * 4 * k; 00388 start[1] += (float) j * 4 * l; 00389 start[2] += (float) i * 4; 00390 areanum = AAS_PointAreaNum(start); 00391 } //end for 00392 } //end for 00393 } //end for 00394 } //end for 00395 //if an area was found 00396 if (areanum) 00397 { 00398 //drop client bbox down and try again 00399 VectorCopy(start, end); 00400 start[2] += 0.25; 00401 end[2] -= 50; 00402 trace = AAS_TraceClientBBox(start, end, PRESENCE_CROUCH, -1); 00403 if (!trace.startsolid) 00404 { 00405 areanum = AAS_PointAreaNum(trace.endpos); 00406 VectorCopy(trace.endpos, goalorigin); 00407 //FIXME: cannot enable next line right now because the reachability 00408 // does not have to be calculated when the level items are loaded 00409 //if the origin is in an area with reachability 00410 //if (AAS_AreaReachability(areanum)) return areanum; 00411 if (areanum) return areanum; 00412 } //end if 00413 else 00414 { 00415 //it can very well happen that the AAS_PointAreaNum function tells that 00416 //a point is in an area and that starting a AAS_TraceClientBBox from that 00417 //point will return trace.startsolid qtrue 00418 #if 0 00419 if (AAS_PointAreaNum(start)) 00420 { 00421 Log_Write("point %f %f %f in area %d but trace startsolid", start[0], start[1], start[2], areanum); 00422 AAS_DrawPermanentCross(start, 4, LINECOLOR_RED); 00423 } //end if 00424 botimport.Print(PRT_MESSAGE, "AAS_BestReachableArea: start solid\n"); 00425 #endif 00426 VectorCopy(start, goalorigin); 00427 return areanum; 00428 } //end else 00429 } //end if 00430 // 00431 //AAS_PresenceTypeBoundingBox(PRESENCE_CROUCH, bbmins, bbmaxs); 00432 //NOTE: the goal origin does not have to be in the goal area 00433 // because the bot will have to move towards the item origin anyway 00434 VectorCopy(origin, goalorigin); 00435 // 00436 VectorAdd(origin, mins, absmins); 00437 VectorAdd(origin, maxs, absmaxs); 00438 //add bounding box size 00439 //VectorSubtract(absmins, bbmaxs, absmins); 00440 //VectorSubtract(absmaxs, bbmins, absmaxs); 00441 //link an invalid (-1) entity 00442 areas = AAS_LinkEntityClientBBox(absmins, absmaxs, -1, PRESENCE_CROUCH); 00443 //get the reachable link arae 00444 areanum = AAS_BestReachableLinkArea(areas); 00445 //unlink the invalid entity 00446 AAS_UnlinkFromAreas(areas); 00447 // 00448 return areanum; 00449 } //end of the function AAS_BestReachableArea

00291 { 00292 int area2num, ent, bot_visualizejumppads, bestareanum; 00293 float volume, bestareavolume; 00294 vec3_t areastart, cmdmove, bboxmins, bboxmaxs; 00295 vec3_t absmins, absmaxs, velocity; 00296 aas_clientmove_t move; 00297 aas_link_t *areas, *link; 00298 char classname[MAX_EPAIRKEY]; 00299 00300 #ifdef BSPC 00301 bot_visualizejumppads = 0; 00302 #else 00303 bot_visualizejumppads = LibVarValue("bot_visualizejumppads", "0"); 00304 #endif 00305 VectorAdd(origin, mins, bboxmins); 00306 VectorAdd(origin, maxs, bboxmaxs); 00307 for (ent = AAS_NextBSPEntity(0); ent; ent = AAS_NextBSPEntity(ent)) 00308 { 00309 if (!AAS_ValueForBSPEpairKey(ent, "classname", classname, MAX_EPAIRKEY)) continue; 00310 if (strcmp(classname, "trigger_push")) continue; 00311 // 00312 if (!AAS_GetJumpPadInfo(ent, areastart, absmins, absmaxs, velocity)) continue; 00313 //get the areas the jump pad brush is in 00314 areas = AAS_LinkEntityClientBBox(absmins, absmaxs, -1, PRESENCE_CROUCH); 00315 for (link = areas; link; link = link->next_area) 00316 { 00317 if (AAS_AreaJumpPad(link->areanum)) break; 00318 } //end for 00319 if (!link) 00320 { 00321 botimport.Print(PRT_MESSAGE, "trigger_push not in any jump pad area\n"); 00322 AAS_UnlinkFromAreas(areas); 00323 continue; 00324 } //end if 00325 // 00326 //botimport.Print(PRT_MESSAGE, "found a trigger_push with velocity %f %f %f\n", velocity[0], velocity[1], velocity[2]); 00327 // 00328 VectorSet(cmdmove, 0, 0, 0); 00329 Com_Memset(&move, 0, sizeof(aas_clientmove_t)); 00330 area2num = 0; 00331 AAS_ClientMovementHitBBox(&move, -1, areastart, PRESENCE_NORMAL, qfalse, 00332 velocity, cmdmove, 0, 30, 0.1f, bboxmins, bboxmaxs, bot_visualizejumppads); 00333 if (move.frames < 30) 00334 { 00335 bestareanum = 0; 00336 bestareavolume = 0; 00337 for (link = areas; link; link = link->next_area) 00338 { 00339 if (!AAS_AreaJumpPad(link->areanum)) continue; 00340 volume = AAS_AreaVolume(link->areanum); 00341 if (volume >= bestareavolume) 00342 { 00343 bestareanum = link->areanum; 00344 bestareavolume = volume; 00345 } //end if 00346 } //end if 00347 AAS_UnlinkFromAreas(areas); 00348 return bestareanum; 00349 } //end if 00350 AAS_UnlinkFromAreas(areas); 00351 } //end for 00352 return 0; 00353 } //end of the function AAS_BestReachableFromJumpPadArea

00186 { 00187 aas_link_t *link; 00188 00189 for (link = areas; link; link = link->next_area) 00190 { 00191 if (AAS_AreaGrounded(link->areanum) || AAS_AreaSwim(link->areanum)) 00192 { 00193 return link->areanum; 00194 } //end if 00195 } //end for 00196 // 00197 for (link = areas; link; link = link->next_area) 00198 { 00199 if (link->areanum) return link->areanum; 00200 //FIXME: this is a bad idea when the reachability is not yet 00201 // calculated when the level items are loaded 00202 if (AAS_AreaReachability(link->areanum)) 00203 return link->areanum; 00204 } //end for 00205 return 0; 00206 } //end of the function AAS_BestReachableLinkArea

01835 {
01836     vec3_t dir1, dir2, p1, p2, p3, p4;
01837     float a1, a2, b1, b2, dist, dist1, dist2;
01838     int founddist;
01839 
01840     //edge vectors
01841     VectorSubtract(v2, v1, dir1);
01842     VectorSubtract(v4, v3, dir2);
01843     //get the horizontal directions
01844     dir1[2] = 0;
01845     dir2[2] = 0;
01846     //
01847     // p1 = point on an edge vector of area2 closest to v1
01848     // p2 = point on an edge vector of area2 closest to v2
01849     // p3 = point on an edge vector of area1 closest to v3
01850     // p4 = point on an edge vector of area1 closest to v4
01851     //
01852     if (dir2[0])
01853     {
01854         a2 = dir2[1] / dir2[0];
01855         b2 = v3[1] - a2 * v3[0];
01856         //point on the edge vector of area2 closest to v1
01857         p1[0] = (DotProduct(v1, dir2) - (a2 * dir2[0] + b2 * dir2[1])) / dir2[0];
01858         p1[1] = a2 * p1[0] + b2;
01859         //point on the edge vector of area2 closest to v2
01860         p2[0] = (DotProduct(v2, dir2) - (a2 * dir2[0] + b2 * dir2[1])) / dir2[0];
01861         p2[1] = a2 * p2[0] + b2;
01862     } //end if
01863     else
01864     {
01865         //point on the edge vector of area2 closest to v1
01866         p1[0] = v3[0];
01867         p1[1] = v1[1];
01868         //point on the edge vector of area2 closest to v2
01869         p2[0] = v3[0];
01870         p2[1] = v2[1];
01871     } //end else
01872     //
01873     if (dir1[0])
01874     {
01875         //
01876         a1 = dir1[1] / dir1[0];
01877         b1 = v1[1] - a1 * v1[0];
01878         //point on the edge vector of area1 closest to v3
01879         p3[0] = (DotProduct(v3, dir1) - (a1 * dir1[0] + b1 * dir1[1])) / dir1[0];
01880         p3[1] = a1 * p3[0] + b1;
01881         //point on the edge vector of area1 closest to v4
01882         p4[0] = (DotProduct(v4, dir1) - (a1 * dir1[0] + b1 * dir1[1])) / dir1[0];
01883         p4[1] = a1 * p4[0] + b1;
01884     } //end if
01885     else
01886     {
01887         //point on the edge vector of area1 closest to v3
01888         p3[0] = v1[0];
01889         p3[1] = v3[1];
01890         //point on the edge vector of area1 closest to v4
01891         p4[0] = v1[0];
01892         p4[1] = v4[1];
01893     } //end else
01894     //start with zero z-coordinates
01895     p1[2] = 0;
01896     p2[2] = 0;
01897     p3[2] = 0;
01898     p4[2] = 0;
01899     //calculate the z-coordinates from the ground planes
01900     p1[2] = (plane2->dist - DotProduct(plane2->normal, p1)) / plane2->normal[2];
01901     p2[2] = (plane2->dist - DotProduct(plane2->normal, p2)) / plane2->normal[2];
01902     p3[2] = (plane1->dist - DotProduct(plane1->normal, p3)) / plane1->normal[2];
01903     p4[2] = (plane1->dist - DotProduct(plane1->normal, p4)) / plane1->normal[2];
01904     //
01905     founddist = qfalse;
01906     //
01907     if (VectorBetweenVectors(p1, v3, v4))
01908     {
01909         dist = VectorDistance(v1, p1);
01910         if (dist > bestdist - 0.5 && dist < bestdist + 0.5)
01911         {
01912             dist1 = VectorDistance(beststart1, v1);
01913             dist2 = VectorDistance(beststart2, v1);
01914             if (dist1 > dist2)
01915             {
01916                 if (dist1 > VectorDistance(beststart1, beststart2)) VectorCopy(v1, beststart2);
01917             } //end if
01918             else
01919             {
01920                 if (dist2 > VectorDistance(beststart1, beststart2)) VectorCopy(v1, beststart1);
01921             } //end else
01922             dist1 = VectorDistance(bestend1, p1);
01923             dist2 = VectorDistance(bestend2, p1);
01924             if (dist1 > dist2)
01925             {
01926                 if (dist1 > VectorDistance(bestend1, bestend2)) VectorCopy(p1, bestend2);
01927             } //end if
01928             else
01929             {
01930                 if (dist2 > VectorDistance(bestend1, bestend2)) VectorCopy(p1, bestend1);
01931             } //end else
01932         } //end if
01933         else if (dist < bestdist)
01934         {
01935             bestdist = dist;
01936             VectorCopy(v1, beststart1);
01937             VectorCopy(v1, beststart2);
01938             VectorCopy(p1, bestend1);
01939             VectorCopy(p1, bestend2);
01940         } //end if
01941         founddist = qtrue;
01942     } //end if
01943     if (VectorBetweenVectors(p2, v3, v4))
01944     {
01945         dist = VectorDistance(v2, p2);
01946         if (dist > bestdist - 0.5 && dist < bestdist + 0.5)
01947         {
01948             dist1 = VectorDistance(beststart1, v2);
01949             dist2 = VectorDistance(beststart2, v2);
01950             if (dist1 > dist2)
01951             {
01952                 if (dist1 > VectorDistance(beststart1, beststart2)) VectorCopy(v2, beststart2);
01953             } //end if
01954             else
01955             {
01956                 if (dist2 > VectorDistance(beststart1, beststart2)) VectorCopy(v2, beststart1);
01957             } //end else
01958             dist1 = VectorDistance(bestend1, p2);
01959             dist2 = VectorDistance(bestend2, p2);
01960             if (dist1 > dist2)
01961             {
01962                 if (dist1 > VectorDistance(bestend1, bestend2)) VectorCopy(p2, bestend2);
01963             } //end if
01964             else
01965             {
01966                 if (dist2 > VectorDistance(bestend1, bestend2)) VectorCopy(p2, bestend1);
01967             } //end else
01968         } //end if
01969         else if (dist < bestdist)
01970         {
01971             bestdist = dist;
01972             VectorCopy(v2, beststart1);
01973             VectorCopy(v2, beststart2);
01974             VectorCopy(p2, bestend1);
01975             VectorCopy(p2, bestend2);
01976         } //end if
01977         founddist = qtrue;
01978     } //end else if
01979     if (VectorBetweenVectors(p3, v1, v2))
01980     {
01981         dist = VectorDistance(v3, p3);
01982         if (dist > bestdist - 0.5 && dist < bestdist + 0.5)
01983         {
01984             dist1 = VectorDistance(beststart1, p3);
01985             dist2 = VectorDistance(beststart2, p3);
01986             if (dist1 > dist2)
01987             {
01988                 if (dist1 > VectorDistance(beststart1, beststart2)) VectorCopy(p3, beststart2);
01989             } //end if
01990             else
01991             {
01992                 if (dist2 > VectorDistance(beststart1, beststart2)) VectorCopy(p3, beststart1);
01993             } //end else
01994             dist1 = VectorDistance(bestend1, v3);
01995             dist2 = VectorDistance(bestend2, v3);
01996             if (dist1 > dist2)
01997             {
01998                 if (dist1 > VectorDistance(bestend1, bestend2)) VectorCopy(v3, bestend2);
01999             } //end if
02000             else
02001             {
02002                 if (dist2 > VectorDistance(bestend1, bestend2)) VectorCopy(v3, bestend1);
02003             } //end else
02004         } //end if
02005         else if (dist < bestdist)
02006         {
02007             bestdist = dist;
02008             VectorCopy(p3, beststart1);
02009             VectorCopy(p3, beststart2);
02010             VectorCopy(v3, bestend1);
02011             VectorCopy(v3, bestend2);
02012         } //end if
02013         founddist = qtrue;
02014     } //end else if
02015     if (VectorBetweenVectors(p4, v1, v2))
02016     {
02017         dist = VectorDistance(v4, p4);
02018         if (dist > bestdist - 0.5 && dist < bestdist + 0.5)
02019         {
02020             dist1 = VectorDistance(beststart1, p4);
02021             dist2 = VectorDistance(beststart2, p4);
02022             if (dist1 > dist2)
02023             {
02024                 if (dist1 > VectorDistance(beststart1, beststart2)) VectorCopy(p4, beststart2);
02025             } //end if
02026             else
02027             {
02028                 if (dist2 > VectorDistance(beststart1, beststart2)) VectorCopy(p4, beststart1);
02029             } //end else
02030             dist1 = VectorDistance(bestend1, v4);
02031             dist2 = VectorDistance(bestend2, v4);
02032             if (dist1 > dist2)
02033             {
02034                 if (dist1 > VectorDistance(bestend1, bestend2)) VectorCopy(v4, bestend2);
02035             } //end if
02036             else
02037             {
02038                 if (dist2 > VectorDistance(bestend1, bestend2)) VectorCopy(v4, bestend1);
02039             } //end else
02040         } //end if
02041         else if (dist < bestdist)
02042         {
02043


Data Structures
struct	aas_lreachability_s
Defines
#define	AAS_MAX_REACHABILITYSIZE 65536
#define	AREA_WEAPONJUMP 8192
#define	INSIDEUNITS 2
#define	INSIDEUNITS_WALKEND 5
#define	INSIDEUNITS_WALKSTART 0.1
#define	INSIDEUNITS_WATERJUMP 15
#define	REACHABILITYAREASPERCYCLE 15
Typedefs
typedef aas_lreachability_s	aas_lreachability_t
Functions
aas_lreachability_t *	AAS_AllocReachability (void)
int	AAS_AreaClusterPortal (int areanum)
int	AAS_AreaCrouch (int areanum)
int	AAS_AreaDoNotEnter (int areanum)
int	AAS_AreaGrounded (int areanum)
float	AAS_AreaGroundFaceArea (int areanum)
int	AAS_AreaJumpPad (int areanum)
int	AAS_AreaLadder (int areanum)
int	AAS_AreaLava (int areanum)
int	AAS_AreaLiquid (int areanum)
int	AAS_AreaReachability (int areanum)
int	AAS_AreaSlime (int areanum)
int	AAS_AreaSwim (int areanum)
int	AAS_AreaTeleporter (int areanum)
float	AAS_AreaVolume (int areanum)
unsigned short int	AAS_BarrierJumpTravelTime (void)
int	AAS_BestReachableArea (vec3_t origin, vec3_t mins, vec3_t maxs, vec3_t goalorigin)
int	AAS_BestReachableFromJumpPadArea (vec3_t origin, vec3_t mins, vec3_t maxs)
int	AAS_BestReachableLinkArea (aas_link_t *areas)
float	AAS_ClosestEdgePoints (vec3_t v1, vec3_t v2, vec3_t v3, vec3_t v4, aas_plane_t plane1, aas_plane_t plane2, vec3_t beststart1, vec3_t bestend1, vec3_t beststart2, vec3_t bestend2, float bestdist)
int	AAS_ContinueInitReachability (float time)
float	AAS_FaceArea (aas_face_t *face)
void	AAS_FaceCenter (int facenum, vec3_t center)
int	AAS_FallDamageDistance (void)
float	AAS_FallDelta (float distance)
aas_lreachability_t *	AAS_FindFaceReachabilities (vec3_t facepoints, int numpoints, aas_plane_t plane, int towardsface)
void	AAS_FreeReachability (aas_lreachability_t *lreach)
int	AAS_GetJumpPadInfo (int ent, vec3_t areastart, vec3_t absmins, vec3_t absmaxs, vec3_t velocity)
void	AAS_InitReachability (void)
float	AAS_MaxJumpDistance (float phys_jumpvel)
float	AAS_MaxJumpHeight (float phys_jumpvel)
int	AAS_NearbySolidOrGap (vec3_t start, vec3_t end)
void	AAS_Reachability_Elevator (void)
int	AAS_Reachability_EqualFloorHeight (int area1num, int area2num)
void	AAS_Reachability_FuncBobbing (void)
int	AAS_Reachability_Grapple (int area1num, int area2num)
int	AAS_Reachability_Jump (int area1num, int area2num)
void	AAS_Reachability_JumpPad (void)
int	AAS_Reachability_Ladder (int area1num, int area2num)
int	AAS_Reachability_Step_Barrier_WaterJump_WalkOffLedge (int area1num, int area2num)
int	AAS_Reachability_Swim (int area1num, int area2num)
void	AAS_Reachability_Teleport (void)
void	AAS_Reachability_WalkOffLedge (int areanum)
int	AAS_Reachability_WeaponJump (int area1num, int area2num)
qboolean	AAS_ReachabilityExists (int area1num, int area2num)
void	AAS_SetupReachabilityHeap (void)
void	AAS_SetWeaponJumpAreaFlags (void)
void	AAS_ShutDownReachabilityHeap (void)
void	AAS_StoreReachability (void)
int	AAS_TravelFlagsForTeam (int ent)
int	Sys_MilliSeconds (void)
int	VectorBetweenVectors (vec3_t v, vec3_t v1, vec3_t v2)
float	VectorDistance (vec3_t v1, vec3_t v2)
void	VectorMiddle (vec3_t v1, vec3_t v2, vec3_t middle)
Variables
aas_lreachability_t **	areareachability
botlib_import_t	botimport
int	calcgrapplereach
aas_lreachability_t *	nextreachability
int	numlreachabilities
int	reach_barrier
int	reach_bfgjump
int	reach_doublejump
int	reach_elevator
int	reach_equalfloor
int	reach_funcbob
int	reach_grapple
int	reach_jump
int	reach_jumppad
int	reach_ladder
int	reach_rampjump
int	reach_rocketjump
int	reach_step
int	reach_strafejump
int	reach_swim
int	reach_teleport
int	reach_walk
int	reach_walkoffledge
int	reach_waterjump
aas_lreachability_t *	reachabilityheap

be_aas_reach.c File Reference

Data Structures

Defines

Typedefs

Functions

Variables

Define Documentation

Typedef Documentation

Function Documentation