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

/gem5/site_scons/site_tools/
H A Ddefault.py64 for key,val in sorted(os.environ.iteritems()):
/gem5/src/python/m5/
H A Ddebug.py40 for name in sorted(flags):
49 for name in sorted(flags):
H A DSimObject.py693 params = map(lambda k_v: k_v[1], sorted(cls._params.local.items()))
735 for k, v in sorted(cls._params.local.items())
790 params = map(lambda k_v: k_v[1], sorted(cls._params.local.items()))
1485 return sorted(all.keys(), key = lambda o: o.path()), True
1502 # Unproxy ports in sorted order so that 'append' operations on
1522 for n in sorted(self._children.keys())),
1525 for param in sorted(self._params.keys()):
1531 for port_name in sorted(self._ports.keys()):
1552 for param in sorted(self._params.keys()):
1557 for n in sorted(sel
[all...]
H A Dsimulate.py92 # Unproxy in sorted order for determinism
97 # Print ini sections in sorted order for easier diffing
98 for obj in sorted(root.descendants(), key=lambda o: o.path()):
/gem5/ext/pybind11/tests/
H A Dtest_stl_binders.py154 assert sorted(list(um)) == ['ua', 'ub']
155 assert sorted(list(um.items())) == [('ua', 1.1), ('ub', 2.6)]
231 assert sorted(list(um)) == ['ua', 'ub']
232 assert sorted(list(um.items())) == [('ua', 1.1), ('ub', 2.6)]
234 assert sorted(list(um)) == ['ub']
235 assert sorted(list(um.items())) == [('ub', 2.6)]
H A Dconftest.py33 return sorted(_strip_and_dedent(s).splitlines())
/gem5/src/mem/ruby/profiler/
H A DAddressProfiler.cc72 std::vector<const AccessTraceForAddress *> sorted; local
79 sorted.push_back(record);
81 sort(sorted.begin(), sorted.end(), AccessTraceForAddress::less_equal);
109 int max = sorted.size();
111 const AccessTraceForAddress* record = sorted[counter];
122 const AccessTraceForAddress* record = sorted[counter];
/gem5/src/mem/slicc/
H A Dmain.py100 for i in sorted(slicc.files()):
/gem5/src/python/m5/util/
H A Dsorteddict.py34 return getattr(self, '_sorted', sorted)
38 sorted = property(_get_sorted, _set_sorted) variable in class:SortedDict
45 _sorted_keys = self.sorted(dict.keys(self))
H A Ddot_writer.py152 for param in sorted(simNode._params.keys()):
/gem5/src/systemc/tests/
H A Dverify.py385 for path in sorted(list([ t.path for t in self._passed ])):
392 for cause, tests in sorted(self._failed.items()):
394 for test in sorted(tests, key=lambda t: t.path):
582 for target, props in sorted(filtered_tests.iteritems()):
590 target, props in sorted(filtered_tests.iteritems())
/gem5/ext/pybind11/tools/
H A Dmkdoc.py59 sorted(CPP_OPERATORS.items(), key=lambda t: -len(t[0])))
326 for name, _, comment in list(sorted(comments, key=lambda x: (x[0], x[1]))):
/gem5/util/
H A Dfind_copyrights.py270 for count,dates,owner in sorted(info, reverse=True):
/gem5/util/style/
H A Dsort_includes.py73 are sorted before files'''
84 # make them sorted with respect to non dnet includes. Python
198 block of sorted includes. This is useful when we have multiple
209 return sorted(set(includes))
/gem5/ext/testlib/
H A Dloader.py258 orphan_tests = sorted(orphan_tests, key=new_tests.index)
/gem5/configs/example/
H A Dread_config.py321 # Step through the sorted connections. Exactly one of
323 # bindable because the connections are sorted.
332 for connection in sorted(connections):
478 return sorted(self.object_dicts.keys())
/gem5/util/minorview/
H A Dmodel.py538 return sorted(ret)
/gem5/src/mem/slicc/symbols/
H A DStateMachine.py1349 # Emit the code sequences in a sorted order. This makes the
1352 for c in sorted(case_sorter):

Completed in 36 milliseconds