Searched refs:scc (Results 1 - 25 of 70) sorted by relevance

123

/netbsd-current/sys/arch/hpcmips/dev/
H A Dm38813c.c129 m38813c_ifsetup(struct m38813c_chip *scc) argument
132 scc->scc_if.hii_ctx = scc;
134 scc->scc_if.hii_establish = m38813c_input_establish;
135 scc->scc_if.hii_poll = m38813c_intr;
141 struct m38813c_chip *scc = &m38813c_chip; local
143 scc->scc_csh = MIPS_PHYS_TO_KSEG1(addr);
145 m38813c_ifsetup(scc);
147 hpckbd_cnattach(&scc->scc_if);
155 struct m38813c_chip *scc local
179 struct m38813c_chip *scc = arg; local
[all...]
H A Dtc5165buf.c154 tc5165buf_ifsetup(struct tc5165buf_chip *scc) argument
157 scc->scc_if.hii_ctx = scc;
158 scc->scc_if.hii_establish = tc5165buf_input_establish;
159 scc->scc_if.hii_poll = tc5165buf_poll;
165 struct tc5165buf_chip *scc = &tc5165buf_chip; local
167 scc->scc_csh = MIPS_PHYS_TO_KSEG1(addr);
169 tc5165buf_ifsetup(scc);
171 hpckbd_cnattach(&scc->scc_if);
179 struct tc5165buf_chip *scc local
193 struct tc5165buf_chip *scc = sc->sc_chip; local
207 struct tc5165buf_chip *scc = arg; local
220 struct tc5165buf_chip *scc = arg; local
[all...]
/netbsd-current/external/cddl/osnet/dist/lib/libgen/common/
H A Dgmatch.c70 wchar_t scc, c; local
78 scc = n;
80 scc = cl;
87 return (scc == 0);
93 if (scc <= 0)
116 if (scc < lc || scc > c)
124 if (lc <= scc &&
125 scc <= c)
134 if (scc !
[all...]
/netbsd-current/sys/arch/hpcarm/dev/
H A Dj720kbd.c135 struct j720kbd_chip *scc = &j720kbd_chip; local
138 j720kbd_ifsetup(scc);
141 hpckbd_cnattach(&scc->scc_if);
145 j720kbd_ifsetup(struct j720kbd_chip *scc) argument
148 scc->scc_if.hii_ctx = scc;
149 scc->scc_if.hii_establish = j720kbd_input_establish;
150 scc->scc_if.hii_poll = j720kbd_poll;
156 struct j720kbd_chip *scc = ic; local
159 scc
180 struct j720kbd_chip *scc = arg; local
202 j720kbd_read(struct j720kbd_chip *scc, char *buf) argument
[all...]
/netbsd-current/external/mit/isl/dist/
H A Disl_scheduler_clustering.h9 * "scc" is an array of "n" elements, each representing an SCC
29 struct isl_sched_graph *scc; member in struct:isl_clustering
H A Disl_scheduler_clustering.c24 * into c->scc, initialize scc_cluster and construct
34 c->n = graph->scc;
35 c->scc = isl_calloc_array(ctx, struct isl_sched_graph, c->n);
40 if (!c->scc || !c->cluster ||
48 i, &c->scc[i]) < 0)
50 c->scc[i].scc = 1;
51 if (isl_sched_graph_compute_maxvar(&c->scc[i]) < 0)
53 if (isl_schedule_node_compute_wcc_band(ctx, &c->scc[i]) < 0)
67 if (c->scc)
245 int scc = graph->node[g->order[i]].scc; local
272 cluster_space(struct isl_sched_graph *scc, int i) argument
546 struct isl_sched_graph *scc; local
586 struct isl_sched_graph *scc; local
[all...]
H A Disl_scheduler.h48 * scc is the index of SCC (or WCC) this node belongs to
85 int scc; member in struct:isl_sched_node
95 int isl_sched_node_scc_exactly(struct isl_sched_node *node, int scc);
161 int isl_sched_edge_scc_exactly(struct isl_sched_edge *edge, int scc);
215 * scc represents the number of components
252 int scc; member in struct:isl_sched_graph
274 struct isl_sched_graph *graph, int scc);
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/cr16/
H A Dscc_test.s10 scc r4
H A Dscc_test.d13 6: 34 08 scc r4
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/cris/
H A Dscc.s6 scc r1
7 shs r0 ; same as scc
H A Dscc.d8 [ ]+0:[ ]+3105[ ]+scc[ ]+\$?r1
9 [ ]+2:[ ]+3005[ ]+scc[ ]+\$?r0
/netbsd-current/sys/arch/amiga/dev/
H A Dmfc.c370 struct mfc_softc *scc; local
380 scc = device_private(self);
381 scc->sc_dev = self;
383 scc->sc_regs = rp = zap->va;
385 scc->mfc_iii = 3;
386 scc->clk_frq = scc->mfc_iii ? 230400 : 115200;
412 scc->sc_isr.isr_intr = mfcintr;
413 scc->sc_isr.isr_arg = scc;
451 struct mfc_softc *scc; local
592 struct mfc_softc *scc= sc->sc_mfc; local
744 struct mfc_softc *scc= sc->sc_mfc; local
825 struct mfc_softc *scc= sc->sc_mfc; local
957 struct mfc_softc *scc = arg; local
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/crx/
H A Djscond_insn.s79 .global scc
80 scc: label
81 scc r4 label
H A Djscond_insn.d63 00000024 <scc>:
64 24: 34 bb scc r4
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dddg.c782 /* Algorithm for computing the recurrence_length of an scc. We assume at
786 set_recurrence_length (ddg_scc_ptr scc)
791 for (j = 0; j < scc->num_backarcs; j++)
793 ddg_edge_ptr backarc = scc->backarcs[j];
805 scc->recurrence_length = result;
809 and mark edges that belong to this scc. */
813 ddg_scc_ptr scc;
817 scc = (ddg_scc_ptr) xmalloc (sizeof (struct ddg_scc));
818 scc->backarcs = NULL;
819 scc
784 set_recurrence_length(ddg_scc_ptr scc) argument
811 ddg_scc_ptr scc; local
844 free_scc(ddg_scc_ptr scc) argument
869 add_backarc_to_scc(ddg_scc_ptr scc, ddg_edge_ptr e) argument
879 add_scc_to_ddg(ddg_all_sccs_ptr g, ddg_scc_ptr scc) argument
981 int i, j, k, scc, way; local
995 ddg_scc_ptr scc; local
[all...]
H A Dcfganal.c1076 int scc;
1095 while (bb_data[cur1].scc != -1)
1097 int ih = bb_data[cur1].scc;
1102 bb_data[cur1].scc = cur2;
1109 bb_data[cur1].scc = cur2;
1173 bb_data[dest->index].scc = -1;
1194 int header = bb_data[ei_edge (ei)->dest->index].scc;
1209 else if (bb_data[ei_edge (ei)->dest->index].scc == -1)
1213 int header = bb_data[ei_edge (ei)->dest->index].scc;
1220 while (bb_data[header].scc !
1072 int scc; member in struct:rpoamdbs_bb_data
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dddg.cc782 /* Algorithm for computing the recurrence_length of an scc. We assume at
786 set_recurrence_length (ddg_scc_ptr scc)
791 for (j = 0; j < scc->num_backarcs; j++)
793 ddg_edge_ptr backarc = scc->backarcs[j];
805 scc->recurrence_length = result;
809 and mark edges that belong to this scc. */
813 ddg_scc_ptr scc;
817 scc = (ddg_scc_ptr) xmalloc (sizeof (struct ddg_scc));
818 scc->backarcs = NULL;
819 scc
784 set_recurrence_length(ddg_scc_ptr scc) argument
811 ddg_scc_ptr scc; local
844 free_scc(ddg_scc_ptr scc) argument
869 add_backarc_to_scc(ddg_scc_ptr scc, ddg_edge_ptr e) argument
879 add_scc_to_ddg(ddg_all_sccs_ptr g, ddg_scc_ptr scc) argument
981 int i, j, k, scc, way; local
995 ddg_scc_ptr scc; local
[all...]
H A Dcfganal.cc1103 int scc;
1122 while (bb_data[cur1].scc != -1)
1124 int ih = bb_data[cur1].scc;
1129 bb_data[cur1].scc = cur2;
1136 bb_data[cur1].scc = cur2;
1200 bb_data[dest->index].scc = -1;
1221 int header = bb_data[ei_edge (ei)->dest->index].scc;
1236 else if (bb_data[ei_edge (ei)->dest->index].scc == -1)
1240 int header = bb_data[ei_edge (ei)->dest->index].scc;
1247 while (bb_data[header].scc !
1099 int scc; member in struct:rpoamdbs_bb_data
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/rx/
H A Dsccnd.d10 0: fc db 02 scc\.l r0
11 3: fc db f2 scc\.l r15
12 6: fc db 02 scc\.l r0
13 9: fc db f2 scc\.l r15
46 6c: fc d0 02 scc\.b \[r0\]
47 6f: fc d0 f2 scc\.b \[r15\]
48 72: fc d1 02 fc scc\.b 252\[r0\]
49 76: fc d1 f2 fc scc\.b 252\[r15\]
50 7a: fc d2 02 fc ff scc\.b 65532\[r0\]
51 7f: fc d2 f2 fc ff scc\
[all...]
/netbsd-current/usr.bin/rdist/
H A Dexpand.c440 int scc; local
448 scc = *s++ & TRIM;
464 if (lc <= scc && scc <= *p++)
467 if (scc == (lc = cc))
489 return (scc == '\0');
492 if ((c & TRIM) != scc)
497 if (scc == '\0')
502 if (scc)
/netbsd-current/etc/etc.pmax/
H A DMAKEDEV.conf21 # Serial devices: dc*, scc*.
42 name=scc; unit=${i#zs}; chr=17
/netbsd-current/usr.bin/script/
H A Dscript.c104 ssize_t scc; local
209 while (!die && (scc = read(STDIN_FILENO, ibuf, BUFSIZ)) > 0) {
210 cc = (size_t)scc;
265 ssize_t scc; local
283 scc = read(master, obuf, sizeof(obuf));
284 if (scc <= 0)
286 cc = (size_t)scc;
/netbsd-current/usr.bin/at/
H A Dparsetime.c150 static char scc; /* scanner - count of remaining arguments */ variable
205 scc = argc;
235 if (scc < 1)
239 scc--;
596 if (scc < 1)
/netbsd-current/external/gpl3/gcc.old/dist/gcc/lto/
H A Dlto-common.c1035 tree_scc_hasher::hash (const tree_scc *scc) argument
1037 return scc->hash;
1590 /* Compare the tree scc SCC to the prevailing candidate PSCC, filling
1594 compare_tree_sccs (tree_scc *pscc, tree_scc *scc, argument
1605 if (compare_tree_sccs_1 (pscc->entries[0], scc->entries[i], &mapp))
1608 on the scc as all trees will be freed. */
1611 /* Reset TREE_ASM_WRITTEN on scc for the next compare or in case
1613 for (unsigned j = 0; j < scc->len; ++j)
1614 TREE_ASM_WRITTEN (scc->entries[j]) = 0;
1633 /* New scc o
1665 tree_scc *scc local
3007 tree_scc *scc, *max_scc = NULL; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/lto/
H A Dlto-common.cc1040 tree_scc_hasher::hash (const tree_scc *scc) argument
1042 return scc->hash;
1599 /* Compare the tree scc SCC to the prevailing candidate PSCC, filling
1603 compare_tree_sccs (tree_scc *pscc, tree_scc *scc, argument
1614 if (compare_tree_sccs_1 (pscc->entries[0], scc->entries[i], &mapp))
1617 on the scc as all trees will be freed. */
1620 /* Reset TREE_ASM_WRITTEN on scc for the next compare or in case
1622 for (unsigned j = 0; j < scc->len; ++j)
1623 TREE_ASM_WRITTEN (scc->entries[j]) = 0;
1642 /* New scc o
1674 tree_scc *scc local
3016 tree_scc *scc, *max_scc = NULL; local
[all...]

Completed in 271 milliseconds

123