| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| hull.cc | 91 TrimVertex *rfirst = right.first();
92 TrimVertex *rlast = right.last();
94 fakeright.init( right.last() );
95 lower.right = &fakeright;
96 upper.right = &right;
98 fakeright.init( right.first() );
99 upper.right = &fakeright;
100 lower.right = &right;
[all...] |
| varray.cc | 101 Arc_ptr right = toparc; local
106 rdir[0] = sgn( right->tail()[0] - right->prev->tail()[0] );
107 rdir[1] = sgn( right->tail()[1] - right->prev->tail()[1] );
113 switch( sgn( left->tail()[1] - right->prev->tail()[1] ) ) {
119 right = right->prev;
120 update( right, rdir, right->tail()[1] )
[all...] |
| trimregion.cc | 61 right.init( npts, extrema, 0 );
62 right.getPrevPt();
69 right.getPrevPts( extrema );
76 right.getPrevPts( bot.vval, backend );
82 getGridExtent( left.last(), right.last() );
108 TrimVertex *rf = right.first();
109 TrimVertex *rl = right.last();
|
| hull.h | 58 Trimline *right; member in struct:Hull::Side
|
| coveandtiler.cc | 132 TrimVertex *rf = right.first();
133 TrimVertex *rl = right.last();
202 right.first();
204 output( right.next() );
216 output( right.first() );
217 output( right.next() );
228 TrimVertex *vert = right.next();
234 for( ; vert; vert = right.next() ) {
242 vert = right.next();
248 for( ; vert; vert = right.next() )
[all...] |
| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| quicksort.h | 39 void quicksort(void *v[], int left, int right,
|
| quicksort.cc | 60 * quicksort( (void**)v, left, right, (int (*)(void *, void *))comp)
62 void quicksort(void *v[], int left, int right,
66 if(left >= right) /*do nothing if array contains */
69 swap(v, left, (left+right)/2);
71 for(i=left+1; i<=right; i++)
76 quicksort(v, last+1, right, comp);
|
| searchTree.cc | 53 ret->right = NULL;
66 TreeNodeDeleteWholeTree(node->right);
76 TreeNodePrint(node->right, keyPrint);
84 int rightdepth = TreeNodeDepth(root->right);
102 return TreeNodeFind(tree->right, key, compkey);
119 x = x->right;
124 * if newnode > y, then y->right is NULL.
136 y->right = newnode;
149 if(node->left == NULL || node->right == NULL) {
155 x = y->right;
[all...] |
| partitionY.h | 73 directedLine *right; member in struct:sweepRange
78 directedLine* right, Int rightType);
|
| /xsrc/external/mit/xorg-server.old/dist/fb/ |
| fbtrap.c | 101 xPointFixed *top, *left, *right, *tmp; local
108 right = &tris->p3;
112 if (_GreaterY (top, right)) {
113 tmp = right; right = top; top = tmp;
115 if (_Clockwise (top, right, left)) {
116 tmp = right; right = left; left = tmp;
135 trap.right.p1 = *top;
136 trap.right.p2 = *right
[all...] |
| /xsrc/external/mit/MesaLib/dist/include/android_stub/android/ |
| rect.h | 42 * In a valid ARect, left <= right and top <= bottom. ARect with left=0, top=10,
43 * right=1, bottom=11 contains only one pixel at x=0, y=10.
54 int32_t right; member in struct:ARect
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| rb_tree.c | 90 while (node->right)
91 node = node->right;
119 assert(u == p->right);
120 p->right = v;
129 assert(x && x->right);
131 struct rb_node *y = x->right;
132 x->right = y->left;
146 y->left = x->right;
147 if (x->right)
148 rb_node_set_parent(x->right, y)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| rb_tree.c | 90 while (node->right)
91 node = node->right;
119 assert(u == p->right);
120 p->right = v;
129 assert(x && x->right);
131 struct rb_node *y = x->right;
132 x->right = y->left;
146 y->left = x->right;
147 if (x->right)
148 rb_node_set_parent(x->right, y)
[all...] |
| /xsrc/external/mit/MesaGLUT/dist/src/glut/beos/ |
| glutstroke.h | 29 float right; member in struct:__anon6
|
| glut_swidth.c | 28 return ch->right;
52 length += ch->right;
|
| /xsrc/external/mit/ctwm/dist/ |
| r_area.c | 70 * Return the right edge of an RArea.
230 // left- and right-most x coords, which define the maximum width
355 const RArea *left, *right; local
358 right = other;
362 right = self;
365 // [--left--] or [right] or [right] or [left]
366 // [right] [--left--] [left] [right]
368 // Room to the left before right starts? That's one stripe
[all...] |
| /xsrc/external/mit/MesaGLUT/dist/src/glut/glx/ |
| glut_swidth.c | 28 return ch->right;
52 length += ch->right;
|
| glutstroke.h | 33 float right; member in struct:__anon13
|
| /xsrc/external/mit/xf86-video-sis/dist/src/ |
| sis_common.h | 58 unsigned int left, right; member in struct:__anon9402
|
| /xsrc/external/mit/xf86-video-xgi/dist/src/ |
| xgi_common.h | 58 unsigned int left, right; member in struct:__anon9680
|
| /xsrc/external/mit/mesa-demos/dist/src/redbook/ |
| accpersp.c | 65 static void accFrustum(GLdouble left, GLdouble right, GLdouble bottom,
75 xwsize = right - left;
83 glFrustum (left + dx, right + dx, bottom + dy, top + dy, nnear, ffar);
106 GLdouble fov2,left,right,bottom,top; local
113 right = top * aspect;
114 left = -right;
116 accFrustum (left, right, bottom, top, nnear, ffar,
|
| dof.c | 71 static void accFrustum(GLdouble left, GLdouble right, GLdouble bottom,
81 xwsize = right - left;
89 glFrustum (left + dx, right + dx, bottom + dy, top + dy, nnear, ffar);
112 GLdouble fov2,left,right,bottom,top; local
119 right = top * aspect;
120 left = -right;
122 accFrustum (left, right, bottom, top, nnear, ffar,
|
| /xsrc/external/mit/xf86-input-synaptics/dist/src/ |
| alpscomm.c | 145 * left,right,up,down.
147 * reflects left,right,down,up in lef1,rig1,mid1,up1.
153 int left = 0, right = 0, middle = 0; local
164 hw->right = (packet[3] >> 1) & 1;
170 hw->left = hw->right = hw->up = hw->down = hw->middle = FALSE;
184 right |= (packet[3] >> 1) & 1;
199 right |= (packet[0] >> 1) & 1;
205 hw->right = right;
|
| /xsrc/external/mit/MesaLib.old/dist/src/freedreno/ir3/ |
| ir3_group.c | 101 for (instr = ir3_neighbor_first(instr); instr; instr = instr->cp.right)
115 * left/right neighbor pointers. Trying to do it in a single
117 * the mov's right neighbor ptr if the next instr also needs
125 struct ir3_instruction *right = (i < (n-1)) ? ops->get(arr, i + 1) : NULL; local
128 /* check for left/right neighbor conflicts: */
130 conflicts(instr->cp.right, right);
155 /* second pass, now that we've inserted mov's, fixup left/right
163 struct ir3_instruction *right = (i < (n-1)) ? ops->get(arr, i + 1) : NULL; local
171 debug_assert(!conflicts(instr->cp.right, right))
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| brw_fs_builder.h | 461 dst_reg right = horiz_offset(tmp, half_width); local
463 ubld.emit_scan(opcode, right, cluster_size, mod);
466 set_condmod(mod, ubld.emit(opcode, right, left_comp, right));
474 const dst_reg right = horiz_stride(horiz_offset(tmp, 1), 2); local
475 set_condmod(mod, ubld.emit(opcode, right, left, right));
484 dst_reg right = horiz_stride(horiz_offset(tmp, 2), 4); local
485 set_condmod(mod, ubld.emit(opcode, right, left, right));
500 dst_reg right = horiz_offset(tmp, i + 2); local
509 dst_reg right = horiz_offset(tmp, 4); local
522 dst_reg right = horiz_offset(tmp, 8); local
[all...] |
