Home
last modified time | relevance | path

Searched full:interference (Results 1 – 25 of 134) sorted by relevance

123456

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveRegMatrix.h1 //===- LiveRegMatrix.h - Track register interference ----------*- C++ -*---===//
9 // The LiveRegMatrix analysis pass keeps track of virtual register interference
15 // unit of interference when dealing with overlapping physical registers. The
55 // Cached register mask interference info.
74 // Check for interference before assigning virtual registers to physical
78 /// Invalidate cached interference queries after modifying virtual register
79 /// live ranges. Interference checks may return stale information unless
84 /// No interference, go ahead and assign.
87 /// Virtual register interference. There are interfering virtual registers
88 /// assigned to PhysReg or its aliases. This interference could be resolved
[all …]
H A DPBQPRAConstraint.h36 /// constraints (e.g. Spill-costs, interference, coalescing).
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterferenceCache.h1 //===- InterferenceCache.h - Caching per-block interference ----*- C++ -*--===//
9 // InterferenceCache remembers per-block interference from LiveIntervalUnions,
10 // fixed RegUnit interference, and register masks.
33 /// BlockInterference - information about the interference in a single basic
43 /// Entry - A cache entry containing interference information for all aliases
62 /// LIS - Used for accessing register mask interference maps.
73 /// register interference.
79 /// Fixed interference in RegUnit.
82 /// Iterator pointing into the fixed RegUnit interference.
94 /// Blocks - Interference for each block in the function.
[all …]
H A DInterferenceCache.cpp1 //===- InterferenceCache.cpp - Caching per-block interference -------------===//
9 // InterferenceCache remembers per-block interference in LiveIntervalUnions.
30 // Static member used for null interference cursors.
85 llvm_unreachable("Ran out of interference cache entries."); in get()
162 // Check for first interference from virtregs. in update()
174 // Same thing for fixed interference. in update()
187 // Also check for register mask interference. in update()
194 // Register mask i clobbers PhysReg before the LIU interference. in update()
203 // No interference in this block? Go ahead and precompute the next block. in update()
213 // Check for last interference in block. in update()
[all …]
H A DLiveRegMatrix.cpp1 //===- LiveRegMatrix.cpp - Track register interference --------------------===//
159 // Regmask interference is more fine grained than regunits. in checkRegMaskInterference()
191 // Regmask interference is the fastest check. in checkInterference()
195 // Check for fixed interference. in checkInterference()
199 // Check the matrix for virtual register interference. in checkInterference()
200 bool Interference = foreachUnit(TRI, VirtReg, PhysReg, in checkInterference() local
204 if (Interference) in checkInterference()
218 // Check for interference with that segment in checkInterference()
H A DSplitKit.cpp598 // We may be trying to avoid interference that ends at a deleted instruction, in defFromParent()
1629 // points and color intervals in basic blocks while avoiding interference.
1646 assert((!LeaveBefore || LeaveBefore < Stop) && "Interference after block"); in splitLiveThroughBlock()
1648 assert((!EnterAfter || EnterAfter >= Start) && "Interference before block"); in splitLiveThroughBlock()
1655 // <<<<<<<<< Possible LeaveBefore interference. in splitLiveThroughBlock()
1661 assert((!LeaveBefore || Idx <= LeaveBefore) && "Interference"); in splitLiveThroughBlock()
1669 // >>>>>>> Possible EnterAfter interference. in splitLiveThroughBlock()
1675 assert((!EnterAfter || Idx >= EnterAfter) && "Interference"); in splitLiveThroughBlock()
1684 // ------------- Straight through, same intv, no interference. in splitLiveThroughBlock()
1697 LLVM_DEBUG(dbgs() << ", switch avoiding interference.\n"); in splitLiveThroughBlock()
[all …]
H A DRegAllocBasic.cpp209 // Record each interference and determine if all are spillable before mutating in spillInterferences()
224 assert(!Intfs.empty() && "expected interference"); in spillInterferences()
250 // single interference test for each register the correct class until we find an
251 // available register. So, the number of interference tests in the worst case is
252 // |vregs| * |machineregs|. And since the number of interference tests is
265 // Check for interference in PhysReg in selectOrSplit()
277 // RegMask or RegUnit interference. in selectOrSplit()
288 "Interference after spill."); in selectOrSplit()
H A DRegAllocEvictionAdvisor.cpp49 "regalloc-eviction-max-interference-cutoff", cl::Hidden,
51 "an interference unevictable and bail out. This "
166 /// canEvictHintInterference - return true if the interference for VirtReg
185 /// @returns True when interference can be evicted cheaper than MaxCost.
189 // It is only possible to evict virtual register interference. in canEvictInterferenceBasedOnCost()
215 "Only expecting virtual register interference from query"); in canEvictInterferenceBasedOnCost()
279 // Keep track of the cheapest interference seen so far. in tryFindEvictionCandidate()
H A DRegAllocGreedy.cpp101 " interference at a time"),
107 "and interference cutoffs of last chance recoloring"),
334 // global interference and other constraints. in getPriority()
346 // interference. Mark a bit to prioritize global above local ranges. in getPriority()
416 // If we missed a simple hint, try to cheaply evict interference from the in tryAssign()
438 // Try to evict interference from a cheaper alternative. in tryAssign()
452 // Interference eviction
467 // If no units have interference, reassignment is possible. in canReassign()
490 << " interference: Cascade " << Cascade << '\n'); in evictInterference()
597 /// interference pattern in Physreg and its aliases. Add the constraints to
[all …]
H A DRegAllocPBQP.cpp213 /// Add interference edges between overlapping vregs.
214 class Interference : public PBQPRAConstraint { class
253 // for the fast interference graph construction algorithm. The last is there
363 // interference edges. in apply()
369 // intersect: there is obviously no interference. in apply()
391 // Create an Interference edge and add it to the graph, unless it is
393 // interference. This case occurs frequently between integer and floating
635 // vregLI overlaps fixed regunit interference. in initializeGraph()
636 bool Interference = false; in initializeGraph() local
639 Interference = true; in initializeGraph()
[all …]
H A DRegAllocEvictionAdvisor.h1 //===- RegAllocEvictionAdvisor.h - Interference resolution ------*- C++ -*-===//
42 // dequeued. This improves performance because we can skip interference checks
73 /// Cost of evicting interference - used by default advisor, and the eviction
H A DLiveIntervalUnion.cpp139 // Quickly skip interference check for empty sets. in collectInterferingVRegs()
156 // Check for overlapping interference. in collectInterferingVRegs()
H A DSplitKit.h543 /// may require creating a local interval when there is interference.
553 /// Split points are placed to avoid interference and such that the uses are
555 /// when there is interference.
H A DRegAllocGreedy.h215 /// Cached per-block interference maps
229 // Interference for PhysReg.
H A DMLRegallocEvictAdvisor.h
/freebsd/contrib/wpa/src/ap/
H A Dacs.c43 * 2. interference factor is calculated for each channel
45 * channel interference factors
56 * - implement other interference computation methods
61 * - collect a histogram of interference over time allowing more educated
67 * Survey interference factor implementation details
71 * The survey interference factor is defined as the ratio of the
92 * combined channel interference (e.g., HT40, which uses two channels) can be
107 * All this "interference factor" is purely subjective and only time
110 * of the interference factor then is dependent on what the card itself
114 * Total interference computation details
[all …]
H A Dwnm_ap.c638 "WNM: Ignore unexpected Collocated Interference Report from " in ieee802_11_rx_wnm_coloc_intf_report()
645 "WNM: Ignore too short Collocated Interference Report from " in ieee802_11_rx_wnm_coloc_intf_report()
653 "WNM: Received Collocated Interference Report frame from " in ieee802_11_rx_wnm_coloc_intf_report()
656 wpa_hexdump(MSG_MSGDUMP, "WNM: Collocated Interference Report Elements", in ieee802_11_rx_wnm_coloc_intf_report()
1085 wpa_printf(MSG_DEBUG, "WNM: Sending Collocated Interference Request to " in wnm_send_coloc_intf_req()
1090 "WNM: Failed to send Collocated Interference Request frame"); in wnm_send_coloc_intf_req()
/freebsd/contrib/llvm-project/libcxx/modules/std/
H A Dnew.cppm
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h49 /// +----> 1. vhaddps %xmm2, %xmm2, %xmm3 ## RESOURCE interference: JFPA [ probability: 73%…
54 /// +----> 1. vhaddps %xmm2, %xmm2, %xmm3 ## RESOURCE interference: JFPA [ probability: 73%…
197 // Used by the bottleneck analysis to compute the interference
/freebsd/usr.sbin/ppp/
H A DREADME.nat179 some interference with an open server socket having the same port number
180 on the ppp host machine. This possibility for interference only exists
356 port interference with the host machine. This can be disabled
/freebsd/contrib/ntp/html/
H A Daudio.html29 algorithms designed to efficiently extract timing signals from noise and interference.
40 …phisticated and efficient in extracting timing signals from noise and interference, it always help…
174 codec and generally free of noise and interference. Note that the monitor
/freebsd/lib/libc/resolv/
H A Dmtctxres.c32 * implicitly running without interference from other threads, so there's
/freebsd/crypto/krb5/src/util/
H A Dkrb5-batch-reindent.el4 ;; Avoid vc-mode interference.
/freebsd/sys/netinet/libalias/
H A DHISTORY76 there might be port interference with the
/freebsd/crypto/openssl/doc/man7/
H A Dopenssl-threads.pod68 without interference.

123456