/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))
|
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))
|
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...] |
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...] |
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...] |
/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...] |
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...] |
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
|
msgdb.h | 48 struct id_rec *left, *right; member in struct:id_rec
|
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
|
gcc_init_compound_literal.c | 34 struct node *left; member in struct:node
|
gcc_init_compound_literal.c | 34 struct node *left; member in struct:node
|
/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.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.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/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...] |
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...] |
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.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.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...] |