Searched refs:right (Results 126 - 150 of 1186) sorted by relevance

1234567891011>>

/netbsd-current/sys/external/bsd/ipf/netinet/
H A Dradix_ipf.c139 /* Parameters: tree(I) - pointer to first right node in tree to search */
152 cur = cur->right;
379 cur = cur->right;
388 prev->right = &nodes[1];
393 nodes[1].right = cur;
395 nodes[1].right = &nodes[0];
448 cur = nodes[1].right;
545 prev->right = &nodes[0];
610 node->right = found->right;
[all...]
/netbsd-current/usr.bin/ctags/
H A Dprint.c119 if (node->right)
120 put_entries(node->right);
/netbsd-current/external/gpl2/groff/dist/src/preproc/eqn/
H A Ddelim.cpp168 char *right; member in class:delim_box
193 : left(l), right(r), p(pp)
200 a_delete right; local
373 if (right) {
374 define_extensible_string(right, uid, RIGHT_DELIM);
386 if (right)
400 if (right)
401 fprintf(stderr, " right \"%s\"", right);
H A Dlist.cpp66 static int compute_spacing(int is_script, int left, int right) argument
68 if (left == SUPPRESS_TYPE || right == SUPPRESS_TYPE)
72 if (left == OPENING_TYPE || right == CLOSING_TYPE)
74 if (right == BINARY_TYPE || left == BINARY_TYPE)
76 if (right == RELATION_TYPE) {
84 if (right == OPERATOR_TYPE)
86 if (left == INNER_TYPE || right == INNER_TYPE)
88 if (left == OPERATOR_TYPE && right == ORDINARY_TYPE)
/netbsd-current/external/gpl3/gcc.old/dist/gcc/d/dmd/root/
H A Doutbuffer.h66 void bracket(char left, char right);
67 size_t bracket(size_t i, const char *left, size_t j, const char *right);
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/cris/
H A Drd-usp-1.d5 # Check that USP gets the right number for V10.
H A Drd-usp-1b.d5 # Check that USP gets the right number for V32.
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/mips/
H A Dinsn-opts.d5 # such as the ISA mode right.
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/common/
H A Doutbuffer.h68 void bracket(char left, char right);
69 d_size_t bracket(d_size_t i, const char *left, d_size_t j, const char *right);
/netbsd-current/external/bsd/bc/dist/
H A Dutil.c388 return find_id (tree->right, id);
406 new_id->right = NULL;
432 A->left = B->right;
433 B->right = A;
441 *root = B->right;
442 B->right = (*root)->left;
443 A->left = (*root)->right;
445 (*root)->right = A;
468 /* Insert it on the right. */
469 if (insert_id_rec (&((*root)->right), new_i
[all...]
/netbsd-current/sys/arch/evbppc/wii/dev/
H A Davenc.c92 avenc_get_volume(uint8_t *left, uint8_t *right) argument
97 *left = *right = 0;
106 *right = __SHIFTOUT(val, AVENC_VOLUME_RIGHT);
110 avenc_set_volume(uint8_t left, uint8_t right) argument
119 __SHIFTIN(right, AVENC_VOLUME_RIGHT);
/netbsd-current/external/bsd/nsd/dist/
H A Ddname.h123 int dname_is_subdomain(const dname_type *left, const dname_type *right);
182 * Pre: left != NULL && right != NULL
184 int dname_compare(const dname_type *left, const dname_type *right);
194 * Pre: left != NULL && right != NULL
195 * label_is_normal(left) && label_is_normal(right)
197 int label_compare(const uint8_t *left, const uint8_t *right);
205 * Pre: left != NULL && right != NULL
208 const dname_type *right);
364 const dname_type *right);
/netbsd-current/usr.bin/xlint/lint1/
H A Dckgetopt.c89 && tn->u.ops.right->tn_op == CON
90 && tn->u.ops.right->u.value.v_tspec == INT
91 && tn->u.ops.right->u.value.u.integer == -1
94 && tn->u.ops.left->u.ops.right->tn_op == CALL
95 && (call = tn->u.ops.left->u.ops.right->u.call)->func->tn_op == ADDR
/netbsd-current/external/gpl3/gdb.old/dist/gold/
H A Dexpression.cc383 Binary_expression(Expression* left, Expression* right) argument
384 : left_(left), right_(right)
466 // is section relative and the right operand is not, the result uses
468 // left and right swapped. IS_DIV means that we need to give an error
469 // if the right operand is zero. WARN means that we should warn if
477 Binary_ ## NAME(Expression* left, Expression* right) \
478 : Binary_expression(left, right) \
490 uint64_t right = this->right_value(eei, &right_section, \
515 if (IS_DIV && right == 0) \
520 return left OPERATOR right; \
703 Max_expression(Expression* left, Expression* right) argument
715 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
744 script_exp_function_max(Expression* left, Expression* right) argument
754 Min_expression(Expression* left, Expression* right) argument
766 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
795 script_exp_function_min(Expression* left, Expression* right) argument
904 Align_expression(Expression* left, Expression* right) argument
938 script_exp_function_align(Expression* left, Expression* right) argument
1142 script_exp_function_data_segment_relro_end(Expression*, Expression* right) argument
[all...]
/netbsd-current/external/gpl3/binutils.old/dist/gold/
H A Dexpression.cc383 Binary_expression(Expression* left, Expression* right) argument
384 : left_(left), right_(right)
466 // is section relative and the right operand is not, the result uses
468 // left and right swapped. IS_DIV means that we need to give an error
469 // if the right operand is zero. WARN means that we should warn if
477 Binary_ ## NAME(Expression* left, Expression* right) \
478 : Binary_expression(left, right) \
490 uint64_t right = this->right_value(eei, &right_section, \
515 if (IS_DIV && right == 0) \
520 return left OPERATOR right; \
703 Max_expression(Expression* left, Expression* right) argument
715 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
744 script_exp_function_max(Expression* left, Expression* right) argument
754 Min_expression(Expression* left, Expression* right) argument
766 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
795 script_exp_function_min(Expression* left, Expression* right) argument
904 Align_expression(Expression* left, Expression* right) argument
938 script_exp_function_align(Expression* left, Expression* right) argument
1142 script_exp_function_data_segment_relro_end(Expression*, Expression* right) argument
[all...]
/netbsd-current/external/gpl3/binutils/dist/gold/
H A Dexpression.cc383 Binary_expression(Expression* left, Expression* right) argument
384 : left_(left), right_(right)
466 // is section relative and the right operand is not, the result uses
468 // left and right swapped. IS_DIV means that we need to give an error
469 // if the right operand is zero. WARN means that we should warn if
477 Binary_ ## NAME(Expression* left, Expression* right) \
478 : Binary_expression(left, right) \
490 uint64_t right = this->right_value(eei, &right_section, \
515 if (IS_DIV && right == 0) \
520 return left OPERATOR right; \
703 Max_expression(Expression* left, Expression* right) argument
715 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
744 script_exp_function_max(Expression* left, Expression* right) argument
754 Min_expression(Expression* left, Expression* right) argument
766 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local
795 script_exp_function_min(Expression* left, Expression* right) argument
904 Align_expression(Expression* left, Expression* right) argument
938 script_exp_function_align(Expression* left, Expression* right) argument
1142 script_exp_function_data_segment_relro_end(Expression*, Expression* right) argument
[all...]
/netbsd-current/external/cddl/osnet/dist/common/avl/
H A Davl.c38 * any given node, the left and right subtrees are allowed to differ in height
66 * - The left/right children pointers of a node are in an array.
68 * left and right indices. The implementation is written as if it only
70 * to "left", the code also works for right handed trees. The
74 * // 1 for dealing with right children
77 * // +1 when right subtree is taller
79 * int right; // will be the opposite of left (0 or 1)
82 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
111 * left and right children when examining a tree. C "if()" statements
128 * - otherwise we return through parent nodes until we've come from a right
140 int right = 1 - left; local
306 int right = 1 - left; local
687 int right; local
[all...]
/netbsd-current/sys/dev/raidframe/
H A Drf_cvscan.c68 for (key = hdr->cur_block, i = 0, tmp = hdr->right;
140 while (hdr->right != NULL
141 && hdr->right->sectorOffset < hdr->cur_block) {
144 ReqInsert(&hdr->left, ReqDequeue(&hdr->right), rf_cvscan_LEFT);
179 Transfer(&hdr->burner, &hdr->right);
195 /* this request is to the right of the current arms */
196 ReqInsert(&hdr->right, req, rf_cvscan_RIGHT);
234 for (i = 0, tmp = hdr->right, sum_dist_right =
249 hdr->cur_block = hdr->right->sectorOffset + hdr->right
[all...]
/netbsd-current/lib/libcurses/
H A Dborder.c51 border(chtype left, chtype right, chtype top, chtype bottom, chtype topleft, argument
54 return wborder(stdscr, left, right, top, bottom, topleft, topright,
66 wborder(WINDOW *win, chtype left, chtype right, chtype top, chtype bottom, argument
75 if (!(right & __CHARTEXT))
76 right |= ACS_VLINE;
93 __CTRACE(__CTRACE_INPUT, "wborder: right = %c, 0x%x\n",
94 right & __CHARTEXT, right & __ATTRIBUTES);
111 right |= (right
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp1477 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
1655 bool operator()(SUnit* left, SUnit* right) const {
1656 // reverse left/right rather than simply !SortFunc(left, right)
1658 return SortFunc(right, left);
1675 bool operator()(SUnit* left, SUnit* right) const;
1689 bool operator()(SUnit* left, SUnit* right) const;
1705 bool operator()(SUnit* left, SUnit* right) const;
1722 bool operator()(SUnit* left, SUnit* right) const;
1932 // Return -1 to schedule right abov
[all...]
/netbsd-current/external/gpl2/xcvs/dist/diff/
H A Dside.c178 print_1sdiff_line (left, sep, right)
181 char const * const *right;
199 if (sep == '|' && put_newline != (right[1][-1] == '\n'))
205 if (right)
207 if (right[1][-1] == '\n')
209 if (**right != '\n')
212 print_half_line (right, col, hw);
/netbsd-current/external/public-domain/xz/dist/src/liblzma/common/
H A Dindex.c41 index_tree_node *right; member in struct:index_tree_node_s
202 if (node->right != NULL)
203 index_tree_node_end(node->right, allocator, free_func);
234 node->right = NULL;
252 tree->rightmost->right = node;
269 index_tree_node *pivot = node->right;
274 assert(node->parent->right == node);
275 node->parent->right = pivot;
280 node->right = pivot->left;
281 if (node->right !
748 index_stream *right = (index_stream *)(this->node.right); local
1233 size_t right = group->last; local
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/sim/common/
H A Dsim-arange.c68 ADDR_SUBRANGE *right = NULL; local
135 right = asr;
170 if (right)
172 if (left == right)
176 new_asr2->start = right->start;
177 new_asr2->end = right->end;
182 right->start = caller->end + 1;
/netbsd-current/external/gpl3/gdb/dist/sim/common/
H A Dsim-arange.c67 ADDR_SUBRANGE *right = NULL; local
134 right = asr;
169 if (right)
171 if (left == right)
175 new_asr2->start = right->start;
176 new_asr2->end = right->end;
181 right->start = caller->end + 1;
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/format/internal/
H A Dwrite.d219 size_t right = 2;
225 prefix[right++] = '-';
227 prefix[right++] = '+';
229 prefix[right++] = ' ';
245 writeAligned(w, prefix[left .. right], digits[pos + 1 .. $], "", f, true);
260 writeAligned(w, prefix[left .. right], digits[pos + 1 .. $], ".", "", fs,
318 if (right == 3)
323 left = right == 3 ? 0 : 1;
324 right = 3;
343 writeAligned(w, prefix[left .. right], int_digi
[all...]

Completed in 401 milliseconds

1234567891011>>