Searched refs:order (Results 1 - 25 of 736) sorted by relevance

1234567891011>>

/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Dknotvector.cc54 order = _order;
66 order = 0;
81 if( order < 1 || order > MAXORDER ) {
82 // spline order un-supported
86 if( knotcount < (2 * order) ) {
91 if( identical( knotlist[kindex-(order-1)], knotlist[order-1]) ) {
117 if ( multi > order ) {
118 // knot multiplicity greater than order o
[all...]
H A Dbezierarc.h45 int order; /* order of arc */ member in struct:BezierArc
H A Dcurve.cc61 order = geo->qspec[0].order;
73 ps += qs->index * qs->order * qs->stride;
76 mapdesc->xformSampling( ps, qs->order, qs->stride, spts, stride );
79 mapdesc->xformCulling( ps, qs->order, qs->stride, cpts, stride );
108 lower.order = upper.order;
115 mapdesc->subdivide( upper.spts, lower.spts, d, upper.stride, upper.order );
118 mapdesc->subdivide( upper.cpts, lower.cpts, d, upper.stride, upper.order );
162 assert( order <
[all...]
H A Dpatch.cc65 pspec[0].order = geo->qspec[0].order;
66 pspec[1].order = geo->qspec[1].order;
67 pspec[0].stride = pspec[1].order * MAXCOORDS;
75 ps += geo->qspec[0].index * geo->qspec[0].order * geo->qspec[0].stride;
76 ps += geo->qspec[1].index * geo->qspec[1].order * geo->qspec[1].stride;
79 mapdesc->xformSampling( ps, geo->qspec[0].order, geo->qspec[0].stride,
80 geo->qspec[1].order, geo->qspec[1].stride,
85 mapdesc->xformCulling( ps, geo->qspec[0].order, ge
[all...]
H A Dknotvector.h48 long order; /* order of spline */ member in struct:Knotvector
H A Dpatch.h55 int order; member in struct:Patchspec
77 int get_uorder() {return pspec[0].order;}
78 int get_vorder() {return pspec[1].order;}
H A Dcurve.h55 int order; member in class:Curve
/xsrc/external/mit/glu/dist/src/libnurbs/interface/
H A DbezierEval.h36 void bezierCurveEval(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retpoint[]);
37 void bezierCurveEvalDer(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retDer[]);
38 void bezierCurveEvalDerGen(int der, float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retDer[]);
H A DbezierEval.cc61 static void bezierCurveEvalfast(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retpoint[]);
75 void bezierCurveEval(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retpoint[]) argument
86 for(i=1; i<order; i++){
90 retpoint[k] = retpoint[k]*oneMinusX + ctlptr[k]* binomialCoefficients[order-1][i] * XPower;
97 /*order = degree +1 >=1.
99 void bezierCurveEvalfast(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retpoint[])
105 for(i=0; i<order; i++) {
110 for(r=1; r<order; r++){
111 for(i=0; i<order-r; i++) {
118 retpoint[j] = buf[order
125 bezierCurveEvalDer(float u0,float u1,int order,float * ctlpoints,int stride,int dimension,float u,float retDer[]) argument
146 bezierCurveEvalDerGen(int der,float u0,float u1,int order,float * ctlpoints,int stride,int dimension,float u,float retDer[]) argument
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/glx/
H A Drender2.c45 GLint order, const GLdouble * pnts)
56 else if (stride < k || order <= 0) {
60 compsize = k * order * __GLX_SIZE_FLOAT64;
71 __GLX_PUT_LONG(24, order);
76 __glFillMap1d(k, order, stride, pnts, (pc + 28));
85 __GLX_PUT_LONG(28, order);
99 __glFillMap1d(k, order, stride, pnts, buf);
112 GLint order, const GLfloat * pnts)
123 else if (stride < k || order <= 0) {
127 compsize = k * order * __GLX_SIZE_FLOAT3
44 __indirect_glMap1d(GLenum target,GLdouble u1,GLdouble u2,GLint stride,GLint order,const GLdouble * pnts) argument
111 __indirect_glMap1f(GLenum target,GLfloat u1,GLfloat u2,GLint stride,GLint order,const GLfloat * pnts) argument
[all...]
H A Deval.c40 __glFillMap1f(GLint k, GLint order, GLint stride, argument
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride, argument
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
/xsrc/external/mit/MesaLib/dist/src/glx/
H A Drender2.c45 GLint order, const GLdouble * pnts)
56 else if (stride < k || order <= 0) {
60 compsize = k * order * __GLX_SIZE_FLOAT64;
71 __GLX_PUT_LONG(24, order);
76 __glFillMap1d(k, order, stride, pnts, (pc + 28));
85 __GLX_PUT_LONG(28, order);
99 __glFillMap1d(k, order, stride, pnts, buf);
112 GLint order, const GLfloat * pnts)
123 else if (stride < k || order <= 0) {
127 compsize = k * order * __GLX_SIZE_FLOAT3
44 __indirect_glMap1d(GLenum target,GLdouble u1,GLdouble u2,GLint stride,GLint order,const GLdouble * pnts) argument
111 __indirect_glMap1f(GLenum target,GLfloat u1,GLfloat u2,GLint stride,GLint order,const GLfloat * pnts) argument
[all...]
H A Deval.c40 __glFillMap1f(GLint k, GLint order, GLint stride, argument
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 for (i = 0; i < order; i++) {
59 __glFillMap1d(GLint k, GLint order, GLint stride, argument
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
68 for (i = 0; i < order; i++) {
/xsrc/external/mit/libdrm/dist/tests/util/
H A Dformat.h49 enum util_yuv_order order; member in struct:util_yuv_info
/xsrc/external/mit/glu/dist/src/libtess/
H A Dpriorityq.c68 pq->order = NULL;
81 if (pq->order != NULL) memFree( pq->order );
102 pq->order = (PQHeapKey **)memAlloc( (size_t)
103 (pq->size * sizeof(pq->order[0])) );
105 pq->order = (PQHeapKey **)memAlloc( (size_t)
106 ((pq->size+1) * sizeof(pq->order[0])) );
111 if (pq->order == NULL) return 0;
113 p = pq->order;
119 /* Sort the indirect pointers in descending order,
[all...]
/xsrc/external/mit/MesaLib/dist/src/vulkan/util/
H A Dvk_extensions.py81 order = []
84 order.append(1)
86 order.append(2)
88 order.append(int(substring))
90 order.append(substring)
91 return order
/xsrc/external/mit/xorg-server.old/dist/glx/
H A Drensize.c49 GLint order; local in function:__glXMap1dReqSize
52 order = *(GLint*) (pc + 20);
55 order = SWAPL( order );
57 if (order < 1)
59 return safe_mul(8, safe_mul(__glMap1d_size(target), order));
65 GLint order; local in function:__glXMap1fReqSize
68 order = *(GLint *)(pc + 12);
71 order = SWAPL( order );
[all...]
H A Drender2.c47 GLint order, k; local in function:__glXDisp_Map1f
52 order = *(GLint *)(pc + 12);
58 CALL_Map1f( GET_DISPATCH(), (target, u1, u2, k, order, points) );
85 GLint order, k; local in function:__glXDisp_Map1d
93 order = *(GLint*) (pc + 20);
97 if (order < 0 || k < 0) {
100 compsize = order * k;
122 CALL_Map1d( GET_DISPATCH(), (target, u1, u2, k, order, points) );
/xsrc/external/mit/xorg-server/dist/glx/
H A Drensize.c50 GLint order; local in function:__glXMap1dReqSize
53 order = *(GLint *) (pc + 20);
56 order = SWAPL(order);
58 if (order < 1)
60 return safe_mul(8, safe_mul(__glMap1d_size(target), order));
67 GLint order; local in function:__glXMap1fReqSize
70 order = *(GLint *) (pc + 12);
73 order = SWAPL(order);
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mesa/math/
H A Dm_eval.h61 GLuint dim, GLuint order);
/xsrc/external/mit/MesaLib/dist/src/mesa/math/
H A Dm_eval.h61 GLuint dim, GLuint order);
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c15 * HACK: Max order == 21 to accommodate TF2's 1.5 MiB, frequently reallocated
46 int order; member in struct:mm_slab
93 mm_bucket_by_order(struct nouveau_mman *cache, int order) argument
95 if (order > MM_MAX_ORDER)
97 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
148 slab->order = chunk_order;
196 *offset = mm_slab_alloc(slab) << slab->order;
220 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order);
222 mm_slab_free(slab, alloc->offset >> slab->order);
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c15 * HACK: Max order == 21 to accommodate TF2's 1.5 MiB, frequently reallocated
46 int order; member in struct:mm_slab
93 mm_bucket_by_order(struct nouveau_mman *cache, int order) argument
95 if (order > MM_MAX_ORDER)
97 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
148 slab->order = chunk_order;
197 *offset = mm_slab_alloc(slab) << slab->order;
220 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order);
222 mm_slab_free(slab, alloc->offset >> slab->order);
/xsrc/external/mit/MesaLib/dist/src/etnaviv/drm-shim/
H A DREADME.md3 This implements the minimum of etnaviv in order to make shader-db work.
/xsrc/external/mit/MesaLib/dist/src/freedreno/drm-shim/
H A DREADME.md3 This implements the minimum of msm in order to make shader-db work.

Completed in 25 milliseconds

1234567891011>>