/freebsd-10.1-release/contrib/byacc/test/ |
H A D | err_syntax11.y | 7 %right '|'
|
/freebsd-10.1-release/contrib/unbound/util/ |
H A D | rbtree.c | 63 /** rotate subtree right (to preserve redblack property) */ 109 rbnode_t *right = node->right; local 110 node->right = right->left; 111 if (right->left != RBTREE_NULL) 112 right->left->parent = node; 114 right->parent = node->parent; 118 node->parent->left = right; 120 node->parent->right [all...] |
/freebsd-10.1-release/contrib/ldns/ |
H A D | rbtree.c | 66 /** rotate subtree right (to preserve redblack property) */ 118 ldns_rbnode_t *right = node->right; local 119 node->right = right->left; 120 if (right->left != LDNS_RBTREE_NULL) 121 right->left->parent = node; 123 right->parent = node->parent; 127 node->parent->left = right; 129 node->parent->right [all...] |
/freebsd-10.1-release/sys/kern/ |
H A D | subr_capability.c | 62 right_to_index(uint64_t right) argument 70 idx = CAPIDXBIT(right); 78 uint64_t right; local 87 right = (uint64_t)va_arg(ap, unsigned long long); 88 if (right == 0) 90 assert(CAPRVER(right) == 0); 91 i = right_to_index(right); 94 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right)); 95 rights->cr_rights[i] |= right; 96 assert(CAPIDXBIT(rights->cr_rights[i]) == CAPIDXBIT(right)); 103 uint64_t right; local 128 uint64_t right; local [all...] |
/freebsd-10.1-release/contrib/apr/include/ |
H A D | apr_user.h | 105 * @param right Another uid to test 111 APR_DECLARE(apr_status_t) apr_uid_compare(apr_uid_t left, apr_uid_t right); 113 #define apr_uid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH) 139 * @param right Another gid to test 145 APR_DECLARE(apr_status_t) apr_gid_compare(apr_gid_t left, apr_gid_t right); 147 #define apr_gid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH)
|
/freebsd-10.1-release/usr.bin/csup/ |
H A D | globtree.c | 73 struct globtree *right; member in struct:globtree 97 gt->right = NULL; 144 globtree_and(struct globtree *left, struct globtree *right) argument 148 if (left->type == GLOBTREE_FALSE || right->type == GLOBTREE_FALSE) { 150 globtree_free(right); 156 return (right); 158 if (right->type == GLOBTREE_TRUE) { 159 globtree_free(right); 164 gt->right = right; 169 globtree_or(struct globtree *left, struct globtree *right) argument [all...] |
/freebsd-10.1-release/contrib/binutils/libiberty/ |
H A D | splay-tree.c | 83 deallocated, we just need to process left and right. */ 92 if (active->right) 94 KDEL (active->right->key); 95 VDEL (active->right->value); 96 active->right->key = (splay_tree_key)pending; 97 pending = (splay_tree_node)(active->right); 116 tmp = n->right; 117 n->right = p; 122 /* Rotate the edge joining the right child N with its parent P. PP is the 131 p->right 353 splay_tree_node left, right; local [all...] |
H A D | fibheap.c | 71 node->right = node; 162 a_root->left->right = b_root; 163 b_root->left->right = a_root; 223 is needed so that delete's call to extractmin gets the right node. */ 295 y = x->right; 311 heap->min = ret->right; 328 node->right = node; 333 and it's right node. */ 442 if (a == a->right) 444 a->right [all...] |
/freebsd-10.1-release/contrib/gcclibs/libiberty/ |
H A D | splay-tree.c | 83 deallocated, we just need to process left and right. */ 92 if (active->right) 94 KDEL (active->right->key); 95 VDEL (active->right->value); 96 active->right->key = (splay_tree_key)pending; 97 pending = (splay_tree_node)(active->right); 116 tmp = n->right; 117 n->right = p; 122 /* Rotate the edge joining the right child N with its parent P. PP is the 131 p->right 353 splay_tree_node left, right; local [all...] |
H A D | fibheap.c | 71 node->right = node; 162 a_root->left->right = b_root; 163 b_root->left->right = a_root; 223 is needed so that delete's call to extractmin gets the right node. */ 295 y = x->right; 311 heap->min = ret->right; 328 node->right = node; 333 and it's right node. */ 442 if (a == a->right) 444 a->right [all...] |
/freebsd-10.1-release/contrib/binutils/bfd/ |
H A D | mep-relocs.pl | 103 my ($bits, $left, $right, $ci, $c, $cv); 106 $right = 32; 114 $right = $cv unless $right < $cv; 122 return ($bits, $left, $right, $mask, $rmask); 133 ($bits, $left, $right, $mask) = mask2shifts ($mask); 142 $c, $bytesize, $bits, $left, $right, $pcrel, $overflow, $mask); 176 ($bits, $left, $right, $mask, $rmask) = mask2shifts ($mask); 177 if ($left > $right) { $left -= $right; [all...] |
/freebsd-10.1-release/sys/dev/sound/pci/ |
H A D | spicds.c | 50 unsigned int left, right; member in struct:spicds_info 269 spicds_set(struct spicds_info *codec, int dir, unsigned int left, unsigned int right) argument 272 device_printf(codec->dev, "spicds_set(codec, %d, %d, %d)\n", dir, left, right); 293 if (right >= 100) 296 right = 255; 298 right = 127; 302 right = right + 27; 306 right = right * 25 [all...] |
/freebsd-10.1-release/contrib/ipfilter/ |
H A D | ipf_rb.h | 15 struct _t *right; \ 43 tmp1 = node->_f.right; \ 45 node->_f.right = tmp2; \ 49 head->top._f.right = tmp1; \ 50 else if (parent->_f.right == node) \ 51 parent->_f.right = tmp1; \ 66 tmp2 = tmp1->_f.right; \ 71 head->top._f.right = tmp1; \ 72 else if (parent->_f.right == node) \ 73 parent->_f.right [all...] |
/freebsd-10.1-release/sys/contrib/ipfilter/netinet/ |
H A D | ipf_rb.h | 15 struct _t *right; \ 43 tmp1 = node->_f.right; \ 45 node->_f.right = tmp2; \ 49 head->top._f.right = tmp1; \ 50 else if (parent->_f.right == node) \ 51 parent->_f.right = tmp1; \ 66 tmp2 = tmp1->_f.right; \ 71 head->top._f.right = tmp1; \ 72 else if (parent->_f.right == node) \ 73 parent->_f.right [all...] |
/freebsd-10.1-release/contrib/ofed/libibverbs/src/ |
H A D | memory.c | 68 struct ibv_mem_node *left, *right; member in struct:ibv_mem_node 114 mm_root->right = NULL; 127 while (node->right) 128 node = node->right; 141 if (node->right) { 142 node = node->right; 146 while (node->parent && node == node->parent->right) 161 node->left = tmp->right; 166 if (node->parent->right == node) 167 node->parent->right [all...] |
/freebsd-10.1-release/sys/netgraph/ |
H A D | ng_tee.c | 47 * It has 4 hooks: left, right, left2right, and right2left. Data 48 * entering from the right is passed to the left and duplicated on 49 * right2left, and data entering from the left is passed to the right 51 * sent to left, and data from right2left to right. 76 struct hookinfo right; member in struct:privdata 173 hinfo = &privdata->right; 180 if (privdata->right.dest) 181 privdata->right.dup = privdata->right.dest; 182 privdata->right [all...] |
/freebsd-10.1-release/contrib/subversion/subversion/libsvn_delta/ |
H A D | compose_delta.c | 56 /* 'left' and 'right' link the node into a splay tree. */ member in struct:range_index_node_t 57 range_index_node_t *left, *right; 248 node->left = node->right = NULL; 272 range_index_node_t *left, *right; 277 scratch_node.left = scratch_node.right = NULL; 278 left = right = &scratch_node; 289 tree->left = node->right; 290 node->right = tree; 296 /* Remember the right subtree */ 297 right 269 range_index_node_t *left, *right; local [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | TargetCXXABI.h | 262 friend bool operator==(const TargetCXXABI &left, const TargetCXXABI &right) { argument 263 return left.getKind() == right.getKind(); 266 friend bool operator!=(const TargetCXXABI &left, const TargetCXXABI &right) { argument 267 return !(left == right);
|
/freebsd-10.1-release/sys/xen/interface/io/ |
H A D | libxenvchan.h | 63 * right is client read, server write 65 struct ring_shared left, right; member in struct:vchan_interface 90 * Grant list: ordering is left, right. Must not extend into actual ring
|
/freebsd-10.1-release/usr.bin/ctags/ |
H A D | tree.c | 85 np->left = np->right = 0; 116 else if (cur_node->right) 117 add_node(node, cur_node->right); 119 cur_node->right = node; 127 if (node->right) 128 free_tree(node->right);
|
/freebsd-10.1-release/contrib/binutils/gas/ |
H A D | expr.c | 178 for me to fix right. Thus a hack. JF: Just make generic_bignum bigger, 1641 expressionS right; 1665 rightseg = expr (op_rank[(int) op_left], &right, mode); 1666 if (right.X_op == O_absent) 1669 right.X_op = O_constant; 1670 right.X_add_number = 0; 1671 right.X_add_symbol = NULL; 1672 right.X_op_symbol = NULL; 1680 as_bad ("missing right bracket"); 1695 /* input_line_pointer->after right 1634 expressionS right; local 1895 valueT left, right; local 2085 case O_left_shift: left <<= right; break; local 2086 case O_right_shift: left >>= right; break; local [all...] |
/freebsd-10.1-release/contrib/wpa/src/crypto/ |
H A D | des-internal.c | 320 u32 work, right, leftt; local 324 right = block[1]; 326 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; 327 right ^= work; 330 work = ((leftt >> 16) ^ right) & 0x0000ffffL; 331 right ^= work; 334 work = ((right >> 2) ^ leftt) & 0x33333333L; 336 right ^= (work << 2); 338 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; 340 right [all...] |
/freebsd-10.1-release/usr.sbin/cron/lib/ |
H A D | compat.c | 88 strcasecmp(left, right) 90 char *right; 92 while (*left && (MkLower(*left) == MkLower(*right))) { 94 right++; 96 return MkLower(*left) - MkLower(*right);
|
/freebsd-10.1-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | erase_fn_imps.hpp | 229 size_type right = m_size - 1; local 231 while (right + 1 != left) 237 else if (pred(m_a_entries[right])) 238 --right; 241 _GLIBCXX_DEBUG_ASSERT(left < right); 243 std::swap(m_a_entries[left], m_a_entries[right]); 246 --right;
|
/freebsd-10.1-release/share/examples/ppp/ |
H A D | login-auth | 54 pack .l.value -side right; 64 pack .p.value -side right; 73 pack .b.cancel -side right;
|