Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:edgestoadd (Results 1 - 6 of 6) sorted by null

/external/quake/quake/src/QW/client/
r_edge.c	167 Adds the edges in the linked list edgestoadd, adding them to the edges in the 168 linked list edgelist. edgestoadd is assumed to be sorted on u, and non-empty (this is actually newedges[v]). edgelist is assumed to be sorted on u, with a 173 void R_InsertNewEdges (edge_t *edgestoadd, edge_t *edgelist) 179 next_edge = edgestoadd->next; 181 if (edgelist->u >= edgestoadd->u) 184 if (edgelist->u >= edgestoadd->u) 187 if (edgelist->u >= edgestoadd->u) 190 if (edgelist->u >= edgestoadd->u) 195 // insert edgestoadd before edgelist 197 edgestoadd->next = edgelist     [all...]
r_local.h	166 void R_InsertNewEdges (edge_t *edgestoadd, edge_t *edgelist);
r_edgea.s	41 #define edgestoadd 4+8 // note odd stack offsets because of interleaving define 51 movl edgestoadd(%esp),%edx
/external/quake/quake/src/WinQuake/
r_edge.cpp	167 Adds the edges in the linked list edgestoadd, adding them to the edges in the 168 linked list edgelist. edgestoadd is assumed to be sorted on u, and non-empty (this is actually newedges[v]). edgelist is assumed to be sorted on u, with a 173 void R_InsertNewEdges (edge_t *edgestoadd, edge_t *edgelist) 179 next_edge = edgestoadd->next; 181 if (edgelist->u >= edgestoadd->u) 184 if (edgelist->u >= edgestoadd->u) 187 if (edgelist->u >= edgestoadd->u) 190 if (edgelist->u >= edgestoadd->u) 195 // insert edgestoadd before edgelist 197 edgestoadd->next = edgelist;     [all...]
r_local.h	165 void R_InsertNewEdges (edge_t *edgestoadd, edge_t *edgelist);
r_edgea.s	41 #define edgestoadd 4+8 // note odd stack offsets because of interleaving define 51 movl edgestoadd(%esp),%edx

Completed in 300 milliseconds