1/* 2 * Copyright (c) 2003 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; --- 156 unchanged lines hidden (view full) --- 165 166void 167PageTable::serialize(std::ostream &os) 168{ 169 paramOut(os, "ptable.size", pTable.size()); 170 171 int count = 0; 172 |
173 m5::hash_map<Addr,Addr>::iterator iter = pTable.begin(); 174 m5::hash_map<Addr,Addr>::iterator end = pTable.end(); 175 while (iter != end) { 176 paramOut(os, csprintf("ptable.entry%dvaddr", count), iter->first); 177 paramOut(os, csprintf("ptable.entry%dpaddr", count), iter->second); 178 179 ++iter; 180 ++count; |
181 } 182 assert(count == pTable.size()); 183} 184 185void 186PageTable::unserialize(Checkpoint *cp, const std::string §ion) 187{ 188 int i = 0, count; --- 14 unchanged lines hidden --- |