| /src/sys/arch/hpcmips/dev/ |
| m38813c.c | 129 m38813c_ifsetup(struct m38813c_chip *scc)
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 = ic local
179 struct m38813c_chip *scc = arg; local
[all...] |
| tc5165buf.c | 154 tc5165buf_ifsetup(struct tc5165buf_chip *scc)
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 = ic 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...] |
| /src/external/cddl/osnet/dist/lib/libgen/common/ |
| gmatch.c | 70 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 != lc
[all...] |
| /src/sys/arch/hpcarm/dev/ |
| j720kbd.c | 135 struct j720kbd_chip *scc = &j720kbd_chip; local
138 j720kbd_ifsetup(scc);
141 hpckbd_cnattach(&scc->scc_if);
145 j720kbd_ifsetup(struct j720kbd_chip *scc)
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->scc_hpckbd = kbdif
180 struct j720kbd_chip *scc = arg; local
[all...] |
| /src/external/mit/isl/dist/ |
| isl_scheduler_clustering.h | 9 * "scc" is an array of "n" elements, each representing an SCC
12 * "scc_cluster" maps each SCC index to the cluster to which it belongs,
13 * where each cluster is represented by the index of the first SCC
14 * in the cluster. Initially, each SCC belongs to a cluster containing
15 * only that SCC.
24 * For each SCC, it keeps track of the number of nodes in the SCC
29 struct isl_sched_graph *scc; member in struct:isl_clustering
|
| isl_scheduler_clustering.c | 24 * into c->scc, initialize scc_cluster and construct
25 * a band of schedule rows for each SCC.
26 * Within each SCC, there is only one SCC by definition.
27 * Each SCC initially belongs to a cluster containing only that SCC.
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
245 int scc = graph->node[g->order[i]].scc; local
546 struct isl_sched_graph *scc; local
586 struct isl_sched_graph *scc; local
[all...] |
| isl_scheduler.h | 48 * 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);
192 * SCC to which a node belongs
215 * scc represents the number of components
252 int scc; member in struct:isl_sched_graph
274 struct isl_sched_graph *graph, int scc);
|
| isl_test_cpp.cc | 141 }, [&sorted] (isl::id_list scc) {
142 assert(scc.size() == 1);
143 sorted = sorted.concat(scc);
350 * - Foreach SCC function
|
| isl_scheduler.c | 64 int isl_sched_node_scc_exactly(struct isl_sched_node *node, int scc)
66 return node->scc == scc;
69 static int node_scc_at_most(struct isl_sched_node *node, int scc)
71 return node->scc <= scc;
74 static int node_scc_at_least(struct isl_sched_node *node, int scc)
76 return node->scc >= scc;
1460 graph->scc = 0
[all...] |
| isl_test_python.py | 236 def add_single(scc):
237 assert(scc.size() == 1)
238 sorted[0] = sorted[0].concat(scc)
487 # - Foreach SCC function
|
| /src/sys/arch/amiga/dev/ |
| mfc.c | 370 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...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-ssa-sccopy.cc | 82 To identify SCCs we implement the Robert Tarjan's SCC algorithm. For the
83 SCC computation we wrap potential copy statements in the 'vertex' struct.
101 /* State of vertex during SCC discovery.
118 /* Information about a vertex. Used by SCC discovery. */
130 /* SCC discovery.
132 Used to find SCCs in a dataflow graph. Implements Tarjan's SCC
294 /* If we've just closed a root vertex of an scc, pop scc from stack. */
297 vec<gimple *> scc = vNULL; local
303 scc.safe_push (SSA_NAME_DEF_STMT (ssa_name (j)))
551 vec<gimple *> scc = worklist.pop (); local
[all...] |
| ddg.cc | 730 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs);
733 fprintf (file, "SCC number: %d\n", i);
782 /* 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;
808 /* Create a new SCC given the set of its nodes. Compute its recurrence_length
809 and mark edges that belong to this scc. */
813 ddg_scc_ptr scc;
811 ddg_scc_ptr scc; local
981 int i, j, k, scc, way; local
995 ddg_scc_ptr scc; local
[all...] |
| cfganal.cc | 1104 /* The basic-block index of the SCC entry of the block visited first
1105 (the SCC leader). */
1106 int scc;
1107 /* The index into the RPO array where the blocks SCC entries end
1108 (only valid for the SCC leader). */
1110 /* The indexes of the exits destinations of this SCC (only valid
1111 for the SCC leader). Initialized upon discovery of SCC leaders. */
1125 while (bb_data[cur1].scc != -1)
1127 int ih = bb_data[cur1].scc;
1102 int scc; member in struct:rpoamdbs_bb_data
[all...] |
| modulo-sched.cc | 2518 /* First SCC has the largest recurrence_length. */
2549 /* Perform the node ordering starting from the SCC with the highest recMII. local
2550 For each SCC order the nodes according to their ASAP/ALAP/HEIGHT etc. */
2553 ddg_scc_ptr scc = all_sccs->sccs[i];
2555 /* Add nodes on paths from previous SCCs to the current SCC. */
2556 find_nodes_on_paths (on_path, g, prev_sccs, scc->nodes);
2557 bitmap_ior (tmp, scc->nodes, on_path);
2559 /* Add nodes on paths from the current SCC to previous SCCs. */
2560 find_nodes_on_paths (on_path, g, scc->nodes, prev_sccs);
2563 /* Remove nodes of previous SCCs from current extended SCC. *
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ddg.cc | 730 fprintf (file, "\n;; Number of SCC nodes - %d\n", sccs->num_sccs);
733 fprintf (file, "SCC number: %d\n", i);
782 /* 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;
808 /* Create a new SCC given the set of its nodes. Compute its recurrence_length
809 and mark edges that belong to this scc. */
813 ddg_scc_ptr scc;
811 ddg_scc_ptr scc; local
981 int i, j, k, scc, way; local
995 ddg_scc_ptr scc; local
[all...] |
| cfganal.cc | 1101 /* The basic-block index of the SCC entry of the block visited first
1102 (the SCC leader). */
1103 int scc;
1104 /* The index into the RPO array where the blocks SCC entries end
1105 (only valid for the SCC leader). */
1107 /* The indexes of the exits destinations of this SCC (only valid
1108 for the SCC leader). Initialized upon discovery of SCC leaders. */
1122 while (bb_data[cur1].scc != -1)
1124 int ih = bb_data[cur1].scc;
1099 int scc; member in struct:rpoamdbs_bb_data
[all...] |
| /src/usr.bin/rdist/ |
| expand.c | 440 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)
|
| /src/etc/etc.pmax/ |
| MAKEDEV.conf | 21 # Serial devices: dc*, scc*.
42 name=scc; unit=${i#zs}; chr=17
|
| /src/usr.bin/script/ |
| script.c | 104 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;
|
| /src/usr.bin/at/ |
| parsetime.c | 150 static char scc; /* scanner - count of remaining arguments */ variable
205 scc = argc;
235 if (scc < 1)
239 scc--;
596 if (scc < 1)
|
| /src/external/gpl3/gcc.old/dist/gcc/lto/ |
| lto-common.cc | 1017 /* Hash of the whole SCC. */
1019 /* Number of trees in the SCC. */
1021 /* Number of possible entries into the SCC (tree nodes [0..entry_len-1]
1024 /* The members of the SCC.
1040 tree_scc_hasher::hash (const tree_scc *scc)
1042 return scc->hash;
1071 recursing through in-SCC tree edges. Returns true if the SCCs entered
1073 SCC entries we visited, starting with (*MAP)[0] = T1 and (*MAP)[1] = T2. */
1099 some SCC as local or we compare too much. */
1372 to spot the SCC members with the difference. *
1674 tree_scc *scc local
3016 tree_scc *scc, *max_scc = NULL; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/lto/ |
| lto-common.cc | 1017 /* Hash of the whole SCC. */
1019 /* Number of trees in the SCC. */
1021 /* Number of possible entries into the SCC (tree nodes [0..entry_len-1]
1024 /* The members of the SCC.
1040 tree_scc_hasher::hash (const tree_scc *scc)
1042 return scc->hash;
1071 recursing through in-SCC tree edges. Returns true if the SCCs entered
1073 SCC entries we visited, starting with (*MAP)[0] = T1 and (*MAP)[1] = T2. */
1099 some SCC as local or we compare too much. */
1377 to spot the SCC members with the difference. *
1679 tree_scc *scc local
3038 tree_scc *scc, *max_scc = NULL; local
[all...] |
| /src/usr.bin/telnet/ |
| telnet.c | 1606 int scc;
1611 scc = 0;
1614 if (scc == 0) {
1621 scc = ring_full_consecutive(&netiring);
1622 if (scc == 0) {
1628 c = *sbp++ & 0xff, scc--; count++;
1660 if (scc > 0) {
1667 sbp++, scc--; count++;
1672 sbp++, scc--; count++;
1602 int scc; local
|
| /src/sys/arch/mac68k/include/ |
| iopreg.h | 70 } scc; member in union:__anon1588::__anon1589
|
