Lines Matching refs:surf
42 // surfaces are generated in back to front order by the bsp, so if a surf
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
304 surf_t *surf;
310 surf = surfaces[1].next;
312 if (iu > surf->last_u)
315 span->u = surf->last_u;
318 span->pnext = surf->spans;
319 surf->spans = span;
325 surf->spanstate = 0;
326 surf = surf->next;
327 } while (surf != &surfaces[1]);
339 surf_t *surf, *surf2;
343 surf = &surfaces[edge->surfs[1]];
348 if (++surf->spanstate == 1)
352 if (surf->key > surf2->key)
357 if (surf->insubmodel && (surf->key == surf2->key))
369 } while (surf->key < surf2->key);
371 if (surf->key == surf2->key)
375 if (!surf->insubmodel)
399 surf->last_u = iu;
403 surf->next = surf2;
404 surf->prev = surf2->prev;
405 surf2->prev->next = surf;
406 surf2->prev = surf;
416 void R_TrailingEdge (surf_t *surf, edge_t *edge)
424 if (--surf->spanstate == 0)
426 if (surf->insubmodel)
429 if (surf == surfaces[1].next)
433 if (iu > surf->last_u)
436 span->u = surf->last_u;
439 span->pnext = surf->spans;
440 surf->spans = span;
444 surf->next->last_u = iu;
447 surf->prev->next = surf->next;
448 surf->next->prev = surf->prev;
463 surf_t *surf, *surf2;
470 surf = &surfaces[edge->surfs[1]];
475 if (++surf->spanstate == 1)
477 if (surf->insubmodel)
482 if (surf->key < surf2->key)
487 if (surf->insubmodel && (surf->key == surf2->key))
491 newzi = surf->d_ziorigin + fv*surf->d_zistepv +
492 fu*surf->d_zistepu;
506 if (surf->d_zistepu >= surf2->d_zistepu)
518 } while (surf->key > surf2->key);
520 if (surf->key == surf2->key)
524 if (!surf->insubmodel)
529 newzi = surf->d_ziorigin + fv*surf->d_zistepv +
530 fu*surf->d_zistepu;
544 if (surf->d_zistepu >= surf2->d_zistepu)
570 surf->last_u = iu;
574 surf->next = surf2;
575 surf->prev = surf2->prev;
576 surf2->prev->next = surf;
577 surf2->prev = surf;
591 surf_t *surf;
605 surf = &surfaces[edge->surfs[0]];
607 R_TrailingEdge (surf, edge);
