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;

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

77 * @param _chunkSize The size/alignment of chunks into which
78 * the region should be decomposed.
79 */
80 ChunkGenerator(Addr _startAddr, int totalSize, int _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 }

--- 51 unchanged lines hidden ---