Searched refs:cycle (Results 1 - 25 of 186) sorted by relevance

12345678

/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/riscv/
H A Dpriv-reg-fail-read-only-02.l2 .*Warning: Read-only CSR is written `csrrw a0,cycle,a1'
3 .*Warning: Read-only CSR is written `csrrw a0,cycle,zero'
4 .*Warning: Read-only CSR is written `csrrw zero,cycle,a1'
5 .*Warning: Read-only CSR is written `csrrw zero,cycle,zero'
6 .*Warning: Read-only CSR is written `csrw cycle,a1'
7 .*Warning: Read-only CSR is written `csrw cycle,zero'
8 .*Warning: Read-only CSR is written `csrrwi a0,cycle,0xb'
9 .*Warning: Read-only CSR is written `csrrwi a0,cycle,0x0'
10 .*Warning: Read-only CSR is written `csrrwi zero,cycle,0xb'
11 .*Warning: Read-only CSR is written `csrrwi zero,cycle,
[all...]
/netbsd-current/usr.bin/make/unit-tests/
H A Ddotwait.exp25 cycle.1.99
26 cycle.1.99
27 make: Graph cycles through `cycle.2.99'
28 make: Graph cycles through `cycle.2.98'
29 make: Graph cycles through `cycle.2.97'
H A Ddotwait.mk5 TESTS= simple recursive shared cycle
56 # cycle: the cyclic dependency must not cause infinite recursion
58 cycle: cycle.1.99 .WAIT cycle.2.99
59 cycle.2.99: cycle.2.98 _ECHOUSE
60 cycle.2.98: cycle.2.97 _ECHOUSE
61 cycle
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp37 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
118 int cycle = Stalls; local
131 // We must find one of the stage's units free for every cycle the
135 int StageCycle = cycle + (int)i;
159 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
165 // Advance the cycle to the next stage.
166 cycle += IS->getNextCycles();
185 unsigned cycle = 0; local
190 // We must reserve one of the stage's units for every cycle the
194 assert(((cycle
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/arc/
H A Dlpcount-err.s1 ;; LP_COUNT register cannot be used with multi-cycle instructions such as:
/netbsd-current/external/gpl3/gdb.old/dist/ld/testsuite/ld-ctf/
H A Dconflicting-cycle-1.parent.d2 #source: cycle-1.c
9 #name: Conflicting cycle 1.parent
H A Dconflicting-cycle-1.B-1.d2 #source: cycle-1.c
9 #name: Conflicting cycle 1.B-1
H A Dconflicting-cycle-1.B-2.d2 #source: cycle-1.c
9 #name: Conflicting cycle 1.B-2
H A Dconflicting-cycle-2.A-1.d2 #source: cycle-1.c
11 #name: Conflicting cycle 2.A-1
H A Dcross-tu-into-cycle.d1 # Check that a type outside a cycle pointing into a cycle
2 # in another TU does not cause the whole cycle to show up
12 #name: cross-TU-into-cycle
H A Dconflicting-cycle-2.A-2.d2 #source: cycle-1.c
11 #name: Conflicting cycle 2.A-2
H A Dconflicting-cycle-2.parent.d2 #source: cycle-1.c
11 #name: Conflicting cycle 2.parent
H A Dconflicting-cycle-3.C-1.d10 #name: Conflicting cycle 3.C-1
H A Dconflicting-cycle-3.parent.d10 #name: Conflicting cycle 3
H A Dcycle-1.d2 #source: cycle-1.c
/netbsd-current/external/gpl3/binutils/dist/include/opcode/
H A Dtic6x-opcode-table.h132 INSN(abs, l, unary, 1cycle, C62X, 0,
137 INSN(abs, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
142 INSN(abs2, l, unary, 1cycle, C64X, 0,
154 INSN(abssp, s, unary, 1cycle, C67X, 0,
160 INSNE(add, l_si_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
165 INSNE(add, l_si_xsi_sl, l, 1_or_2_src, 1cycle, C62X, 0,
170 INSNE(add, l_xsi_sl_sl, l, 1_or_2_src, 1cycle, C62X, 0,
175 INSNE(add, l_s5_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
180 INSNE(add, l_s5_sl_sl, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
185 INSNE(add, s_si_xsi_si, s, 1_or_2_src, 1cycle, C62
[all...]
/netbsd-current/external/gpl3/binutils.old/dist/include/opcode/
H A Dtic6x-opcode-table.h132 INSN(abs, l, unary, 1cycle, C62X, 0,
137 INSN(abs, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
142 INSN(abs2, l, unary, 1cycle, C64X, 0,
154 INSN(abssp, s, unary, 1cycle, C67X, 0,
160 INSNE(add, l_si_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
165 INSNE(add, l_si_xsi_sl, l, 1_or_2_src, 1cycle, C62X, 0,
170 INSNE(add, l_xsi_sl_sl, l, 1_or_2_src, 1cycle, C62X, 0,
175 INSNE(add, l_s5_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
180 INSNE(add, l_s5_sl_sl, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
185 INSNE(add, s_si_xsi_si, s, 1_or_2_src, 1cycle, C62
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/include/opcode/
H A Dtic6x-opcode-table.h132 INSN(abs, l, unary, 1cycle, C62X, 0,
137 INSN(abs, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
142 INSN(abs2, l, unary, 1cycle, C64X, 0,
154 INSN(abssp, s, unary, 1cycle, C67X, 0,
160 INSNE(add, l_si_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
165 INSNE(add, l_si_xsi_sl, l, 1_or_2_src, 1cycle, C62X, 0,
170 INSNE(add, l_xsi_sl_sl, l, 1_or_2_src, 1cycle, C62X, 0,
175 INSNE(add, l_s5_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
180 INSNE(add, l_s5_sl_sl, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
185 INSNE(add, s_si_xsi_si, s, 1_or_2_src, 1cycle, C62
[all...]
/netbsd-current/external/gpl3/gdb/dist/include/opcode/
H A Dtic6x-opcode-table.h132 INSN(abs, l, unary, 1cycle, C62X, 0,
137 INSN(abs, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
142 INSN(abs2, l, unary, 1cycle, C64X, 0,
154 INSN(abssp, s, unary, 1cycle, C67X, 0,
160 INSNE(add, l_si_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
165 INSNE(add, l_si_xsi_sl, l, 1_or_2_src, 1cycle, C62X, 0,
170 INSNE(add, l_xsi_sl_sl, l, 1_or_2_src, 1cycle, C62X, 0,
175 INSNE(add, l_s5_xsi_si, l, 1_or_2_src, 1cycle, C62X, 0,
180 INSNE(add, l_s5_sl_sl, l, 1_or_2_src, 1cycle, C62X, TIC6X_FLAG_NO_CROSS,
185 INSNE(add, s_si_xsi_si, s, 1_or_2_src, 1cycle, C62
[all...]
/netbsd-current/external/lgpl3/gmp/dist/mpn/riscv/64/
H A Daors_n.asm70 ADDSUB t4, t0, t6 C cycle 3, 9, ...
71 CMPCY( t3, t4, t0) C cycle 4, 10, ...
73 add t6, t2, t3 C cycle 5, 11, ...
80 ADDSUB t4, t1, t6 C cycle 0, 6, ...
81 CMPCY( t3, t4, t1) C cycle 1, 7, ...
83 add t6, t2, t3 C cycle 2, 8, ...
H A Daorsmul_1.asm64 ADDSUB a6, a5, a6 C cycle 0, 3, ...
67 CMPCY( a5, a6, a5) C cycle 1, 4, ...
69 add a6, a4, a5 C cycle 2, 5, ...
H A Dmul_1.asm49 add a6, a5, a6 C cycle 0, 3, ...
50 sltu a5, a6, a5 C cycle 1, 4, ...
52 add a6, a7, a5 C cycle 2, 5, ...
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dmcf.c36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
37 the flow on the found cycle by the minimum residual capacity in that
38 cycle.
87 /* Residual flow for this edge - used during negative cycle canceling. */
768 /* Finds a negative cycle in the residual network using
769 the Bellman-Ford algorithm. The flow on the found cycle is reversed by the
770 minimum residual capacity of that cycle. ENTRY and EXIT vertices are not
778 CYCLE - Vector to hold the minimum cost cycle
781 true if a negative cycle was found, false otherwise. */
785 int *pi, gcov_type *d, int *cycle)
784 cancel_negative_cycle(fixup_graph_type *fixup_graph, int *pi, gcov_type *d, int *cycle) argument
1307 int *cycle; local
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dmcf.cc36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
37 the flow on the found cycle by the minimum residual capacity in that
38 cycle.
87 /* Residual flow for this edge - used during negative cycle canceling. */
768 /* Finds a negative cycle in the residual network using
769 the Bellman-Ford algorithm. The flow on the found cycle is reversed by the
770 minimum residual capacity of that cycle. ENTRY and EXIT vertices are not
778 CYCLE - Vector to hold the minimum cost cycle
781 true if a negative cycle was found, false otherwise. */
785 int *pi, gcov_type *d, int *cycle)
784 cancel_negative_cycle(fixup_graph_type *fixup_graph, int *pi, gcov_type *d, int *cycle) argument
1307 int *cycle; local
[all...]
/netbsd-current/lib/libmenu/
H A Dinternals.c91 int neighbour, cycle, row_major, edge; local
95 cycle = ((menu->opts & O_NONCYCLIC) != O_NONCYCLIC);
99 if (cycle) {
111 if (cycle)
143 if ((!cycle) && (edge == 1))
150 if (cycle)
184 if ((!cycle) && (edge == 1))
190 if (cycle) {
201 if (cycle)
230 if ((!cycle)
[all...]

Completed in 266 milliseconds

12345678