Intesim2 Integration

Details: See Review 80001 https://gpgpu-sim-code-review.appspot.com/80001/

[git-p4: depot-paths = "//depot/gpgpu_sim_research/fermi/distribution/": change = 16747]

1 files changed, 83 insertions, 0 deletions

diff --git a/src/intersim2/buffer.cpp b/src/intersim2/buffer.cpp
new file mode 100644
index 0000000..25f78e9
--- /dev/null
+++ b/src/intersim2/buffer.cpp
@@ -0,0 +1,83 @@
+// $Id: buffer.cpp 5188 2012-08-30 00:31:31Z dub $
+
+/*
+ Copyright (c) 2007-2012, Trustees of The Leland Stanford Junior University
+ All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ Redistributions of source code must retain the above copyright notice, this 
+ list of conditions and the following disclaimer.
+ Redistributions in binary form must reproduce the above copyright notice, this
+ list of conditions and the following disclaimer in the documentation and/or
+ other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include <sstream>
+
+#include "globals.hpp"
+#include "booksim.hpp"
+#include "buffer.hpp"
+
+Buffer::Buffer( const Configuration& config, int outputs, 
+		Module *parent, const string& name ) :
+Module( parent, name ), _occupancy(0)
+{
+  int num_vcs = config.GetInt( "num_vcs" );
+
+  _size = config.GetInt("buf_size");
+  if(_size < 0) {
+    _size = num_vcs * config.GetInt( "vc_buf_size" );
+  };
+
+  _vc.resize(num_vcs);
+
+  for(int i = 0; i < num_vcs; ++i) {
+    ostringstream vc_name;
+    vc_name << "vc_" << i;
+    _vc[i] = new VC(config, outputs, this, vc_name.str( ) );
+  }
+
+#ifdef TRACK_BUFFERS
+  int classes = config.GetInt("classes");
+  _class_occupancy.resize(classes, 0);
+#endif
+}
+
+Buffer::~Buffer()
+{
+  for(vector<VC*>::iterator i = _vc.begin(); i != _vc.end(); ++i) {
+    delete *i;
+  }
+}
+
+void Buffer::AddFlit( int vc, Flit *f )
+{
+  if(_occupancy >= _size) {
+    Error("Flit buffer overflow.");
+  }
+  ++_occupancy;
+  _vc[vc]->AddFlit(f);
+#ifdef TRACK_BUFFERS
+  ++_class_occupancy[f->cl];
+#endif
+}
+
+void Buffer::Display( ostream & os ) const
+{
+  for(vector<VC*>::const_iterator i = _vc.begin(); i != _vc.end(); ++i) {
+    (*i)->Display(os);
+  }
+}