qf
/
game-source
mirror of https://git.code.sf.net/p/quake/game-source
0
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
game-source/fbxa/waypoint.r

636 lines
13 KiB
R
Raw Blame History

/***********************************************
* *
* FrikBot Waypoints *
* "The better than roaming AI" *
* *
***********************************************/
/*
This program is in the Public Domain. My crack legal
team would like to add:
RYAN "FRIKAC" SMITH IS PROVIDING THIS SOFTWARE "AS IS"
AND MAKES NO WARRANTY, EXPRESS OR IMPLIED, AS TO THE
ACCURACY, CAPABILITY, EFFICIENCY, MERCHANTABILITY, OR
FUNCTIONING OF THIS SOFTWARE AND/OR DOCUMENTATION. IN
NO EVENT WILL RYAN "FRIKAC" SMITH BE LIABLE FOR ANY
GENERAL, CONSEQUENTIAL, INDIRECT, INCIDENTAL,
EXEMPLARY, OR SPECIAL DAMAGES, EVEN IF RYAN "FRIKAC"
SMITH HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES, IRRESPECTIVE OF THE CAUSE OF SUCH DAMAGES.
You accept this software on the condition that you
indemnify and hold harmless Ryan "FrikaC" Smith from
any and all liability or damages to third parties,
including attorney fees, court costs, and other
related costs and expenses, arising out of your use
of this software irrespective of the cause of said
liability.
The export from the United States or the subsequent
reexport of this software is subject to compliance
with United States export control and munitions
control restrictions. You agree that in the event you
seek to export this software, you assume full
responsibility for obtaining all necessary export
licenses and approvals and for assuring compliance
with applicable reexport restrictions.
Any reproduction of this software must contain
this notice in its entirety.
*/
#include "libfrikbot.h"
#include "Array.h"
#include "qfile.h"
#include "qfs.h"
#include "string.h"
#include "PropertyList.h"
Array *waypoint_array;
@static entity waypoint_thinker;
@static Array *waypoint_queue;
@static void () waypoint_init =
{
waypoint_array = [[Array alloc] init];
if (!waypoint_queue)
waypoint_queue = [[Array alloc] init];
if (!waypoint_thinker) {
waypoint_thinker = spawn ();
waypoint_thinker.classname = "waypoint_thinker";
}
};
@implementation Waypoint
-(int)id
{
int index = [waypoint_array indexOfObject:self];
if (index != NotFound)
return index + 1;
return 0;
}
-(id)init
{
if (!waypoint_array)
waypoint_init ();
return [super initWithEntity:nil];
}
-(id)initAt:(vector)org
{
[self init];
[waypoint_array addObject: self];
[self release];
origin = org;
search_time = time;
distance = -1;
return self;
}
-(id)initAt:(vector)org linkedTo:(int*)link flags:(int)flag
{
self = [self initAt:org];
links[0] = (Waypoint *) link[0];
links[1] = (Waypoint *) link[1];
links[2] = (Waypoint *) link[2];
links[3] = (Waypoint *) link[3];
flags = flag;
return self;
}
-(id)initFromEntity:(entity)ent
{
[self initAt:ent.origin];
//FIXME do entity based init
return self;
}
-(void)dealloc
{
[waypoint_array makeObjectsPerformSelector:@selector(unlinkWay:)
withObject:self];
[super dealloc];
}
-(void)setOrigin:(vector)org
{
origin = org;
if (ent)
setorigin (ent, org);
}
-(vector)origin
{
return origin;
}
-(vector)realorigin
{
return origin;
}
-(void)clearLinks
{
links[0] = links[1] = links[2] = links[3] = nil;
}
-(int)isLinkedTo:(Waypoint *)way
{
local int i;
if (way == self || !way || !self)
return 0;
for (i = 0; i < 4; i++) {
if (links[i] == way) {
if (flags & (AI_TELELINK_1 << i))
return 2;
return 1;
}
}
return 0;
}
-(int)linkWay:(Waypoint *)way
{
local int i;
if (self == way || !self || !way)
return 0;
else if ([self isLinkedTo:way])
return 0; // already linked!!!
for (i = 0; i < 4; i++) {
if (!links[i]) {
links[i] = way;
return 1;
}
}
return 0;
}
// Link Ways part 2, used only for teleporters
-(int)teleLinkWay:(Waypoint *)way
{
local int i;
if (self == way || !self || !way)
return 0;
else if ([self isLinkedTo:way])
return 0; // already linked!!!
for (i = 0; i < 4; i++) {
if (!links[i]) {
links[i] = way;
flags |= AI_TELELINK_1 << i;
return 1;
}
}
return 0;
}
-(void)unlinkWay:(Waypoint *)way
{
local int i;
if (self == way || !self || !way)
return;
else if (![self isLinkedTo:way])
return;
for (i = 0; i < 4; i++) {
if (links[i] == way) {
flags &= ~(AI_TELELINK_1 << i);
links[i] = nil;
}
}
}
/*
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Waypoint Loading from file
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
*/
+(void)loadFile:(string)path
{
local QFile file;
local PLItem *plist;
local string plist_data;
local int i, count;
file = QFS_OpenFile (path);
if (!file) {
dprint (sprintf ("could not load file: %s", path));
return;
}
plist_data = Qreadstring (file, Qfilesize (file));
Qclose (file);
plist = [PLItem fromString:plist_data];
str_free (plist_data);
[Waypoint clearAll];
count = [(PLArray *)plist numObjects];
dprint (sprintf ("%i waypoints\n", count));
for (i = 0; i < count; i++) {
local PLDictionary *way = (PLDictionary *) [(PLArray *) plist getObjectAtIndex:i];
local PLString *s = (PLString *) [way getObjectForKey:"origin"];
local vector org = stov (sprintf ("'%s'", [s string]));
local PLArray *links = (PLArray *) [way getObjectForKey:"link"];
//FIXME compiler/vm "bug" makes passing pointers to locals dangerous
s = (PLString *) [way getObjectForKey:"flags"];
local int flags = stoi ([s string]);
@static int link[4];
s = (PLString *) [links getObjectAtIndex:0];
link[0] = stoi ([s string]);
s = (PLString *) [links getObjectAtIndex:1];
link[1] = stoi ([s string]);
s = (PLString *) [links getObjectAtIndex:2];
link[2] = stoi ([s string]);
s = (PLString *) [links getObjectAtIndex:3];
link[3] = stoi ([s string]);
[[Waypoint alloc] initAt:org linkedTo:link flags:flags];
}
[Waypoint fixWaypoints];
}
+(void)clearAll
{
dprint ("Waypoint clearAll\n");
if (waypoint_array)
[waypoint_array release];
waypoint_init ();
}
+(Waypoint *)waypointForNum:(int)num
{
if (!num)
return nil;
return [waypoint_array objectAtIndex:num - 1];
}
-(void)fix
{
local int i, tmp;
for (i = 0; i < 4; i++) {
tmp = (int)links[i];
links[i] = [Waypoint waypointForNum:tmp];
}
}
#if 0
// you don't want this. it's harsh. overflows normal servers and clients
-(void) debug
{
local int i;
local vector dir, dest, pos;
@self = spawn ();
@self.origin = origin;
light_globe ();
for (i = 0; i < 4; i++) {
if (!links[i])
continue;
dest = [links[i] origin];
dir = normalize (dest - origin) * 15;
pos = origin;
while ((pos-origin)*(pos-origin) < (dest-origin)*(dest-origin)) {
@self = spawn ();
@self.origin = pos;
precache_model ("progs/s_bubble.spr");
setmodel (@self, "progs/s_bubble.spr");
makestatic (@self);
pos += dir;
}
}
}
#endif
+(void) fixWaypoints
{
[waypoint_array makeObjectsPerformSelector:@selector(fix)];
//see -debug above
//[waypoint_array makeObjectsPerformSelector:@selector(debug)];
}
-(void)plitem:(PLItem *)list
{
local PLDictionary *way = (PLDictionary *) [PLItem newDictionary];
local PLArray *l = (PLArray *) [PLItem newArray];
local int i;
[way addKey:"origin" value:[PLItem newString:sprintf ("%g %g %g",
origin.x,
origin.y,
origin.z)]];
for (i = 0; i < 4; i++) {
if (links[i])
[l addObject:[PLItem newString:itos ([links[i] id])]];
else
[l addObject:[PLItem newString:"0"]];
}
[way addKey:"link" value:l];
[way addKey:"flags" value:[PLItem newString:itos (flags)]];
[(PLArray *) list addObject:way];
}
+(PLItem *) plist
{
local PLItem *list = [PLItem newArray];
[waypoint_array makeObjectsPerformSelector:@selector(plitem:)
withObject:list];
return list;
}
-(void) checkWay:(Target *)ent
{
local int i;
for (i = 0; i < 4; i++)
if (links[i])
break;
if (i == 4)
sprint (ent.ent, PRINT_HIGH,
sprintf ("Waypoitn %i has no outbount links\n", [self id]));
for (i = 0; i < 4; i++)
if (links[i] == self)
break;
if (i != 4)
sprint (ent.ent, PRINT_HIGH,
sprintf ("Waypoitn %i links to itself\n", [self id]));
}
+(void) check:(Target *)ent
{
[waypoint_array makeObjectsPerformSelector:@selector(checkWay)
withObject:ent];
}
+(Waypoint *)find:(vector)org radius:(float)rad
{
local vector dif;
local float dist;
local int i, count;
local Waypoint *way = nil, *w;
rad = rad * rad; // radius squared
count = [waypoint_array count];
for (i = 0; i < count; i++) {
w = [waypoint_array objectAtIndex:i];
dif = w.origin - org;
dist = dif * dif; // dist squared, really
if (dist < rad) {
w.chain = way;
way = w;
}
}
return way;
}
-(void)show
{
if (!ent) {
ent = spawn ();
own = 1;
}
ent.classname = "waypoint";
ent.solid = SOLID_TRIGGER;
ent.movetype = MOVETYPE_NONE;
setsize (ent, VEC_HULL_MIN, VEC_HULL_MAX);
setorigin (ent, origin);
setmodel (ent, "progs/s_bubble.spr");
}
+(void)showAll
{
[waypoint_array makeObjectsPerformSelector:@selector (show)];
}
-(void)hide
{
if (ent) {
remove (ent);
ent = nil;
own = 0;
}
}
+(void)hideAll
{
[waypoint_array makeObjectsPerformSelector:@selector (hide)];
}
-(void)select
{
if (!ent)
[self show];
setmodel (ent, "progs/s_light.spr");
}
-(void)deselect
{
if (!ent)
[self show];
setmodel (ent, "progs/s_bubble.spr");
}
/*
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Route & path table management
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
*/
-(void)clearRoute
{
busy = FALSE;
enemy = nil;
distance = -1; // not in table
}
+(void)clearRouteTable
{
// cleans up route table
[waypoint_array makeObjectsPerformSelector:@selector (clearRoute)];
}
-(void)clearRouteForBot:(Bot *)bot
{
bot_bits &= ~bot.b_clientflag;
}
+(void)clearMyRoute:(Bot *) bot
{
[waypoint_array makeObjectsPerformSelector:@selector (clearRouteForBot:)
withObject:bot];
}
/*
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
WaypointThink
Calculates the routes. We use thinks to avoid
tripping the runaway loop counter
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
*/
-(void)followLink:(Waypoint *)e2 :(int)bBit
{
local float dist;
if (flags & bBit)
dist = distance;
else
dist = vlen(origin - e2.origin) + distance;
// check if this is an RJ link
if (e2.flags & AI_SUPER_JUMP) {
if (![route_table canRJ])
return;
}
if (e2.flags & AI_DIFFICULT)
dist = dist + 1000;
dist = dist + random() * 100; // add a little chaos
if ((dist < e2.distance) || (e2.distance == -1)) {
if (!e2.busy)
busy_waypoints = busy_waypoints + 1;
e2.busy = TRUE;
e2.distance = dist;
e2.enemy = self;
[e2 queueForThink];
}
}
-(void)waypointThink
{
local int i;
if (distance == -1)
return;
// can you say ugly?
if (flags & AI_TRACE_TEST) {
for (i = 0; i < 4; i++) {
if (links[i]) {
traceline (origin, links[i].origin, TRUE, /*self*/nil);
if (trace_fraction == 1)
[self followLink:links[i] :AI_TELELINK_1 << i];
}
}
} else {
for (i = 0; i < 4; i++) {
if (links[i]) {
[self followLink:links[i] :AI_TELELINK_1 << i];
}
}
}
busy_waypoints--;
busy = FALSE;
if (busy_waypoints <= 0) {
if (direct_route) {
[route_table getPath:route_table.targets[0] :FALSE];
direct_route = FALSE;
}
}
if ([waypoint_queue count]
&& (waypoint_thinker.@this = [waypoint_queue lastObject])) {
local id obj = waypoint_thinker.@this;
local IMP imp = [obj methodForSelector: @selector (waypointThink)];
waypoint_thinker.think = (void ()()) imp;
waypoint_thinker.nextthink = time;
[waypoint_queue removeLastObject];
}
}
-(id)queueForThink
{
if (waypoint_thinker.@this) {
[waypoint_queue addObject: self];
} else {
local IMP imp = [self methodForSelector: @selector (waypointThink)];
waypoint_thinker.think = (void ()()) imp;
waypoint_thinker.nextthink = time;
waypoint_thinker.@this = self;
}
return self;
}
-(int)priority:(Bot *)bot
{
if (flags & AI_SNIPER)
return 30;
else if (flags & AI_AMBUSH)
return 30;
return 0;
}
-(float)searchTime
{
return search_time;
}
-(void)setSearchTime:(float)st
{
search_time = st;
}
-(string)classname
{
return is_temp ? "temp_waypoint" : "waypoint";
}
@end
/*
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
BSP/QC Waypoint loading
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
*/
void() waypoint =
{
local Waypoint *way = [[Waypoint alloc] initFromEntity: @self];
};
/* create a new waypoint using frikbot style info
org origin of the waypoint
bit1 first 3 links (cast to int)
bit4 fourth link
flargs various flags
links are 1 based with 0 being no link and 1 being the first waypoint
created, 2 the second and so on.
*/
void(vector org, vector bit1, int bit4, int flargs) make_way =
{
local Waypoint *y = [[Waypoint alloc] initAt:org];
waypoint_mode = WM_LOADED;
y.flags = flargs;
y.links[0] = (Waypoint *) (int) bit1.x;
y.links[1] = (Waypoint *) (int) bit1.y;
y.links[2] = (Waypoint *) (int) bit1.z;
y.links[3] = (Waypoint *) (int) bit4;
};
Reference in New Issue View Git Blame Copy Permalink