qcsrc/server/pathlib/path_waypoint.qc

   1 #include "path_waypoint.qh"
   2 #include "../bot/waypoints.qh"
   3
   4 #include "pathlib.qh"
   5 #include "main.qh"
   6
   7 var float pathlib_wpp_open(entity wp, entity child, float cost);
   8
   9 void pathlib_wpp_close(entity wp)
  10 {
  11     --pathlib_open_cnt;
  12     ++pathlib_closed_cnt;
  13
  14     wp.pathlib_list = closedlist;
  15
  16     if(wp == best_open_node)
  17         best_open_node = world;
  18
  19     if(wp == goal_node)
  20         pathlib_foundgoal = true;
  21 }
  22
  23 float pathlib_wpp_opencb(entity wp, entity child, float cost)
  24 {
  25
  26     if(child.pathlib_list == closedlist)
  27         return false;
  28
  29         // FIXME! wp.wp##mincost is NOT distance. Make it distance or add a field for distance to be used here (for better speed)
  30         cost = vlen(child.origin - wp.origin);
  31
  32     child.path_prev      = wp;
  33     child.pathlib_list   = openlist;
  34     child.pathlib_node_g = wp.pathlib_node_g + cost;
  35     child.pathlib_node_h = pathlib_heuristic(child.origin, goal_node.origin);
  36     child.pathlib_node_c = pathlib_wpp_waypointcallback(child, wp);
  37     child.pathlib_node_f = child.pathlib_node_g + child.pathlib_node_h + child.pathlib_node_c;
  38
  39
  40     if(child == goal_node)
  41         pathlib_foundgoal = true;
  42
  43     ++pathlib_open_cnt;
  44
  45     if(best_open_node.pathlib_node_f > child.pathlib_node_f)
  46         best_open_node = child;
  47
  48     return true;
  49 }
  50
  51 float pathlib_wpp_openncb(entity wp, entity child, float cost)
  52 {
  53
  54     if(child.pathlib_list == closedlist)
  55         return false;
  56
  57         // FIXME! wp.wp##mincost is NOT distance. Make it distance or add a field for distance to be used here (for better speed)
  58         cost = vlen(child.origin - wp.origin);
  59
  60     child.path_prev      = wp;
  61     child.pathlib_list   = openlist;
  62     child.pathlib_node_g = wp.pathlib_node_g + cost;
  63     child.pathlib_node_h = pathlib_heuristic(child.origin, goal_node.origin);
  64     child.pathlib_node_f = child.pathlib_node_g + child.pathlib_node_h;
  65
  66     if(child == goal_node)
  67         pathlib_foundgoal = true;
  68
  69     ++pathlib_open_cnt;
  70
  71     if(best_open_node.pathlib_node_f > child.pathlib_node_f)
  72         best_open_node = child;
  73
  74     return true;
  75 }
  76
  77 float pathlib_wpp_expand(entity wp)
  78 {
  79     if(wp.wp00) pathlib_wpp_open(wp,wp.wp00,wp.wp00mincost); else return 0;
  80     if(wp.wp01) pathlib_wpp_open(wp,wp.wp01,wp.wp01mincost); else return 1;
  81     if(wp.wp02) pathlib_wpp_open(wp,wp.wp02,wp.wp02mincost); else return 2;
  82     if(wp.wp03) pathlib_wpp_open(wp,wp.wp03,wp.wp03mincost); else return 3;
  83     if(wp.wp04) pathlib_wpp_open(wp,wp.wp04,wp.wp04mincost); else return 4;
  84     if(wp.wp05) pathlib_wpp_open(wp,wp.wp05,wp.wp05mincost); else return 5;
  85     if(wp.wp06) pathlib_wpp_open(wp,wp.wp06,wp.wp06mincost); else return 6;
  86     if(wp.wp07) pathlib_wpp_open(wp,wp.wp07,wp.wp07mincost); else return 7;
  87     if(wp.wp08) pathlib_wpp_open(wp,wp.wp08,wp.wp08mincost); else return 8;
  88     if(wp.wp09) pathlib_wpp_open(wp,wp.wp09,wp.wp09mincost); else return 9;
  89     if(wp.wp10) pathlib_wpp_open(wp,wp.wp10,wp.wp10mincost); else return 10;
  90     if(wp.wp11) pathlib_wpp_open(wp,wp.wp11,wp.wp11mincost); else return 11;
  91     if(wp.wp12) pathlib_wpp_open(wp,wp.wp12,wp.wp12mincost); else return 12;
  92     if(wp.wp13) pathlib_wpp_open(wp,wp.wp13,wp.wp13mincost); else return 13;
  93     if(wp.wp14) pathlib_wpp_open(wp,wp.wp14,wp.wp14mincost); else return 14;
  94     if(wp.wp15) pathlib_wpp_open(wp,wp.wp15,wp.wp15mincost); else return 15;
  95     if(wp.wp16) pathlib_wpp_open(wp,wp.wp16,wp.wp16mincost); else return 16;
  96     if(wp.wp17) pathlib_wpp_open(wp,wp.wp17,wp.wp17mincost); else return 17;
  97     if(wp.wp18) pathlib_wpp_open(wp,wp.wp18,wp.wp18mincost); else return 18;
  98     if(wp.wp19) pathlib_wpp_open(wp,wp.wp19,wp.wp19mincost); else return 19;
  99     if(wp.wp20) pathlib_wpp_open(wp,wp.wp20,wp.wp20mincost); else return 20;
 100     if(wp.wp21) pathlib_wpp_open(wp,wp.wp21,wp.wp21mincost); else return 21;
 101     if(wp.wp22) pathlib_wpp_open(wp,wp.wp22,wp.wp22mincost); else return 22;
 102     if(wp.wp23) pathlib_wpp_open(wp,wp.wp23,wp.wp23mincost); else return 23;
 103     if(wp.wp24) pathlib_wpp_open(wp,wp.wp24,wp.wp24mincost); else return 24;
 104     if(wp.wp25) pathlib_wpp_open(wp,wp.wp25,wp.wp25mincost); else return 25;
 105     if(wp.wp26) pathlib_wpp_open(wp,wp.wp26,wp.wp26mincost); else return 26;
 106     if(wp.wp27) pathlib_wpp_open(wp,wp.wp27,wp.wp27mincost); else return 27;
 107     if(wp.wp28) pathlib_wpp_open(wp,wp.wp28,wp.wp28mincost); else return 28;
 108     if(wp.wp29) pathlib_wpp_open(wp,wp.wp29,wp.wp29mincost); else return 29;
 109     if(wp.wp30) pathlib_wpp_open(wp,wp.wp30,wp.wp30mincost); else return 30;
 110     if(wp.wp31) pathlib_wpp_open(wp,wp.wp31,wp.wp31mincost); else return 31;
 111
 112     return 32;
 113 }
 114
 115 entity pathlib_wpp_bestopen()
 116 {
 117     entity n, best;
 118
 119     if(best_open_node)
 120         return best_open_node;
 121
 122     n = findchainentity(pathlib_list, openlist);
 123     best = n;
 124     while(n)
 125     {
 126         if(n.pathlib_node_f < best.pathlib_node_f)
 127             best = n;
 128
 129         n = n.chain;
 130     }
 131
 132     return best;
 133
 134 }
 135
 136 entity pathlib_waypointpath(entity wp_from, entity wp_to, float callback)
 137 {
 138     entity n;
 139     float ptime;
 140
 141     ptime                                       = gettime(GETTIME_REALTIME);
 142     pathlib_starttime           = ptime;
 143         pathlib_movecost                = 300;
 144         pathlib_movecost_diag   = vlen('1 1 0' * pathlib_movecost);
 145
 146         if (!pathlib_wpp_waypointcallback)
 147                 callback = false;
 148
 149         if (callback)
 150                 pathlib_wpp_open = pathlib_wpp_opencb;
 151         else
 152                 pathlib_wpp_open = pathlib_wpp_openncb;
 153
 154         pathlib_heuristic = pathlib_h_none;
 155
 156     if (!openlist)
 157         openlist       = spawn();
 158
 159     if (!closedlist)
 160         closedlist     = spawn();
 161
 162     pathlib_closed_cnt       = 0;
 163     pathlib_open_cnt         = 0;
 164     pathlib_searched_cnt     = 0;
 165     pathlib_foundgoal      = false;
 166
 167     LOG_TRACE("pathlib_waypointpath init\n");
 168
 169     // Initialize waypoint grid
 170     // FIXME! presisted chain for better preformance
 171     for(n = findchain(classname, "waypoint"); n; n = n.chain)
 172     {
 173         n.pathlib_list = world;
 174         n.pathlib_node_g = 0;
 175         n.pathlib_node_f = 0;
 176         n.pathlib_node_h = 0;
 177
 178         //setmodel(n, "models/runematch/rune.mdl");
 179         //n.effects = EF_LOWPRECISION;
 180         //n.colormod = '0 0 0';
 181         //n.scale = 1;
 182
 183     }
 184
 185     goal_node  = wp_to;
 186     start_node = wp_from;
 187
 188     start_node.pathlib_list = closedlist;
 189     LOG_TRACE("Expanding ",ftos(pathlib_wpp_expand(start_node))," links\n");
 190     if(pathlib_open_cnt <= 0)
 191     {
 192         LOG_TRACE("pathlib_waypointpath: Start waypoint not linked! aborting.\n");
 193         return world;
 194     }
 195
 196     return world;
 197 }
 198
 199 entity pathlib_waypointpath_step()
 200 {
 201     entity n;
 202
 203     n = pathlib_wpp_bestopen();
 204     if(!n)
 205     {
 206         LOG_TRACE("Cannot find best open node, abort.\n");
 207         return world;
 208     }
 209     pathlib_wpp_close(n);
 210         LOG_TRACE("Expanding ",ftos(pathlib_wpp_expand(n))," links\n");
 211
 212     if(pathlib_foundgoal)
 213     {
 214         entity start, end, open, ln;
 215
 216         LOG_TRACE("Target found. Rebuilding and filtering path...\n");
 217
 218                 buildpath_nodefilter = buildpath_nodefilter_none;
 219                 start = path_build(world, start_node.origin, world, world);
 220                 end   = path_build(world, goal_node.origin, world, start);
 221                 ln    = end;
 222
 223                 for(open = goal_node; open.path_prev != start_node; open = open.path_prev)
 224                 {
 225                         n    = path_build(ln,open.origin,open.path_prev,start);
 226                         ln.path_prev = n;
 227                         ln = n;
 228                 }
 229                 start.path_next = n;
 230                 n.path_prev = start;
 231
 232         return start;
 233     }
 234
 235     return world;
 236 }
 237 void plas_think()
 238 {SELFPARAM();
 239     pathlib_waypointpath_step();
 240     if(pathlib_foundgoal)
 241         return;
 242     self.nextthink = time + 0.1;
 243 }
 244
 245 void pathlib_waypointpath_autostep()
 246 {
 247     entity n;
 248     n = spawn();
 249     n.think = plas_think;
 250     n.nextthink = time + 0.1;
 251 }