Notices & clean
[carveJwlIkooP6JGAAIwe30JlM.git] / world_routes.h
1 /*
2 * Copyright (C) 2021-2022 Mt.ZERO Software, Harry Godden - All Rights Reserved
3 */
4
5 #ifndef ROUTES_H
6 #define ROUTES_H
7
8 #include "world.h"
9 #include "world_info.h"
10 #include "world_gate.h"
11
12 #include "shaders/vblend.h"
13 #include "shaders/route.h"
14 #include "shaders/routeui.h"
15
16 enum route_special_type
17 {
18 k_route_special_type_gate = 1,
19 k_route_special_type_collector = 2
20 };
21
22 static void world_routes_interact(void)
23 {
24 world.routes.last_interaction = vg_time;
25 }
26
27 static void debug_sbpath( struct route_node *rna, struct route_node *rnb,
28 u32 colour, float xoffset )
29 {
30 v3f p0, h0, p1, h1, l, p;
31
32 v3_copy( rna->co, p0 );
33 v3_muladds( rna->co, rna->h, 1.0f, h0 );
34 v3_copy( rnb->co, p1 );
35 v3_muladds( rnb->co, rnb->h, -1.0f, h1 );
36
37 v3_muladds( p0, rna->right, xoffset, p0 );
38 v3_muladds( h0, rna->right, xoffset, h0 );
39 v3_muladds( p1, rnb->right, xoffset, p1 );
40 v3_muladds( h1, rnb->right, xoffset, h1 );
41
42 v3_copy( p0, l );
43
44 for( int i=0; i<5; i++ )
45 {
46 float t = (float)(i+1)/5.0f;
47 eval_bezier_time( p0, p1, h0, h1, t, p );
48 vg_line( p, l, colour );
49 v3_copy( p, l );
50 }
51 }
52
53 /*
54 * Get a list of node ids in stack, and return how many there is
55 */
56 static u32 world_routes_get_path( u32 starter, u32 stack[64] )
57 {
58 struct subworld_routes *r = &world.routes;
59 u32 stack_i[64];
60
61 stack[0] = starter;
62 stack_i[0] = 0;
63
64 u32 si = 1;
65 int loop_complete = 0;
66
67 while( si )
68 {
69 if( stack_i[si-1] == 2 )
70 {
71 si --;
72 continue;
73 }
74
75 struct route_node *rn = &r->nodes[stack[si-1]];
76 u32 nextid = rn->next[stack_i[si-1]];
77 stack_i[si-1] ++;
78
79 if( nextid != 0xffffffff )
80 {
81 if( nextid == stack[0] )
82 {
83 loop_complete = 1;
84 break;
85 }
86
87 int valid = 1;
88 for( int sj=0; sj<si; sj++ )
89 {
90 if( stack[sj] == nextid )
91 {
92 valid = 0;
93 break;
94 }
95 }
96
97 if( valid )
98 {
99 stack_i[si] = 0;
100 stack[si] = nextid;
101 si ++;
102 continue;
103 }
104 }
105 }
106
107 if( loop_complete )
108 return si;
109
110 return 0;
111 }
112
113 /*
114 * Free a segment from the UI bar to be reused later
115 */
116 static void world_routes_ui_popfirst( u32 route )
117 {
118 struct subworld_routes *r = &world.routes;
119 struct route *pr = &r->routes[route];
120
121 if( pr->ui.segment_count )
122 {
123 pr->ui.segment_start ++;
124
125 if( pr->ui.segment_start == 32 )
126 pr->ui.segment_start = 0;
127
128 pr->ui.segment_count --;
129 }
130 }
131
132 /*
133 * Reset ui bar completely
134 */
135 static void world_routes_ui_clear( u32 route )
136 {
137 struct subworld_routes *r = &world.routes;
138 struct route *pr = &r->routes[route];
139 pr->ui.segment_start = (pr->ui.segment_start + pr->ui.segment_count) %
140 k_max_ui_segments;
141 pr->ui.segment_count = 0;
142 }
143
144 /*
145 * Break a index range into two pieces over the edge of the maximum it can
146 * store. s1 is 0 always, so its a ring buffer.
147 */
148 static void world_routes_ui_split_indices( u32 s0, u32 count, u32 *c0, u32 *c1 )
149 {
150 *c0 = (VG_MIN( s0+count, k_route_ui_max_indices )) - s0;
151 *c1 = count-(*c0);
152 }
153
154 /*
155 * Place a set of indices into gpu array automatically splits
156 * across bounds
157 */
158 static void world_routes_ui_set_indices( struct route *pr,
159 u16 *indices, u32 count )
160 {
161 u32 c0, c1;
162 world_routes_ui_split_indices( pr->ui.indices_head, count, &c0, &c1 );
163
164 glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, pr->ui.ebo );
165
166 if( c0 )
167 {
168 glBufferSubData( GL_ELEMENT_ARRAY_BUFFER, pr->ui.indices_head*sizeof(u16),
169 c0*sizeof(u16), indices );
170 }
171
172 if( c1 )
173 {
174 glBufferSubData( GL_ELEMENT_ARRAY_BUFFER, 0, c1*sizeof(u16), indices+c0 );
175 pr->ui.indices_head = c1;
176 }
177 else
178 pr->ui.indices_head += c0;
179 }
180
181 /*
182 * Place a set of vertices into gpu array
183 */
184 static u32 world_routes_ui_set_verts( struct route *pr, v2f *verts, u32 count )
185 {
186 if( pr->ui.vertex_head + count >= k_route_ui_max_verts )
187 pr->ui.vertex_head = 0;
188
189 u32 vert_start = pr->ui.vertex_head;
190 pr->ui.vertex_head += count;
191
192 glBindBuffer( GL_ARRAY_BUFFER, pr->ui.vbo );
193 glBufferSubData( GL_ARRAY_BUFFER, (GLintptr)(vert_start*sizeof(v2f)),
194 sizeof(v2f)*count, verts );
195
196 return vert_start;
197 }
198
199 /*
200 * Update the last (count) vertices positions, does not add any.
201 * Data must already be written to, and not cross either array boundaries.
202 */
203 static u32 world_routes_ui_update_verts( struct route *pr,
204 v2f *verts, u32 count )
205 {
206 u32 vert_start = pr->ui.vertex_head-count;
207
208 glBindBuffer( GL_ARRAY_BUFFER, pr->ui.vbo );
209 glBufferSubData( GL_ARRAY_BUFFER, (GLintptr)(vert_start*sizeof(v2f)),
210 sizeof(v2f)*count, verts );
211
212 return vert_start;
213 }
214
215 /*
216 * Current/active segment of this UI bar
217 */
218 static struct route_ui_segment *world_routes_ui_curseg( struct route *pr )
219 {
220 u32 index = (pr->ui.segment_start+pr->ui.segment_count-1)%k_max_ui_segments;
221 return &pr->ui.segments[ index ];
222 }
223
224 /*
225 * Start a new segment in the UI bar, will create a split on the last one if
226 * there is one active currently. (api)
227 */
228 static void world_routes_ui_newseg( u32 route )
229 {
230 struct subworld_routes *r = &world.routes;
231 struct route *pr = &r->routes[route];
232
233 pr->ui.last_notch = 0.0;
234
235 glBindVertexArray( pr->ui.vao );
236 if( pr->ui.segment_count )
237 {
238 float const k_gap_width = 1.0f;
239
240 struct route_ui_segment *cseg = world_routes_ui_curseg(pr);
241
242 v2f verts[2];
243 verts[0][0] = cseg->length-k_gap_width;
244 verts[0][1] = 0.5f;
245 verts[1][0] = cseg->length-k_gap_width;
246 verts[1][1] = -0.5f;
247
248 world_routes_ui_update_verts( pr, verts, 2 );
249 }
250
251 pr->ui.segment_count ++;
252 struct route_ui_segment *segment = world_routes_ui_curseg(pr);
253
254 v2f verts[4];
255 verts[0][0] = 0.0f;
256 verts[0][1] = 0.5f;
257 verts[1][0] = 0.0f;
258 verts[1][1] = -0.5f;
259 verts[2][0] = 0.0f;
260 verts[2][1] = 0.5f;
261 verts[3][0] = 0.0f;
262 verts[3][1] = -0.5f;
263
264 u32 vert_start = world_routes_ui_set_verts( pr, verts, 4 );
265
266 u16 indices[6];
267 indices[0] = vert_start + 0;
268 indices[1] = vert_start + 1;
269 indices[2] = vert_start + 3;
270 indices[3] = vert_start + 0;
271 indices[4] = vert_start + 3;
272 indices[5] = vert_start + 2;
273
274 segment->vertex_start = vert_start;
275 segment->vertex_count = 4;
276 segment->index_start = pr->ui.indices_head;
277 segment->index_count = 6;
278 segment->notches = 0;
279
280 world_routes_ui_set_indices( pr, indices, 6 );
281 }
282
283 /*
284 * Extend the end of the bar
285 */
286 static void world_routes_ui_updatetime( u32 route, float time )
287 {
288 struct subworld_routes *r = &world.routes;
289 struct route *pr = &r->routes[route];
290
291 v2f verts[2];
292 verts[0][0] = time;
293 verts[0][1] = 0.5f;
294 verts[1][0] = time;
295 verts[1][1] = -0.5f;
296
297 u32 vert_start = pr->ui.vertex_head-2;
298
299 glBindVertexArray( pr->ui.vao );
300 world_routes_ui_update_verts( pr, verts, 2 );
301
302 struct route_ui_segment *cseg = world_routes_ui_curseg(pr);
303 cseg->length = time;
304 }
305
306 /*
307 * Create a notch in the bar, used when a reset is triggered by the user
308 */
309 static void world_routes_ui_notch( u32 route, float time )
310 {
311 struct subworld_routes *r = &world.routes;
312 struct route *pr = &r->routes[route];
313
314 if( (time - pr->ui.last_notch) > 1.0 )
315 {
316 struct route_ui_segment *segment = world_routes_ui_curseg(pr);
317 if( segment->notches == k_max_ui_splits_per_segment )
318 return;
319
320 segment->notches ++;
321
322 v2f verts[8];
323
324 float const k_notch_width = 1.0f;
325
326 float xa = time-k_notch_width,
327 xb = time-k_notch_width * 0.5f,
328 xc = time;
329
330 verts[0][0] = xa;
331 verts[0][1] = 0.5f;
332 verts[1][0] = xa;
333 verts[1][1] = -0.5f;
334
335 verts[2][0] = xb;
336 verts[2][1] = 0.25f;
337 verts[3][0] = xb;
338 verts[3][1] = -0.25f;
339
340 verts[4][0] = xc;
341 verts[4][1] = 0.5f;
342 verts[5][0] = xc;
343 verts[5][1] = -0.5f;
344
345 verts[6][0] = xc;
346 verts[6][1] = 0.5f;
347 verts[7][0] = xc;
348 verts[7][1] = -0.5f;
349
350 glBindVertexArray( pr->ui.vao );
351 u32 vert_start_mod = world_routes_ui_update_verts( pr, verts, 2 ),
352 vert_start_new = world_routes_ui_set_verts( pr, verts+2, 6 );
353
354 u16 indices[18];
355 indices[ 0] = vert_start_mod+1;
356 indices[ 1] = vert_start_new+0;
357 indices[ 2] = vert_start_mod+0;
358 indices[ 3] = vert_start_mod+1;
359 indices[ 4] = vert_start_new+1;
360 indices[ 5] = vert_start_new+0;
361
362 indices[ 6] = vert_start_new+0;
363 indices[ 7] = vert_start_new+1;
364 indices[ 8] = vert_start_new+3;
365 indices[ 9] = vert_start_new+0;
366 indices[10] = vert_start_new+3;
367 indices[11] = vert_start_new+2;
368
369 indices[12] = vert_start_new+3;
370 indices[13] = vert_start_new+4;
371 indices[14] = vert_start_new+2;
372 indices[15] = vert_start_new+3;
373 indices[16] = vert_start_new+5;
374 indices[17] = vert_start_new+4;
375
376 world_routes_ui_set_indices( pr, indices, 18 );
377
378 pr->ui.last_notch = time;
379
380 segment->vertex_count += 6;
381 segment->index_count += 18;
382 }
383 }
384
385 static void world_routes_ui_draw_segment( struct route_ui_segment *segment )
386 {
387 u32 c0, c1;
388 world_routes_ui_split_indices( segment->index_start,
389 segment->index_count, &c0, &c1 );
390 if( c0 )
391 glDrawElements( GL_TRIANGLES, c0, GL_UNSIGNED_SHORT,
392 (void *)(segment->index_start*sizeof(u16)));
393 if( c1 )
394 glDrawElements( GL_TRIANGLES, c1, GL_UNSIGNED_SHORT, (void *)(0) );
395 }
396
397 /*
398 * Draws full bar at Y offset(offset).
399 */
400 static void world_routes_ui_draw( u32 route, v4f colour, float offset )
401 {
402 float const k_bar_height = 0.05f,
403 k_bar_scale_x = 0.005f;
404
405 struct subworld_routes *r = &world.routes;
406 struct route *pr = &r->routes[route];
407
408 float cx = pr->ui.xpos;
409
410 shader_routeui_use();
411 glBindVertexArray( pr->ui.vao );
412
413 float fade_amt = vg_time - pr->ui.fade_timer_start;
414 fade_amt = vg_clampf( fade_amt / 1.0f, 0.0f, 1.0f );
415
416 float fade_block_size = 0.0f,
417 main_block_size = 0.0f;
418
419 for( u32 i=0; i<pr->ui.fade_count; i++ )
420 {
421 u32 j = (pr->ui.fade_start + i) % k_max_ui_segments;
422 struct route_ui_segment *segment = &pr->ui.segments[j];
423
424 fade_block_size += segment->length;
425 }
426
427 cx -= fade_block_size * fade_amt;
428
429 v4f fade_colour;
430 v4_copy( colour, fade_colour );
431 fade_colour[3] *= 1.0f-fade_amt;
432
433 float timer_delta = (vg_time - world.routes.last_interaction) * (1.0/60.0),
434 timer_scale = 1.0f - vg_minf( timer_delta, 1.0f );
435
436 /*
437 * Draw fadeout bar
438 */
439
440 float height = pr->factive*k_bar_height * timer_scale,
441 base = -1.0f + (offset+0.5f)*k_bar_height * timer_scale;
442
443 shader_routeui_uColour( fade_colour );
444 for( u32 i=0; i<pr->ui.fade_count; i++ )
445 {
446 u32 j = (pr->ui.fade_start + i) % k_max_ui_segments;
447 struct route_ui_segment *segment = &pr->ui.segments[j];
448
449 shader_routeui_uOffset( (v4f){ cx*k_bar_scale_x, base,
450 k_bar_scale_x, height } );
451
452 world_routes_ui_draw_segment( segment );
453 cx += segment->length;
454 }
455
456 /*
457 * Draw main bar
458 */
459 shader_routeui_uColour( colour );
460 for( u32 i=0; i<pr->ui.segment_count; i++ )
461 {
462 u32 j = (pr->ui.segment_start + i) % k_max_ui_segments;
463 struct route_ui_segment *segment = &pr->ui.segments[j];
464
465 shader_routeui_uOffset( (v4f){ cx*k_bar_scale_x, base,
466 k_bar_scale_x, height } );
467
468 world_routes_ui_draw_segment( segment );
469 cx += segment->length;
470
471 main_block_size += segment->length;
472 }
473
474 pr->ui.xpos = vg_lerpf( pr->ui.xpos, -main_block_size * 0.5f, 0.03f );
475 }
476
477 static void world_routes_local_set_record( u32 route, double lap_time )
478 {
479 vg_success( " NEW LAP TIME: %f\n", lap_time );
480
481 struct subworld_routes *r = &world.routes;
482 struct route *pr = &r->routes[route];
483
484 if( pr->track_id != 0xffffffff )
485 {
486 double time_centiseconds = lap_time * 100.0;
487 if( time_centiseconds > (float)0xfffe )
488 return;
489
490 highscore_record temp;
491 temp.trackid = pr->track_id;
492 temp.datetime = time(NULL);
493 temp.playerid = 0;
494 temp.points = 0;
495 temp.time = time_centiseconds;
496
497 highscores_push_record( &temp );
498 track_infos[ pr->track_id ].push = 1;
499 }
500 else
501 {
502 vg_warn( "There is no associated track for this record...\n" );
503 }
504 }
505
506 /*
507 * Will scan the whole run for two things;
508 * 1: we set a new record for the total, complete loop around the course
509 * 2: the time of each segment will be recorded into the data buffer
510 * (not implemented: TODO)
511 */
512 static void world_routes_verify_run( u32 route )
513 {
514 struct subworld_routes *r = &world.routes;
515 struct route *pr = &r->routes[route];
516
517 u32 stack[64];
518 u32 si = world_routes_get_path( r->routes[route].start, stack );
519
520 /*
521 * we only care about gates that ref gates, so shuffle down the array
522 */
523 struct route_timing *timings[64];
524 u32 sj = 0, maxv = 0, begin = 0;
525 for( u32 i=0; i<si; i++ )
526 {
527 if( r->nodes[stack[i]].special_type == k_route_special_type_collector )
528 timings[sj ++] = &r->collectors[r->nodes[stack[i]].special_id].timing;
529 else if( r->nodes[stack[i]].special_type == k_route_special_type_gate )
530 timings[sj ++] = &r->gates[r->nodes[stack[i]].special_id].timing;
531 }
532
533 for( u32 i=0; i<sj; i++ )
534 {
535 if( timings[i]->version > maxv )
536 {
537 maxv = timings[i]->version;
538 begin = i;
539 }
540 }
541
542 vg_info( "== begin verification (%u) ==\n", route );
543 vg_info( " current version: %u\n", r->current_run_version );
544
545 int verified = 0;
546 if( timings[begin]->version == r->current_run_version )
547 verified = 1;
548
549 int valid_segment_count = 0;
550
551 double lap_time = 0.0;
552
553 for( u32 i=0; i<sj; i++ )
554 {
555 u32 j = (sj+begin-i-1) % sj,
556 j1 = (j+1) % sj;
557
558 double diff = 0.0;
559
560 if( i<sj-1 )
561 {
562 /* j1v should equal jv+1 */
563 if( timings[j1]->version == timings[j]->version+1 )
564 {
565 diff = timings[j1]->time - timings[j]->time;
566 lap_time += diff;
567
568 if( verified && diff > 0.0 ) valid_segment_count ++;
569 }
570 else
571 verified = 0;
572 }
573
574 if( verified )
575 vg_success( " [ %u %f ] %f\n", timings[j1]->time,
576 timings[j1]->version, diff );
577 else
578 vg_warn( " [ %u %f ]\n", timings[j1]->time, timings[j1]->version );
579 }
580
581 pr->ui.fade_start = pr->ui.segment_start;
582 pr->ui.fade_count = 0;
583 pr->ui.fade_timer_start = vg_time;
584
585 int orig_seg_count = pr->ui.segment_count;
586
587 world_routes_ui_newseg( route );
588
589 if( verified )
590 {
591 world_routes_local_set_record( route, lap_time );
592 world_routes_ui_popfirst(route);
593 pr->ui.fade_count ++;
594 }
595 else
596 vg_info( " ctime: %f\n", lap_time );
597
598 /* remove any excess we had from previous runs */
599 int to_remove = orig_seg_count-valid_segment_count;
600 for( int i=0; i<to_remove; i++ )
601 {
602 world_routes_ui_popfirst(route);
603 pr->ui.fade_count ++;
604 }
605
606 r->routes[route].latest_pass = vg_time;
607 }
608
609 /*
610 * When going through a gate this is called for bookkeeping purposes
611 */
612 static void world_routes_activate_gate( u32 id )
613 {
614 world_routes_interact();
615
616 struct subworld_routes *r = &world.routes;
617 struct route_gate *rg = &r->gates[id];
618 struct route_node *pnode = &r->nodes[rg->node_id],
619 *pdest = &r->nodes[pnode->next[0]];
620
621 struct route_collector *rc = &r->collectors[ pdest->special_id ];
622
623 r->active_gate = id;
624 rg->timing.version = r->current_run_version;
625 rg->timing.time = vg_time;
626 for( u32 i=0; i<r->route_count; i++ )
627 {
628 struct route *route = &r->routes[i];
629
630 int was_active = route->active;
631
632 route->active = 0;
633 for( u32 j=0; j<pdest->ref_count; j++ )
634 {
635 if( pdest->route_ids[j] == i )
636 {
637 world_routes_verify_run( i );
638 route->active = 1;
639 break;
640 }
641 }
642
643 if( was_active && !route->active )
644 {
645 route->ui.fade_start = route->ui.segment_start;
646 route->ui.fade_count = route->ui.segment_count;
647 route->ui.fade_timer_start = vg_time;
648 world_routes_ui_clear(i);
649
650 vg_success( "CLEARING -> %u %u \n", route->ui.fade_start,
651 route->ui.fade_count );
652 }
653 }
654
655 r->current_run_version ++;
656
657 rc->timing.version = r->current_run_version;
658 rc->timing.time = vg_time;
659 r->current_run_version ++;
660 }
661
662 /*
663 * Notify the UI system that we've reset the player
664 */
665 static void world_routes_notify_reset(void)
666 {
667 struct subworld_routes *r = &world.routes;
668 world_routes_interact();
669
670 for( int i=0; i<r->route_count; i++ )
671 {
672 struct route *route = &r->routes[i];
673
674 if( route->active )
675 world_routes_ui_notch( i, vg_time - route->latest_pass );
676 }
677 }
678
679 static void world_routes_debug(void)
680 {
681 struct subworld_routes *r = &world.routes;
682
683 for( int i=0; i<r->node_count; i++ )
684 {
685 struct route_node *rn = &r->nodes[i];
686 vg_line_pt3( rn->co, 1.0f, rn->special_type? 0xffffff00: 0xff00b2ff );
687 }
688
689 for( int i=0; i<r->route_count; i++ )
690 {
691 struct route *route = &r->routes[i];
692
693 u32 stack[64];
694 u32 si = world_routes_get_path( route->start, stack );
695
696 u32 colours[] = { 0xfff58142, 0xff42cbf5, 0xff42f56c, 0xfff542b3,
697 0xff5442f5 };
698
699 u32 cc = colours[i%vg_list_size(colours)];
700
701 for( int sj=0; sj<si; sj++ )
702 {
703 int sk = (sj+1)%si;
704 debug_sbpath( &r->nodes[stack[sj]], &r->nodes[stack[sk]], cc,
705 (float)i );
706 }
707 }
708
709 for( int i=0; i<r->node_count; i++ )
710 {
711 struct route_node *ri = &r->nodes[i],
712 *rj = NULL;
713
714 for( int j=0; j<2; j++ )
715 {
716 if( ri->next[j] != 0xffffffff )
717 {
718 rj = &r->nodes[ri->next[j]];
719 vg_line( ri->co, rj->co, 0x20ffffff );
720 }
721 }
722 }
723 }
724
725 static void world_id_fixup( u32 *uid, mdl_header *mdl )
726 {
727 if( *uid )
728 *uid = mdl_node_from_id( mdl, *uid )->sub_uid;
729 else
730 *uid = 0xffffffff;
731 }
732
733 static void world_routes_create_mesh( u32 route_id )
734 {
735 struct subworld_routes *r = &world.routes;
736 struct route *route = &r->routes[ route_id ];
737
738 u32 stack[64];
739 u32 si = world_routes_get_path( route->start, stack );
740
741 u32 last_valid = 0;
742
743 for( int sj=0; sj<si; sj++ )
744 {
745 int sk=(sj+1)%si;
746
747 struct route_node *rnj = &r->nodes[ stack[sj] ],
748 *rnk = &r->nodes[ stack[sk] ],
749 *rnl;
750
751 if( rnj->special_type && rnk->special_type )
752 {
753 last_valid = 0;
754 continue;
755 }
756
757 float base_x0 = (float)rnj->ref_count*-0.5f + (float)rnj->current_refs,
758 base_x1 = (float)rnk->ref_count*-0.5f + (float)rnk->current_refs;
759
760 if( rnk->special_type )
761 {
762 rnl = &r->nodes[ rnk->next[0] ];
763 base_x1 = (float)rnl->ref_count*-0.5f + (float)rnl->current_refs;
764 }
765
766 if( sk == 0 )
767 {
768 base_x1 -= 1.0f;
769 }
770
771 v3f p0, h0, p1, h1, p, pd;
772
773 v3_copy( rnj->co, p0 );
774 v3_muladds( rnj->co, rnj->h, 1.0f, h0 );
775 v3_copy( rnk->co, p1 );
776 v3_muladds( rnk->co, rnk->h, -1.0f, h1 );
777
778 float t=0.0f;
779 int it = 0;
780
781 for( int it=0; it<256; it ++ )
782 {
783 float const k_sample_dist = 0.02f;
784 eval_bezier_time( p0,p1,h0,h1, t,p );
785 eval_bezier_time( p0,p1,h0,h1, t+k_sample_dist,pd );
786
787 float mod = k_sample_dist / v3_dist( p, pd );
788
789 v3f v0,up, right;
790 v3_muls( rnj->up, 1.0f-t, up );
791 v3_muladds( up, rnk->up, t, up );
792
793 v3_sub( pd,p,v0 );
794 v3_cross( up, v0, right );
795 v3_normalize( right );
796
797 float cur_x = (1.0f-t)*base_x0 + t*base_x1;
798
799 v3f sc, sa, sb, down;
800 v3_muladds( p, right, cur_x, sc );
801 v3_muladds( sc, up, 1.5f, sc );
802 v3_muladds( sc, right, 0.45f, sa );
803 v3_muladds( sc, right, -0.45f, sb );
804 v3_muls( up, -1.0f, down );
805
806 ray_hit ha, hb;
807 ha.dist = 8.0f;
808 hb.dist = 8.0f;
809 if( ray_world( sa, down, &ha ) &&
810 ray_world( sb, down, &hb ))
811 {
812 mdl_vert va, vb;
813
814 v3_muladds( ha.pos, up, 0.06f, va.co );
815 v3_muladds( hb.pos, up, 0.06f, vb.co );
816 v3_copy( up, va.norm );
817 v3_copy( up, vb.norm );
818 v2_zero( va.uv );
819 v2_zero( vb.uv );
820
821 scene_push_vert( &r->scene_lines, &va );
822 scene_push_vert( &r->scene_lines, &vb );
823
824 if( last_valid )
825 {
826 /* Connect them with triangles */
827 scene_push_tri( &r->scene_lines, (u32[3]){
828 last_valid+0-2, last_valid+1-2, last_valid+2-2} );
829 scene_push_tri( &r->scene_lines, (u32[3]){
830 last_valid+1-2, last_valid+3-2, last_valid+2-2} );
831 }
832
833 last_valid = r->scene_lines.vertex_count;
834 }
835 else
836 last_valid = 0;
837
838 t += 1.0f*mod;
839
840 if( t >= 1.0f )
841 {
842 /* TODO special case for end of loop, need to add triangles
843 * between first and last rungs */
844 break;
845 }
846 }
847
848 rnj->current_refs ++;
849 }
850
851 scene_copy_slice( &r->scene_lines, &route->sm );
852 }
853
854 /*
855 * Create the strips of colour that run through the world along course paths
856 */
857 static int world_routes_create_all_meshes(void)
858 {
859 vg_info( "Generating route meshes\n" );
860
861 struct subworld_routes *r = &world.routes;
862 scene_init( &r->scene_lines );
863
864 for( u32 i=0; i<r->route_count; i++ )
865 world_routes_create_mesh( i );
866
867 vg_acquire_thread_sync();
868 {
869 scene_upload( &r->scene_lines );
870
871 /* UI buffers */
872 for( int i=0; i<r->route_count; i++ )
873 {
874 /* OpenGL strips */
875 struct route *route = &r->routes[i];
876
877 glGenVertexArrays( 1, &route->ui.vao );
878 glGenBuffers( 1, &route->ui.vbo );
879 glGenBuffers( 1, &route->ui.ebo );
880 glBindVertexArray( route->ui.vao );
881
882 size_t stride = sizeof(v2f);
883
884 glBindBuffer( GL_ARRAY_BUFFER, route->ui.vbo );
885 glBufferData( GL_ARRAY_BUFFER, k_route_ui_max_verts*stride,
886 NULL, GL_DYNAMIC_DRAW );
887
888 glBindVertexArray( route->ui.vao );
889 glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, route->ui.ebo );
890 glBufferData( GL_ELEMENT_ARRAY_BUFFER,
891 k_route_ui_max_indices*sizeof(u16), NULL,
892 GL_DYNAMIC_DRAW );
893
894 glVertexAttribPointer( 0, 2, GL_FLOAT, GL_FALSE, stride, (void *)0 );
895 glEnableVertexAttribArray( 0 );
896 VG_CHECK_GL_ERR();
897 }
898 }
899 vg_release_thread_sync();
900
901 scene_free_offline_buffers( &r->scene_lines );
902 return 1;
903 }
904
905
906 static void world_routes_loadfrom( mdl_header *mdl )
907 {
908 vg_info( "Initializing routes\n" );
909
910 struct subworld_routes *r = &world.routes;
911 r->nodes = NULL;
912 r->node_count = 0; r->node_cap = 0; r->routes = NULL;
913 r->route_count = 0;
914 r->route_cap = 0;
915 r->gates = NULL;
916 r->gate_count = 0;
917 r->gate_cap = 0;
918
919 /* TODO Break this up */
920 for( int i=0; i<mdl->node_count; i++ )
921 {
922 mdl_node *pnode = mdl_node_from_id(mdl,i);
923 m4x3f transform;
924
925 if( pnode->classtype == k_classtype_route_node ||
926 pnode->classtype == k_classtype_gate )
927 {
928 mdl_node_transform( pnode, transform );
929 pnode->sub_uid = r->node_count;
930
931 r->nodes = buffer_reserve( r->nodes, r->node_count, &r->node_cap, 1,
932 sizeof( struct route_node ) );
933
934 struct route_node *rn = &r->nodes[r->node_count];
935
936 v3_copy( transform[0], rn->right );
937 v3_normalize( rn->right );
938 v3_copy( transform[1], rn->up );
939 v3_normalize( rn->up );
940 v3_muls( transform[2], -1.0f, rn->h );
941 v3_copy( transform[3], rn->co );
942 rn->ref_count = 0;
943 rn->current_refs = 0;
944 rn->special_type = 0;
945 rn->special_id = 0;
946
947 if( pnode->classtype == k_classtype_gate )
948 {
949 struct classtype_gate *inf = mdl_get_entdata( mdl, pnode );
950
951 /* H is later scaled based on link distance */
952 v3_normalize( rn->h );
953 rn->next[0] = inf->target;
954 rn->next[1] = 0;
955
956 /* TODO */
957 if( inf->target )
958 {
959 mdl_node *pother = mdl_node_from_id( mdl, inf->target );
960
961 if( pother->classtype == k_classtype_gate )
962 {
963 r->gates = buffer_reserve( r->gates, r->gate_count,
964 &r->gate_cap,
965 1, sizeof( struct route_gate ) );
966
967 struct route_gate *rg = &r->gates[r->gate_count];
968 rg->node_id = r->node_count;
969 rg->timing.time = 0.0;
970 rg->timing.version = 0;
971
972 v3_copy( pnode->co, rg->gate.co[0] );
973 v3_copy( pother->co, rg->gate.co[1] );
974 v4_copy( pnode->q, rg->gate.q[0] );
975 v4_copy( pother->q, rg->gate.q[1] );
976 v2_copy( inf->dims, rg->gate.dims );
977
978 gate_transform_update( &rg->gate );
979 rn->special_type = k_route_special_type_gate;
980 rn->special_id = r->gate_count;
981
982 r->gate_count ++;
983 }
984 }
985
986 if( rn->special_type == 0 )
987 {
988 r->collectors = buffer_reserve(
989 r->collectors, r->collector_count, &r->collector_cap,
990 1, sizeof( struct route_collector ));
991
992 struct route_collector *rc = &r->collectors[r->collector_count];
993 rc->timing.time = 0.0;
994 rc->timing.version = 0;
995
996 rn->special_type = k_route_special_type_collector;
997 rn->special_id = r->collector_count;
998
999 r->collector_count ++;
1000 }
1001 }
1002 else
1003 {
1004 struct classtype_route_node *inf = mdl_get_entdata( mdl, pnode );
1005 rn->next[0] = inf->target;
1006 rn->next[1] = inf->target1;
1007 }
1008
1009 r->node_count ++;
1010 }
1011 else if( pnode->classtype == k_classtype_route )
1012 {
1013 struct classtype_route *inf = mdl_get_entdata( mdl, pnode );
1014 r->routes = buffer_reserve( r->routes, r->route_count, &r->route_cap,
1015 1, sizeof( struct route ) );
1016
1017 struct route *route = &r->routes[r->route_count];
1018
1019 v3_copy( inf->colour, route->colour );
1020 route->colour[3] = 1.0f;
1021
1022
1023 route->track_id = 0xffffffff;
1024 for( u32 j=0; j<vg_list_size(track_infos); j++ )
1025 {
1026 if( !strcmp( mdl_pstr(mdl,pnode->pstr_name), track_infos[j].name ))
1027 {
1028 route->track_id = j;
1029 break;
1030 }
1031 }
1032
1033 route->start = inf->id_start;
1034 route->active = 0;
1035 route->factive = 0.0f;
1036 mdl_node_transform( pnode, route->scoreboard_transform );
1037
1038 route->ui.indices_head = k_route_ui_max_indices - 9;
1039 route->ui.vertex_head = k_route_ui_max_verts - 200;
1040 route->ui.segment_start = 0;
1041 route->ui.segment_count = 0;
1042 route->ui.last_notch = 0.0;
1043 route->ui.fade_start = 0;
1044 route->ui.fade_count = 0;
1045 route->ui.fade_timer_start = 0.0;
1046
1047 r->route_count ++;
1048 }
1049 }
1050
1051 /*
1052 * Apply correct system-local ids
1053 */
1054 for( int i=0; i<r->node_count; i++ )
1055 {
1056 struct route_node *rn = &r->nodes[i];
1057
1058 for( int j=0; j<2; j++ )
1059 world_id_fixup( &rn->next[j], mdl );
1060 }
1061
1062 for( int i=0; i<r->route_count; i++ )
1063 {
1064 struct route *route = &r->routes[i];
1065 world_id_fixup( &route->start, mdl );
1066 }
1067
1068 /*
1069 * Gather references
1070 */
1071 for( int i=0; i<r->route_count; i++ )
1072 {
1073 struct route *route = &r->routes[i];
1074
1075 u32 stack[64];
1076 u32 si = world_routes_get_path( route->start, stack );
1077
1078 for( int sj=0; sj<si; sj++ )
1079 {
1080 struct route_node *rn = &r->nodes[ stack[sj] ];
1081 rn->route_ids[ rn->ref_count ++ ] = i;
1082
1083 if( rn->ref_count > 4 )
1084 vg_warn( "Too many references on route node %i\n", i );
1085 }
1086 }
1087
1088 world_routes_create_all_meshes();
1089 }
1090
1091 /*
1092 * -----------------------------------------------------------------------------
1093 * Events
1094 * -----------------------------------------------------------------------------
1095 */
1096
1097 static void world_routes_init(void)
1098 {
1099 struct subworld_routes *r = &world.routes;
1100 r->current_run_version = 2;
1101
1102 shader_route_register();
1103 shader_routeui_register();
1104 }
1105
1106 static void world_routes_free(void*_)
1107 {
1108 struct subworld_routes *r = &world.routes;
1109
1110 vg_free( r->nodes );
1111 vg_free( r->routes );
1112 vg_free( r->gates );
1113 }
1114
1115 static void world_routes_update(void)
1116 {
1117 struct subworld_routes *r = &world.routes;
1118
1119 for( int i=0; i<r->route_count; i++ )
1120 {
1121 struct route *route = &r->routes[i];
1122 route->factive = vg_lerpf( route->factive, route->active, 0.01f );
1123
1124 if( route->active )
1125 {
1126 world_routes_ui_updatetime( i, vg_time - route->latest_pass );
1127 }
1128 }
1129 }
1130
1131 static void bind_terrain_textures(void);
1132 static void render_world_routes( m4x4f projection, v3f camera )
1133 {
1134 struct subworld_routes *r = &world.routes;
1135
1136 m4x3f identity_matrix;
1137 m4x3_identity( identity_matrix );
1138
1139 shader_route_use();
1140 shader_route_uTexGarbage(0);
1141 shader_link_standard_ub( _shader_route.id, 2 );
1142 bind_terrain_textures();
1143
1144 shader_route_uPv( projection );
1145 shader_route_uMdl( identity_matrix );
1146 shader_route_uCamera( camera );
1147
1148 scene_bind( &r->scene_lines );
1149
1150 for( int i=0; i<r->route_count; i++ )
1151 {
1152 struct route *route = &r->routes[i];
1153
1154 v4f colour;
1155 v3_lerp( (v3f){0.7f,0.7f,0.7f}, route->colour, route->factive, colour );
1156 colour[3] = 1.0f;
1157
1158 shader_route_uColour( colour );
1159 mdl_draw_submesh( &route->sm );
1160 }
1161 }
1162
1163 static void render_world_routes_ui(void)
1164 {
1165 glEnable(GL_BLEND);
1166 glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);
1167 glBlendEquation(GL_FUNC_ADD);
1168
1169 struct subworld_routes *r = &world.routes;
1170
1171 float active_offset = 0.0f;
1172 for( int i=0; i<r->route_count; i++ )
1173 {
1174 struct route *route = &r->routes[i];
1175 world_routes_ui_draw( i, route->colour, active_offset );
1176 active_offset += route->factive;
1177 }
1178
1179 glDisable(GL_BLEND);
1180 }
1181
1182 #endif /* ROUTES_H */