Lines Matching refs:prim
47 const struct _mesa_prim *prim; member
115 struct _mesa_prim *prim = &split->dstprim[split->dstprim_nr++]; in next_outprim() local
116 memset(prim, 0, sizeof(*prim)); in next_outprim()
117 return prim; in next_outprim()
124 const struct _mesa_prim *prim) in update_index_bounds() argument
126 split->min_index = MIN2(split->min_index, prim->start); in update_index_bounds()
127 split->max_index = MAX2(split->max_index, prim->start + prim->count - 1); in update_index_bounds()
137 const struct _mesa_prim *prim) in get_max_vertices() argument
139 if ((prim->start > split->min_index && in get_max_vertices()
140 prim->start - split->min_index >= split->limit) || in get_max_vertices()
141 (prim->start < split->max_index && in get_max_vertices()
142 split->max_index - prim->start >= split->limit)) in get_max_vertices()
146 return MIN2(split->min_index, prim->start) + split->limit - prim->start; in get_max_vertices()
159 const struct _mesa_prim *prim = &split->prim[i]; in split_prims() local
162 _tnl_split_prim_inplace(prim->mode, &first, &incr); in split_prims()
163 GLuint available = get_max_vertices(split, prim); in split_prims()
164 GLuint count = prim->count - (prim->count - first) % incr; in split_prims()
166 if (prim->count < first) in split_prims()
172 available = get_max_vertices(split, prim); in split_prims()
178 *outprim = *prim; in split_prims()
191 outprim->mode = prim->mode; in split_prims()
192 outprim->begin = (j == 0 && prim->begin); in split_prims()
193 outprim->end = (nr == remaining && prim->end); in split_prims()
194 outprim->start = prim->start + j; in split_prims()
207 available = get_max_vertices(split, prim); in split_prims()
226 elts[j] = prim->start + j; in split_prims()
233 tmpprim = *prim; in split_prims()
253 prim, 1, in split_prims()
267 const struct _mesa_prim *prim, in _tnl_split_inplace() argument
281 split.prim = prim; in _tnl_split_inplace()