Lines Matching defs:idx
607 int idx = 0;
635 if (idx + 3 * vertex_count > max_index_count) {
679 indices[idx] = indices[idx - 1];
680 indices[idx + 1] = add_vertex(save, vertex_to_index,
683 idx += 2;
688 indices[idx++] = add_vertex(save, vertex_to_index,
695 int start = idx;
707 indices[idx++] = add_vertex(save, vertex_to_index,
712 indices[idx++] = add_vertex(save, vertex_to_index,
723 indices[idx++] = add_vertex(save, vertex_to_index,
733 indices[idx++] = add_vertex(save, vertex_to_index,
743 merged_prims[last_valid_prim].count += idx - start;
751 merged_prims[last_valid_prim].count = idx - start;
756 assert((idx > 0 || converted_prim) && idx <= max_index_count);
761 node->cold->ib.count = idx;
765 total_vert_count = vertex_to_index ? (max_index + 1) : idx;
766 unsigned total_bytes_needed = idx * sizeof(uint32_t) +
835 for (unsigned i = 0; i < idx; i++)
869 idx * sizeof(uint32_t),
872 save->current_bo_bytes_used += idx * sizeof(uint32_t);