/dragonfly/contrib/binutils-2.27/gas/doc/ |
H A D | c-m68hc11.texi | 100 @cindex @samp{--short-branches} 101 @item --short-branches 102 The @samp{--short-branches} option turns off the translation of 103 relative branches into absolute branches when the branch offset is 111 @samp{jmp} and the conditional branches instructions are inverted and 117 @cindex @samp{--force-long-branches} 118 @item --force-long-branches 119 The @samp{--force-long-branches} option forces the translation of 120 relative branches into absolute branches. This option does not affect 419 by the @samp{--short-branches} or @samp{--force-long-branches} options. [all …]
|
H A D | c-nios2.texi | 36 Replace identified out-of-range branches with PC-relative @code{jmp} 51 Do not replace any branches or calls. 242 Do not replace any branches or calls. 246 Replace identified out-of-range branches with
|
H A D | c-m68k.texi | 141 Always keep branches PC-relative. In the M680x0 architecture all branches 146 branches are available, only word branches will be emitted. An error 148 option has no effect on 68020 and other processors that have long branches. 528 If no long branches are available and the @samp{--pcrel} option is not 530 branches are available, the @samp{--pcrel} option is given, and a word 548 instruction. However, if a word branch is not sufficient, no long branches 573 sufficient and long branches are available, when the source reads 582 If, however, long branches are not available and the @samp{--pcrel} option is
|
H A D | c-i370.texi | 79 All labels are relative to the last USING. Thus, branches to a label 156 will be used for branches in the @code{.text} section. A second
|
H A D | c-vax.texi | 70 assemblers would emit short and medium branches, unless told by 71 this option to emit short and long branches. 237 @var{COND} may be any one of the conditional branches
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | gcov.c | 207 int branches; member 1632 coverage->branches++; in add_branch_counts() 1707 if (coverage->branches) in function_summary() 1711 coverage->branches, 2), in function_summary() 1712 coverage->branches); in function_summary() 1715 coverage->branches, 2), in function_summary() 1716 coverage->branches); in function_summary() 1965 arc->line_next = line->u.branches; in add_line_counts() 1966 line->u.branches = arc; in add_line_counts() 2001 for (arc = line->u.branches, arc_p = NULL; arc; in accumulate_line_counts() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | gcov.c | 203 vector<arc_info *> branches; member 310 int branches; member 980 for (it = line->branches.begin (); it != line->branches.end (); in output_intermediate_line() 2148 coverage->branches++; in add_branch_counts() 2257 if (coverage->branches) in function_summary() 2261 coverage->branches, 2), in function_summary() 2262 coverage->branches); in function_summary() 2265 coverage->branches, 2), in function_summary() 2266 coverage->branches); in function_summary() 2558 line->branches.push_back (arc); in add_line_counts() [all …]
|
/dragonfly/contrib/cvs-1.12/src/ |
H A D | rcs.c | 968 if (rnode->branches != NULL) in free_rcsvers_contents() 969 dellist (&rnode->branches); in free_rcsvers_contents() 2725 if (vn->branches == NULL) in RCS_getbranch() 2728 head = vn->branches->list; in RCS_getbranch() 3048 if (vers->branches == NULL) in RCS_getdatebranch() 3053 for (p = vers->branches->list->next; p != vers->branches->list; p = p->next) in RCS_getdatebranch() 7489 if (vers->branches == NULL) in RCS_deltas() 8134 List *branches; in RCS_putdtree() local 8140 branches = getlist(); in RCS_putdtree() 8161 if (versp->branches != NULL) in RCS_putdtree() [all …]
|
H A D | rcs.h | 162 List *branches; member
|
H A D | log.c | 1538 if (vnode->branches != NULL) in log_tree() 1545 head = vnode->branches->list; in log_tree() 1665 if (ver->branches != NULL) in log_version() 1668 walklist (ver->branches, log_branch, NULL); in log_version()
|
/dragonfly/contrib/tre/lib/ |
H A D | tre-compile.c | 140 b = lm->branches; in print_last_matched_pre() 190 b = lm->branches; in print_last_matched() 939 u->branches = b; in tre_add_tags() 1145 u->branches = lb; in tre_add_tags() 1161 u->branches = rb; in tre_add_tags() 1175 u->branches = lb; in tre_add_tags() 1190 u->branches = rb; in tre_add_tags() 1200 if (lu->branches) in tre_add_tags() 1202 if (ru->branches) in tre_add_tags() 1212 lu->branches = ru->branches; in tre_add_tags() [all …]
|
H A D | tre-internal.h | 296 tre_last_matched_branch_pre_t *branches; int n_branches; int start_tag; member 308 tre_last_matched_branch_t *branches; int n_branches; int start_tag; member
|
H A D | regexec.c | 71 b = lm->branches; in tre_reset_last_matched_branches() 106 for (i = lm->n_branches, b = lm->branches; i > 0; i--, b++) in tre_reset_last_matched_branches() 121 for (i = lm->n_branches, b = lm->branches; i > 0; i--, b++) in tre_reset_last_matched_branches()
|
/dragonfly/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_rar.c | 192 int branches[2]; member 2568 while (!(code->tree[node].branches[0] == in read_next_symbol() 2569 code->tree[node].branches[1])) in read_next_symbol() 2580 if (code->tree[node].branches[bit] < 0) in read_next_symbol() 2586 node = code->tree[node].branches[bit]; in read_next_symbol() 2589 return code->tree[node].branches[0]; in read_next_symbol() 2662 if (code->tree[lastnode].branches[0] == in add_value() 2663 code->tree[lastnode].branches[1]) in add_value() 2730 code->tree[lastnode].branches[0] = value; in add_value() 2793 if (code->tree[node].branches[0] == in make_table_recurse() [all …]
|
/dragonfly/gnu/usr.bin/rcs/rlog/ |
H A D | rlog.c | 530 putforest(root->branches); 616 newbranch = node->branches; 746 newbranch = root->branches; 904 newbranch = root->branches; 959 newbranch = root->branches;
|
/dragonfly/contrib/gcc-4.7/gcc/doc/ |
H A D | gcov.texi | 127 [@option{-u}|@option{--unconditional-branches}] 166 each branch in your program was taken. Unconditional branches will not 171 Write branch frequencies as the number of branches taken, rather than 172 the percentage of branches taken. 229 @itemx --unconditional-branches 231 Unconditional branches are normally not interesting. 401 80.00% of 5 branches executed in file tmp.c 402 80.00% of 5 branches taken at least once in file tmp.c 447 be multiple branches and calls listed for a single source line if there 449 branches and calls are each given a number. There is no simple way to map [all …]
|
/dragonfly/gnu/usr.bin/rcs/ci/ |
H A D | ci.c | 575 newdelta.branches = 0; 1048 if (!branchpoint->branches) { 1050 branchpoint->branches = &newbranch; 1060 bhead=branchpoint->branches; 1073 btrail = &branchpoint->branches;
|
/dragonfly/contrib/cryptsetup/ |
H A D | README.DRAGONFLY | 10 All modifications are made in the master or release branches!
|
/dragonfly/contrib/mpfr/ |
H A D | README | 70 svn ls svn://scm.gforge.inria.fr/svn/mpfr/branches 73 to get the list of branches or tags (releases), then checkout a
|
/dragonfly/gnu/usr.bin/rcs/lib/ |
H A D | rcsgen.c | 545 nextbranch = node->branches; 575 nextbranch = root->branches;
|
H A D | rcsrev.c | 558 bhead = bpoint->branches; 659 bhead = trail->branches;
|
/dragonfly/contrib/cvs-1.12/contrib/ |
H A D | rcs-5.7-commitid.patch | 234 struct branchhead * branches; /* list of first revisions on branches*/ 409 newbranch = node->branches;
|
/dragonfly/contrib/gcc-4.7/gcc/config/i386/ |
H A D | ppro.md | 200 ;; execute branches that are taken multiple times (such as in loops). 202 ;; branches cost only one fetch cycle. Mispredicted branches are very 207 ;; optimistic and assume branches are often predicted correctly, so 221 ;; ??? Indirect branches probably have worse latency than this.
|
/dragonfly/contrib/gcc-8.0/gcc/config/i386/ |
H A D | ppro.md | 200 ;; execute branches that are taken multiple times (such as in loops). 202 ;; branches cost only one fetch cycle. Mispredicted branches are very 207 ;; optimistic and assume branches are often predicted correctly, so 221 ;; ??? Indirect branches probably have worse latency than this.
|
/dragonfly/gnu/usr.bin/rcs/rcs/ |
H A D | rcs.c | 1147 if ( pt->branches ){ /* a branch point */ 1584 pre = pt = cuthead->branches; in buildtree() 1592 cuthead->branches = pt->nextbranch; in buildtree()
|