/gem5/src/cpu/simple/probes/ |
H A D | simpoint.cc | 103 info.count = currentBBVInstCount; 106 // If basic block is seen before, just increment the count by the 109 info.count += currentBBVInstCount; 113 // Reached end of interval if the sum of the current inst count 114 // (intervalCount) and the excessive inst count from the previous 122 if (info.count != 0) { 123 counts.push_back(std::make_pair(info.id, info.count)); 124 info.count = 0;
|
/gem5/src/systemc/tests/systemc/misc/unit/aproc_halt/disaproc1/ |
H A D | disaproc1.cpp | 145 int count; local 158 count = 0; 167 a = (val1[count % (sizeof(val1)/sizeof(val1[0]))] & 1); 168 b = (val2[count % (sizeof(val2)/sizeof(val2[0]))] & 1); 169 count++;
|
/gem5/src/systemc/tests/systemc/misc/unit/aproc_halt/disaproc3/ |
H A D | disaproc3.cpp | 151 int count; local 164 count = 0; 173 a = (val1[count % (sizeof(val1)/sizeof(val1[0]))] & 1); 174 b = (val2[count % (sizeof(val2)/sizeof(val2[0]))] & 1); 175 count++;
|
/gem5/util/style/ |
H A D | style.py | 138 count = 0 141 count += tabsize - count % tabsize 143 count += 1 145 return count
|
/gem5/ext/googletest/googletest/src/ |
H A D | gtest-printers.cc | 64 size_t count, ostream* os) { 66 for (size_t i = 0; i != count; i++) { 82 void PrintBytesInObjectToImpl(const unsigned char* obj_bytes, size_t count, argument 85 *os << count << "-byte object <"; local 93 if (count < kThreshold) { 94 PrintByteSegmentInObjectTo(obj_bytes, 0, count, os); 99 const size_t resume_pos = (count - kChunkSize + 1)/2*2; 100 PrintByteSegmentInObjectTo(obj_bytes, resume_pos, count - resume_pos, os); 114 void PrintBytesInObjectTo(const unsigned char* obj_bytes, size_t count, argument 116 PrintBytesInObjectToImpl(obj_bytes, count, o 63 PrintByteSegmentInObjectTo(const unsigned char* obj_bytes, size_t start, size_t count, ostream* os) argument [all...] |
/gem5/ext/libelf/ |
H A D | gelf_phdr.c | 102 elf32_newphdr(Elf *e, size_t count) argument 104 return (_libelf_newphdr(e, ELFCLASS32, count)); 108 elf64_newphdr(Elf *e, size_t count) argument 110 return (_libelf_newphdr(e, ELFCLASS64, count)); 114 gelf_newphdr(Elf *e, size_t count) argument 120 return (_libelf_newphdr(e, e->e_class, count));
|
H A D | libelf_phdr.c | 110 _libelf_newphdr(Elf *e, int ec, size_t count) argument 134 if (count > 0 && (newphdr = calloc(count, msz)) == NULL) { 149 e->e_u.e_elf.e_nphdr = count;
|
/gem5/src/base/ |
H A D | cp_annotate.hh | 108 int32_t count = 1) { return; } 111 int32_t count = 1) { return; } 114 int32_t count = 1) { return; } 117 int32_t count = 1) { return; } 120 int32_t count = 1) { return; } 123 int32_t count = 1) { return; } 306 int count); 308 int count); 446 std::string q, uint64_t qid, System *q_sys = NULL, int32_t count = 1) 455 q, qid, qSize[qi-1], qData[qi-1].size(), qBytes[qi-1], count); [all...] |
H A D | refcnt.hh | 62 // The reference count is mutable because one may want to 63 // reference count a const pointer. This really is OK because 66 mutable int count; member in class:RefCounted 71 // reference count as well and we certainly don't want that. 77 * We initialize the reference count to zero and the first object 83 RefCounted() : count(0) {} 96 /// Increment the reference count 97 void incref() const { ++count; } 99 /// Decrement the reference count and destroy the object if all 101 void decref() const { if (--count < [all...] |
/gem5/src/mem/ |
H A D | page_table.cc | 177 PTable::size_type count = 0; local 179 ScopedCheckpointSection sec(cp, csprintf("Entry%d", count++)); 185 assert(count == pTable.size()); 191 int count; local 192 paramIn(cp, "ptable.size", count); 194 for (int i = 0; i < count; ++i) {
|
/gem5/ext/ply/test/ |
H A D | lex_module_import.py | 37 t.lineno += t.value.count("\n")
|
H A D | calclex.py | 39 t.lineno += t.value.count("\n")
|
H A D | lex_closure.py | 41 t.lineno += t.value.count("\n")
|
H A D | lex_object.py | 40 t.lineno += t.value.count("\n")
|
/gem5/src/mem/cache/replacement_policies/ |
H A D | tree_plru_rp.cc | 101 : BaseReplacementPolicy(p), numLeaves(p->num_leaves), count(0), 200 if (count % numLeaves == 0) { 206 (count % numLeaves) + numLeaves - 1, 210 count++;
|
/gem5/src/mem/ruby/structures/ |
H A D | TimerTable.cc | 68 assert(!m_map.count(address)); 85 assert(m_map.count(address));
|
H A D | PersistentTable.cc | 74 assert(m_map.count(address)); 165 return m_map.count(address) > 0; 177 return entry.m_starving.count(); 189 return entry.m_starving.count() - entry.m_request_to_write.count();
|
/gem5/src/cpu/pred/ |
H A D | 2bit_local.cc | 121 LocalBP::getPrediction(uint8_t &count) argument 123 // Get the MSB of the count 124 return (count >> (localCtrBits - 1));
|
/gem5/src/dev/arm/ |
H A D | smmu_v3_proc.hh | 82 count(_max), max(_max) 85 unsigned count; member in struct:SMMUSemaphore
|
/gem5/src/systemc/tests/systemc/misc/unit/aproc_halt/disaproc2/ |
H A D | disaproc2.cpp | 152 int count; local 165 count = 0; 174 a = (val1[count % (sizeof(val1)/sizeof(val1[0]))]); 175 b = (val2[count % (sizeof(val2)/sizeof(val2[0]))]); 176 count++;
|
/gem5/configs/common/cores/arm/ |
H A D | O3_ARM_v7a.py | 37 count = 2 variable in class:O3_ARM_v7a_Simple_Int 44 count = 1 variable in class:O3_ARM_v7a_Complex_Int 77 count = 2 variable in class:O3_ARM_v7a_FP 84 count = 1 variable in class:O3_ARM_v7a_Load 89 count = 1 variable in class:O3_ARM_v7a_Store
|
H A D | ex5_big.py | 44 count = 2 variable in class:ex5_big_Simple_Int 51 count = 1 variable in class:ex5_big_Complex_Int 81 count = 2 variable in class:ex5_big_FP 87 count = 1 variable in class:ex5_big_Load 91 count = 1 variable in class:ex5_big_Store
|
/gem5/ext/ply/example/yply/ |
H A D | ylex.py | 45 t.lexer.lineno += t.value.count('\n') 51 t.lexer.lineno += t.value.count("\n") 87 t.lexer.lineno += t.value.count('\n')
|
/gem5/src/mem/ruby/slicc_interface/ |
H A D | RubySlicc_Util.hh | 177 int count = 0; local 180 count++; 183 return count;
|
/gem5/src/arch/mips/ |
H A D | interrupts.cc | 149 RegVal count = tc->readMiscRegNoEffect(MISCREG_COUNT); local 150 if (compare == count && count != 0)
|