lsq_unit.hh (4332:548ef28989b8) | lsq_unit.hh (4395:9acb011a6c35) |
---|---|
1/* 2 * Copyright (c) 2004-2006 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; --- 19 unchanged lines hidden (view full) --- 28 * Authors: Kevin Lim 29 * Korey Sewell 30 */ 31 32#ifndef __CPU_O3_LSQ_UNIT_HH__ 33#define __CPU_O3_LSQ_UNIT_HH__ 34 35#include <algorithm> | 1/* 2 * Copyright (c) 2004-2006 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; --- 19 unchanged lines hidden (view full) --- 28 * Authors: Kevin Lim 29 * Korey Sewell 30 */ 31 32#ifndef __CPU_O3_LSQ_UNIT_HH__ 33#define __CPU_O3_LSQ_UNIT_HH__ 34 35#include <algorithm> |
36#include <cstring> |
|
36#include <map> 37#include <queue> 38 39#include "arch/faults.hh" 40#include "arch/locked_mem.hh" 41#include "config/full_system.hh" 42#include "base/hashmap.hh" 43#include "cpu/inst_seq.hh" --- 243 unchanged lines hidden (view full) --- 287 288 public: 289 struct SQEntry { 290 /** Constructs an empty store queue entry. */ 291 SQEntry() 292 : inst(NULL), req(NULL), size(0), 293 canWB(0), committed(0), completed(0) 294 { | 37#include <map> 38#include <queue> 39 40#include "arch/faults.hh" 41#include "arch/locked_mem.hh" 42#include "config/full_system.hh" 43#include "base/hashmap.hh" 44#include "cpu/inst_seq.hh" --- 243 unchanged lines hidden (view full) --- 288 289 public: 290 struct SQEntry { 291 /** Constructs an empty store queue entry. */ 292 SQEntry() 293 : inst(NULL), req(NULL), size(0), 294 canWB(0), committed(0), completed(0) 295 { |
295 bzero(data, sizeof(data)); | 296 std::memset(data, 0, sizeof(data)); |
296 } 297 298 /** Constructs a store queue entry for a given instruction. */ 299 SQEntry(DynInstPtr &_inst) 300 : inst(_inst), req(NULL), size(0), 301 canWB(0), committed(0), completed(0) 302 { | 297 } 298 299 /** Constructs a store queue entry for a given instruction. */ 300 SQEntry(DynInstPtr &_inst) 301 : inst(_inst), req(NULL), size(0), 302 canWB(0), committed(0), completed(0) 303 { |
303 bzero(data, sizeof(data)); | 304 std::memset(data, 0, sizeof(data)); |
304 } 305 306 /** The store instruction. */ 307 DynInstPtr inst; 308 /** The request for the store. */ 309 RequestPtr req; 310 /** The size of the store. */ 311 int size; --- 414 unchanged lines hidden --- | 305 } 306 307 /** The store instruction. */ 308 DynInstPtr inst; 309 /** The request for the store. */ 310 RequestPtr req; 311 /** The size of the store. */ 312 int size; --- 414 unchanged lines hidden --- |