| /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; */ \
52 else dest = ((((unsigned) left)&0x7fffffff) << (32-(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))
|
| sfcmp.c | 57 register unsigned int left, right; local in function:sgl_fcmp
61 left = *leftptr;
66 if( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT)
72 if( ( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT)
73 && Sgl_isnotzero_mantissa(left)
74 && (Exception(cond) || Sgl_isone_signaling(left)))
90 else if( ((Sgl_exponent(left) == SGL_INFINITY_EXPONENT)
91 && Sgl_isnotzero_mantissa(left))
104 Sgl_xortointp1(left,right,xorresult);
107 /* left negative => less, left positive => greater
[all...] |
| sfsub.c | 57 register unsigned int left, right, result, extent; local in function:sgl_fsub
65 left = *leftptr;
70 Sgl_xortointp1(left,right,/*to*/save);
75 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT)
77 if (Sgl_iszero_mantissa(left))
95 *dstptr = left;
104 if (Sgl_isone_signaling(left))
110 Sgl_set_quiet(left);
128 *dstptr = left;
131 } /* End left NaN or Infinity processing *
[all...] |
| sfadd.c | 57 register unsigned int left, right, result, extent; local in function:sgl_fadd
67 left = *leftptr;
72 Sgl_xortointp1(left,right,/*to*/save);
77 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT)
79 if (Sgl_iszero_mantissa(left))
97 *dstptr = left;
106 if (Sgl_isone_signaling(left))
112 Sgl_set_quiet(left);
130 *dstptr = left;
133 } /* End left NaN or Infinity processing *
[all...] |
| /src/usr.bin/m4/ |
| parser.y | 32 %left LOR
33 %left LAND
34 %left '|'
35 %left '^'
36 %left '&'
37 %left EQ NE
38 %left '<' LE '>' GE
39 %left LSHIFT RSHIFT
40 %left '+' '-'
41 %left '*' '/' '%
[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 | 34 struct node *left; 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
49 * error message: 'left operand of '=' must be lvalue [114]'.
51 left = right = arg;
53 left = arg;
73 * In PHP, '?:' is left-associative, which is rather surprising and
|
| lang_level_c99.c | 150 short top, left, bottom, right; member in struct:short_rect
159 me.left = me.left;
|
| /src/usr.bin/make/unit-tests/ |
| deptgt-suffixes.exp | 6 # ".src-left" (num 2, ref 2)
12 # From: .src-left
14 # ".tgt-left" (num 4, ref 2)
19 # To: .tgt-left
23 .src-left.tgt-right:
26 .src-right.tgt-left:
30 : Making deptgt-suffixes.src-left out of nothing.
31 : Making deptgt-suffixes.tgt-right from deptgt-suffixes.src-left.
33 : Making deptgt-suffixes.tgt-left from deptgt-suffixes.src-right.
|
| deptgt-suffixes.mk | 22 .SUFFIXES: .src-left .tgt-right
23 deptgt-suffixes.src-left:
25 .src-left.tgt-right:
30 .SUFFIXES: .tgt-left .src-right
33 .src-right.tgt-left:
35 all: deptgt-suffixes.tgt-left
|
| /src/usr.bin/menuc/ |
| avl.c | 43 * struct id_rec *left, *right; / * Tree pointers. * /
81 return find_id (tree->left, id);
100 new_id->left = NULL;
109 /* Insert it on the left. */
110 if (insert_id (&((*root)->left), new_id))
123 B = (*root)->left;
127 A->left = B->right;
137 B->right = (*root)->left;
138 A->left = (*root)->right;
139 (*root)->left = B
[all...] |
| /src/common/dist/zlib/contrib/blast/ |
| blast.c | 46 unsigned left; /* available input at in */ member in struct:state
70 * bit buffer, using shift left.
79 if (s->left == 0) {
80 s->left = s->infun(s->inhow, &(s->in));
81 if (s->left == 0) longjmp(s->env, 1); /* out of input */
84 s->left--;
88 /* drop need bits and update buffer, always zero to seven bits left */
137 int left; /* bits left in next or left to process * local in function:decode
195 int left; \/* number of possible codes left of current length *\/ local in function:construct
449 unsigned left; local in function:main
[all...] |
| blast.h | 46 unsigned *left, unsigned char **in);
59 * If left and in are not NULL and *left is not zero when blast() is called,
60 * then the *left bytes at *in are consumed for input before infun() is used.
68 * If there is any unused input, *left is set to the number of bytes that were
69 * read and *in points to them. Otherwise *left is set to zero and *in is set
70 * to NULL. If left or in are NULL, then they are not set.
|
| /src/common/dist/zlib/ |
| uncompr.c | 34 uLong len, left; local in function:uncompress2
39 left = *destLen;
43 left = 1;
61 stream.avail_out = left > (uLong)max ? max : (uInt)left;
62 left -= stream.avail_out;
75 left = 1;
80 err == Z_BUF_ERROR && left + stream.avail_out ? Z_DATA_ERROR :
|
| compress.c | 29 uLong left; local in function:compress2
31 left = *destLen;
48 stream.avail_out = left > (uLong)max ? max : (uInt)left;
49 left -= stream.avail_out;
|
| /src/sys/arch/x86/x86/ |
| procfs_machdep.c | 244 size_t *left)
250 l = snprintf(p, *left, "%s ", table[i]);
251 if (l < *left) {
252 *left -= l;
270 procfs_getonecpufeatures(struct cpu_info *ci, char *p, size_t *left)
272 size_t last = *left;
276 procfs_getonefeatreg(ci->ci_feat_val[0], x86_features[0], p, left);
277 diff = last - *left;
280 left);
281 diff = last - *left;
378 size_t left, l, size; local in function:procfs_getonecpu
[all...] |
| /src/common/dist/zlib/examples/ |
| gzjoin.c | 81 unsigned left; /* bytes remaining at next */ member in struct:__anonc73ac6780108
113 in->left = 0;
127 if (in->left != 0)
131 len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left);
134 in->left += (unsigned)len;
135 } while (len != 0 && in->left < CHUNK);
140 #define bget(in) (in->left ? 0 : bload(in), \
141 in->left ? (in->left--, *(in->next)++) :
176 unsigned left; local in function:bskip
[all...] |
| enough.c | 42 all the symbols are used, there are exactly zero possible bit patterns left
126 left: number of available bit patterns at length len
132 left: 2..syms - 1, but only the evens (so syms == 8 -> 2, 4, 6)
135 syms == 2 is not saved since that immediately leads to a single code. left
137 the current length, which is double the number at the previous length. left
138 ends at syms-1 since left == syms immediately results in a single code.
139 (left > sym is not allowed since that would result in an incomplete code.)
156 to the num[] array as described above for the (syms, left, len) triplet.
237 local inline size_t map(int syms, int left, int len) {
239 (left >> 1) - 1) * (g.max - 1)
464 for (int left = 2; left < n; left += 2) { local in function:enough
[all...] |
| /src/usr.bin/xlint/lint1/ |
| ckctype.c | 102 for (on = arg; on->tn_op == CVT; on = on->u.ops.left)
137 ln->u.ops.left != NULL &&
138 ln->u.ops.left->tn_op == LOAD &&
139 ln->u.ops.left->u.ops.left != NULL &&
140 ln->u.ops.left->u.ops.left->tn_op == NAME &&
141 is_ctype_table(ln->u.ops.left->u.ops.left->u.sym->s_name))
|
| /src/usr.sbin/gspa/gspa/ |
| gsp_gram.y | 61 %left LEFT_SHIFT, RIGHT_SHIFT
62 %left '^' /* EXCLUSIVE OR operator */
63 %left '|' /* OR operator */
64 %left '&' /* AND operator */
65 %left '+', '-'
66 %left '*', '/'
|
| /src/sys/external/bsd/ipf/netinet/ |
| ipf_rb.h | 73 struct _t *left; \
107 tmp2 = tmp1->_f.left; \
116 parent->_f.left = tmp1; \
117 tmp1->_f.left = node; \
128 tmp1 = node->_f.left; \
130 node->_f.left = tmp2; \
138 parent->_f.left = tmp1; \
150 node->_f.left = &_n##_rb_zero; \
155 p = &n->_f.left; \
166 if (parent == gparent->_f.left) { \
[all...] |
| /src/sys/external/mit/xen-include-public/dist/xen/include/public/io/ |
| libxenvchan.h | 66 * left is client write, server read
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/bin/expr/ |
| expr.y | 69 %left SPEC_OR
70 %left SPEC_AND
71 %left COMPARE
72 %left ADD_SUB_OPERATOR
73 %left MUL_DIV_MOD_OPERATOR
74 %left SPEC_REG
75 %left LENGTH
174 eval_arith(const char *left, const char *op, const char *right)
180 if (!is_integer(left))
181 yyerror("non-integer argument '%s'", left);
[all...] |
| /src/common/dist/zlib/contrib/infback9/ |
| inftree9.c | 41 int left; /* number of prefix codes available */ local in function:inflate_table9
120 left = 1;
122 left <<= 1;
123 left -= count[len];
124 if (left < 0) return -1; /* over-subscribed */
126 if (left > 0 && (type == CODES || max != 1))
258 left = (int)(1 << curr);
260 left -= count[curr + drop];
261 if (left <= 0) break;
263 left <<= 1
[all...] |
