| /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
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
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
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/crypto/external/bsd/openssl/dist/crypto/bio/ |
| bio_cb.c | 25 int left; local
31 left = BIO_snprintf(buf, sizeof(buf), "BIO[%p]: ", (void *)bio);
34 if (left < 0)
35 left = 0;
36 p = buf + left;
37 left = sizeof(buf) - left;
41 BIO_snprintf(p, left, "Free - %s\n", bio->method->name);
45 BIO_snprintf(p, left, "read(%d,%zu) - %s fd=%d\n",
49 BIO_snprintf(p, left, "read(%d,%zu) - %s\n"
[all...] |
| /src/external/gpl3/gcc.old/dist/libgomp/ |
| splay-tree.c | 41 /* Rotate the edge joining the left child N with its parent P. PP is the
50 p->left = tmp;
61 tmp = n->left;
62 n->left = p;
86 /* Left or right? If no child, then we're done. */
88 c = n->left;
94 /* Next one left or right? If found or no child, we're done
98 || (cmp2 < 0 && !c->left)
111 rotate_left (&n->left, c, c->left);
177 splay_tree_node left, right; local
[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/crypto/external/apache2/openssl/dist/crypto/bio/ |
| bio_cb.c | 25 int left; local
33 left = BIO_snprintf(buf, sizeof(buf), "BIO[%p]: ", (void *)bio);
36 if (left < 0)
37 left = 0;
38 p = buf + left;
39 left = sizeof(buf) - left;
43 BIO_snprintf(p, left, "Free - %s\n", bio->method->name);
47 BIO_snprintf(p, left, "read(%d,%zu) - %s fd=%d\n",
51 BIO_snprintf(p, left, "read(%d,%zu) - %s\n"
[all...] |
| /src/tests/usr.bin/xlint/lint1/ |
| gcc_init_compound_literal.c | 34 struct node *left; member in struct:node
|
| /src/usr.bin/msgc/ |
| msgdb.h | 48 struct id_rec *left, *right; member in struct:id_rec
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/bio/ |
| bio_cb.c | 24 int len, left; local
35 left = sizeof(buf) - len;
39 BIO_snprintf(p, left, "Free - %s\n", bio->method->name);
43 BIO_snprintf(p, left, "read(%d,%lu) - %s fd=%d\n",
47 BIO_snprintf(p, left, "read(%d,%lu) - %s\n",
52 BIO_snprintf(p, left, "write(%d,%lu) - %s fd=%d\n",
56 BIO_snprintf(p, left, "write(%d,%lu) - %s\n",
60 BIO_snprintf(p, left, "puts() - %s\n", bio->method->name);
63 BIO_snprintf(p, left, "gets(%lu) - %s\n", (unsigned long)argi,
67 BIO_snprintf(p, left, "ctrl(%lu) - %s\n", (unsigned long)argi
[all...] |
| /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.
|
| /src/external/bsd/byacc/dist/test/ |
| err_syntax11.y | 8 %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/external/gpl3/gcc/dist/gcc/fortran/ |
| bbt.cc | 63 /* Rotate the treap left. */
71 t->right = t->right->left;
72 temp->left = t;
85 temp = t->left;
86 t->left = t->left->right;
108 t->left = insert (new_bbt, t->left, compare);
109 if (t->priority < t->left->priority)
145 if (t->left == NULL
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| bbt.cc | 63 /* Rotate the treap left. */
71 t->right = t->right->left;
72 temp->left = t;
85 temp = t->left;
86 t->left = t->left->right;
108 t->left = insert (new_bbt, t->left, compare);
109 if (t->priority < t->left->priority)
145 if (t->left == NULL
[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
195 int left; \/* number of possible codes left of current length *\/ local
449 unsigned left; local
[all...] |
| /src/external/gpl3/binutils/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
195 int left; \/* number of possible codes left of current length *\/ local
449 unsigned left; local
[all...] |
| /src/external/gpl3/binutils.old/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
195 int left; \/* number of possible codes left of current length *\/ local
449 unsigned left; local
[all...] |
| /src/external/gpl3/gdb/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
195 int left; \/* number of possible codes left of current length *\/ local
449 unsigned left; local
[all...] |
| /src/external/gpl3/gdb.old/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
195 int left; \/* number of possible codes left of current length *\/ local
449 unsigned left; local
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/test/testutil/ |
| tu_local.h | 21 const char *left, const char *right,
26 const char *left, const char *right,
32 const char *left, const char *right,
37 const char *left, const char *right,
42 const char *left, const char *right,
|
| /src/external/gpl3/gcc/dist/gcc/config/rs6000/ |
| rbtree.cc | 44 nodeptr->left = t->rbt_nil;
51 /* Perform a left-rotate operation on NODE in the red-black tree. */
58 /* Turn RIGHT's left subtree into NODE's right subtree. */
59 node->right = right->left;
60 if (right->left != t->rbt_nil)
61 right->left->par = node;
68 else if (node == node->par->left)
69 node->par->left = right;
73 /* Put NODE on RIGHT's left. */
74 right->left = node
82 struct rbt_string_node *left = node->left; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| rbtree.cc | 44 nodeptr->left = t->rbt_nil;
51 /* Perform a left-rotate operation on NODE in the red-black tree. */
58 /* Turn RIGHT's left subtree into NODE's right subtree. */
59 node->right = right->left;
60 if (right->left != t->rbt_nil)
61 right->left->par = node;
68 else if (node == node->par->left)
69 node->par->left = right;
73 /* Put NODE on RIGHT's left. */
74 right->left = node
82 struct rbt_string_node *left = node->left; local
[all...] |
| /src/external/gpl3/gcc/dist/libgomp/ |
| splay-tree.c | 41 /* Rotate the edge joining the left child N with its parent P. PP is the
50 p->left = tmp;
61 tmp = n->left;
62 n->left = p;
86 /* Left or right? If no child, then we're done. */
88 c = n->left;
94 /* Next one left or right? If found or no child, we're done
98 || (cmp2 < 0 && !c->left)
111 rotate_left (&n->left, c, c->left);
185 splay_tree_node left, right; local
[all...] |
