/netbsd-6-1-5-RELEASE/external/bsd/mdocml/dist/ |
H A D | eqn_html.c | 76 if (bp->right) 77 print_text(p, bp->right);
|
H A D | eqn_term.c | 69 if (bp->right) 70 term_word(p, bp->right);
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/cris/ |
H A D | rd-usp-1.d | 5 # Check that USP gets the right number for V10.
|
H A D | rd-usp-1b.d | 5 # Check that USP gets the right number for V32.
|
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/preproc/eqn/ |
H A D | delim.cpp | 168 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 D | list.cpp | 66 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-6-1-5-RELEASE/tests/lib/libc/regex/ |
H A D | t_regex_att.in | 41 tc:rightassoc:Tests right-associative implementations
|
/netbsd-6-1-5-RELEASE/usr.bin/ctags/ |
H A D | print.c | 119 if (node->right) 120 put_entries(node->right);
|
/netbsd-6-1-5-RELEASE/gnu/dist/bc/bc/ |
H A D | util.c | 387 return find_id (tree->right, id); 407 new_id->right = NULL; 433 A->left = B->right; 434 B->right = A; 442 *root = B->right; 443 B->right = (*root)->left; 444 A->left = (*root)->right; 446 (*root)->right = A; 469 /* Insert it on the right. */ 470 if (insert_id_rec (&((*root)->right), new_i [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gold/ |
H A D | expression.cc | 317 Binary_expression(Expression* left, Expression* right) argument 318 : left_(left), right_(right) 383 // is section relative and the right operand is not, the result uses 385 // left and right swapped. IS_DIV means that we need to give an error 386 // if the right operand is zero. WARN means that we should warn if 394 Binary_ ## NAME(Expression* left, Expression* right) \ 395 : Binary_expression(left, right) \ 407 uint64_t right = this->right_value(eei, &right_section, \ 432 if (IS_DIV && right == 0) \ 437 return left OPERATOR right; \ 597 Max_expression(Expression* left, Expression* right) argument 609 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local 638 script_exp_function_max(Expression* left, Expression* right) argument 648 Min_expression(Expression* left, Expression* right) argument 660 uint64_t right = this->right_value(eei, &right_section, &right_alignment); local 689 script_exp_function_min(Expression* left, Expression* right) argument 798 Align_expression(Expression* left, Expression* right) argument 832 script_exp_function_align(Expression* left, Expression* right) argument 1033 script_exp_function_data_segment_relro_end(Expression*, Expression* right) argument [all...] |
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/common/avl/ |
H A D | avl.c | 33 * any given node, the left and right subtrees are allowed to differ in height 61 * - The left/right children pointers of a node are in an array. 63 * left and right indices. The implementation is written as if it only 65 * to "left", the code also works for right handed trees. The 69 * // 1 for dealing with right children 72 * // +1 when right subtree is taller 74 * int right; // will be the opposite of left (0 or 1) 77 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right) 100 * left and right children when examining a tree. C "if()" statements 117 * - otherwise we return thru parent nodes until we've come from a right chil 128 int right = 1 - left; local 294 int right = 1 - left; local 672 int right; local [all...] |
/netbsd-6-1-5-RELEASE/lib/libcurses/ |
H A D | border.c | 51 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); 112 right |= (right [all...] |
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/diff/ |
H A D | side.c | 178 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-6-1-5-RELEASE/external/public-domain/xz/dist/src/liblzma/common/ |
H A D | index.c | 41 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); 235 node->right = NULL; 253 tree->rightmost->right = node; 270 index_tree_node *pivot = node->right; 275 assert(node->parent->right == node); 276 node->parent->right = pivot; 281 node->right = pivot->left; 282 if (node->right ! 745 index_stream *right = (index_stream *)(this->node.right); local 1224 size_t right = group->last; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/sim/common/ |
H A D | sim-arange.c | 74 ADDR_SUBRANGE *right = NULL; local 141 right = asr; 176 if (right) 178 if (left == right) 182 new_asr2->start = right->start; 183 new_asr2->end = right->end; 188 right->start = caller->end + 1;
|
/netbsd-6-1-5-RELEASE/usr.bin/nbperf/ |
H A D | nbperf-chm.c | 108 - state->g[e->middle] - state->g[e->right]) 112 - state->g[e->left] - state->g[e->right]) 115 state->g[e->right] = (2 * state->graph.e + e_idx 121 state->visited[e->right] = 1; 125 - state->g[e->right]) % state->graph.e; 127 state->g[e->right] = (state->graph.e + e_idx 131 state->visited[e->right] = 1;
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gprof/ |
H A D | basic_blocks.c | 61 const Sym *right = *(const Sym **) rp; 63 if (left->file && right->file) 65 r = strcmp (left->file->name, right->file->name); 70 if (left->line_num != right->line_num) 71 return left->line_num - right->line_num; 74 if (left->addr < right->addr) 76 else if (left->addr > right->addr) 89 const Sym *right = *(const Sym **) rp; 93 else if (!right) 96 if (left->ncalls < right 60 const Sym *right = *(const Sym **) rp; local 88 const Sym *right = *(const Sym **) rp; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/27_io/manipulators/adjustfield/wchar_t/ |
H A D | 1.cc | 68 oss << L":" << std::setw(6) << std::right << false << L":" << std::endl; 72 oss << L":" << std::setw(3) << std::right << false << L":" << std::endl; 82 oss << L":" << std::setw(6) << std::right << false << L":" << std::endl;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/27_io/manipulators/basefield/wchar_t/ |
H A D | 1.cc | 72 oss << L":" << std::setw(11) << std::right; member in class:std 84 oss << L":" << std::setw(11) << std::right; member in class:std 100 oss << L"|" << std::setw(16) << std::right; member in class:std
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | tree-chrec.h | 105 tree right) 108 || right == chrec_dont_know) 112 build_int_cst (NULL_TREE, loop_num), left, right); 100 build_polynomial_chrec(unsigned loop_num, tree left, tree right) argument
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/manipulators/adjustfield/wchar_t/ |
H A D | 1.cc | 77 oss << L":" << std::setw(6) << std::right << false << L":" << std::endl; 81 oss << L":" << std::setw(3) << std::right << false << L":" << std::endl; 91 oss << L":" << std::setw(6) << std::right << false << L":" << std::endl;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/manipulators/basefield/wchar_t/ |
H A D | 1.cc | 81 oss << L":" << std::setw(11) << std::right; member in class:std 93 oss << L":" << std::setw(11) << std::right; member in class:std 109 oss << L"|" << std::setw(16) << std::right; member in class:std
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/sim/testsuite/sim/h8300/ |
H A D | shlr.s | 28 shlr.b r0l ; shift right logical by one 54 shlr.b @er0 ; shift right logical by one, indirect 83 shlr.b @er0+ ; shift right logical by one, postinc 113 shlr.b @er0- ; shift right logical by one, postdec 143 shlr.b @+er0 ; shift right logical by one, preinc 173 shlr.b @-er0 ; shift right logical by one, predec 203 shlr.b @(2:2, er0) ; shift right logical by one, disp2 233 shlr.b @(44:16, er0) ; shift right logical by one, disp16 264 shlr.b @(666:32, er0) ; shift right logical by one, disp32 294 shlr.b @byte_dest:16 ; shift right logica [all...] |
H A D | rotr.s | 28 rotr.b r0l ; shift right arithmetic by one 53 rotr.b @er0 ; shift right arithmetic by one, indirect 80 rotr.b @er0+ ; shift right arithmetic by one, postinc 107 rotr.b @er0- ; shift right arithmetic by one, postdec 134 rotr.b @+er0 ; shift right arithmetic by one, preinc 161 rotr.b @-er0 ; shift right arithmetic by one, predec 188 rotr.b @(2:2, er0) ; shift right arithmetic by one, disp2 215 rotr.b @(44:16, er0) ; shift right arithmetic by one, disp16 242 rotr.b @(666:32, er0) ; shift right arithmetic by one, disp32 268 rotr.b @byte_dest:16 ; shift right arithmeti [all...] |
H A D | rotxr.s | 28 rotxr.b r0l ; shift right arithmetic by one 54 rotxr.b @er0 ; shift right arithmetic by one, indirect 83 rotxr.b @er0+ ; shift right arithmetic by one, postinc 113 rotxr.b @er0- ; shift right arithmetic by one, postdec 143 rotxr.b @+er0 ; shift right arithmetic by one, preinc 173 rotxr.b @-er0 ; shift right arithmetic by one, predec 203 rotxr.b @(2:2, er0) ; shift right arithmetic by one, disp2 233 rotxr.b @(44:16, er0) ; shift right arithmetic by one, disp16 264 rotxr.b @(666:32, er0) ; shift right arithmetic by one, disp32 294 rotxr.b @byte_dest:16 ; shift right arithmeti [all...] |