/freebsd-9.3-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-9.3-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-9.3-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-9.3-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-9.3-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-9.3-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-9.3-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...] |
H A D | ng_tee.h | 53 #define NG_TEE_HOOK_RIGHT "right" 77 struct ng_tee_hookstat right; member in struct:ng_tee_stats 85 { "right", (hstype) }, \
|
/freebsd-9.3-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-9.3-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-9.3-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-9.3-release/contrib/wpa/src/crypto/ |
H A D | des-internal.c | 326 u32 work, right, leftt; local 330 right = block[1]; 332 work = ((leftt >> 4) ^ right) & 0x0f0f0f0fL; 333 right ^= work; 336 work = ((leftt >> 16) ^ right) & 0x0000ffffL; 337 right ^= work; 340 work = ((right >> 2) ^ leftt) & 0x33333333L; 342 right ^= (work << 2); 344 work = ((right >> 8) ^ leftt) & 0x00ff00ffL; 346 right [all...] |
/freebsd-9.3-release/sys/gnu/fs/xfs/ |
H A D | xfs_alloc_btree.c | 91 xfs_agblock_t rbno; /* right block's block number */ 92 xfs_buf_t *rbp; /* right block's buffer pointer */ 93 xfs_alloc_block_t *right; /* right btree block */ local 94 xfs_alloc_key_t *rkp; /* right block key pointer */ 95 xfs_alloc_ptr_t *rpp; /* right block address pointer */ 96 int rrecs=0; /* number of records in right block */ 97 xfs_alloc_rec_t *rrp; /* right block record pointer */ 177 * this is the leaf level, and there is no right sibling block, 280 * tree balanced. Look at the left and right siblin 1170 xfs_alloc_block_t *right; /* right (current) btree block */ local 1311 xfs_alloc_block_t *right; /* right btree block */ local 1462 xfs_alloc_block_t *right; /* right neighbor btree block */ local 1597 xfs_alloc_block_t *right; /* right (new) btree block */ local [all...] |
H A D | xfs_ialloc_btree.c | 86 xfs_agblock_t rbno; /* right block's block number */ 87 xfs_buf_t *rbp; /* right block's buffer pointer */ 88 xfs_inobt_block_t *right; /* right btree block */ local 89 xfs_inobt_key_t *rkp; /* right block key pointer */ 91 xfs_inobt_ptr_t *rpp; /* right block address pointer */ 92 int rrecs = 0; /* number of records in right block */ 94 xfs_inobt_rec_t *rrp; /* right block record pointer */ 234 * tree balanced. Look at the left and right sibling blocks to 248 * If there's a right siblin 1061 xfs_inobt_block_t *right; /* right (current) btree block */ local 1204 xfs_inobt_block_t *right; /* right btree block */ local 1347 xfs_inobt_block_t *right; /* right neighbor btree block */ local 1481 xfs_inobt_block_t *right; /* right (new) btree block */ local [all...] |
/freebsd-9.3-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-9.3-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-9.3-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;
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | et-forest.h | 68 struct et_node *right; /* The brothers of the node. */ member in struct:et_node
|
H A D | tree-chrec.h | 105 tree right) 108 || right == chrec_dont_know) 111 gcc_assert (TREE_TYPE (left) == TREE_TYPE (right)); 114 build_int_cst (NULL_TREE, loop_num), left, right); 100 build_polynomial_chrec(unsigned loop_num, tree left, tree right) argument
|
/freebsd-9.3-release/contrib/sendmail/contrib/ |
H A D | cidrexpand | 17 # the -r flag to makemap will make it "do the right thing" 70 my ($prefix,$left,$right,$space); 107 ($prefix,$left,$space,$right) = 113 print "$prefix$nl$space$right\n";
|
/freebsd-9.3-release/contrib/groff/src/preproc/eqn/ |
H A D | delim.cpp | 166 char *right; member in class:delim_box 191 : left(l), right(r), p(pp) 198 a_delete right; local 371 if (right) { 372 define_extensible_string(right, uid, RIGHT_DELIM); 384 if (right) 398 if (right) 399 fprintf(stderr, " right \"%s\"", right);
|
H A D | list.cpp | 64 static int compute_spacing(int is_script, int left, int right) argument 66 if (left == SUPPRESS_TYPE || right == SUPPRESS_TYPE) 70 if (left == OPENING_TYPE || right == CLOSING_TYPE) 72 if (right == BINARY_TYPE || left == BINARY_TYPE) 74 if (right == RELATION_TYPE) { 82 if (right == OPERATOR_TYPE) 84 if (left == INNER_TYPE || right == INNER_TYPE) 86 if (left == OPERATOR_TYPE && right == ORDINARY_TYPE)
|
/freebsd-9.3-release/contrib/ncurses/form/ |
H A D | fld_newftyp.c | 42 (FIELDTYPE *)0, /* pointer to right operand */ 128 if (typ->right) 129 typ->right->ref--;
|