world_routes.h

   1 #ifndef ROUTES_H
   2 #define ROUTES_H
   3
   4 #include "common.h"
   5 #include "model.h"
   6 #include "gate.h"
   7
   8 #include "shaders/vblend.h"
   9 #include "shaders/route.h"
  10
  11 enum route_special_type
  12 {
  13    k_route_special_type_gate = 1,
  14    k_route_special_type_collector = 2
  15 };
  16
  17 struct subworld_routes
  18 {
  19    struct route_node
  20    {
  21       v3f co, right, up, h;
  22       u32 next[2];
  23
  24       u32 special_type, special_id, current_refs, ref_count;
  25       u32 route_ids[4];    /* Gates can be linked into up to four routes */
  26    }
  27    *nodes;
  28
  29    u32 node_count,
  30        node_cap;
  31
  32    struct route
  33    {
  34       const char *name;
  35       v4f colour;
  36
  37       u32 start;
  38       mdl_submesh sm;
  39
  40       int active;
  41       float factive;
  42    }
  43    *routes;
  44
  45    u32 route_count,
  46        route_cap;
  47
  48    struct route_gate
  49    {
  50       teleport_gate gate;
  51
  52       u32 node_id;
  53       u32 passed_version; /* Incremented on every teleport */
  54    }
  55    *gates;
  56
  57    struct route_collector
  58    {
  59       double time_passed; /* When did we last pass this? */
  60    }
  61    *collectors;
  62
  63    u32 gate_count,
  64        gate_cap,
  65        collector_count,
  66        collector_cap;
  67
  68    u32 active_gate,
  69        current_run_version;
  70
  71    scene scene_lines;
  72 };
  73
  74 static struct subworld_routes *subworld_routes(void);
  75
  76 static void debug_sbpath( struct route_node *rna, struct route_node *rnb,
  77                           u32 colour, float xoffset )
  78 {
  79    v3f p0, h0, p1, h1, l, p;
  80
  81    v3_copy( rna->co, p0 );
  82    v3_muladds( rna->co, rna->h,  1.0f, h0 );
  83    v3_copy( rnb->co, p1 );
  84    v3_muladds( rnb->co, rnb->h, -1.0f, h1 );
  85
  86    v3_muladds( p0, rna->right, xoffset, p0 );
  87    v3_muladds( h0, rna->right, xoffset, h0 );
  88    v3_muladds( p1, rnb->right, xoffset, p1 );
  89    v3_muladds( h1, rnb->right, xoffset, h1 );
  90
  91    v3_copy( p0, l );
  92
  93    for( int i=0; i<5; i++ )
  94    {
  95       float t = (float)(i+1)/5.0f;
  96       eval_bezier_time( p0, p1, h0, h1, t, p );
  97       vg_line( p, l, colour );
  98       v3_copy( p, l );
  99    }
 100 }
 101
 102 static u32 world_routes_get_path( u32 starter, u32 stack[64] )
 103 {
 104    struct subworld_routes *r = subworld_routes();
 105    u32 stack_i[64];
 106
 107    stack[0] = starter;
 108    stack_i[0] = 0;
 109
 110    u32 si = 1;
 111    int loop_complete = 0;
 112
 113    while( si )
 114    {
 115       if( stack_i[si-1] == 2 )
 116       {
 117          si --;
 118          continue;
 119       }
 120
 121       struct route_node *rn = &r->nodes[stack[si-1]];
 122       u32 nextid = rn->next[stack_i[si-1]];
 123       stack_i[si-1] ++;
 124
 125       if( nextid != 0xffffffff )
 126       {
 127          if( nextid == stack[0] )
 128          {
 129             loop_complete = 1;
 130             break;
 131          }
 132
 133          int valid = 1;
 134          for( int sj=0; sj<si; sj++ )
 135          {
 136             if( stack[sj] == nextid )
 137             {
 138                valid = 0;
 139                break;
 140             }
 141          }
 142
 143          if( valid )
 144          {
 145             stack_i[si] = 0;
 146             stack[si] = nextid;
 147             si ++;
 148             continue;
 149          }
 150       }
 151    }
 152
 153    if( loop_complete )
 154       return si;
 155
 156    return 0;
 157 }
 158
 159 static void world_routes_verify_run( u32 route, double new_pass_time )
 160 {
 161    struct subworld_routes *r = subworld_routes();
 162
 163    u32 stack[64];
 164    u32 si = world_routes_get_path( r->routes[route].start, stack );
 165
 166    /*
 167     * we only care about gates that ref gates, so shuffle down the array
 168     */
 169    u32 gates[64];
 170    u32 sj = 0;
 171    for( u32 i=0; i<si; i++ )
 172       if( r->nodes[stack[i]].special_type == k_route_special_type_gate )
 173          gates[sj ++] = r->nodes[stack[i]].special_id;
 174
 175    /*
 176     * run versions & times must always ASCEND apart from exactly once, where
 177     * the tail connects to the head
 178     */
 179
 180    vg_info("Verifying run (%u)\n", route);
 181
 182    u32 offset = 0xffffffff;
 183
 184    vg_info( "  ver: %u\n", r->current_run_version );
 185
 186    for( u32 i=0; i<sj; i++ )
 187    {
 188       struct route_gate *pa = &r->gates[gates[i]];
 189       u32 na = r->nodes[r->nodes[pa->node_id].next[0]].special_id;
 190       struct route_collector *pca = &r->collectors[ na ];
 191
 192       if( pa->passed_version != r->current_run_version )
 193       {
 194          vg_info( "  [%u]: %u (%f)\n", gates[i], pa->passed_version,
 195                                                  pca->time_passed );
 196       }
 197       else
 198       {
 199          vg_info( "  [%u]: %u (%f & %f)\n", gates[i], pa->passed_version,
 200                                                       pca->time_passed,
 201                                                       new_pass_time );
 202          offset = i;
 203       }
 204    }
 205
 206    if( offset == 0xffffffff )
 207    {
 208       /* If we don't find the emitter we passed through, we've only just
 209        * started this route, so no blocks need to be emmited */
 210       return;
 211    }
 212
 213    double lap_time = 0.0;
 214    int verify_count = 0;
 215
 216    for( u32 i=0; i<sj; i++ )
 217    {
 218       u32 j = i+offset;
 219       struct route_gate *pa = &r->gates[gates[j%sj]],
 220                         *pb = &r->gates[gates[(j+1) % sj]];
 221
 222       u32 na = r->nodes[r->nodes[pa->node_id].next[0]].special_id,
 223           nb = r->nodes[r->nodes[pb->node_id].next[0]].special_id;
 224
 225       struct route_collector *pca = &r->collectors[ na ],
 226                              *pcb = &r->collectors[ nb ];
 227
 228       double diff = 0.0;
 229
 230       /* Verifying the path: either of this conditions must be true */
 231       int verified = 0;
 232       if( pa->passed_version == r->current_run_version )
 233       {
 234          /* The version should drop back down to pa+1-sj */
 235       }
 236       else
 237       {
 238          /* The version should be pa+1 */
 239       }
 240
 241       verify_count += verified;
 242
 243       if( pb->passed_version == r->current_run_version )
 244       {
 245          /* we need to use new val */
 246          diff = new_pass_time - pca->time_passed;
 247          vg_info( " LOOP %f\n", diff );
 248       }
 249       else
 250       {
 251          diff = pcb->time_passed - pca->time_passed;
 252          vg_info( "      %f\n", diff );
 253       }
 254
 255       lap_time += diff;
 256    }
 257
 258    /* Verify count is how many blocks we want to emit */
 259 }
 260
 261 static void world_routes_activate_gate( u32 id )
 262 {
 263    struct subworld_routes *r = subworld_routes();
 264    struct route_gate *rg = &r->gates[id];
 265    struct route_node *pnode = &r->nodes[rg->node_id],
 266                      *pdest = &r->nodes[pnode->next[0]];
 267
 268    struct route_collector *rc = &r->collectors[ pdest->special_id ];
 269
 270    r->active_gate = id;
 271    rg->passed_version = r->current_run_version;
 272
 273    vg_info( "collector updated: %u\n", pdest->special_id );
 274
 275    for( u32 i=0; i<r->route_count; i++ )
 276    {
 277       struct route *route = &r->routes[i];
 278
 279       route->active = 0;
 280       for( u32 j=0; j<pdest->ref_count; j++ )
 281       {
 282          if( pdest->route_ids[j] == i )
 283          {
 284             world_routes_verify_run( i, vg_time );
 285             route->active = 1;
 286             break;
 287          }
 288       }
 289    }
 290
 291    rc->time_passed = vg_time;
 292    r->current_run_version ++;
 293 }
 294
 295 static void world_routes_debug(void)
 296 {
 297    struct subworld_routes *r = subworld_routes();
 298
 299    for( int i=0; i<r->node_count; i++ )
 300    {
 301       struct route_node *rn = &r->nodes[i];
 302       vg_line_pt3( rn->co, 1.0f, rn->special_type? 0xffffff00: 0xff00b2ff );
 303    }
 304
 305    for( int i=0; i<r->route_count; i++ )
 306    {
 307       struct route *route = &r->routes[i];
 308
 309       u32 stack[64];
 310       u32 si = world_routes_get_path( route->start, stack );
 311
 312       u32 colours[] = { 0xfff58142, 0xff42cbf5, 0xff42f56c, 0xfff542b3,
 313                         0xff5442f5 };
 314
 315       u32 cc = colours[i%vg_list_size(colours)];
 316
 317       for( int sj=0; sj<si; sj++ )
 318       {
 319          int sk = (sj+1)%si;
 320          debug_sbpath( &r->nodes[stack[sj]], &r->nodes[stack[sk]], cc,
 321                (float)i );
 322       }
 323    }
 324
 325    for( int i=0; i<r->node_count; i++ )
 326    {
 327       struct route_node *ri = &r->nodes[i],
 328                         *rj = NULL;
 329
 330       for( int j=0; j<2; j++ )
 331       {
 332          if( ri->next[j] != 0xffffffff )
 333          {
 334             rj = &r->nodes[ri->next[j]];
 335             vg_line( ri->co, rj->co, 0x20ffffff );
 336          }
 337       }
 338    }
 339 }
 340
 341 static void world_routes_free(void)
 342 {
 343    struct subworld_routes *r = subworld_routes();
 344
 345    free( r->nodes );
 346    free( r->routes );
 347    free( r->gates );
 348 }
 349
 350 static void world_id_fixup( u32 *uid, mdl_header *mdl )
 351 {
 352    if( *uid )
 353       *uid = mdl_node_from_id( mdl, *uid )->sub_uid;
 354    else
 355       *uid = 0xffffffff;
 356 }
 357
 358 static void world_routes_gen_meshes(void)
 359 {
 360    struct subworld_routes *r = subworld_routes();
 361    scene_init( &r->scene_lines );
 362
 363    for( int i=0; i<r->route_count; i++ )
 364    {
 365       struct route *route = &r->routes[i];
 366
 367       u32 stack[64];
 368       u32 si = world_routes_get_path( route->start, stack );
 369
 370       u32 last_valid = 0;
 371
 372       for( int sj=0; sj<si; sj++ )
 373       {
 374          int sk=(sj+1)%si;
 375
 376          struct route_node *rnj = &r->nodes[ stack[sj] ],
 377                            *rnk = &r->nodes[ stack[sk] ],
 378                            *rnl;
 379
 380          if( rnj->special_type && rnk->special_type )
 381          {
 382             last_valid = 0;
 383             continue;
 384          }
 385
 386          float base_x0 = (float)rnj->ref_count*-0.5f + (float)rnj->current_refs,
 387                base_x1 = (float)rnk->ref_count*-0.5f + (float)rnk->current_refs;
 388
 389          if( rnk->special_type )
 390          {
 391             rnl = &r->nodes[ rnk->next[0] ];
 392             base_x1 = (float)rnl->ref_count*-0.5f + (float)rnl->current_refs;
 393          }
 394
 395          if( sk == 0 )
 396          {
 397             base_x1 -= 1.0f;
 398          }
 399
 400          v3f p0, h0, p1, h1, p, pd;
 401
 402          v3_copy( rnj->co, p0 );
 403          v3_muladds( rnj->co, rnj->h,  1.0f, h0 );
 404          v3_copy( rnk->co, p1 );
 405          v3_muladds( rnk->co, rnk->h, -1.0f, h1 );
 406
 407          float t=0.0f;
 408          int it = 0;
 409
 410          for( int it=0; it<256; it ++ )
 411          {
 412             float const k_sample_dist = 0.02f;
 413             eval_bezier_time( p0,p1,h0,h1, t,p );
 414             eval_bezier_time( p0,p1,h0,h1, t+k_sample_dist,pd );
 415
 416             float mod = k_sample_dist / v3_dist( p, pd );
 417
 418             v3f v0,up, right;
 419             v3_muls( rnj->up, 1.0f-t, up );
 420             v3_muladds( up, rnk->up, t, up );
 421
 422             v3_sub( pd,p,v0 );
 423             v3_cross( up, v0, right );
 424             v3_normalize( right );
 425
 426             float cur_x = (1.0f-t)*base_x0 + t*base_x1;
 427
 428             v3f sc, sa, sb, down;
 429             v3_muladds( p, right, cur_x, sc );
 430             v3_muladds( sc, up, 1.5f, sc );
 431             v3_muladds( sc, right,  0.45f, sa );
 432             v3_muladds( sc, right, -0.45f, sb );
 433             v3_muls( up, -1.0f, down );
 434
 435             ray_hit ha, hb;
 436             ha.dist = 8.0f;
 437             hb.dist = 8.0f;
 438             if(ray_world( sa, down, &ha ) &&
 439                ray_world( sb, down, &hb ))
 440             {
 441                mdl_vert va, vb;
 442
 443                v3_muladds( ha.pos, up, 0.06f, va.co );
 444                v3_muladds( hb.pos, up, 0.06f, vb.co );
 445                v3_copy( up, va.norm );
 446                v3_copy( up, vb.norm );
 447                v3_zero( va.colour );
 448                v3_zero( vb.colour );
 449                v2_zero( va.uv );
 450                v2_zero( vb.uv );
 451
 452                scene_push_vert( &r->scene_lines, &va );
 453                scene_push_vert( &r->scene_lines, &vb );
 454
 455                if( last_valid )
 456                {
 457                   /* Connect them with triangles */
 458                   scene_push_tri( &r->scene_lines, (u32[3]){
 459                         last_valid+0-2, last_valid+1-2, last_valid+2-2} );
 460                   scene_push_tri( &r->scene_lines, (u32[3]){
 461                         last_valid+1-2, last_valid+3-2, last_valid+2-2} );
 462                }
 463
 464                last_valid = r->scene_lines.vertex_count;
 465             }
 466             else
 467                last_valid = 0;
 468
 469             t += 1.0f*mod;
 470
 471             if( t >= 1.0f )
 472             {
 473                /* TODO special case for end of loop, need to add triangles
 474                 *      between first and last rungs */
 475                break;
 476             }
 477          }
 478
 479          rnj->current_refs ++;
 480       }
 481
 482       scene_copy_slice( &r->scene_lines, &route->sm );
 483    }
 484
 485    scene_upload( &r->scene_lines );
 486    scene_free_offline_buffers( &r->scene_lines );
 487 }
 488
 489 static void bind_terrain_textures(void);
 490 static void render_world_routes( m4x4f projection, v3f camera )
 491 {
 492    struct subworld_routes *r = subworld_routes();
 493
 494    m4x3f identity_matrix;
 495    m4x3_identity( identity_matrix );
 496
 497    shader_route_use();
 498    shader_route_uTexGarbage(0);
 499    shader_link_standard_ub( _shader_route.id, 2 );
 500    bind_terrain_textures();
 501
 502    shader_route_uPv( projection );
 503    shader_route_uMdl( identity_matrix );
 504    shader_route_uCamera( camera );
 505
 506    scene_bind( &r->scene_lines );
 507
 508    for( int i=0; i<r->route_count; i++ )
 509    {
 510       struct route *route = &r->routes[i];
 511       route->factive = vg_lerpf( route->factive, route->active, 0.01f );
 512
 513       v4f colour;
 514       v3_lerp( (v3f){0.7f,0.7f,0.7f}, route->colour, route->factive, colour );
 515       colour[3] = 1.0f;
 516
 517       shader_route_uColour( colour );
 518       mdl_draw_submesh( &route->sm );
 519    }
 520 }
 521
 522 static void world_routes_register(void)
 523 {
 524    shader_route_register();
 525 }
 526
 527 static void world_routes_loadfrom( mdl_header *mdl )
 528 {
 529    struct subworld_routes *r = subworld_routes();
 530    r->nodes = NULL;
 531    r->node_count = 0;
 532    r->node_cap = 0;
 533    r->routes = NULL;
 534    r->route_count = 0;
 535    r->route_cap = 0;
 536    r->gates = NULL;
 537    r->gate_count = 0;
 538    r->gate_cap = 0;
 539
 540    for( int i=0; i<mdl->node_count; i++ )
 541    {
 542       mdl_node *pnode = mdl_node_from_id(mdl,i);
 543       m4x3f transform;
 544
 545       if( pnode->classtype == k_classtype_route_node ||
 546           pnode->classtype == k_classtype_gate )
 547       {
 548          mdl_node_transform( pnode, transform );
 549          pnode->sub_uid = r->node_count;
 550
 551          r->nodes = buffer_reserve( r->nodes, r->node_count, &r->node_cap, 1,
 552                                     sizeof( struct route_node ) );
 553
 554          struct route_node *rn = &r->nodes[r->node_count];
 555
 556          v3_copy( transform[0], rn->right );
 557          v3_normalize( rn->right );
 558          v3_copy( transform[1], rn->up );
 559          v3_normalize( rn->up );
 560          v3_muls( transform[2], -1.0f, rn->h );
 561          v3_copy( transform[3], rn->co );
 562          rn->ref_count = 0;
 563          rn->current_refs = 0;
 564          rn->special_type = 0;
 565          rn->special_id = 0;
 566
 567          if( pnode->classtype == k_classtype_gate )
 568          {
 569             struct classtype_gate *inf = mdl_get_entdata( mdl, pnode );
 570
 571             /* H is later scaled based on link distance */
 572             v3_normalize( rn->h );
 573             rn->next[0] = inf->target;
 574             rn->next[1] = 0;
 575
 576             /* TODO */
 577             if( inf->target )
 578             {
 579                mdl_node *pother = mdl_node_from_id( mdl, inf->target );
 580
 581                if( pother->classtype == k_classtype_gate )
 582                {
 583                   r->gates = buffer_reserve( r->gates, r->gate_count,
 584                                              &r->gate_cap,
 585                                              1, sizeof( struct route_gate ) );
 586
 587                   struct route_gate *rg = &r->gates[r->gate_count];
 588                   rg->node_id = r->node_count;
 589                   rg->passed_version = 0xffffffff;
 590
 591                   v3_copy( pnode->co,  rg->gate.co[0] );
 592                   v3_copy( pother->co, rg->gate.co[1] );
 593                   v4_copy( pnode->q,   rg->gate.q[0] );
 594                   v4_copy( pother->q,  rg->gate.q[1] );
 595                   v2_copy( inf->dims,  rg->gate.dims );
 596
 597                   gate_transform_update( &rg->gate );
 598                   rn->special_type = k_route_special_type_gate;
 599                   rn->special_id = r->gate_count;
 600
 601                   r->gate_count ++;
 602                }
 603             }
 604
 605             if( rn->special_type == 0 )
 606             {
 607                r->collectors = buffer_reserve(
 608                      r->collectors, r->collector_count, &r->collector_cap,
 609                                           1, sizeof( struct route_collector ));
 610
 611                struct route_collector *rc = &r->collectors[r->collector_count];
 612                rc->time_passed = 0.0;
 613
 614                rn->special_type = k_route_special_type_collector;
 615                rn->special_id = r->collector_count;
 616
 617                r->collector_count ++;
 618             }
 619          }
 620          else
 621          {
 622             struct classtype_route_node *inf = mdl_get_entdata( mdl, pnode );
 623             rn->next[0] = inf->target;
 624             rn->next[1] = inf->target1;
 625          }
 626
 627          r->node_count ++;
 628       }
 629       else if( pnode->classtype == k_classtype_route )
 630       {
 631          struct classtype_route *inf = mdl_get_entdata( mdl, pnode );
 632          r->routes = buffer_reserve( r->routes, r->route_count, &r->route_cap,
 633                                      1, sizeof( struct route ) );
 634
 635          struct route *route = &r->routes[r->route_count];
 636
 637          v3_copy( inf->colour, route->colour );
 638          route->colour[3] = 1.0f;
 639
 640          route->name = NULL;
 641          route->start = inf->id_start;
 642          route->active = 0;
 643          route->factive = 0.0f;
 644
 645          r->route_count ++;
 646       }
 647    }
 648
 649    /*
 650     * Apply correct system-local ids
 651     */
 652    for( int i=0; i<r->node_count; i++ )
 653    {
 654       struct route_node *rn = &r->nodes[i];
 655
 656       for( int j=0; j<2; j++ )
 657          world_id_fixup( &rn->next[j], mdl );
 658    }
 659
 660    for( int i=0; i<r->route_count; i++ )
 661    {
 662       struct route *route = &r->routes[i];
 663       world_id_fixup( &route->start, mdl );
 664    }
 665
 666    /*
 667     * Gather references
 668     */
 669    for( int i=0; i<r->route_count; i++ )
 670    {
 671       struct route *route = &r->routes[i];
 672
 673       u32 stack[64];
 674       u32 si = world_routes_get_path( route->start, stack );
 675
 676       for( int sj=0; sj<si; sj++ )
 677       {
 678          struct route_node *rn = &r->nodes[ stack[sj] ];
 679          rn->route_ids[ rn->ref_count ++ ] = i;
 680
 681          if( rn->ref_count > 4 )
 682             vg_warn( "Too many references on route node %i\n", i );
 683       }
 684    }
 685
 686    world_routes_gen_meshes();
 687 }
 688
 689 #endif /* ROUTES_H */