| /src/sys/arch/hppa/spmath/ |
| hppa.h | 44 #define Shiftdouble(left,right,amount,dest) \
45 /* int left, right, amount, dest; */ \
46 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))
49 #define Variableshiftdouble(left,right,amount,dest) \
50 /* unsigned int left, right; int amount, dest; */ \
51 if (amount == 0) dest = right; \
53 ((unsigned) right >> (amount))
56 #define Variable_shift_double(left,right,amount,dest) \
57 /* unsigned int left, right; int amount, dest; */ \
58 dest = (left << (32-(amount))) | ((unsigned) right >> (amount)
[all...] |
| sfcmp.c | 57 register unsigned int left, right; local in function:sgl_fcmp
62 right = *rightptr;
67 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )
76 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
77 && Sgl_isnotzero_mantissa(right)
78 && (Exception(cond) || Sgl_isone_signaling(right)) ) )
93 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
94 && Sgl_isnotzero_mantissa(right)) )
104 Sgl_xortointp1(left,right,xorresult);
110 && Sgl_iszero_exponentmantissa(right) )
[all...] |
| sfsub.c | 57 register unsigned int left, right, result, extent; local in function:sgl_fsub
66 right = *rightptr;
70 Sgl_xortointp1(left,right,/*to*/save);
79 if (Sgl_isnotnan(right))
81 if (Sgl_isinfinity(right) && save==0)
115 else if (Sgl_is_signalingnan(right))
121 Sgl_set_quiet(right);
122 *dstptr = right;
135 if (Sgl_isinfinity_exponent(right))
137 if (Sgl_iszero_mantissa(right))
[all...] |
| sfadd.c | 57 register unsigned int left, right, result, extent; local in function:sgl_fadd
68 right = *rightptr;
72 Sgl_xortointp1(left,right,/*to*/save);
81 if (Sgl_isnotnan(right))
83 if (Sgl_isinfinity(right) && save!=0)
117 else if (Sgl_is_signalingnan(right))
123 Sgl_set_quiet(right);
124 *dstptr = right;
137 if (Sgl_isinfinity_exponent(right))
139 if (Sgl_iszero_mantissa(right))
[all...] |
| /src/usr.bin/msgc/ |
| msgdb.h | 48 struct id_rec *left, *right; member in struct:id_rec
|
| /src/tests/usr.bin/xlint/lint1/ |
| gcc_init_compound_literal.c | 35 struct node *right; member in struct:node
|
| expr_precedence.c | 44 int left, right; local in function:assignment_associativity
47 * Assignments are right-associative. If they were left-associative,
48 * the result of (left = right) would be an rvalue, resulting in this
51 left = right = arg;
68 * In almost all programming languages, '?:' is right-associative,
|
| /src/usr.bin/make/unit-tests/ |
| deptgt-suffixes.exp | 7 # To: .tgt-right
10 # ".tgt-right" (num 3, ref 2)
16 # From: .src-right
18 # ".src-right" (num 5, ref 2)
23 .src-left.tgt-right:
26 .src-right.tgt-left:
31 : Making deptgt-suffixes.tgt-right from deptgt-suffixes.src-left.
32 : Making deptgt-suffixes.src-right out of nothing.
33 : Making deptgt-suffixes.tgt-left from deptgt-suffixes.src-right.
|
| deptgt-suffixes.mk | 22 .SUFFIXES: .src-left .tgt-right
25 .src-left.tgt-right:
27 all: deptgt-suffixes.tgt-right
30 .SUFFIXES: .tgt-left .src-right
31 deptgt-suffixes.src-right:
33 .src-right.tgt-left:
|
| /src/usr.bin/menuc/ |
| avl.c | 43 * struct id_rec *left, *right; / * Tree pointers. * /
83 return find_id (tree->right, id);
101 new_id->right = NULL;
127 A->left = B->right;
128 B->right = A;
136 *root = B->right;
137 B->right = (*root)->left;
138 A->left = (*root)->right;
140 (*root)->right = A;
163 /* Insert it on the right. *
[all...] |
| /src/sys/external/bsd/ipf/netinet/ |
| ipf_rb.h | 74 struct _t *right; \
106 tmp1 = node->_f.right; \
108 node->_f.right = tmp2; \
112 head->top._f.right = tmp1; \
113 else if (parent->_f.right == node) \
114 parent->_f.right = tmp1; \
129 tmp2 = tmp1->_f.right; \
134 head->top._f.right = tmp1; \
135 else if (parent->_f.right == node) \
136 parent->_f.right = tmp1;
[all...] |
| /src/sys/external/mit/xen-include-public/dist/xen/include/public/io/ |
| libxenvchan.h | 67 * right is client read, server write
69 struct ring_shared left, right; member in struct:vchan_interface
94 * Grant list: ordering is left, right. Must not extend into actual ring
|
| /src/usr.bin/ctags/ |
| tree.c | 91 np->left = np->right = 0;
123 if (cur_node->right)
124 add_node(node, cur_node->right);
126 cur_node->right = node;
137 if (node->right) {
139 nnode = node->right;
141 free_tree(node->right);
|
| /src/sys/netinet/ |
| tcp_sack.c | 231 tp->rcv_dsack_block.right = seq + len;
251 tcp_seq left, right, acked; local in function:tcp_sack_option
284 memcpy(&right, lp + sizeof(uint32_t), sizeof(uint32_t));
286 right = ntohl(right);
288 if (SEQ_LEQ(right, acked) || SEQ_GT(right, tp->snd_max) ||
289 SEQ_GEQ(left, right)) {
300 t_sack_block[j].right = t_sack_block[j - 1].right;
[all...] |
| /src/sys/dev/i2c/ |
| sgsmix.c | 163 sgsmix_set_speaker_vol(void *cookie, int left, int right)
167 DPRINTF("%s: speaker %d %d\n", device_xname(sc->sc_dev), left, right);
175 if (right == 0) {
179 ((255 - right) >> 3) & 0x1f);
184 sgsmix_set_headphone_vol(void *cookie, int left, int right)
188 DPRINTF("%s: headphones %d %d\n", device_xname(sc->sc_dev), left, right);
196 if (right == 0) {
200 ((255 - right) >> 3) & 0x1f);
|
| /src/lib/libc/arch/hppa/string/ |
| ffs.S | 47 shd %r0,%arg0,16,%arg0 ; else shift right 16 bits
50 shd %r0,%arg0,8,%arg0 ; else shift right 8 bits
53 shd %r0,%arg0,4,%arg0 ; else shift right 4 bits
56 shd %r0,%arg0,2,%arg0 ; else shift right 2 bits
|
| /src/sys/arch/vax/include/ |
| qevent.h | 110 short right; member in struct:_vs_box
|
| /src/sys/dev/qbus/ |
| qevent.h | 110 short right; member in struct:_vs_box
|
| /src/usr.bin/sdiff/ |
| edit.c | 70 eparse(const char *cmd, const char *left, const char *right)
91 goto RIGHT;
92 if (right == NULL)
96 if (asprintf(&text, "%s\n%s\n", left, right) == -1)
112 RIGHT:
113 /* Skip if there is no right column. */
114 if (right == NULL)
117 if (asprintf(&text, "%s\n", right) == -1)
|
| /src/games/arithmetic/ |
| arithmetic.c | 185 * selected such that the right operand and either the left operand (for +, x)
195 int left, op, right, result; local in function:problem
198 right = left = result = 0;
201 right = getrandom(rangemax + 1, op, 1);
207 result = left + right;
211 left = right + result;
215 result = left * right;
218 right = getrandom(rangemax, op, 1) + 1;
220 left = right * result + random() % right;
[all...] |
| /src/sys/dev/raidframe/ |
| rf_sstf.c | 56 #define QSUM(_sstfq_) (((_sstfq_)->lopri.qlen)+((_sstfq_)->left.qlen)+((_sstfq_)->right.qlen))
297 sstfq->left.qlen, sstfq->right.qlen,
308 do_sstf_ord_q(&sstfq->right.queue, &sstfq->right.qtail, req);
309 sstfq->right.qlen++;
357 sstfq->left.qlen, sstfq->right.qlen, sstfq->lopri.qlen);
362 if (sstfq->right.queue == NULL) {
363 RF_ASSERT(sstfq->right.qlen == 0);
386 DO_BEST_DEQ(sstfq->last_sector, req, &sstfq->right);
389 if (sstfq->right.queue == NULL)
[all...] |
| rf_cvscan.h | 68 RF_DiskQueueData_t *right; member in struct:RF_CvscanHeader_s
|
| /src/sys/external/bsd/drm2/dist/drm/qxl/ |
| qxl_draw.c | 98 drawable->self_bitmap_area.right = 0;
122 * Right now implementing with a single draw and a clip list. Clip
142 int left, right, top, bottom; local in function:qxl_draw_dirty_fb
164 right = clips->x2;
172 right = max_t(int, right, (int)clips_ptr->x2);
177 width = right - left;
196 drawable_rect.right = right;
229 drawable->u.copy.src_area.right = width
[all...] |
| /src/games/battlestar/ |
| room.c | 86 right = here.east;
93 right = here.west;
100 right = here.south;
107 right = here.north;
130 return ("right");
142 return ("right");
151 return ("right");
167 return ("right");
192 case RIGHT:
205 case RIGHT
[all...] |
| /src/bin/expr/ |
| expr.y | 174 eval_arith(const char *left, const char *op, const char *right)
182 if (!is_integer(right))
183 yyerror("non-integer argument '%s'", right);
186 r = to_integer(right);
243 "operation '%s %s %s'", left, op, right);
250 eval_compare(const char *left, const char *op, const char *right)
254 if (is_integer(left) && is_integer(right)) {
256 r = strtoll(right, NULL, 10);
258 l = strcoll(left, right);
|
