Home
last modified time | relevance | path

Searched refs:cycle (Results 1 – 25 of 334) sorted by relevance

12345678910>>...14

/openbsd-src/gnu/llvm/llvm/docs/
H A DCycleTerminology.rst18 1. In a directed graph G that is a function CFG or a subgraph of it, a *cycle*
21 ensures that a single basic block is a cycle only if there is an edge
23 2. A basic block in a cycle that can be reached from the entry of
25 in the cycle is called an *entry* of the cycle.
26 A cycle can have multiple entries.
28 first node of a cycle to be visited is called the *header* of this cycle
33 5. The *child cycles* (or simply cycles) nested inside a cycle C with
37 Thus, cycles form an implementation-defined forest where each cycle C is
40 a reducible cycle (an LLVM loop) L dominates all its other nodes, and
41 is always chosen as the header of some cycle C regardless of the DFS
[all …]
H A DConvergenceAndUniformity.rst67 Described in :ref:`cycle-terminology`.
70 Described in :ref:`cycle-closed-path`.
219 The maximal converged-with relation is defined in terms of cycle
220 headers, which are not unique to a given CFG. Each cycle hierarchy for
227 converged-with relation if and only if for every cycle ``C`` with
240 relation for the given cycle hierarchy".
267 .. _convergence-cycle-headers:
273 nodes that are inside some cycle. The dynamic instances of such nodes
279 Such a path must pass through the header of at least one cycle --- the
280 smallest cycle that includes the entire closed path. In a given
[all …]
/openbsd-src/regress/usr.bin/tsort/
H A Dnormalize-cycles6 @cycle = ();
10 return if @cycle == 0;
12 for ($i = 0; $i < @cycle; $i++) {
13 if ($cycle[$i] lt $min) {
15 $min = $cycle[$i];
19 for ($i = $minindex; $i <@cycle; $i++) {
20 push(@ordered, $cycle[$i]);
23 push(@ordered, $cycle[$i]);
32 @cycle = ();
34 m/^tsort:\s+/ and push(@cycle, $');
/openbsd-src/gnu/llvm/lldb/scripts/
H A Danalyze-project-deps.py121 cycle = cur_path[new_index:]
122 if not is_existing_cycle(cycle, cycles):
123 cycles.append(cycle)
152 for cycle in cycles:
153 cycle.append(cycle[0])
154 zipper = list(zip(cycle[0:-1], cycle[1:]))
174 for (total, smallest, cycle) in counted:
176 sys.stdout.write(cycle[0][0])
177 for (first, count, last) in cycle:
181 for cycle in cycles:
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp117 int cycle = Stalls; in getHazardType() local
134 int StageCycle = cycle + (int)i; in getHazardType()
165 cycle += IS->getNextCycles(); in getHazardType()
184 unsigned cycle = 0; in EmitInstruction() local
193 assert(((cycle + i) < RequiredScoreboard.getDepth()) && in EmitInstruction()
200 freeUnits &= ~ReservedScoreboard[cycle + i]; in EmitInstruction()
204 freeUnits &= ~RequiredScoreboard[cycle + i]; in EmitInstruction()
216 RequiredScoreboard[cycle + i] |= freeUnit; in EmitInstruction()
218 ReservedScoreboard[cycle + i] |= freeUnit; in EmitInstruction()
222 cycle += IS->getNextCycles(); in EmitInstruction()
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/lldb/source/Core/
H A DBUILD.gn23 #"//lldb/source/Breakpoint", # Dependency cycle.
24 #"//lldb/source/DataFormatters", # Dependency cycle.
25 #"//lldb/source/Expression", # Dependency cycle.
28 #"//lldb/source/Interpreter", # Dependency cycle.
29 #"//lldb/source/Symbol", # Dependency cycle.
30 #"//lldb/source/Target", # Dependency cycle.
36 #"//lldb/source/Plugins/Language/CPlusPlus", # 3-hop dependency cycle.
37 #"//lldb/source/Plugins/Language/ObjC", # Many-hop dependency cycle.
/openbsd-src/usr.bin/make/
H A Dmake.c597 bool cycle = false; in targets_contain_cycles() local
604 cycle = true; in targets_contain_cycles()
612 return cycle; in targets_contain_cycles()
651 struct growableArray cycle; in break_and_print_cycles() local
653 Array_Init(&cycle, 16); /* cycles are generally shorter */ in break_and_print_cycles()
657 Array_Reset(&cycle); in break_and_print_cycles()
658 c = find_cycle(t, &cycle); in break_and_print_cycles()
660 print_unlink_cycle(&cycle, c); in break_and_print_cycles()
664 free(cycle.a); in break_and_print_cycles()
669 find_cycle(Lst l, struct growableArray *cycle) in find_cycle() argument
[all …]
/openbsd-src/gnu/usr.bin/binutils-2.17/gprof/
H A Dfsf_callg_bl.m32 cycle, the cycle number is printed between the
51 member of a cycle, the cycle number is printed between
73 member of a cycle, the cycle number is printed
77 entry for the cycle-as-a-whole. This entry shows who called the
78 cycle (as parents) and the members of the cycle (as children.)
80 were internal to the cycle, and the calls entry for each member shows,
82 the cycle.
H A Dbsd_callg_bl.m31 its membership in a cycle, if any.
58 parent's membership in a cycle, if any.
84 membership in a cycle, if any.
92 children) in the same cycle as the function. If
93 the function (or child) is a member of a cycle,
96 cycle as a whole.
103 cycle listings:
104 the cycle as a whole is listed with the same
106 the members of the cycle, and their contributions
107 to the time and call counts of the cycle.
/openbsd-src/gnu/usr.bin/binutils/gprof/
H A Dfsf_callg_bl.m32 cycle, the cycle number is printed between the
51 member of a cycle, the cycle number is printed between
73 member of a cycle, the cycle number is printed
77 entry for the cycle-as-a-whole. This entry shows who called the
78 cycle (as parents) and the members of the cycle (as children.)
80 were internal to the cycle, and the calls entry for each member shows,
82 the cycle.
H A Dbsd_callg_bl.m31 its membership in a cycle, if any.
58 parent's membership in a cycle, if any.
84 membership in a cycle, if any.
92 children) in the same cycle as the function. If
93 the function (or child) is a member of a cycle,
96 cycle as a whole.
103 cycle listings:
104 the cycle as a whole is listed with the same
106 the members of the cycle, and their contributions
107 to the time and call counts of the cycle.
/openbsd-src/usr.bin/gprof/
H A Dgprof.callg19 a cycle, if any.
35 membership in a cycle, if any.
50 cycle, if any.
53 * these fields are omitted for parents (or children) in the same cycle as the
54 function. If the function (or child) is a member of a cycle, the propagated
56 time of the cycle as a whole.
60 cycle listings:
61 the cycle as a whole is listed with the same fields as a function
62 entry. Below it are listed the members of the cycle, and their
63 contributions to the time and call counts of the cycle
[all...]
H A Darcs.c352 int cycle; in cyclelink() local
380 cycle = 0; in cyclelink()
385 cycle += 1; in cyclelink()
386 cyclenlp = &cyclenl[cycle]; in cyclelink()
399 cyclenlp -> cycleno = cycle; /* internal number of cycle on */ in cyclelink()
408 printf( " is the head of cycle %d\n" , cycle ); in cyclelink()
415 memberp -> cycleno = cycle; in cyclelink()
427 if ( arcp -> arc_parentp -> cycleno == cycle ) { in cyclelink()
757 int cycle; in cycletime() local
761 for ( cycle = 1 ; cycle <= ncycle ; cycle += 1 ) { in cycletime()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/lldb/source/Commands/
H A DBUILD.gn18 #"//lldb/source/Breakpoint", # FIXME: many-hop dependency cycle.
22 #"//lldb/source/Expression", # FIXME: 2-hop dependency cycle.
25 #"//lldb/source/Interpreter", # FIXME: Dependency cycle.
26 #"//lldb/source/Symbol", # FIXME: many-hop dependency cycle.
27 #"//lldb/source/Target", # FIXME: 2-hop dependency cycle.
/openbsd-src/gnu/gcc/gcc/config/mips/
H A Dsb1.md8 ;; each cycle.
22 ;; insn can issue per cycle (fp1).
46 ;; DMULT block any multiply from issuing in the next cycle.
69 ;; For long cycle operations, the FPU has a 4 cycle pipeline that repeats,
71 ;; can have at most 4 long-cycle operations per pipe.
97 ;; predicted taken branch causes 2 cycle ifetch bubble. predicted not
98 ;; taken branch causes 0 cycle ifetch bubble. mispredicted branch causes 8
99 ;; cycle ifetch bubble. We assume all branches predicted not taken.
109 ;; ??? This is 1 cycle for ldl/ldr to ldl/ldr when they use the same data
117 ;; insns can be issued in the same cycle. However, a value of 1 gives
[all …]
H A D4k.md79 ;; 4Kc/4Km MUL has 2 cycle latency, but has the special property that it will
80 ;; stall the integer unit pipeline. MUL 16x16 or 32x16 forces 1 cycle stall,
81 ;; while MUL 32x32 forces 2 cycle stall. If next insn use the result, an
115 ;; Move to HI/LO -> MADD/MSUB,MFHI/MFLO has a 1 cycle latency.
121 ;; Move from HI/LO -> integer operation has a 2 cycle latency.
/openbsd-src/lib/libmenu/
H A Dm_global.c389 bool cycle = (menu->opt & O_NONCYCLIC) ? FALSE : TRUE; in _nc_Link_Items() local
407 (cycle ? menu->items[(Last_in_Row >= Number_Of_Items) ? in _nc_Link_Items()
416 (cycle ? menu->items[row * Number_Of_Columns] : in _nc_Link_Items()
423 (cycle ? menu->items[(Last_in_Column >= Number_Of_Items) ? in _nc_Link_Items()
431 (cycle ? menu->items[(row + 1) < menu->rows ? in _nc_Link_Items()
456 (cycle ? (Last_in_Column >= Number_Of_Items) ? in _nc_Link_Items()
464 (cycle ? menu->items[row] : (ITEM *)0); in _nc_Link_Items()
470 (cycle ? in _nc_Link_Items()
481 (cycle ? in _nc_Link_Items()
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/lldb/source/DataFormatters/
H A DBUILD.gn7 #"//lldb/source/Interpreter", # FIXME: Dependency cycle.
8 …#"//lldb/source/Symbol", # FIXME: 3-hop Dependency cycle (DataFormatters->Symbol->Expression->Inte…
9 …#"//lldb/source/Target", # FIXME: 3-hop Dependency cycle (DataFormatters->Target->Expression->Int…
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/lldb/source/Expression/
H A DBUILD.gn10 #"//lldb/source/Symbol", # FIXME: Dependency cycle.
11 #"//lldb/source/Target", # FIXME: Dependency cycle.
17 #"//lldb/source/Plugins/Language/CPlusPlus", # 4-hop dependency cycle.
/openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCScheduleP7.td46 // Each LSU pipeline can complete a load or store in one cycle.
51 // FX loads have a two cycle load-to-use latency (so one "bubble" cycle).
52 // VSU loads have a three cycle load-to-use latency (so two "bubble" cycle).
54 // Frequent FX ops. take only one cycle and results can be used again in the
55 // next cycle (there is a self-bypass). Getting results from the other FX
56 // pipeline takes an additional cycle.
61 // (either to a float or XC op). prevents dispatch in that cycle to VS2 of any
69 // share the same write-back, and have a 5-cycle latency difference, so the
387 let IssueWidth = 6; // 4 (non-branch) instructions are dispatched per cycle.
390 // cycle (from all queues) is 8.
/openbsd-src/gnu/gcc/gcc/config/arm/
H A Darm1020e.md81 ;; the shift value in a second cycle. Pretend we take two cycles in
132 ;; cycle in which both words are available.
135 ;; three iterations through the execute cycle, and make their results
136 ;; available after the memory cycle.
160 ;; pipeline in all but the 5th cycle, and the LSU pipeline in cycles
165 ;; with LSL of zero. The remainder take 1 cycle to execute.
185 ;; base address is 64-bit aligned; if it is not, an additional cycle
187 ;; aligned. Because the processor can load two registers per cycle,
191 ;; The ALU pipeline is decoupled after the first cycle unless there is
282 ;; first execute state. We model this by using 1020a_e in the first cycle.
[all …]
/openbsd-src/gnu/usr.bin/binutils/gdb/
H A Dvalprint.c411 int cycle; in print_octal_chars() local
446 cycle = (len * BITS_IN_BYTES) % BITS_IN_OCTAL; in print_octal_chars()
456 switch (cycle) in print_octal_chars()
496 cycle++; in print_octal_chars()
497 cycle = cycle % BITS_IN_OCTAL; in print_octal_chars()
506 switch (cycle) in print_octal_chars()
543 cycle++; in print_octal_chars()
544 cycle = cycle % BITS_IN_OCTAL; in print_octal_chars()
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/lldb/source/Plugins/ObjectFile/JIT/
H A DBUILD.gn8 #"//lldb/source/Symbol", # 2-hop dependency cycle.
9 #"//lldb/source/Target", # 2-hop dependency cycle.
/openbsd-src/gnu/gcc/gcc/
H A Dgcov.c102 unsigned int cycle : 1; member
156 } cycle; /* Used in all-blocks mode, after blocks are linked onto member
1524 block->u.cycle.arc = NULL; in add_line_counts()
1525 block->u.cycle.ident = ~0U; in add_line_counts()
1605 block->u.cycle.ident = ix; in accumulate_line_counts()
1616 if (arc->src->u.cycle.ident != ix) in accumulate_line_counts()
1655 arc->cycle in accumulate_line_counts()
1657 || dst->u.cycle.ident != ix in accumulate_line_counts()
1659 || dst->u.cycle.arc) in accumulate_line_counts()
1673 for (dst = head; (probe_arc = dst->u.cycle.arc); in accumulate_line_counts()
[all …]
/openbsd-src/gnu/llvm/llvm/docs/AMDGPU/
H A Dgfx11_delay.rst57 FMA_ACCUM_CYCLE_1 Single cycle penalty for FMA accumulation.
58 SALU_CYCLE_1 1 cycle penalty for a prior SALU instruction.
59 SALU_CYCLE_2 2 cycle penalty for a prior SALU instruction.
60 SALU_CYCLE_3 3 cycle penalty for a prior SALU instruction.

12345678910>>...14