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
|
// Copyright (c) 2009-2011, Tor M. Aamodt, Wilson W.L. Fung,
// 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 <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include "../option_parser.h"
#ifndef ADDRDEC_H
#define ADDRDEC_H
#include "../abstract_hardware_model.h"
enum partition_index_function {
CONSECUTIVE = 0,
BITWISE_PERMUTATION,
IPOLY,
PAE,
RANDOM,
CUSTOM
};
struct addrdec_t {
void print(FILE *fp) const;
unsigned chip;
unsigned bk;
unsigned row;
unsigned col;
unsigned burst;
unsigned sub_partition;
};
class linear_to_raw_address_translation {
public:
linear_to_raw_address_translation();
void addrdec_setoption(option_parser_t opp);
void init(unsigned int n_channel, unsigned int n_sub_partition_in_channel);
// accessors
void addrdec_tlx(new_addr_type addr, addrdec_t *tlx) const;
new_addr_type partition_address(new_addr_type addr) const;
private:
void addrdec_parseoption(const char *option);
void sweep_test() const; // sanity check to ensure no overlapping
enum { CHIP = 0, BK = 1, ROW = 2, COL = 3, BURST = 4, N_ADDRDEC };
const char *addrdec_option;
int gpgpu_mem_address_mask;
partition_index_function memory_partition_indexing;
bool run_test;
int ADDR_CHIP_S;
unsigned char addrdec_mklow[N_ADDRDEC];
unsigned char addrdec_mkhigh[N_ADDRDEC];
new_addr_type addrdec_mask[N_ADDRDEC];
new_addr_type sub_partition_id_mask;
unsigned int gap;
unsigned m_n_channel;
int m_n_sub_partition_in_channel;
int m_n_sub_partition_total;
unsigned log2channel;
unsigned log2sub_partition;
unsigned nextPowerOf2_m_n_channel;
};
#endif
|
