Searched defs:edgestoadd (Results 1 - 4 of 4) sorted by relevance
/external/quake/quake/src/QW/client/ |
H A D | 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) argument 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 [all...] |
H A D | 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/ |
H A D | 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)
argument 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 [all...] |
H A D | r_edgea.s | 41 #define edgestoadd 4+8 // note odd stack offsets because of interleaving define 51 movl edgestoadd(%esp),%edx
|
Completed in 53 milliseconds