/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/libiberty/ |
H A D | cp-demint.c | 62 struct demangle_component *right) 113 if (right != NULL) 124 p->u.s_binary.right = right; 59 cplus_demangle_fill_component(struct demangle_component *p, enum demangle_component_type type, struct demangle_component *left, struct demangle_component *right) argument
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/include/backward/ |
H A D | iomanip.h | 50 using std::right;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/ios_base/types/fmtflags/ |
H A D | case_label.cc | 59 case std::ios_base::right:
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/manipulators/adjustfield/char/ |
H A D | 2.cc | 42 o << std::setw(6) << std::right << "san"; member in class:std
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/manipulators/adjustfield/wchar_t/ |
H A D | 2.cc | 41 o << std::setw(6) << std::right << L"san";
|
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/ |
H A D | rf_sstf.h | 42 RF_SstfQ_t right; member in struct:RF_Sstf_s
|
/netbsd-6-1-5-RELEASE/sys/arch/hppa/spmath/ |
H A D | sgl_float.h | 85 #define Sgl_leftshiftby1_withextent(left,right,result) \ 86 Shiftdouble(Sall(left),Extall(right),31,Sall(result)) 88 #define Sgl_rightshiftby1_withextent(left,right,dst) \ 89 Shiftdouble(Sall(left),Extall(right),1,Extall(right)) 254 /* The left argument is never smaller than the right argument */ 258 /* Subtract right augmented with extension from left augmented with zeros and 260 #define Sgl_subtract_withextension(left,right,extent,result) \ 261 /* sgl_floating_point left,right,result; extension extent */ \ 262 Sgl_subtract(left,right,resul [all...] |
/netbsd-6-1-5-RELEASE/usr.bin/nbperf/ |
H A D | graph3.c | 93 e->right == e2->right && 121 graph->edges[i].right = hashes[2] % graph->v; 124 if (graph->edges[i].left == graph->edges[i].right) 126 if (graph->edges[i].middle == graph->edges[i].right) 151 v = &graph->verts[graph->edges[i].right]; 202 vr = &graph->verts[e->right]; 243 graph3_remove_vertex(graph, &graph->verts[e->right]);
|
H A D | graph2.c | 92 if (i < j && e->right == e2->right && 119 graph->edges[i].right = hashes[1] % graph->v; 120 if (graph->edges[i].left == graph->edges[i].right) 137 v = &graph->verts[graph->edges[i].right]; 170 v2 = &graph->verts[e->right];
|
H A D | nbperf-bdz.c | 100 if (state->visited[e->right]) 103 t = e->right; 111 if (state->visited[e->right] == 0) 112 state->visited[e->right] = 1; 115 - state->g[e->right]) % 3;
|
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gprof/ |
H A D | symtab.c | 55 to, or greater than the right value. If two symbols are equal 66 const Sym *right = (const Sym *) rp; 68 if (left->addr > right->addr) 70 else if (left->addr < right->addr) 73 if (left->is_func != right->is_func) 74 return right->is_func - left->is_func; 76 return left->is_static - right->is_static; 65 const Sym *right = (const Sym *) rp; local
|
H A D | cg_print.c | 137 cmp_member (Sym *left, Sym *right) 140 double right_time = right->cg.prop.self + right->cg.prop.child; 142 unsigned long right_calls = right->ncalls + right->cg.self_calls; 223 cmp_arc (Arc *left, Arc *right) 227 Sym *right_parent = right->parent; 228 Sym *right_child = right->child; 242 printf (" %f + %f %lu/%lu\n", right->time, right 136 cmp_member(Sym *left, Sym *right) argument 222 cmp_arc(Arc *left, Arc *right) argument 551 cmp_name(const PTR left, const PTR right) argument 675 cmp_arc_count(const PTR left, const PTR right) argument 692 cmp_fun_nuses(const PTR left, const PTR right) argument [all...] |
H A D | cg_arcs.c | 157 const Sym *right = *(const Sym **) rp; local 159 return left->cg.top_order - right->cg.top_order; 541 const Sym *right = *(const Sym **) rp; local 545 - (right->cg.prop.self + right->cg.prop.child); 558 if (!right->name && right->cg.cyc.num != 0) 566 if (!right->name) 570 if (left->name[0] != '_' && right->name[0] == '_') 574 if (left->name[0] == '_' && right [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/texinfo/intl/ |
H A D | plural.y | 100 new_exp_1 (enum operator op, struct expression *right) 104 args[0] = right; 109 new_exp_2 (enum operator op, struct expression *left, struct expression *right) 114 args[1] = right; 137 %right '?' /* ? */ 144 %right '!' /* ! */
|
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/preproc/eqn/ |
H A D | eqn.y | 103 /* The original eqn manual says that `left' is right associative. It's lying. 104 Consider `left ( ~ left ( ~ right ) right )'. */ 106 %right LEFT 108 %right LPILE RPILE CPILE PILE TEXT QUOTED_TEXT MATRIX MARK LINEUP '^' '~' '\t' '{' SPLIT NOSPLIT 109 %right FROM TO 111 %right SUB SUP 112 %right ROMAN BOLD ITALIC FAT FONT SIZE FWD BACK DOWN UP TYPE VCENTER SPECIAL 113 %right BAR UNDER PRIME
|
/netbsd-6-1-5-RELEASE/gnu/dist/diffutils/src/ |
H A D | side.c | 168 char const *const *right) 184 if (sep == '|' && put_newline != (right[1][-1] == '\n')) 189 if (right) 191 put_newline |= right[1][-1] == '\n'; 192 if (**right != '\n') 195 print_half_line (right, col, hw); 167 print_1sdiff_line(char const *const *left, char sep, char const *const *right) argument
|
/netbsd-6-1-5-RELEASE/gnu/dist/gettext/gettext-runtime/intl/ |
H A D | plural.y | 98 new_exp_1 (enum operator op, struct expression *right) 102 args[0] = right; 107 new_exp_2 (enum operator op, struct expression *left, struct expression *right) 112 args[1] = right; 135 %right '?' /* ? */ 142 %right '!' /* ! */
|
/netbsd-6-1-5-RELEASE/bin/ksh/ |
H A D | tree.c | 81 t = t->right; 85 t = t->right; 90 t->left, (t->type==TOR) ? "||" : "&&", t->right); 94 t = t->right; 125 for (t1 = t->left; t1 != NULL; t1 = t1->right) { 139 t = t->right; 145 if (t->right == NULL || t->right->type != TELIF) 147 t = t->right; 152 if (t->right ! [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | et-forest.c | 478 nw->right = NULL; 527 struct et_node *left, *right; local 560 right = father->son; 561 if (right) 562 left = right->left; 564 left = right = t; 566 left->right = t; 567 right->left = t; 569 t->right = right; [all...] |
H A D | stmt.c | 78 totally unbalanced, with everything on the right. We balance the tree 80 and nodes on the right having higher values. We then output the tree 89 struct case_node *right; /* Right son in binary tree; also node chain */ 1704 the right. Set PADDING_CORRECTION to the number of padding 1708 the register, which translates to right padding on little-endian 1746 xbitpos for the destination store (right justified). */ 2080 r->right = head; 2174 for (n = nodes; n; n = n->right) 2247 Generate the code to test it and jump to the right place. */ 2330 for (n = case_list; n; n = n->right) 88 struct case_node *right; /* Right son in binary tree; also node chain */ member in struct:case_node [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | et-forest.c | 478 nw->right = NULL; 516 struct et_node *left, *right; local 549 right = father->son; 550 if (right) 551 left = right->left; 553 left = right = t; 555 left->right = t; 556 right->left = t; 558 t->right = right; [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libmudflap/ |
H A D | mf-runtime.c | 90 mfsplay_tree_node right; member in struct:mfsplay_tree_node_s 1597 /* Iterate left then right near this key value to find all overlapping objects. */ 2425 /* The target is to the right. */ 2426 next = &n->right; 2459 *node = n->right; 2460 n->right = *parent; 2472 or where both are right children. */ 2477 (*grandparent)->left = p->right; 2478 p->right = *grandparent; 2479 p->left = n->right; 2695 mfsplay_tree_node left, right; local [all...] |
/netbsd-6-1-5-RELEASE/gnu/dist/groff/src/devices/grohtml/ |
H A D | html-table.cpp | 291 if (c->right > linelength) { 292 c->right = linelength; 299 if (p != NULL && p->right > 0) 300 add_column(p->no+1, p->right, linelength, 'L'); 357 * get_right - returns the right most position of this column. 362 if (c != NULL && c->right > 0) 363 return c->right; 453 .put_string("%\" align=right>") 569 if ((l != NULL) && (hstart < l->right)) 585 n->right [all...] |
/netbsd-6-1-5-RELEASE/usr.bin/sdiff/ |
H A D | sdiff.c | 43 char *right; member in struct:diffline 368 * Prints an individual column (left or right), taking into account 450 /* Choose right column as-is. */ 708 /* If -l flag was given, don't print right column. */ 750 enqueue(char *left, char divc, char *right) argument 758 diffp->right = right; 769 free(diffp->right); 847 char divc, *left, *right; local 857 right [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/lib/ |
H A D | tre-compile.c | 39 and the right child is the old root. */ 53 c->right = tre_mem_alloc(mem, sizeof(tre_ast_node_t)); 54 if (c->right == NULL) 57 c->right->obj = node->obj; 58 c->right->type = node->type; 59 c->right->nullable = -1; 60 c->right->submatch_id = -1; 61 c->right->firstpos = NULL; 62 c->right->lastpos = NULL; 63 c->right 320 tre_ast_node_t *right = cat->right; local 411 tre_ast_node_t *right = uni->right; local 568 tre_ast_node_t *right = tre_stack_pop_voidptr(stack); local [all...] |