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
|
// Copyright (c) 2009-2011, The University of British Columbia
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
// 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.
// Neither the name of The University of British Columbia nor the names of its
// 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 "mem_fetch.h"
#include "mem_latency_stat.h"
#include "shader.h"
#include "visualizer.h"
#include "gpu-sim.h"
unsigned mem_fetch::sm_next_mf_request_uid=1;
mem_fetch::mem_fetch( const mem_access_t &access,
const warp_inst_t *inst,
unsigned ctrl_size,
unsigned wid,
unsigned sid,
unsigned tpc,
const class memory_config *config )
{
m_request_uid = sm_next_mf_request_uid++;
m_access = access;
if( inst ) {
m_inst = *inst;
assert( wid == m_inst.warp_id() );
}
m_data_size = access.get_size();
m_ctrl_size = ctrl_size;
m_sid = sid;
m_tpc = tpc;
m_wid = wid;
config->m_address_mapping.addrdec_tlx(access.get_addr(),&m_raw_addr);
m_partition_addr = config->m_address_mapping.partition_address(access.get_addr());
m_type = m_access.is_write()?WRITE_REQUEST:READ_REQUEST;
m_timestamp = gpu_sim_cycle + gpu_tot_sim_cycle;
m_timestamp2 = 0;
m_status = MEM_FETCH_INITIALIZED;
m_status_change = gpu_sim_cycle + gpu_tot_sim_cycle;
}
mem_fetch::~mem_fetch()
{
m_status = MEM_FETCH_DELETED;
}
static const char* Status_str[] = {
"INITIALIZED",
"IN_ICNT_TO_MEM",
"IN_PARTITION_ROP_DELAY",
"IN_PARTITION_ICNT_TO_L2_QUEUE",
"IN_PARTITION_L2_TO_DRAM_QUEUE",
"IN_PARTITION_MC_INTERFACE_QUEUE",
"IN_PARTITION_MC_INPUT_QUEUE",
"IN_PARTITION_MC_BANK_ARB_QUEUE",
"IN_PARTITION_DRAM",
"IN_PARTITION_MC_RETURNQ",
"IN_PARTITION_DRAM_TO_L2_QUEUE",
"IN_PARTITION_L2_FILL_QUEUE",
"IN_PARTITION_L2_TO_ICNT_QUEUE",
"IN_ICNT_TO_SHADER",
"IN_CLUSTER_TO_SHADER_QUEUE",
"IN_SHADER_LDST_RESPONSE_FIFO",
"IN_SHADER_FETCHED",
"MEM_FETCH_DELETED"
};
void mem_fetch::print( FILE *fp, bool print_inst ) const
{
if( this == NULL ) {
fprintf(fp," <NULL mem_fetch pointer>\n");
return;
}
fprintf(fp," mf: uid=%6u, sid%02u:w%02u, part=%u, ", m_request_uid, m_sid, m_wid, m_raw_addr.chip );
m_access.print(fp);
if( (unsigned)m_status < NUM_MEM_REQ_STAT )
fprintf(fp," status = %s (%llu), ", Status_str[m_status], m_status_change );
else
fprintf(fp," status = %u??? (%llu), ", m_status, m_status_change );
if( !m_inst.empty() && print_inst ) m_inst.print(fp);
else fprintf(fp,"\n");
}
void mem_fetch::set_status( enum mem_fetch_status status, unsigned long long cycle )
{
m_status = status;
m_status_change = cycle;
}
bool mem_fetch::isatomic() const
{
if( m_inst.empty() ) return false;
return m_inst.isatomic();
}
void mem_fetch::do_atomic()
{
m_inst.do_atomic();
}
bool mem_fetch::istexture() const
{
if( m_inst.empty() ) return false;
return m_inst.space.get_type() == tex_space;
}
bool mem_fetch::isconst() const
{
if( m_inst.empty() ) return false;
return (m_inst.space.get_type() == const_space) || (m_inst.space.get_type() == param_space_kernel);
}
|
