/openbsd-current/sys/arch/hppa/spmath/ |
H A D | hppa.h | 18 #define Shiftdouble(left,right,amount,dest) \ 19 /* int left, right, amount, dest; */ \ 20 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount)) 23 #define Variableshiftdouble(left,right,amount,dest) \ 24 /* unsigned int left, right; int amount, dest; */ \ 26 else dest = ((((unsigned) left)&0x7fffffff) << (32-(amount))) | \ 30 #define Variable_shift_double(left,right,amount,dest) \ 31 /* unsigned int left, right; int amount, dest; */ \ 32 dest = (left << (32-(amount))) | ((unsigned) right >> (amount))
|
H A D | sfcmp.c | 29 register unsigned int left, right; local 33 left = *leftptr; 38 if( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) 44 if( ( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) 45 && Sgl_isnotzero_mantissa(left) 46 && (Exception(cond) || Sgl_isone_signaling(left))) 62 else if( ((Sgl_exponent(left) == SGL_INFINITY_EXPONENT) 63 && Sgl_isnotzero_mantissa(left)) 76 Sgl_xortointp1(left,right,xorresult); 79 /* left negativ [all...] |
H A D | sfsub.c | 28 register unsigned int left, right, result, extent; local 36 left = *leftptr; 41 Sgl_xortointp1(left,right,/*to*/save); 46 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) 48 if (Sgl_iszero_mantissa(left)) 66 *dstptr = left; 75 if (Sgl_isone_signaling(left)) 81 Sgl_set_quiet(left); 99 *dstptr = left; 102 } /* End left Na [all...] |
H A D | sfadd.c | 28 register unsigned int left, right, result, extent; local 38 left = *leftptr; 43 Sgl_xortointp1(left,right,/*to*/save); 48 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) 50 if (Sgl_iszero_mantissa(left)) 68 *dstptr = left; 77 if (Sgl_isone_signaling(left)) 83 Sgl_set_quiet(left); 101 *dstptr = left; 104 } /* End left Na [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.bugs/ |
H A D | 900324_05.C | 13 int_array &left = int_array_object; variable 18 left = right; // ERROR - causes segfault
|
/openbsd-current/usr.bin/m4/ |
H A D | parser.y | 27 %left LOR 28 %left LAND 29 %left '|' 30 %left '^' 31 %left '&' 32 %left EQ NE 33 %left '<' LE '>' GE 34 %left LSHIFT RSHIFT 35 %left '+' '-' 36 %left '*' '/' ' [all...] |
/openbsd-current/gnu/usr.bin/perl/dist/Time-HiRes/t/ |
H A D | Watchdog.pm | 41 my $left = $TheEnd - time(); 42 printf("# I am the main process $$, terminating the watchdog process $watchdog_pid before it terminates me in %d seconds (testing took %d seconds).\n", $left, $waitfor - $left);
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | operators5.C | 12 base operator+ (const base& left, const base& right) argument 16 ret_val.i = left.i + right.i; 20 base operator- (const base& left, int right) argument 24 ret_val.i = left.i - right;
|
/openbsd-current/lib/libc/stdlib/ |
H A D | tsearch.c | 19 struct node_t *left, *right; member in struct:node_t 39 &(*rootp)->left : /* T3: follow left branch */ 46 q->left = q->right = (struct node_t *)0; 68 &(*rootp)->left : /* follow left branch */ 74 if ((q = (*rootp)->left) == (struct node_t *)0) /* Left (struct node_t *)0? */ 77 if (r->left == (struct node_t *)0) { /* D2: Find successor */ 78 r->left = q; 81 for (q = r->left; [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/unsorted/ |
H A D | PYRBUG.c | 9 int top, left, bottom, right; member in struct:__anon7072 16 && pt.h >= r->left && pt.h < r->right;
|
/openbsd-current/gnu/usr.sbin/mkhybrid/src/libhfs_iso/ |
H A D | node.c | 200 int n_split(node *left, unsigned char *record, int *reclen) argument 206 right = *left; 207 right.nd.ndBLink = left->nnum; 212 left->nd.ndFLink = right.nnum; 213 nrecs = left->nd.ndNRecs; 228 && left->roff[mid] + *reclen + 2 > HFS_BLOCKSZ - 2 * (mid + 1)) 238 && right.roff[nrecs] - right.roff[mid] + left->roff[0] + *reclen + 2 > HFS_BLOCKSZ - 2 * (mid + 1)) 253 rec = HFS_NODEREC(*left, i); 264 rec = HFS_NODEREC(*left, i); 269 n_compact(left); 369 n_merge(node *right, node *left, unsigned char *record, int *flag) argument 426 node left; local [all...] |
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 42 const SUnit *pickBest(const SUnit *left, const SUnit *right); 130 // Return -1 if left has higher priority, 1 if right has higher priority. 132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { argument 135 int LHeight = (int)left->getHeight(); 148 int LDepth = left->getDepth(); 151 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum 156 if (left->Latency != right->Latency) 157 return left->Latency > right->Latency ? 1 : -1; 162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) argument 169 int spread = (int)left [all...] |
/openbsd-current/usr.bin/ssh/ |
H A D | sftp-realpath.c | 53 * in which case the path which caused trouble is left in (resolved). 63 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 87 left_len = strlcpy(left, path + 1, sizeof(left)); 97 left_len = strlcpy(left, path, sizeof(left)); 99 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { 105 * Iterate over path components in `left'. 109 * Extract the next path component and adjust `left' 112 p = strchr(left, '/'); [all...] |
/openbsd-current/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
H A D | erase_fn_imps.hpp | 129 const size_type left = partition(pred_t(pred)); local 131 _GLIBCXX_DEBUG_ASSERT(m_size >= left); 133 const size_type ersd = m_size - left; 135 for (size_type i = left; i < m_size; ++i) 141 resize_policy::get_new_size_for_arbitrary(left); 145 std::copy(m_a_entries, m_a_entries + left, a_entries); 156 m_size = left; 228 size_type left = 0; local 231 while (right + 1 != left) 233 _GLIBCXX_DEBUG_ASSERT(left < [all...] |
/openbsd-current/usr.sbin/unbound/util/ |
H A D | rbtree.c | 61 /** rotate subtree left (to preserve redblack property) */ 104 * Rotates the node to the left. 111 node->right = right->left; 112 if (right->left != RBTREE_NULL) 113 right->left->parent = node; 118 if (node == node->parent->left) { 119 node->parent->left = right; 126 right->left = node; 137 rbnode_type *left = node->left; local [all...] |
/openbsd-current/sbin/unwind/libunbound/util/ |
H A D | rbtree.c | 61 /** rotate subtree left (to preserve redblack property) */ 104 * Rotates the node to the left. 111 node->right = right->left; 112 if (right->left != RBTREE_NULL) 113 right->left->parent = node; 118 if (node == node->parent->left) { 119 node->parent->left = right; 126 right->left = node; 137 rbnode_type *left = node->left; local [all...] |
/openbsd-current/gnu/usr.bin/perl/cpan/Compress-Raw-Zlib/zlib-src/ |
H A D | uncompr.c | 36 uLong len, left; local 41 left = *destLen; 45 left = 1; 63 stream.avail_out = left > (uLong)max ? max : (uInt)left; 64 left -= stream.avail_out; 77 left = 1; 82 err == Z_BUF_ERROR && left + stream.avail_out ? Z_DATA_ERROR :
|
H A D | compress.c | 32 uLong left; local 34 left = *destLen; 51 stream.avail_out = left > (uLong)max ? max : (uInt)left; 52 left -= stream.avail_out;
|
/openbsd-current/lib/libz/ |
H A D | uncompr.c | 30 uLong len, left; local 35 left = *destLen; 39 left = 1; 57 stream.avail_out = left > (uLong)max ? max : (uInt)left; 58 left -= stream.avail_out; 71 left = 1; 76 err == Z_BUF_ERROR && left + stream.avail_out ? Z_DATA_ERROR :
|
H A D | compress.c | 25 uLong left; local 27 left = *destLen; 44 stream.avail_out = left > (uLong)max ? max : (uInt)left; 45 left -= stream.avail_out;
|
/openbsd-current/usr.sbin/nsd/ |
H A D | rbtree.c | 60 * Rotates the node to the left. 67 node->right = right->left; 68 if (right->left != RBTREE_NULL) 69 right->left->parent = node; 74 if (node == node->parent->left) { 75 node->parent->left = right; 82 right->left = node; 93 rbnode_type *left = node->left; local 94 node->left [all...] |
/openbsd-current/gnu/usr.bin/perl/cpan/CPAN-Meta/lib/CPAN/Meta/ |
H A D | Merge.pm | 13 my ($left, $right) = @_; 15 (not defined $left and not defined $right) 17 || (defined $left and defined $right and $left eq $right); 21 my ($left, $right, $path) = @_; 22 croak sprintf "Can't merge attribute %s: '%s' does not equal '%s'", join('.', @{$path}), $left, $right 23 unless _is_identical($left, $right); 24 return $left; 52 my ($left, $right) = @_; 53 return [ +_uniq(@{$left}, [all...] |
/openbsd-current/regress/sys/kern/realpath/ |
H A D | realpath3.c | 50 * in which case the path which caused trouble is left in (resolved). 61 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 106 left_len = strlcpy(left, path + 1, sizeof(left)); 116 left_len = strlcpy(left, path, sizeof(left)); 118 if (left_len >= sizeof(left)) { 124 * Iterate over path components in `left'. 128 * Extract the next path component and adjust `left' 131 p = strchr(left, '/'); [all...] |
/openbsd-current/gnu/lib/libiberty/src/ |
H A D | splay-tree.c | 83 deallocated, we just need to process left and right. */ 85 if (active->left) 87 KDEL (active->left->key); 88 VDEL (active->left->value); 89 active->left->key = (splay_tree_key)pending; 90 pending = (splay_tree_node)(active->left); 109 /* Rotate the edge joining the left child N with its parent P. PP is the 118 p->left = tmp; 129 tmp = n->left; 130 n->left 353 splay_tree_node left, right; local [all...] |
/openbsd-current/sys/lib/libz/ |
H A D | compress.c | 25 uLong left; local 27 left = *destLen; 44 stream.avail_out = left > (uLong)max ? max : (uInt)left; 45 left -= stream.avail_out;
|