Searched refs:states (Results 1 - 23 of 23) sorted by relevance

/gem5/src/mem/cache/prefetch/
H A Daccess_map_pattern_matching.hh90 std::vector<AccessMapState> states; member in struct:AccessMapPatternMatching::AccessMapEntry
92 AccessMapEntry(size_t num_entries) : states(num_entries, AM_INIT)
98 for (auto &entry : states) {
135 * @param states vector containing the states of three contiguous hot zones
140 inline bool checkCandidate(std::vector<AccessMapState> const &states, argument
143 enum AccessMapState tgt = states[current - stride];
144 enum AccessMapState s = states[current + stride];
145 enum AccessMapState s2 = states[current + 2 * stride];
146 enum AccessMapState s2_p1 = states[curren
[all...]
H A Daccess_map_pattern_matching.cc122 enum AccessMapState old = entry.states[block];
123 entry.states[block] = state;
181 * Create a contiguous copy of the 3 entries states.
185 std::vector<AccessMapState> states(3 * lines_per_zone);
187 states[idx] =
188 am_entry_prev != nullptr ? am_entry_prev->states[idx] : AM_INVALID;
189 states[idx + lines_per_zone] = am_entry_curr->states[idx];
190 states[idx + 2 * lines_per_zone] =
191 am_entry_next != nullptr ? am_entry_next->states[id
[all...]
/gem5/src/mem/slicc/ast/
H A DTransitionDeclAST.py32 def __init__(self, slicc, request_types, states, events, next_state,
37 self.states = states
62 for state in self.states:
63 if state not in machine.states:
H A DStateDeclAST.py31 def __init__(self, slicc, type_ast, pairs, states):
35 self.states = states
59 # Add all of the states of the type to it
60 for state in self.states:
/gem5/src/cpu/testers/traffic_gen/
H A Dtraffic_gen.cc180 states[id] = createTrace(duration, traceFile, addrOffset);
183 states[id] = createIdle(duration);
186 states[id] = createExit(duration);
208 states[id] = createLinear(duration, start_addr,
214 states[id] = createRandom(duration, start_addr,
250 states[id] = createDram(duration, start_addr,
269 states[id] = createDramRot(duration, start_addr,
312 transitionMatrix.resize(states.size());
313 for (size_t i = 0; i < states.size(); i++) {
314 transitionMatrix[i].resize(states
[all...]
H A Dtraffic_gen.hh66 * traces. By describing these behaviours as states, it is straight
119 /** Map of generator states */
120 std::unordered_map<uint32_t, std::shared_ptr<BaseGen>> states; member in class:TrafficGen
/gem5/ext/ply/test/
H A Dlex_state1.py16 states = 'comment' variable
H A Dlex_state2.py16 states = ('comment','example') variable
H A Dlex_state3.py17 states = ((comment, 'inclusive'), variable
H A Dlex_state4.py17 states = (('comment', 'exclsive'),) variable
H A Dlex_state5.py16 states = (('comment', 'exclusive'), variable
H A Dlex_state_noerror.py16 states = (('comment', 'exclusive'),) variable
H A Dlex_state_norule.py16 states = (('comment', 'exclusive'), variable
H A Dlex_state_try.py16 states = (('comment', 'exclusive'),) variable
H A Dlex_opt_alias.py4 # Tests ability to match up functions with states, aliases, and
15 states = (('instdef','inclusive'),('spam','exclusive')) variable
/gem5/src/mem/slicc/symbols/
H A DTransition.py37 self.state = machine.states[state]
51 self.nextState = machine.states[nextState]
H A DStateMachine.py81 self.states = OrderedDict()
104 self.states[state.ident] = state
1431 for state in self.states.itervalues():
1441 for state in self.states.itervalues():
1489 for state in self.states.itervalues():
/gem5/src/mem/slicc/generate/
H A Dtex.py48 for state in sm.states:
/gem5/ext/googletest/googlemock/src/
H A Dgmock-spec-builders.cc592 StateMap& states() { return states_; } function in class:__anon13::MockObjectRegistry
660 g_mock_object_registry.states()[mock_obj].leakable = true;
688 if (g_mock_object_registry.states().count(mock_obj) == 0) {
697 g_mock_object_registry.states()[mock_obj].function_mockers;
715 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker);
725 MockObjectState& state = g_mock_object_registry.states()[mock_obj];
749 g_mock_object_registry.states().begin();
750 it != g_mock_object_registry.states().end(); ++it) {
755 g_mock_object_registry.states().erase(it);
767 if (g_mock_object_registry.states()
[all...]
/gem5/ext/ply/ply/
H A Dlex.py121 self.lexstatere = {} # Dictionary mapping lexer states to master regexs
122 self.lexstateretext = {} # Dictionary mapping lexer states to regex strings
123 self.lexstaterenames = {} # Dictionary mapping lexer states to symbol names
125 self.lexstatestack = [] # Stack of lexer states
516 # state names, this function returns a tuple (states,tokenname) where states
527 states = tuple(parts[1:i])
529 states = ('INITIAL',)
531 if 'ANY' in states:
532 states
[all...]
/gem5/ext/ply/example/yply/
H A Dylex.py16 states = (('code','exclusive'),) variable
/gem5/src/arch/
H A Dmicro_asm.py199 states = ( variable
/gem5/src/base/
H A Dcp_annotate.cc375 // if expl is true suspend symbol table based states
412 // return back to symbol table based states
855 // Output the various state machines and their corresponding states
862 // State machines, id -> states
870 vector<string> states; local
871 states.resize(numSt[x-1]+1);
875 states[i->second] = i->first;
879 for (int y = 1; y < states.size(); y++)
880 *osbin << ", \"" << states[y] << "\""; local

Completed in 32 milliseconds