1/* 2 * Copyright (c) 2001-2005 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 * 28 * Authors: Steve Reinhardt 29 */ 30 31#ifndef __BASE__CHUNK_GENERATOR_HH__ 32#define __BASE__CHUNK_GENERATOR_HH__ 33 34/** 35 * @file 36 * Declaration and inline definition of ChunkGenerator object. 37 */ 38 39#include <algorithm>
| 1/* 2 * Copyright (c) 2001-2005 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 * 28 * Authors: Steve Reinhardt 29 */ 30 31#ifndef __BASE__CHUNK_GENERATOR_HH__ 32#define __BASE__CHUNK_GENERATOR_HH__ 33 34/** 35 * @file 36 * Declaration and inline definition of ChunkGenerator object. 37 */ 38 39#include <algorithm>
|
| 40
|
40#include "base/intmath.hh"
| 41#include "base/intmath.hh"
|
41#include "arch/isa_traits.hh" // for Addr
| 42#include "base/types.hh"
|
42 43/** 44 * This class takes an arbitrary memory region (address/length pair) 45 * and generates a series of appropriately (e.g. block- or page-) 46 * aligned chunks covering the same region. 47 * 48 * Example usage: 49 50\code 51 for (ChunkGenerator gen(addr, size, chunkSize); !gen.done(); gen.next()) { 52 doSomethingChunky(gen.addr(), gen.size()); 53 } 54\endcode 55 */ 56class ChunkGenerator 57{ 58 private: 59 /** The starting address of the current chunk. */ 60 Addr curAddr; 61 /** The starting address of the next chunk (after the current one). */ 62 Addr nextAddr; 63 /** The size of the current chunk (in bytes). */
| 43 44/** 45 * This class takes an arbitrary memory region (address/length pair) 46 * and generates a series of appropriately (e.g. block- or page-) 47 * aligned chunks covering the same region. 48 * 49 * Example usage: 50 51\code 52 for (ChunkGenerator gen(addr, size, chunkSize); !gen.done(); gen.next()) { 53 doSomethingChunky(gen.addr(), gen.size()); 54 } 55\endcode 56 */ 57class ChunkGenerator 58{ 59 private: 60 /** The starting address of the current chunk. */ 61 Addr curAddr; 62 /** The starting address of the next chunk (after the current one). */ 63 Addr nextAddr; 64 /** The size of the current chunk (in bytes). */
|
64 int curSize;
| 65 unsigned curSize;
|
65 /** The number of bytes remaining in the region after the current chunk. */
| 66 /** The number of bytes remaining in the region after the current chunk. */
|
66 int sizeLeft;
| 67 unsigned sizeLeft;
|
67 /** The start address so we can calculate offset in writing block. */ 68 const Addr startAddr; 69 /** The maximum chunk size, e.g., the cache block size or page size. */
| 68 /** The start address so we can calculate offset in writing block. */ 69 const Addr startAddr; 70 /** The maximum chunk size, e.g., the cache block size or page size. */
|
70 const int chunkSize;
| 71 const unsigned chunkSize;
|
71 72 public: 73 /** 74 * Constructor. 75 * @param _startAddr The starting address of the region. 76 * @param totalSize The total size of the region. 77 * @param _chunkSize The size/alignment of chunks into which 78 * the region should be decomposed. 79 */
| 72 73 public: 74 /** 75 * Constructor. 76 * @param _startAddr The starting address of the region. 77 * @param totalSize The total size of the region. 78 * @param _chunkSize The size/alignment of chunks into which 79 * the region should be decomposed. 80 */
|
80 ChunkGenerator(Addr _startAddr, int totalSize, int _chunkSize)
| 81 ChunkGenerator(Addr _startAddr, unsigned totalSize, unsigned _chunkSize)
|
81 : startAddr(_startAddr), chunkSize(_chunkSize) 82 { 83 // chunkSize must be a power of two 84 assert(chunkSize == 0 || isPowerOf2(chunkSize)); 85 assert(totalSize >= 0); 86 87 // set up initial chunk. 88 curAddr = startAddr; 89 90 if (chunkSize == 0) //Special Case, if we see 0, assume no chuncking 91 { 92 nextAddr = startAddr + totalSize; 93 } 94 else 95 { 96 // nextAddr should be *next* chunk start 97 nextAddr = roundUp(startAddr, chunkSize); 98 if (curAddr == nextAddr) { 99 // ... even if startAddr is already chunk-aligned 100 nextAddr += chunkSize; 101 } 102 } 103 104 // how many bytes are left between curAddr and the end of this chunk?
| 82 : startAddr(_startAddr), chunkSize(_chunkSize) 83 { 84 // chunkSize must be a power of two 85 assert(chunkSize == 0 || isPowerOf2(chunkSize)); 86 assert(totalSize >= 0); 87 88 // set up initial chunk. 89 curAddr = startAddr; 90 91 if (chunkSize == 0) //Special Case, if we see 0, assume no chuncking 92 { 93 nextAddr = startAddr + totalSize; 94 } 95 else 96 { 97 // nextAddr should be *next* chunk start 98 nextAddr = roundUp(startAddr, chunkSize); 99 if (curAddr == nextAddr) { 100 // ... even if startAddr is already chunk-aligned 101 nextAddr += chunkSize; 102 } 103 } 104 105 // how many bytes are left between curAddr and the end of this chunk?
|
105 int left_in_chunk = nextAddr - curAddr;
| 106 unsigned left_in_chunk = nextAddr - curAddr;
|
106 curSize = std::min(totalSize, left_in_chunk); 107 sizeLeft = totalSize - curSize; 108 } 109 110 /** Return starting address of current chunk. */
| 107 curSize = std::min(totalSize, left_in_chunk); 108 sizeLeft = totalSize - curSize; 109 } 110 111 /** Return starting address of current chunk. */
|
111 Addr addr() { return curAddr; }
| 112 Addr addr() const { return curAddr; }
|
112 /** Return size in bytes of current chunk. */
| 113 /** Return size in bytes of current chunk. */
|
113 int size() { return curSize; }
| 114 unsigned size() const { return curSize; }
|
114 115 /** Number of bytes we have already chunked up. */
| 115 116 /** Number of bytes we have already chunked up. */
|
116 int complete() { return curAddr - startAddr; }
| 117 unsigned complete() const { return curAddr - startAddr; } 118
|
117 /** 118 * Are we done? That is, did the last call to next() advance 119 * past the end of the region? 120 * @return True if yes, false if more to go. 121 */
| 119 /** 120 * Are we done? That is, did the last call to next() advance 121 * past the end of the region? 122 * @return True if yes, false if more to go. 123 */
|
122 bool done() { return (curSize == 0); }
| 124 bool done() const { return (curSize == 0); }
|
123 124 /** 125 * Advance generator to next chunk. 126 * @return True if successful, false if unsuccessful 127 * (because we were at the last chunk). 128 */
| 125 126 /** 127 * Advance generator to next chunk. 128 * @return True if successful, false if unsuccessful 129 * (because we were at the last chunk). 130 */
|
129 bool next()
| 131 bool 132 next()
|
130 { 131 if (sizeLeft == 0) { 132 curSize = 0; 133 return false; 134 } 135 136 curAddr = nextAddr; 137 curSize = std::min(sizeLeft, chunkSize); 138 sizeLeft -= curSize; 139 nextAddr += curSize; 140 return true; 141 } 142}; 143 144#endif // __BASE__CHUNK_GENERATOR_HH__
| 133 { 134 if (sizeLeft == 0) { 135 curSize = 0; 136 return false; 137 } 138 139 curAddr = nextAddr; 140 curSize = std::min(sizeLeft, chunkSize); 141 sizeLeft -= curSize; 142 nextAddr += curSize; 143 return true; 144 } 145}; 146 147#endif // __BASE__CHUNK_GENERATOR_HH__
|