/gem5/src/cpu/ |
H A D | smt.hh | 56 * Changes the status and priority of the thread with the given number. 59 * @param priority The new priority. 61 void change_thread_state(ThreadID tid, int activate, int priority);
|
/gem5/src/mem/qos/ |
H A D | policy_fixed_prio.cc | 62 FixedPriorityPolicy::initMasterName(std::string master, uint8_t priority) argument 65 this->pair<std::string, uint8_t>(master, priority)); 69 FixedPriorityPolicy::initMasterObj(const SimObject* master, uint8_t priority) argument 72 this->pair<const SimObject*, uint8_t>(master, priority)); 79 // if a match is found in the configured priority map, returns the 80 // matching priority, else returns zero 88 "assigning default priority %d\n",
|
H A D | policy_fixed_prio.hh | 51 * Fixed Priority Policy: based on a configured MasterID to priority map, 52 * it returns a fixed QoS priority value: every master has a fixed priority. 65 * Initialize the fixed master's priority by providing 66 * the master's name and priority value. 70 * @param priority priority value for the master 72 void initMasterName(std::string master, uint8_t priority); 75 * Initialize the fixed master's priority by providing 76 * the master's SimObject pointer and priority valu [all...] |
H A D | QoSPolicy.py | 62 def setMasterPriority(self, master, priority): 66 self._mpriorities.append([master, priority]) 75 priority = mprio[1] 78 master, int(priority)) 81 master.getCCObject(), priority) 83 # default fixed priority value for non-listed Masters 85 "Default priority for non-listed Masters")
|
/gem5/src/mem/cache/prefetch/ |
H A D | queued.hh | 66 /** The priority of this prefetch */ 67 int32_t priority; member in struct:QueuedPrefetcher::DeferredPacket 79 * @param prio This prefetch priority 83 priority(prio), translationRequest() { 88 return priority > that.priority; 92 return priority < that.priority; 184 void insert(const PacketPtr &pkt, PrefetchInfo &new_pfi, int32_t priority); 226 * specified queue. If the request is found, its priority i [all...] |
H A D | queued.cc | 307 const PrefetchInfo &pfi, int32_t priority) 315 /* If the address is already in the queue, update priority and leave */ 318 if (it->priority < priority) { 319 /* Update priority value and position in the queue */ 320 it->priority = priority; 324 /* If the packet has higher priority, swap */ 331 "prefetch queue, priority updated\n"); 353 int32_t priority) 306 alreadyInQueue(std::list<DeferredPacket> &queue, const PrefetchInfo &pfi, int32_t priority) argument 352 insert(const PacketPtr &pkt, PrefetchInfo &new_pfi, int32_t priority) argument [all...] |
/gem5/src/sim/ |
H A D | ticked_object.cc | 47 Event::Priority priority) : 49 event([this]{ processClockEvent(); }, name(), false, priority), 112 Event::Priority priority) : 115 Ticked(*this, NULL, priority) 45 Ticked(ClockedObject &object_, Stats::Scalar *imported_num_cycles, Event::Priority priority) argument 111 TickedObject(const TickedObjectParams *params, Event::Priority priority) argument
|
H A D | ticked_object.hh | 95 Event::Priority priority = Event::CPU_Tick_Pri); 169 Event::Priority priority = Event::CPU_Tick_Pri);
|
H A D | eventq.hh | 90 * and priority definitions and accessor functions. This class should 121 /// priority; these values are used to control events that need to 124 /// Minimum priority 145 /// priority). Steve? 151 /// DVFS update event leads to stats dump therefore given a lower priority 178 /// Maximum priority 196 // when+priority. All events in the same bin will be stored in a 210 Priority _priority; //!< event priority 403 /// Get the event priority 404 Priority priority() cons function in class:Event [all...] |
H A D | eventq.cc | 324 short priority = 0; local 335 nextInBin->priority() < priority) { 336 cprintf("priority inverted!"); 349 priority = nextInBin->priority(); 410 cprintf("Scheduled for %d, priority %d\n", when(), _priority);
|
H A D | mathexpr.hh | 82 int priority; member in struct:MathExpr::OpSearch
|
H A D | mathexpr.cc | 71 * It will look for operators in priority order to recursively build the 81 // From low to high priority 94 if (ops[opt].priority != p) continue;
|
/gem5/src/python/m5/ |
H A D | event.py | 85 def create(func, priority=Event.Default_Pri): 88 return EventWrapper(func, priority=priority)
|
/gem5/src/python/pybind11/ |
H A D | event.cc | 71 PyEvent(Event::Priority priority) argument 72 : Event(priority, Event::Managed) 165 .def("priority", &Event::priority) 170 py::arg("priority") = (int)Event::Default_Pri)
|
/gem5/src/cpu/minor/ |
H A D | cpu.hh | 169 std::vector<ThreadID> roundRobinPriority(ThreadID priority) argument 173 prio_list.push_back((priority + i) % numThreads);
|
/gem5/src/arch/sparc/ |
H A D | faults.hh | 65 const FaultPriority priority; member in struct:SparcISA::SparcFaultBase::FaultVals 70 : name(name_), trapType(trapType_), priority(priority_), 77 virtual FaultPriority priority() = 0; 90 FaultPriority priority() { return vals.priority; } function in class:SparcISA::SparcFault 193 FaultPriority priority() { return 3200 - _n*100; } function in class:SparcISA::InterruptLevelN
|
/gem5/util/batch/ |
H A D | batch.py | 172 self.priority = None 223 if self.priority: 224 self.cmd.append('-p' + self.priority)
|
/gem5/util/pbs/ |
H A D | pbs.py | 105 self.priority = None 156 if self.priority: 157 self.cmd.append('-p' + self.priority)
|
/gem5/src/dev/arm/ |
H A D | gic_v3_redistributor.hh | 174 Bitfield<7, 2> priority; member in class:Gicv3Redistributor
|
H A D | gic_v3_redistributor.cc | 406 "int_id %d priority %d\n", int_id, irqPriority[int_id]); 777 * Recalculate the highest priority pending interrupt after a 791 * Multiple pending ints with same priority. 840 uint8_t lpi_priority = config_entry.priority << 2;
|
/gem5/src/cpu/simple/ |
H A D | base.cc | 427 change_thread_state(ThreadID tid, int activate, int priority) argument
|