/haiku-buildtools/binutils/gas/testsuite/gas/cr16/ |
H A D | scc_test.s | 10 scc r4
|
H A D | scc_test.d | 13 6: 34 08 scc r4
|
/haiku-buildtools/binutils/gas/testsuite/gas/cris/ |
H A D | scc.s | 6 scc r1 7 shs r0 ; same as scc
|
H A D | scc.d | 8 [ ]+0:[ ]+3105[ ]+scc[ ]+\$?r1 9 [ ]+2:[ ]+3005[ ]+scc[ ]+\$?r0
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/cris/ |
H A D | scc.s | 6 scc r1 7 shs r0 ; same as scc
|
H A D | scc.d | 8 [ ]+0:[ ]+3105[ ]+scc[ ]+\$?r1 9 [ ]+2:[ ]+3005[ ]+scc[ ]+\$?r0
|
/haiku-buildtools/binutils/gas/testsuite/gas/crx/ |
H A D | jscond_insn.s | 79 .global scc 80 scc: label 81 scc r4 label
|
H A D | jscond_insn.d | 63 00000024 <scc>: 64 24: 34 bb scc r4
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/crx/ |
H A D | jscond_insn.s | 79 .global scc 80 scc: label 81 scc r4 label
|
H A D | jscond_insn.d | 63 00000024 <scc>: 64 24: 34 bb scc r4
|
/haiku-buildtools/binutils/gas/testsuite/gas/rx/ |
H A D | sccnd.d | 9 0: fc db 02 scc\.l r0 10 3: fc db f2 scc\.l r15 11 6: fc db 02 scc\.l r0 12 9: fc db f2 scc\.l r15 45 6c: fc d0 02 scc\.b \[r0\] 46 6f: fc d0 f2 scc\.b \[r15\] 47 72: fc d1 02 fc scc\.b 252\[r0\] 48 76: fc d1 f2 fc scc\.b 252\[r15\] 49 7a: fc d2 02 fc ff scc\.b 65532\[r0\] 50 7f: fc d2 f2 fc ff scc\ [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | ddg.c | 858 /* Algorithm for computing the recurrence_length of an scc. We assume at 862 set_recurrence_length (ddg_scc_ptr scc, ddg_ptr g) 867 for (j = 0; j < scc->num_backarcs; j++) 869 ddg_edge_ptr backarc = scc->backarcs[j]; 875 length = longest_simple_path (g, src->cuid, dest->cuid, scc->nodes); 884 scc->recurrence_length = result; 888 and mark edges that belong to this scc as IN_SCC. */ 892 ddg_scc_ptr scc; 896 scc = (ddg_scc_ptr) xmalloc (sizeof (struct ddg_scc)); 897 scc 860 set_recurrence_length(ddg_scc_ptr scc, ddg_ptr g) argument 890 ddg_scc_ptr scc; local 921 free_scc(ddg_scc_ptr scc) argument 946 add_backarc_to_scc(ddg_scc_ptr scc, ddg_edge_ptr e) argument 956 add_scc_to_ddg(ddg_all_sccs_ptr g, ddg_scc_ptr scc) argument 1075 ddg_scc_ptr scc; local [all...] |
H A D | modulo-sched.c | 2598 ddg_scc_ptr scc = all_sccs->sccs[i]; 2601 find_nodes_on_paths (on_path, g, prev_sccs, scc->nodes); 2602 bitmap_ior (tmp, scc->nodes, on_path); 2605 find_nodes_on_paths (on_path, g, scc->nodes, prev_sccs); 2615 /* Handle the remaining nodes that do not belong to any scc. Each call 2781 order_nodes_in_scc (ddg_ptr g, sbitmap nodes_ordered, sbitmap scc, 2799 if (bitmap_and (tmp, predecessors, scc)) 2804 else if (bitmap_and (tmp, successors, scc)) 2814 if ((u = find_max_asap (g, scc)) >= 0) 2835 bitmap_and (tmp, v_node_succs, scc); 2594 ddg_scc_ptr scc = all_sccs->sccs[i]; local 2777 order_nodes_in_scc(ddg_ptr g, sbitmap nodes_ordered, sbitmap scc, int * node_order, int pos) argument [all...] |
H A D | tree-ssa-sccvn.c | 2790 print_scc (FILE *out, vec<tree> scc) argument 2796 FOR_EACH_VEC_ELT (scc, i, var) 3855 sort_scc (vec<tree> scc) 3857 scc.qsort (compare_ops); 3905 process_scc (vec<tree> scc) 3919 if (scc.length () == 1) 3921 tree use = scc[0]; 3939 print_scc (dump_file, scc); 3960 FOR_EACH_VEC_ELT (scc, i, var) 3962 FOR_EACH_VEC_ELT (scc, 3991 auto_vec<tree> scc; local [all...] |
/haiku-buildtools/gcc/gcc/lto/ |
H A D | lto.c | 1153 tree_scc_hasher::hash (const value_type *scc) argument 1155 return scc->hash; 1689 /* Compare the tree scc SCC to the prevailing candidate PSCC, filling 1693 compare_tree_sccs (tree_scc *pscc, tree_scc *scc, argument 1704 if (compare_tree_sccs_1 (pscc->entries[0], scc->entries[i], &mapp)) 1707 on the scc as all trees will be freed. */ 1710 /* Reset TREE_ASM_WRITTEN on scc for the next compare or in case 1712 for (unsigned j = 0; j < scc->len; ++j) 1713 TREE_ASM_WRITTEN (scc->entries[j]) = 0; 1742 tree_scc *scc local 3217 tree_scc *scc, *max_scc = NULL; local [all...] |
/haiku-buildtools/isl/ |
H A D | isl_schedule.c | 58 * scc is the index of SCC (or WCC) this node belongs to 80 int scc; member in struct:isl_sched_node 171 * scc represents the number of components 204 int scc; member in struct:isl_sched_graph 657 graph->scc = 0; 662 graph->node[g->order[i]].scc = graph->scc; 667 graph->scc++; 697 return graph->node[*i1].scc - graph->node[*i2].scc; 2009 node_scc_exactly(struct isl_sched_node *node, int scc) argument 2014 node_scc_at_most(struct isl_sched_node *node, int scc) argument 2019 node_scc_at_least(struct isl_sched_node *node, int scc) argument 2024 edge_scc_exactly(struct isl_sched_edge *edge, int scc) argument 2029 edge_dst_scc_at_most(struct isl_sched_edge *edge, int scc) argument 2034 edge_src_scc_at_least(struct isl_sched_edge *edge, int scc) argument [all...] |
H A D | isl_ast_codegen.c | 1753 /* Generate code for the schedule domains in "scc" 1756 * The domains in "scc" form a strongly connected component in the ordering. 1757 * If the number of domains in "scc" is larger than 1, then this means 1775 * For each basic set i in "scc" and for each of the following basic sets j, 1778 * We collect all the pieces in a new list that replaces "scc". 1780 static int add_nodes(__isl_take isl_basic_set_list *scc, void *user) argument 1789 n = isl_basic_set_list_n_basic_set(scc); 1790 bset = isl_basic_set_list_get_basic_set(scc, 0); 1792 isl_basic_set_list_free(scc); 1809 bset = isl_basic_set_list_get_basic_set(scc, 1917 generate_sorted_domains_wrap(__isl_take isl_basic_set_list *scc, void *user) argument [all...] |
H A D | isl_list_templ.c | 367 int (*fn)(__isl_take LIST(EL) *scc, void *user), void *user) 400 int (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | assign-warn-1.c | 83 TESTASS(scc, signed char *, char *); /* { dg-warning "pointer targets in assignment differ in signedness" } */
|
H A D | assign-warn-2.c | 84 TESTASS(scc, signed char *, char *); /* { dg-error "pointer targets in assignment differ in signedness" } */
|
/haiku-buildtools/isl/include/isl/ |
H A D | list.h | 61 int (*fn)(__isl_take isl_##EL##_list *scc, void *user), \
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/pdp11/ |
H A D | opcode.s | 42 scc
|
H A D | opcode.d | 39 2e: 00bf [ ]*scc
|
/haiku-buildtools/binutils/gas/testsuite/gas/pdp11/ |
H A D | opcode.s | 43 scc
|
H A D | opcode.d | 39 2e: 00bf [ ]*scc
|