Searched refs:BVItem (Results 1 – 2 of 2) sorted by relevance
33 struct BVItem struct42 const BVItem* a = (const BVItem*)va; in compareItemX() argument43 const BVItem* b = (const BVItem*)vb; in compareItemX()53 const BVItem* a = (const BVItem*)va; in compareItemY()54 const BVItem* b = (const BVItem*)vb; in compareItemY()64 const BVItem* a = (const BVItem*)va; in compareItemZ()65 const BVItem* b = (const BVItem*)vb; in compareItemZ()86 const BVItem& it = items[i]; in calcExtends()146 qsort(items+imin, inum, sizeof(BVItem), compareItemX); in subdivide()178 BVItem* items = (BVItem*)dtAlloc(sizeof(BVItem)*npolys, DT_ALLOC_TEMP); in createBVTree()[all …]
33 struct BVItem struct42 const BVItem* a = (const BVItem*)va; in compareItemX() argument43 const BVItem* b = (const BVItem*)vb; in compareItemX()53 const BVItem* a = (const BVItem*)va; in compareItemY()54 const BVItem* b = (const BVItem*)vb; in compareItemY()64 const BVItem* a = (const BVItem*)va; in compareItemZ()65 const BVItem* b = (const BVItem*)vb; in compareItemZ()86 const BVItem& it = items[i]; in calcExtends()145 qsort(items+imin, inum, sizeof(BVItem), compareItemX); in subdivide()175 BVItem* items = (BVItem*)dtAlloc(sizeof(BVItem)*params->polyCount, DT_ALLOC_TEMP); in createBVTree()[all …]