| /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/glu/dist/src/libnurbs/nurbtess/ |
| partitionY.h | 73 directedLine *right; member in struct:sweepRange
78 directedLine* right, Int rightType);
|
| searchTree.h | 40 struct treeNode* right; member in struct:treeNode
|
| /xsrc/external/mit/glu/dist/src/libnurbs/internals/ |
| trimregion.h | 50 Trimline right; member in class:TrimRegion
|
| hull.h | 58 Trimline *right; member in struct:Hull::Side
|
| 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...] |
| /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/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/MesaGLUT/dist/src/glut/beos/ |
| glutstroke.h | 29 float right; member in struct:__anon6
|
| /xsrc/external/mit/MesaGLUT/dist/src/glut/glx/ |
| glutstroke.h | 33 float right; member in struct:__anon13
|
| /xsrc/external/mit/MesaLib/dist/src/asahi/compiler/ |
| agx_register_allocate.c | 214 unsigned right = ssa_to_reg[ins->src[0].value] + (size * ins->imm); local
216 if (left != right) {
219 agx_register(right, ins->src[0].size));
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| rb_tree.h | 50 /** Right child of this node, null for a leaf */
51 struct rb_node *right; member in struct:rb_node
105 * \p parent, otherwise it will be the right child
134 x = x->right;
172 x = x->right;
185 * be either the right-most node comparing less than \p key or the
186 * right-most node comparing greater than \p key. If the tree is empty,
210 x = x->right;
221 /** Get the last (right-most) node in the tree or NULL */
224 /** Get the next node (to the right) in the tree or NULL *
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| rb_tree.h | 50 /** Right child of this node, null for a leaf */
51 struct rb_node *right; member in struct:rb_node
105 * \p parent, otherwise it will be the right child
134 x = x->right;
170 x = x->right;
185 * be either the right-most node comparing less than \p key or the
186 * right-most node comparing greater than \p key. If the tree is empty,
208 x = x->right;
221 /** Get the last (right-most) node in the tree or NULL */
224 /** Get the next node (to the right) in the tree or NULL *
[all...] |
| /xsrc/external/mit/ctwm/dist/ |
| ewmh.h | 30 int right; member in struct:EwmhStrut
|
| 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/libXpm/dist/src/ |
| rgb.c | 212 int left, right, middle; local
247 right = numTheRGBRecords - 1;
249 middle = (left + right) / 2;
259 right = middle - 1;
263 } while (left <= right);
|
| /xsrc/external/mit/mesa-demos/dist/src/redbook/ |
| 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/xfs/dist/difs/ |
| atom.c | 62 *right; member in struct:_Node
90 np = &((*np)->right);
96 np = &((*np)->right);
136 nd->left = nd->right = (NodePtr) NULL;
174 if (patom->right)
175 free_atom(patom->right);
|
| /xsrc/external/mit/xorg-server/dist/dix/ |
| atom.c | 62 struct _Node *left, *right; member in struct:_Node
90 np = &((*np)->right);
96 np = &((*np)->right);
133 nd->left = nd->right = NULL;
172 if (patom->right)
173 FreeAtom(patom->right);
|
| /xsrc/external/mit/xorg-server.old/dist/dix/ |
| atom.c | 64 struct _Node *left, *right; member in struct:_Node
96 np = &((*np)->right);
103 np = &((*np)->right);
146 nd->left = nd->right = NULL;
182 if(patom->right)
183 FreeAtom(patom->right);
|
| /xsrc/external/mit/xorg-server.old/dist/mi/ |
| mifpolycon.c | 68 * edge list and a right edge list. The algorithm used
89 double xl = 0.0, xr = 0.0, /* x vals of left and right edges */
91 mr = 0.0, /* right edge slope */
102 int left, right, /* indices to first endpoints */ local
164 /* add a right edge if we need to */
170 right = nextright--;
177 dy = ptsIn[nextright].y - ptsIn[right].y;
180 mr = (ptsIn[nextright].x - ptsIn[right].x) / dy;
181 dy = y - (ptsIn[right].y + yFtrans);
182 xr = (ptsIn[right].x + xFtrans) + mr * max(dy, 0)
[all...] |
| /xsrc/external/mit/MesaLib/dist/include/android_stub/nativebase/ |
| nativebase.h | 62 int32_t right; member in struct:android_native_rect_t
|
| /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...] |
