1/*
2 * Copyright (c) 2012-2014 ARM Limited
3 * All rights reserved.
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software

--- 71 unchanged lines hidden (view full) ---

80 unsigned blkIndex = 0; // index into blks array
81 for (unsigned i = 0; i < numSets; ++i) {
82 sets[i].assoc = assoc;
83
84 sets[i].blks.resize(assoc);
85
86 // link in the data blocks
87 for (unsigned j = 0; j < assoc; ++j) {
88 // locate next cache block
89 BlkType *blk = &blks[blkIndex];
90 blk->data = &dataBlks[blkSize*blkIndex];
91 ++blkIndex;
92
93 // invalidate new cache block
94 blk->invalidate();
95
96 //EGH Fix Me : do we need to initialize blk?
97
98 // Setting the tag to j is just to prevent long chains in the hash
99 // table; won't matter because the block is invalid
100 blk->tag = j;
101 blk->whenReady = 0;
102 blk->isTouched = false;
103 sets[i].blks[j]=blk;
104 blk->set = i;
105 blk->way = j;
106 }
107 }
108}
109
110CacheBlk*
111BaseSetAssoc::findBlock(Addr addr, bool is_secure) const
112{
113 Addr tag = extractTag(addr);

--- 72 unchanged lines hidden ---