Searched refs:count (Results 126 - 150 of 207) sorted by relevance

123456789

/gem5/ext/testlib/
H A Dresult.py225 def result_attribute(self, result, count):
226 return XMLAttribute(self.result_map[result], count)
251 def result_attribute(self, result, count):
252 return XMLAttribute(self.result_map[result], count)
H A Dhandlers.py226 outcome_fmt = ' {count} {outcome}'
236 count = outcome_count[outcome]
237 if count:
238 strings.append(outcome_fmt.format(count=count,
/gem5/src/mem/ruby/profiler/
H A DAddressProfiler.hh59 void profileRetry(Addr data_addr, AccessType type, int count);
/gem5/src/mem/ruby/common/
H A DNetDest.cc122 NetDest::count() const function in class:NetDest
126 counter += m_bits[i].count();
140 assert(count() > 0);
/gem5/src/dev/
H A Dintel_8254_timer.cc126 warn_once("Reading current count from inactive timer.\n");
153 uint16_t count = currentCount(); local
157 return (uint8_t)count;
161 return count >> 8;
/gem5/src/systemc/tests/systemc/misc/stars/star114477/
H A Ddesign_rtl.h43 sc_in<sc_uint<32> > count; local
48 sensitive << count << out_a1;
126 REM_UNS_OP( count.read(), C18_B, C18_REMAINDER );
/gem5/src/mem/ruby/system/
H A DGPUCoalescer.cc262 if (m_readRequestTable.count(line_addr) > 0) {
267 if (m_writeRequestTable.count(line_addr) > 0) {
275 if (m_writeRequestTable.count(line_addr) > 0) {
280 if (m_readRequestTable.count(line_addr) > 0) {
301 assert(kernelEndList.count(wavefront_id) == 0);
494 assert(m_writeRequestTable.count(makeLineAddress(address)));
575 assert(m_readRequestTable.count(makeLineAddress(address)));
671 assert(!reqCoalescer.count(request_line_address));
838 if (!reqCoalescer.count(line_addr)) {
1044 assert(kernelEndList.count(wavefront_i
[all...]
/gem5/src/sim/
H A Dsystem.hh445 int count = 0; local
450 if (*i) count++;
452 return count;
H A Dcxx_config.hh175 unsigned int count)
174 setPortConnectionCount(const std::string &name, unsigned int count) argument
/gem5/ext/systemc/src/sysc/utils/
H A Dsc_report_handler.cpp205 for ( int i = 0; i < item->count; ++i )
343 for ( int i = 0; i < items->count; ++i )
377 for ( int i = 0; i < items->count; ++i )
411 items->count = 1;
412 items->md = new sc_msg_def[items->count];
419 memset(items->md, 0, sizeof(sc_msg_def) * items->count);
649 for ( int i = 0; i < item->count; ++i )
H A Dsc_report_handler.h126 int count; // set to number of items in md[] member in struct:sc_core::sc_report_handler::msg_def_items
/gem5/ext/libelf/
H A Dlibelf_ar.c64 * - a 4-byte count of entries stored as a binary value, MSB first
399 * The first 4 bytes are a binary count of the number of entries in the
418 _libelf_ar_process_symtab(Elf *e, size_t *count) argument
425 assert(count != NULL);
477 *count = e->e_u.e_ar.e_symtabsz = nentries + 1;
/gem5/src/arch/hsail/insts/
H A Dbranch.hh290 if (false_pc != rpc && true_mask.count() < curr_mask.count()) {
295 if (true_pc != rpc && true_mask.count()) {
311 // so we do not count it as a source-register operand
325 // register which is not stored in the VRF so we do not count it
/gem5/ext/pybind11/tests/
H A Dtest_stl.cpp89 return set.count("key1") && set.count("key2") && set.count("key3");
/gem5/src/dev/storage/
H A Ddisk_image.cc222 SafeRead(ifstream &stream, void *data, int count) argument
224 stream.read((char *)data, count);
305 SafeWrite(ofstream &stream, const void *data, int count) argument
307 stream.write((const char *)data, count);
/gem5/ext/ply/example/newclasscalc/
H A Dcalc.py94 t.lexer.lineno += t.value.count("\n")
/gem5/ext/ply/example/classcalc/
H A Dcalc.py91 t.lexer.lineno += t.value.count("\n")
/gem5/src/arch/arm/insts/
H A Dstatic_inst.hh327 const unsigned count = sizeof(T) / sizeof(E); local
330 E eVals[count];
334 for (unsigned i = 0; i < count; i++) {
338 for (unsigned i = 0; i < count; i++) {
/gem5/util/
H A Dqdo155 count = 0
156 while self.isalive() and count < 10:
H A Dfind_copyrights.py270 for count,dates,owner in sorted(info, reverse=True):
272 owner = '%s (%s files)' % (owner, count)
/gem5/src/mem/ruby/structures/
H A DPerfectCacheMemory.hh114 return m_map.count(makeLineAddress(address)) > 0;
/gem5/ext/googletest/googlemock/include/gmock/
H A Dgmock-spec-builders.h828 // Checks the action count (i.e. the number of WillOnce() and
897 // Check the validity of the action count if it hasn't been done
1027 // whether their count makes sense.
1041 // whether their count makes sense.
1096 // In case the action count wasn't checked when the expectation
1156 const int count = call_count();
1157 Assert(count >= 1, __FILE__, __LINE__,
1163 count > action_count) {
1169 << "Called " << count << " times, but only "
1176 return count <
[all...]
/gem5/ext/googletest/googlemock/test/
H A Dgmock_stress_test.cc176 int* count; member in struct:testing::__anon26::Helper1Param
184 (*param.count)++;
/gem5/ext/googletest/googletest/include/gtest/
H A Dgtest-printers.h119 size_t count,
375 size_t count = 0; local
377 it != container.end(); ++it, ++count) {
378 if (count > 0) {
380 if (count == kMaxCount) { // Enough has been printed.
391 if (count > 0) {
548 void PrintRawArrayTo(const T a[], size_t count, ::std::ostream* os) { argument
550 for (size_t i = 1; i != count; i++) {
/gem5/src/cpu/o3/
H A Dinst_queue.hh270 unsigned getCount(ThreadID tid) { return count[tid]; };
416 /** Per Thread IQ count */
417 unsigned count[Impl::MaxThreads]; member in class:InstructionQueue
462 /** Debugging function to count how many entries are in the IQ. It does

Completed in 26 milliseconds

123456789