Home
last modified time | relevance | path

Searched refs:primIdx (Results 1 – 15 of 15) sorted by relevance

/dports/science/teem/teem-1.11.0-src/src/limn/
H A Dpolydata.c387 unsigned int ret, primIdx; in limnPolyDataPolygonNumber() local
391 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPolygonNumber()
447 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataVertexNormals_()
451 switch (pld->type[primIdx]) { in limnPolyDataVertexNormals_()
550 unsigned int ret, primIdx; in limnPolyDataPrimitiveTypes() local
554 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPrimitiveTypes()
604 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPrimitiveArea()
605 area[primIdx] = 0; in limnPolyDataPrimitiveArea()
606 switch (pld->type[primIdx]) { in limnPolyDataPrimitiveArea()
608 area[primIdx] = 0.0; in limnPolyDataPrimitiveArea()
[all …]
H A Dpolyfilter.c49 for (primIdx=0; primIdx<pldIn->primNum; primIdx++) { in limnPolyDataSpiralTubeWrap()
55 tvni = tubeFacet*(2 + pldIn->icnt[primIdx]); in limnPolyDataSpiralTubeWrap()
56 tini = 2*tubeFacet*(1 + pldIn->icnt[primIdx]); in limnPolyDataSpiralTubeWrap()
98 for (primIdx=0; primIdx<pldIn->primNum; primIdx++) { in limnPolyDataSpiralTubeWrap()
100 pldOut->type[primIdx] = limnPrimitiveTriangleStrip; in limnPolyDataSpiralTubeWrap()
102 pldOut->icnt[primIdx] = in limnPolyDataSpiralTubeWrap()
105 pldOut->icnt[primIdx] = in limnPolyDataSpiralTubeWrap()
106 2*tubeFacet*(1 + pldIn->icnt[primIdx]); in limnPolyDataSpiralTubeWrap()
110 inVertIdx<pldIn->icnt[primIdx]; in limnPolyDataSpiralTubeWrap()
128 if (1 == pldIn->icnt[primIdx]) { in limnPolyDataSpiralTubeWrap()
[all …]
H A Dio.c152 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataWriteIV()
165 primIdx, airEnumStr(limnPrimitive, pld->type[primIdx])); in limnPolyDataWriteIV()
254 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataWriteIV()
256 triNum = pld->icnt[primIdx]/3; in limnPolyDataWriteIV()
471 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataWriteLMPD()
474 primIdx, airEnumStr(limnPrimitive, pld->type[primIdx])); in limnPolyDataWriteLMPD()
501 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataWriteLMPD()
505 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataWriteLMPD()
678 for (primIdx=0; primIdx<primNum; primIdx++) { in limnPolyDataReadLMPD()
686 if (!(pld->type[primIdx])) { in limnPolyDataReadLMPD()
[all …]
H A Dpolymod.c241 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in maxTrianglePerPrimitive()
279 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in triangleWithVertex()
306 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in triangleWithVertex()
353 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in vertexWithTriangle()
1193 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in _limnPolyDataVertexWindingProcess()
1237 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in _limnPolyDataVertexWindingProcess()
1453 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPrimitiveSort()
1454 rec[1 + 2*primIdx] = primIdx; in limnPolyDataPrimitiveSort()
1474 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPrimitiveSort()
1479 for (primIdx=0; primIdx<pld->primNum; primIdx++) { in limnPolyDataPrimitiveSort()
[all …]
H A Dpolyshapes.c510 primIdx = 0; in limnPolyDataCylinder()
519 pld->icnt[primIdx] = thetaRes; in limnPolyDataCylinder()
520 primIdx++; in limnPolyDataCylinder()
548 primIdx++; in limnPolyDataCylinder()
561 primIdx++; in limnPolyDataCylinder()
686 primIdx = 0; in limnPolyDataCone()
697 primIdx++; in limnPolyDataCone()
705 primIdx++; in limnPolyDataCone()
756 thetaIdx, phiIdx, primIdx; in limnPolyDataSuperquadric() local
816 primIdx = 0; in limnPolyDataSuperquadric()
[all …]
/dports/graphics/yafaray/libYafaRay-3.5.1/include/yafraycore/
H A Dray_kdtree.h29 void createLeaf(uint32_t *primIdx, int np, const T **prims, MemoryArena &arena) in createLeaf() argument
37 for(int i=0;i<np;i++) primitives[i] = (T *)prims[primIdx[i]]; in createLeaf()
42 onePrimitive = (T *)prims[primIdx[0]]; in createLeaf()
92 void pigeonMinCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, splitCost_t &split);
93 void minimalCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx,
H A Dkdtree.h34 void createLeaf(uint32_t *primIdx, int np, const triangle_t **prims, MemoryArena &arena) in createLeaf() argument
42 for(int i=0;i<np;i++) primitives[i] = (triangle_t *)prims[primIdx[i]]; in createLeaf()
47 onePrimitive = (triangle_t *)prims[primIdx[0]]; in createLeaf()
145 void pigeonMinCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, splitCost_t &split);
146 void minimalCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx,
/dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/objects/finders/
H A DBvh.inl.h73 for (Size primIdx = 0; primIdx < node.primCnt; ++primIdx) { in getIntersections() local
76 const TBvhObject& obj = objects[node.start + primIdx]; in getIntersections()
/dports/science/teem/teem-1.11.0-src/src/pull/
H A DcontextPull.c794 primIdx, phistIdx, phistNum; in pullPositionHistoryGet() local
816 primIdx = 0; in pullPositionHistoryGet()
857 pld->type[primIdx] = limnPrimitiveLineStrip; in pullPositionHistoryGet()
858 pld->icnt[primIdx] = phistNum; in pullPositionHistoryGet()
859 primIdx++; in pullPositionHistoryGet()
/dports/misc/usd/USD-21.11/pxr/imaging/hd/
H A DrenderIndex.cpp1120 size_t primIdx = 0; in _PreSyncRequestVector() local
1121 while (primIdx < numPrims) in _PreSyncRequestVector()
1123 if (HdChangeTracker::IsClean(syncReq->request.dirtyBits[primIdx])) { in _PreSyncRequestVector()
1128 ++primIdx; in _PreSyncRequestVector()
1131 std::swap(syncReq->rprims[primIdx], in _PreSyncRequestVector()
1133 std::swap(syncReq->request.IDs[primIdx], in _PreSyncRequestVector()
1135 std::swap(syncReq->request.dirtyBits[primIdx], in _PreSyncRequestVector()
1144 ++primIdx; in _PreSyncRequestVector()
/dports/graphics/yafaray/libYafaRay-3.5.1/src/yafraycore/
H A Dkdtree.cc152 void triKdTree_t::pigeonMinCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, splitCost_t… in pigeonMinCost() argument
172 const bound_t &bbox = allBounds[ primIdx[i] ]; in pigeonMinCost()
301 void triKdTree_t::minimalCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, in minimalCost() argument
321 pn = primIdx[i]; in minimalCost()
337 pn = primIdx[i]; in minimalCost()
H A Dray_kdtree.cc169 void kdTree_t<T>::pigeonMinCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, splitCost_t… in pigeonMinCost() argument
189 const bound_t &bbox = allBounds[ primIdx[i] ]; in pigeonMinCost()
314 void kdTree_t<T>::minimalCost(uint32_t nPrims, bound_t &nodeBound, uint32_t *primIdx, in minimalCost() argument
334 pn = primIdx[i]; in minimalCost()
350 pn = primIdx[i]; in minimalCost()
/dports/graphics/jogamp-jogl/jogl/src/newt/native/
H A DX11RandR13.c73 int i, j, primIdx=0; in dumpOutput() local
78 primIdx = i; in dumpOutput()
/dports/lang/squeak/Squeak-4.10.2.2614-src/unix/src/vm/
H A Dinterp.c2102 if ((primIdx >= 81) && (primIdx <= 88)) { in balancedStackafterPrimitivewithArgs()
4791 sqInt primIdx; in flushExternalPrimitives() local
17280 sqInt primIdx; in primitiveDoPrimitiveWithArgs() local
17338 primIdx = (integerPointer >> 1); in primitiveDoPrimitiveWithArgs()
17345 primIdx = 0; in primitiveDoPrimitiveWithArgs()
17348 primIdx = null; in primitiveDoPrimitiveWithArgs()
17359 foo->primitiveIndex = primIdx; in primitiveDoPrimitiveWithArgs()
22644 sqInt primIdx; in primitiveResponse() local
22653 primIdx = foo->primitiveIndex; in primitiveResponse()
22659 printUnbalancedStack(primIdx); in primitiveResponse()
[all …]
/dports/lang/squeak/Squeak-4.10.2.2614-src/unix/misc/
H A DVMM38b4-64bit-vm1-ikp.1.cs3963 functionPointerFor: primIdx inClass: theClass
3969 ^primitiveTable at: primIdx! !
4078 balancedStack: delta afterPrimitive: primIdx withArgs: nArgs
4080 (primIdx >= 81 and:[primIdx <= 88]) ifTrue:[^true].
6637 dispatchFunctionPointerOn: primIdx in: primTable
6641 ^self dispatchFunctionPointer: (primTable at: primIdx)! !