1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
|
// Copyright (c) 2009-2021, Tor M. Aamodt, Vijay Kandiah, Nikos Hardavellas,
// Mahmoud Khairy, Junrui Pan, Timothy G. Rogers
// The University of British Columbia, Northwestern University, Purdue
// University All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this
// list of conditions and the following disclaimer;
// 2. Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution;
// 3. Neither the names of The University of British Columbia, Northwestern
// University nor the names of their contributors may be used to
// endorse or promote products derived from this software without specific
// prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <list>
#include <set>
#include "../abstract_hardware_model.h"
#include "../option_parser.h"
#include "../statwrapper.h"
#include "dram.h"
#include "gpu-cache.h"
#include "gpu-sim.h"
#include "histogram.h"
#include "l2cache.h"
#include "l2cache_trace.h"
#include "mem_fetch.h"
#include "mem_latency_stat.h"
#include "shader.h"
mem_fetch *partition_mf_allocator::alloc(new_addr_type addr,
mem_access_type type, unsigned size,
bool wr, unsigned long long cycle,
unsigned long long streamID) const {
assert(wr);
mem_access_t access(type, addr, size, wr, m_memory_config->gpgpu_ctx);
mem_fetch *mf = new mem_fetch(access, NULL, streamID, WRITE_PACKET_SIZE, -1,
-1, -1, m_memory_config, cycle);
return mf;
}
mem_fetch *partition_mf_allocator::alloc(
new_addr_type addr, mem_access_type type, const active_mask_t &active_mask,
const mem_access_byte_mask_t &byte_mask,
const mem_access_sector_mask_t §or_mask, unsigned size, bool wr,
unsigned long long cycle, unsigned wid, unsigned sid, unsigned tpc,
mem_fetch *original_mf, unsigned long long streamID) const {
mem_access_t access(type, addr, size, wr, active_mask, byte_mask, sector_mask,
m_memory_config->gpgpu_ctx);
mem_fetch *mf = new mem_fetch(access, NULL, streamID,
wr ? WRITE_PACKET_SIZE : READ_PACKET_SIZE, wid,
sid, tpc, m_memory_config, cycle, original_mf);
return mf;
}
memory_partition_unit::memory_partition_unit(unsigned partition_id,
const memory_config *config,
class memory_stats_t *stats,
class gpgpu_sim *gpu)
: m_id(partition_id),
m_config(config),
m_stats(stats),
m_arbitration_metadata(config),
m_gpu(gpu) {
m_dram = new dram_t(m_id, m_config, m_stats, this, gpu);
m_sub_partition = new memory_sub_partition
*[m_config->m_n_sub_partition_per_memory_channel];
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
unsigned sub_partition_id =
m_id * m_config->m_n_sub_partition_per_memory_channel + p;
m_sub_partition[p] =
new memory_sub_partition(sub_partition_id, m_config, stats, gpu);
}
}
void memory_partition_unit::handle_memcpy_to_gpu(
size_t addr, unsigned global_subpart_id, mem_access_sector_mask_t mask) {
unsigned p = global_sub_partition_id_to_local_id(global_subpart_id);
std::string mystring = mask.to_string<char, std::string::traits_type,
std::string::allocator_type>();
MEMPART_DPRINTF(
"Copy Engine Request Received For Address=%zx, local_subpart=%u, "
"global_subpart=%u, sector_mask=%s \n",
addr, p, global_subpart_id, mystring.c_str());
m_sub_partition[p]->force_l2_tag_update(
addr, m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle, mask);
}
memory_partition_unit::~memory_partition_unit() {
delete m_dram;
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
delete m_sub_partition[p];
}
delete[] m_sub_partition;
}
memory_partition_unit::arbitration_metadata::arbitration_metadata(
const memory_config *config)
: m_last_borrower(config->m_n_sub_partition_per_memory_channel - 1),
m_private_credit(config->m_n_sub_partition_per_memory_channel, 0),
m_shared_credit(0) {
// each sub partition get at least 1 credit for forward progress
// the rest is shared among with other partitions
m_private_credit_limit = 1;
m_shared_credit_limit = config->gpgpu_frfcfs_dram_sched_queue_size +
config->gpgpu_dram_return_queue_size -
(config->m_n_sub_partition_per_memory_channel - 1);
if (config->seperate_write_queue_enabled)
m_shared_credit_limit += config->gpgpu_frfcfs_dram_write_queue_size;
if (config->gpgpu_frfcfs_dram_sched_queue_size == 0 or
config->gpgpu_dram_return_queue_size == 0) {
m_shared_credit_limit =
0; // no limit if either of the queue has no limit in size
}
assert(m_shared_credit_limit >= 0);
}
bool memory_partition_unit::arbitration_metadata::has_credits(
int inner_sub_partition_id) const {
int spid = inner_sub_partition_id;
if (m_private_credit[spid] < m_private_credit_limit) {
return true;
} else if (m_shared_credit_limit == 0 ||
m_shared_credit < m_shared_credit_limit) {
return true;
} else {
return false;
}
}
void memory_partition_unit::arbitration_metadata::borrow_credit(
int inner_sub_partition_id) {
int spid = inner_sub_partition_id;
if (m_private_credit[spid] < m_private_credit_limit) {
m_private_credit[spid] += 1;
} else if (m_shared_credit_limit == 0 ||
m_shared_credit < m_shared_credit_limit) {
m_shared_credit += 1;
} else {
assert(0 && "DRAM arbitration error: Borrowing from depleted credit!");
}
m_last_borrower = spid;
}
void memory_partition_unit::arbitration_metadata::return_credit(
int inner_sub_partition_id) {
int spid = inner_sub_partition_id;
if (m_private_credit[spid] > 0) {
m_private_credit[spid] -= 1;
} else {
m_shared_credit -= 1;
}
assert((m_shared_credit >= 0) &&
"DRAM arbitration error: Returning more than available credits!");
}
void memory_partition_unit::arbitration_metadata::print(FILE *fp) const {
fprintf(fp, "private_credit = ");
for (unsigned p = 0; p < m_private_credit.size(); p++) {
fprintf(fp, "%d ", m_private_credit[p]);
}
fprintf(fp, "(limit = %d)\n", m_private_credit_limit);
fprintf(fp, "shared_credit = %d (limit = %d)\n", m_shared_credit,
m_shared_credit_limit);
}
bool memory_partition_unit::busy() const {
bool busy = false;
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
if (m_sub_partition[p]->busy()) {
busy = true;
}
}
return busy;
}
void memory_partition_unit::cache_cycle(unsigned cycle) {
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
m_sub_partition[p]->cache_cycle(cycle);
}
}
void memory_partition_unit::visualizer_print(gzFile visualizer_file) const {
m_dram->visualizer_print(visualizer_file);
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
m_sub_partition[p]->visualizer_print(visualizer_file);
}
}
// determine whether a given subpartition can issue to DRAM
bool memory_partition_unit::can_issue_to_dram(int inner_sub_partition_id) {
int spid = inner_sub_partition_id;
bool sub_partition_contention = m_sub_partition[spid]->dram_L2_queue_full();
bool has_dram_resource = m_arbitration_metadata.has_credits(spid);
MEMPART_DPRINTF(
"sub partition %d sub_partition_contention=%c has_dram_resource=%c\n",
spid, (sub_partition_contention) ? 'T' : 'F',
(has_dram_resource) ? 'T' : 'F');
return (has_dram_resource && !sub_partition_contention);
}
int memory_partition_unit::global_sub_partition_id_to_local_id(
int global_sub_partition_id) const {
return (global_sub_partition_id -
m_id * m_config->m_n_sub_partition_per_memory_channel);
}
void memory_partition_unit::simple_dram_model_cycle() {
// pop completed memory request from dram and push it to dram-to-L2 queue
// of the original sub partition
if (!m_dram_latency_queue.empty() &&
((m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle) >=
m_dram_latency_queue.front().ready_cycle)) {
mem_fetch *mf_return = m_dram_latency_queue.front().req;
if (mf_return->get_access_type() != L1_WRBK_ACC &&
mf_return->get_access_type() != L2_WRBK_ACC) {
mf_return->set_reply();
unsigned dest_global_spid = mf_return->get_sub_partition_id();
int dest_spid = global_sub_partition_id_to_local_id(dest_global_spid);
assert(m_sub_partition[dest_spid]->get_id() == dest_global_spid);
if (!m_sub_partition[dest_spid]->dram_L2_queue_full()) {
if (mf_return->get_access_type() == L1_WRBK_ACC) {
m_sub_partition[dest_spid]->set_done(mf_return);
delete mf_return;
} else {
m_sub_partition[dest_spid]->dram_L2_queue_push(mf_return);
mf_return->set_status(
IN_PARTITION_DRAM_TO_L2_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_arbitration_metadata.return_credit(dest_spid);
MEMPART_DPRINTF(
"mem_fetch request %p return from dram to sub partition %d\n",
mf_return, dest_spid);
}
m_dram_latency_queue.pop_front();
}
} else {
this->set_done(mf_return);
delete mf_return;
m_dram_latency_queue.pop_front();
}
}
// mem_fetch *mf = m_sub_partition[spid]->L2_dram_queue_top();
// if( !m_dram->full(mf->is_write()) ) {
// L2->DRAM queue to DRAM latency queue
// Arbitrate among multiple L2 subpartitions
int last_issued_partition = m_arbitration_metadata.last_borrower();
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
int spid = (p + last_issued_partition + 1) %
m_config->m_n_sub_partition_per_memory_channel;
if (!m_sub_partition[spid]->L2_dram_queue_empty() &&
can_issue_to_dram(spid)) {
mem_fetch *mf = m_sub_partition[spid]->L2_dram_queue_top();
if (m_dram->full(mf->is_write())) break;
m_sub_partition[spid]->L2_dram_queue_pop();
MEMPART_DPRINTF(
"Issue mem_fetch request %p from sub partition %d to dram\n", mf,
spid);
dram_delay_t d;
d.req = mf;
d.ready_cycle = m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle +
m_config->dram_latency;
m_dram_latency_queue.push_back(d);
mf->set_status(IN_PARTITION_DRAM_LATENCY_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_arbitration_metadata.borrow_credit(spid);
break; // the DRAM should only accept one request per cycle
}
}
//}
}
void memory_partition_unit::dram_cycle() {
// pop completed memory request from dram and push it to dram-to-L2 queue
// of the original sub partition
mem_fetch *mf_return = m_dram->return_queue_top();
if (mf_return) {
unsigned dest_global_spid = mf_return->get_sub_partition_id();
int dest_spid = global_sub_partition_id_to_local_id(dest_global_spid);
assert(m_sub_partition[dest_spid]->get_id() == dest_global_spid);
if (!m_sub_partition[dest_spid]->dram_L2_queue_full()) {
if (mf_return->get_access_type() == L1_WRBK_ACC) {
m_sub_partition[dest_spid]->set_done(mf_return);
delete mf_return;
} else {
m_sub_partition[dest_spid]->dram_L2_queue_push(mf_return);
mf_return->set_status(IN_PARTITION_DRAM_TO_L2_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_arbitration_metadata.return_credit(dest_spid);
MEMPART_DPRINTF(
"mem_fetch request %p return from dram to sub partition %d\n",
mf_return, dest_spid);
}
m_dram->return_queue_pop();
}
} else {
m_dram->return_queue_pop();
}
m_dram->cycle();
m_dram->dram_log(SAMPLELOG);
// mem_fetch *mf = m_sub_partition[spid]->L2_dram_queue_top();
// if( !m_dram->full(mf->is_write()) ) {
// L2->DRAM queue to DRAM latency queue
// Arbitrate among multiple L2 subpartitions
int last_issued_partition = m_arbitration_metadata.last_borrower();
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
int spid = (p + last_issued_partition + 1) %
m_config->m_n_sub_partition_per_memory_channel;
if (!m_sub_partition[spid]->L2_dram_queue_empty() &&
can_issue_to_dram(spid)) {
mem_fetch *mf = m_sub_partition[spid]->L2_dram_queue_top();
if (m_dram->full(mf->is_write())) break;
m_sub_partition[spid]->L2_dram_queue_pop();
MEMPART_DPRINTF(
"Issue mem_fetch request %p from sub partition %d to dram\n", mf,
spid);
dram_delay_t d;
d.req = mf;
d.ready_cycle = m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle +
m_config->dram_latency;
m_dram_latency_queue.push_back(d);
mf->set_status(IN_PARTITION_DRAM_LATENCY_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_arbitration_metadata.borrow_credit(spid);
break; // the DRAM should only accept one request per cycle
}
}
//}
// DRAM latency queue
if (!m_dram_latency_queue.empty() &&
((m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle) >=
m_dram_latency_queue.front().ready_cycle) &&
!m_dram->full(m_dram_latency_queue.front().req->is_write())) {
mem_fetch *mf = m_dram_latency_queue.front().req;
m_dram_latency_queue.pop_front();
m_dram->push(mf);
}
}
void memory_partition_unit::set_done(mem_fetch *mf) {
unsigned global_spid = mf->get_sub_partition_id();
int spid = global_sub_partition_id_to_local_id(global_spid);
assert(m_sub_partition[spid]->get_id() == global_spid);
if (mf->get_access_type() == L1_WRBK_ACC ||
mf->get_access_type() == L2_WRBK_ACC) {
m_arbitration_metadata.return_credit(spid);
MEMPART_DPRINTF(
"mem_fetch request %p return from dram to sub partition %d\n", mf,
spid);
}
m_sub_partition[spid]->set_done(mf);
}
void memory_partition_unit::set_dram_power_stats(
unsigned &n_cmd, unsigned &n_activity, unsigned &n_nop, unsigned &n_act,
unsigned &n_pre, unsigned &n_rd, unsigned &n_wr, unsigned &n_wr_WB,
unsigned &n_req) const {
m_dram->set_dram_power_stats(n_cmd, n_activity, n_nop, n_act, n_pre, n_rd,
n_wr, n_wr_WB, n_req);
}
void memory_partition_unit::print(FILE *fp) const {
fprintf(fp, "Memory Partition %u: \n", m_id);
for (unsigned p = 0; p < m_config->m_n_sub_partition_per_memory_channel;
p++) {
m_sub_partition[p]->print(fp);
}
fprintf(fp, "In Dram Latency Queue (total = %zd): \n",
m_dram_latency_queue.size());
for (std::list<dram_delay_t>::const_iterator mf_dlq =
m_dram_latency_queue.begin();
mf_dlq != m_dram_latency_queue.end(); ++mf_dlq) {
mem_fetch *mf = mf_dlq->req;
fprintf(fp, "Ready @ %llu - ", mf_dlq->ready_cycle);
if (mf)
mf->print(fp);
else
fprintf(fp, " <NULL mem_fetch?>\n");
}
m_dram->print(fp);
}
memory_sub_partition::memory_sub_partition(unsigned sub_partition_id,
const memory_config *config,
class memory_stats_t *stats,
class gpgpu_sim *gpu) {
m_id = sub_partition_id;
m_config = config;
m_stats = stats;
m_gpu = gpu;
m_memcpy_cycle_offset = 0;
assert(m_id < m_config->m_n_mem_sub_partition);
char L2c_name[32];
snprintf(L2c_name, 32, "L2_bank_%03d", m_id);
m_L2interface = new L2interface(this);
m_mf_allocator = new partition_mf_allocator(config);
if (!m_config->m_L2_config.disabled())
m_L2cache = new l2_cache(L2c_name, m_config->m_L2_config, -1, -1,
m_L2interface, m_mf_allocator,
IN_PARTITION_L2_MISS_QUEUE, gpu, L2_GPU_CACHE);
unsigned int icnt_L2;
unsigned int L2_dram;
unsigned int dram_L2;
unsigned int L2_icnt;
sscanf(m_config->gpgpu_L2_queue_config, "%u:%u:%u:%u", &icnt_L2, &L2_dram,
&dram_L2, &L2_icnt);
m_icnt_L2_queue = new fifo_pipeline<mem_fetch>("icnt-to-L2", 0, icnt_L2);
m_L2_dram_queue = new fifo_pipeline<mem_fetch>("L2-to-dram", 0, L2_dram);
m_dram_L2_queue = new fifo_pipeline<mem_fetch>("dram-to-L2", 0, dram_L2);
m_L2_icnt_queue = new fifo_pipeline<mem_fetch>("L2-to-icnt", 0, L2_icnt);
wb_addr = -1;
}
memory_sub_partition::~memory_sub_partition() {
delete m_icnt_L2_queue;
delete m_L2_dram_queue;
delete m_dram_L2_queue;
delete m_L2_icnt_queue;
delete m_L2cache;
delete m_L2interface;
}
void memory_sub_partition::cache_cycle(unsigned cycle) {
// L2 fill responses
if (!m_config->m_L2_config.disabled()) {
if (m_L2cache->access_ready() && !m_L2_icnt_queue->full()) {
mem_fetch *mf = m_L2cache->next_access();
if (mf->get_access_type() !=
L2_WR_ALLOC_R) { // Don't pass write allocate read request back to
// upper level cache
mf->set_reply();
mf->set_status(IN_PARTITION_L2_TO_ICNT_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_icnt_queue->push(mf);
} else {
if (m_config->m_L2_config.m_write_alloc_policy == FETCH_ON_WRITE) {
mem_fetch *original_wr_mf = mf->get_original_wr_mf();
assert(original_wr_mf);
original_wr_mf->set_reply();
original_wr_mf->set_status(
IN_PARTITION_L2_TO_ICNT_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_icnt_queue->push(original_wr_mf);
}
m_request_tracker.erase(mf);
delete mf;
}
}
}
// DRAM to L2 (texture) and icnt (not texture)
if (!m_dram_L2_queue->empty()) {
mem_fetch *mf = m_dram_L2_queue->top();
if (!m_config->m_L2_config.disabled() && m_L2cache->waiting_for_fill(mf)) {
if (m_L2cache->fill_port_free()) {
mf->set_status(IN_PARTITION_L2_FILL_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2cache->fill(mf, m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle +
m_memcpy_cycle_offset);
m_dram_L2_queue->pop();
}
} else if (!m_L2_icnt_queue->full()) {
if (mf->is_write() && mf->get_type() == WRITE_ACK)
mf->set_status(IN_PARTITION_L2_TO_ICNT_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_icnt_queue->push(mf);
m_dram_L2_queue->pop();
}
}
// prior L2 misses inserted into m_L2_dram_queue here
if (!m_config->m_L2_config.disabled()) m_L2cache->cycle();
// new L2 texture accesses and/or non-texture accesses
if (!m_L2_dram_queue->full() && !m_icnt_L2_queue->empty()) {
mem_fetch *mf = m_icnt_L2_queue->top();
if (!m_config->m_L2_config.disabled() &&
((m_config->m_L2_texure_only && mf->istexture()) ||
(!m_config->m_L2_texure_only))) {
// L2 is enabled and access is for L2
bool output_full = m_L2_icnt_queue->full();
bool port_free = m_L2cache->data_port_free();
if (!output_full && port_free) {
std::list<cache_event> events;
enum cache_request_status status =
m_L2cache->access(mf->get_addr(), mf,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle +
m_memcpy_cycle_offset,
events);
bool write_sent = was_write_sent(events);
bool read_sent = was_read_sent(events);
MEM_SUBPART_DPRINTF("Probing L2 cache Address=%llx, status=%u\n",
mf->get_addr(), status);
if (status == HIT) {
if (!write_sent) {
// L2 cache replies
assert(!read_sent);
if (mf->get_access_type() == L1_WRBK_ACC) {
m_request_tracker.erase(mf);
delete mf;
} else {
mf->set_reply();
mf->set_status(IN_PARTITION_L2_TO_ICNT_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_icnt_queue->push(mf);
}
m_icnt_L2_queue->pop();
} else {
assert(write_sent);
m_icnt_L2_queue->pop();
}
} else if (status != RESERVATION_FAIL) {
if (mf->is_write() &&
(m_config->m_L2_config.m_write_alloc_policy == FETCH_ON_WRITE ||
m_config->m_L2_config.m_write_alloc_policy ==
LAZY_FETCH_ON_READ) &&
!was_writeallocate_sent(events)) {
if (mf->get_access_type() == L1_WRBK_ACC) {
m_request_tracker.erase(mf);
delete mf;
} else if (m_config->m_L2_config.get_write_policy() == WRITE_BACK) {
mf->set_reply();
mf->set_status(IN_PARTITION_L2_TO_ICNT_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_icnt_queue->push(mf);
}
}
// L2 cache accepted request
m_icnt_L2_queue->pop();
} else {
assert(!write_sent);
assert(!read_sent);
// L2 cache lock-up: will try again next cycle
}
}
} else {
// L2 is disabled or non-texture access to texture-only L2
mf->set_status(IN_PARTITION_L2_TO_DRAM_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
m_L2_dram_queue->push(mf);
m_icnt_L2_queue->pop();
}
}
// ROP delay queue
if (!m_rop.empty() && (cycle >= m_rop.front().ready_cycle) &&
!m_icnt_L2_queue->full()) {
mem_fetch *mf = m_rop.front().req;
m_rop.pop();
m_icnt_L2_queue->push(mf);
mf->set_status(IN_PARTITION_ICNT_TO_L2_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
}
}
bool memory_sub_partition::full() const { return m_icnt_L2_queue->full(); }
bool memory_sub_partition::full(unsigned size) const {
return m_icnt_L2_queue->is_avilable_size(size);
}
bool memory_sub_partition::L2_dram_queue_empty() const {
return m_L2_dram_queue->empty();
}
class mem_fetch *memory_sub_partition::L2_dram_queue_top() const {
return m_L2_dram_queue->top();
}
void memory_sub_partition::L2_dram_queue_pop() { m_L2_dram_queue->pop(); }
bool memory_sub_partition::dram_L2_queue_full() const {
return m_dram_L2_queue->full();
}
void memory_sub_partition::dram_L2_queue_push(class mem_fetch *mf) {
m_dram_L2_queue->push(mf);
}
void memory_sub_partition::print_cache_stat(unsigned &accesses,
unsigned &misses) const {
FILE *fp = stdout;
if (!m_config->m_L2_config.disabled()) m_L2cache->print(fp, accesses, misses);
}
void memory_sub_partition::print(FILE *fp) const {
if (!m_request_tracker.empty()) {
fprintf(fp, "Memory Sub Parition %u: pending memory requests:\n", m_id);
for (std::set<mem_fetch *>::const_iterator r = m_request_tracker.begin();
r != m_request_tracker.end(); ++r) {
mem_fetch *mf = *r;
if (mf)
mf->print(fp);
else
fprintf(fp, " <NULL mem_fetch?>\n");
}
}
if (!m_config->m_L2_config.disabled()) m_L2cache->display_state(fp);
}
void memory_stats_t::visualizer_print(gzFile visualizer_file) {
gzprintf(visualizer_file, "Ltwowritemiss: %d\n", L2_write_miss);
gzprintf(visualizer_file, "Ltwowritehit: %d\n", L2_write_hit);
gzprintf(visualizer_file, "Ltworeadmiss: %d\n", L2_read_miss);
gzprintf(visualizer_file, "Ltworeadhit: %d\n", L2_read_hit);
clear_L2_stats_pw();
if (num_mfs)
gzprintf(visualizer_file, "averagemflatency: %lld\n",
mf_total_lat / num_mfs);
}
void memory_stats_t::clear_L2_stats_pw() {
L2_write_miss = 0;
L2_write_hit = 0;
L2_read_miss = 0;
L2_read_hit = 0;
}
void gpgpu_sim::print_dram_stats(FILE *fout) const {
unsigned cmd = 0;
unsigned activity = 0;
unsigned nop = 0;
unsigned act = 0;
unsigned pre = 0;
unsigned rd = 0;
unsigned wr = 0;
unsigned wr_WB = 0;
unsigned req = 0;
unsigned tot_cmd = 0;
unsigned tot_nop = 0;
unsigned tot_act = 0;
unsigned tot_pre = 0;
unsigned tot_rd = 0;
unsigned tot_wr = 0;
unsigned tot_req = 0;
for (unsigned i = 0; i < m_memory_config->m_n_mem; i++) {
m_memory_partition_unit[i]->set_dram_power_stats(cmd, activity, nop, act,
pre, rd, wr, wr_WB, req);
tot_cmd += cmd;
tot_nop += nop;
tot_act += act;
tot_pre += pre;
tot_rd += rd;
tot_wr += wr + wr_WB;
tot_req += req;
}
fprintf(fout, "gpgpu_n_dram_reads = %d\n", tot_rd);
fprintf(fout, "gpgpu_n_dram_writes = %d\n", tot_wr);
fprintf(fout, "gpgpu_n_dram_activate = %d\n", tot_act);
fprintf(fout, "gpgpu_n_dram_commands = %d\n", tot_cmd);
fprintf(fout, "gpgpu_n_dram_noops = %d\n", tot_nop);
fprintf(fout, "gpgpu_n_dram_precharges = %d\n", tot_pre);
fprintf(fout, "gpgpu_n_dram_requests = %d\n", tot_req);
}
unsigned memory_sub_partition::flushL2() {
if (!m_config->m_L2_config.disabled()) {
m_L2cache->flush();
}
return 0; // TODO: write the flushed data to the main memory
}
unsigned memory_sub_partition::invalidateL2() {
if (!m_config->m_L2_config.disabled()) {
m_L2cache->invalidate();
}
return 0;
}
bool memory_sub_partition::busy() const { return !m_request_tracker.empty(); }
std::vector<mem_fetch *>
memory_sub_partition::breakdown_request_to_sector_requests(mem_fetch *mf) {
std::vector<mem_fetch *> result;
mem_access_sector_mask_t sector_mask = mf->get_access_sector_mask();
if (mf->get_data_size() == SECTOR_SIZE &&
mf->get_access_sector_mask().count() == 1) {
result.push_back(mf);
} else if (mf->get_data_size() == MAX_MEMORY_ACCESS_SIZE) {
// break down every sector
mem_access_byte_mask_t mask;
for (unsigned i = 0; i < SECTOR_CHUNCK_SIZE; i++) {
for (unsigned k = i * SECTOR_SIZE; k < (i + 1) * SECTOR_SIZE; k++) {
mask.set(k);
}
mem_fetch *n_mf = m_mf_allocator->alloc(
mf->get_addr() + SECTOR_SIZE * i, mf->get_access_type(),
mf->get_access_warp_mask(), mf->get_access_byte_mask() & mask,
std::bitset<SECTOR_CHUNCK_SIZE>().set(i), SECTOR_SIZE, mf->is_write(),
m_gpu->gpu_tot_sim_cycle + m_gpu->gpu_sim_cycle, mf->get_wid(),
mf->get_sid(), mf->get_tpc(), mf, mf->get_streamID());
result.push_back(n_mf);
}
// This is for constant cache
} else if (mf->get_data_size() == 64 &&
(mf->get_access_sector_mask().all() ||
mf->get_access_sector_mask().none())) {
unsigned start;
if (mf->get_addr() % MAX_MEMORY_ACCESS_SIZE == 0)
start = 0;
else
start = 2;
mem_access_byte_mask_t mask;
for (unsigned i = start; i < start + 2; i++) {
for (unsigned k = i * SECTOR_SIZE; k < (i + 1) * SECTOR_SIZE; k++) {
mask.set(k);
}
mem_fetch *n_mf = m_mf_allocator->alloc(
mf->get_addr(), mf->get_access_type(), mf->get_access_warp_mask(),
mf->get_access_byte_mask() & mask,
std::bitset<SECTOR_CHUNCK_SIZE>().set(i), SECTOR_SIZE, mf->is_write(),
m_gpu->gpu_tot_sim_cycle + m_gpu->gpu_sim_cycle, mf->get_wid(),
mf->get_sid(), mf->get_tpc(), mf, mf->get_streamID());
result.push_back(n_mf);
}
} else {
for (unsigned i = 0; i < SECTOR_CHUNCK_SIZE; i++) {
if (sector_mask.test(i)) {
mem_access_byte_mask_t mask;
for (unsigned k = i * SECTOR_SIZE; k < (i + 1) * SECTOR_SIZE; k++) {
mask.set(k);
}
mem_fetch *n_mf = m_mf_allocator->alloc(
mf->get_addr() + SECTOR_SIZE * i, mf->get_access_type(),
mf->get_access_warp_mask(), mf->get_access_byte_mask() & mask,
std::bitset<SECTOR_CHUNCK_SIZE>().set(i), SECTOR_SIZE,
mf->is_write(), m_gpu->gpu_tot_sim_cycle + m_gpu->gpu_sim_cycle,
mf->get_wid(), mf->get_sid(), mf->get_tpc(), mf,
mf->get_streamID());
result.push_back(n_mf);
}
}
}
if (result.size() == 0) assert(0 && "no mf sent");
return result;
}
void memory_sub_partition::push(mem_fetch *m_req, unsigned long long cycle) {
if (m_req) {
m_stats->memlatstat_icnt2mem_pop(m_req);
std::vector<mem_fetch *> reqs;
if (m_config->m_L2_config.m_cache_type == SECTOR)
reqs = breakdown_request_to_sector_requests(m_req);
else
reqs.push_back(m_req);
for (unsigned i = 0; i < reqs.size(); ++i) {
mem_fetch *req = reqs[i];
m_request_tracker.insert(req);
if (req->istexture()) {
m_icnt_L2_queue->push(req);
req->set_status(IN_PARTITION_ICNT_TO_L2_QUEUE,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
} else {
rop_delay_t r;
r.req = req;
r.ready_cycle = cycle + m_config->rop_latency;
m_rop.push(r);
req->set_status(IN_PARTITION_ROP_DELAY,
m_gpu->gpu_sim_cycle + m_gpu->gpu_tot_sim_cycle);
}
}
}
}
mem_fetch *memory_sub_partition::pop() {
mem_fetch *mf = m_L2_icnt_queue->pop();
m_request_tracker.erase(mf);
if (mf && mf->isatomic()) mf->do_atomic();
if (mf && (mf->get_access_type() == L2_WRBK_ACC ||
mf->get_access_type() == L1_WRBK_ACC)) {
delete mf;
mf = NULL;
}
return mf;
}
mem_fetch *memory_sub_partition::top() {
mem_fetch *mf = m_L2_icnt_queue->top();
if (mf && (mf->get_access_type() == L2_WRBK_ACC ||
mf->get_access_type() == L1_WRBK_ACC)) {
m_L2_icnt_queue->pop();
m_request_tracker.erase(mf);
delete mf;
mf = NULL;
}
return mf;
}
void memory_sub_partition::set_done(mem_fetch *mf) {
m_request_tracker.erase(mf);
}
void memory_sub_partition::accumulate_L2cache_stats(
class cache_stats &l2_stats) const {
if (!m_config->m_L2_config.disabled()) {
l2_stats += m_L2cache->get_stats();
}
}
void memory_sub_partition::get_L2cache_sub_stats(
struct cache_sub_stats &css) const {
if (!m_config->m_L2_config.disabled()) {
m_L2cache->get_sub_stats(css);
}
}
void memory_sub_partition::get_L2cache_sub_stats_pw(
struct cache_sub_stats_pw &css) const {
if (!m_config->m_L2_config.disabled()) {
m_L2cache->get_sub_stats_pw(css);
}
}
void memory_sub_partition::clear_L2cache_stats_pw() {
if (!m_config->m_L2_config.disabled()) {
m_L2cache->clear_pw();
}
}
void memory_sub_partition::visualizer_print(gzFile visualizer_file) {
// Support for L2 AerialVision stats
// Per-sub-partition stats would be trivial to extend from this
cache_sub_stats_pw temp_sub_stats;
get_L2cache_sub_stats_pw(temp_sub_stats);
m_stats->L2_read_miss += temp_sub_stats.read_misses;
m_stats->L2_write_miss += temp_sub_stats.write_misses;
m_stats->L2_read_hit += temp_sub_stats.read_hits;
m_stats->L2_write_hit += temp_sub_stats.write_hits;
clear_L2cache_stats_pw();
}
|