HomeSort by: relevance | last modified time | path
    Searched refs:Available (Results 1 - 25 of 32) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZMachineScheduler.cpp 11 // the MachineScheduler. It has a sorted Available set of SUs and a pickNode()
75 Available.clear(); // -misched-cutoff.
163 if (Available.empty())
167 if (Available.size() == 1) {
169 HazardRec->dumpSU(*Available.begin(), dbgs()); dbgs() << "\n";);
170 return *Available.begin();
173 // All nodes that are possible to schedule are stored in the Available set.
174 LLVM_DEBUG(dbgs() << "** Available: "; Available.dump(*HazardRec););
177 for (auto *SU : Available) {
    [all...]
SystemZMachineScheduler.h 11 // the MachineScheduler. It has a sorted Available set of SUs and a pickNode()
71 // A sorter for the Available set that makes sure that SUs are considered
95 /// The set of available SUs to schedule next.
96 SUSet Available;
146 /// Available.
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
R600MachineScheduler.cpp 60 (Available[CurInstKind].empty());
62 (!Available[IDFetch].empty() || !Available[IDOther].empty());
64 if (CurInstKind == IDAlu && !Available[IDFetch].empty()) {
71 (FetchInstCount + Available[IDFetch].size());
81 // Available[IDFetch].size() * 2 : GPRs required in the Fetch clause
87 unsigned NearRegisterRequirement = 2 * Available[IDFetch].size();
171 MoveUnits(Pending[IDFetch], Available[IDFetch]);
199 Available[IDOther].push_back(SU);
414 // If there is a T_XYZW alu available, use i
    [all...]
R600MachineScheduler.h 53 std::vector<SUnit *> Available[IDLast], Pending[IDLast];
GCNSchedStrategy.cpp 150 ReadyQueue &Q = Zone.Available;
250 assert(Top.Available.empty() && Top.Pending.empty() &&
251 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");
  /src/external/apache2/llvm/dist/clang/lib/APINotes/
APINotesYAMLCompiler.cpp 30 Available = 0,
46 IO.enumCase(AA, "available", APIAvailability::Available);
135 APIAvailability Mode = APIAvailability::Available;
189 APIAvailability::Available);
227 APIAvailability::Available);
265 APIAvailability::Available);
309 APIAvailability::Available);
341 APIAvailability::Available);
370 APIAvailability::Available);
    [all...]
  /src/distrib/atari/floppies/prepare/
install.sh 82 Available disks are:
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 56 // Check if the scheduler should penalize instructions that are available to
63 // available. Then, we compare the result to this value.
137 /// Keep track of available resources.
358 Available.push(SU);
384 LLVM_DEBUG(dbgs() << "*** Next cycle " << Available.getName() << " cycle "
417 /// Release pending ready nodes in to the available queue. This makes them
420 // If the available queue is empty, it is safe to reset MinReadyCycle.
421 if (Available.empty())
425 // so, add them to the available queue.
439 Available.push(SU)
    [all...]
HexagonMachineScheduler.h 137 ReadyQueue Available;
148 /// MinReadyCycle - Cycle of the soonest available instruction.
157 : Available(ID, Name+".A"),
192 return Available.getID() == ConvergingVLIWScheduler::TopQID;
  /src/external/apache2/llvm/dist/llvm/utils/docker/scripts/
build_install_llvm.sh 20 Available options:
checkout.sh 18 Available options:
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
Loads.cpp 426 llvm::DefMaxInstsToScan("available-load-scan-limit", cl::init(6), cl::Hidden,
429 "available loaded value"));
474 // If this is a load of Ptr, the loaded value is available.
494 // If this is a store through Ptr, the value is available!
550 if (Value *Available = getAvailableLoadStore(Inst, StrippedPtr, AccessTy,
552 return Available;
567 // When AA isn't available, but if the load and the store have the same
617 // Try to find an available value first, and delay expensive alias analysis
619 Value *Available = nullptr;;
629 Available = getAvailableLoadStore(&Inst, StrippedPtr, AccessTy
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
Mips16InstrInfo.cpp 378 BitVector Available = rs.getRegsAvailable(&Mips::CPU16RegsRegClass);
379 Available &= Candidates;
387 Reg = Available.find_first();
399 Available.reset(Reg);
403 SpReg = Available.find_first();
415 Available.reset(SpReg);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineScheduler.cpp 1313 /// available for use in the scheduler.
1521 // comparison instead when it's available.
1993 Available.clear();
2071 /// available for scheduling until they are ready. However, a weaker in-order
2114 // group is available at 0, effectively removing the group record from
2116 // Otherwise, choose the first available instance from among the subunits.
2223 LLVM_DEBUG(dbgs() << Available.getName() << " RemLatency SU("
2240 LLVM_DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
2252 dbgs() << " " << Available.getName() << " + Remain CritRes: "
2278 checkHazard(SU) || (Available.size() >= ReadyListLimit)
    [all...]
RegisterScavenging.cpp 12 /// block. It also provides a mechanism to make registers available by evicting
265 return !LiveUnits.available(Reg);
344 "No available scavenger restore location!");
351 /// Given the bitvector \p Available of free register units at position
357 /// the position MBB.end() if no register is available.
384 if (!MRI.isReserved(Reg) && Used.available(Reg) &&
385 LiveOut.available(Reg))
399 if (Survivor == 0 || !Used.available(Survivor)) {
402 if (!MRI.isReserved(Reg) && Used.available(Reg)) {
450 // Find an available scavenging slot with size and alignment matchin
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
SafepointIRVerifier.cpp 288 /// values "available" at a given point in the control flow graph is the set of
296 // Set of values available coming in, before the phi nodes
299 // Set of values available going out
515 /// Model the effect of an instruction on the set of available values.
517 AvailableValueSet &Available);
746 // available after this block completes. Note: This turns out to be
747 // really important for reducing memory consuption of the initial available
783 AvailableValueSet &Available) {
786 Available.clear();
788 Available.insert(&I)
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/docker/
build_docker_image.sh 22 Available options:
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
MachineScheduler.h 134 /// MachineSchedRegistry provides a selection of available machine instruction
621 ReadyQueue Available;
639 /// MinReadyCycle - Cycle of the soonest available instruction.
691 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
703 return Available.getID() == TopQID;
774 /// pending queue (if already in) and push into available queue.
797 /// Call this before applying any other heuristics to the Available queue.
798 /// Updates the Available/Pending Q's if necessary and returns the single
799 /// available instruction, or NULL if there are multiple candidates.
  /src/usr.sbin/sysinst/
msg.pm.en 65 message avdisks {Available disks:}
msg.mi.en 140 {Available disks}
553 {Available CDs }
597 {Available interfaces}
1273 a partitioning scheme from the available options below. }
1276 {Please select a different partitioning scheme from the available
1433 { Total size of $0 is $1, available: $2}
  /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/Config/
Query.pm 44 in keyed pair form, i.e. a series of C<< key => value >> pairs. Available
  /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/Config/
Query.pm 44 in keyed pair form, i.e. a series of C<< key => value >> pairs. Available
  /src/external/apache2/llvm/dist/llvm/tools/llvm-go/
llvm-go.go 243 Available subcommands: build get install run test print-components print-config`)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
GVN.cpp 104 "Number of blocks speculated as available in "
127 "into) when deducing if a value is fully available or not in GVN "
176 /// Represents a particular available value that we know how to materialize.
259 /// AV - The actual available value
700 /// We know the block *is not* fully available. This is a fixpoint.
702 /// We know the block *is* fully available. This is a fixpoint.
703 Available = 1,
704 /// We do not know whether the block is fully available or not,
707 /// available, this would have been cleaned up into an Unavailable.
712 /// we're analyzing is fully available in the specified block. As we go, kee
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AVR/
AVRExpandPseudoInsts.cpp 921 BitVector Available = RS.getRegsAvailable(&AVR::GPR8RegClass);
922 Available &= Candidates;
924 signed Reg = Available.find_first();

Completed in 70 milliseconds

1 2