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, 86 insertions, 0 deletions

diff --git a/src/intersim2/arbiters/arbiter.hpp b/src/intersim2/arbiters/arbiter.hpp
new file mode 100644
index 0000000..456bd8f
--- /dev/null
+++ b/src/intersim2/arbiters/arbiter.hpp
@@ -0,0 +1,86 @@
+// $Id: arbiter.hpp 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.
+*/
+
+// ----------------------------------------------------------------------
+//
+//  Arbiter: Base class for Matrix and Round Robin Arbiter
+//
+// ----------------------------------------------------------------------
+
+#ifndef _ARBITER_HPP_
+#define _ARBITER_HPP_
+
+#include <vector>
+
+#include "module.hpp"
+
+class Arbiter : public Module {
+
+protected:
+
+  typedef struct { 
+    bool valid ;
+    int id ;
+    int pri ;
+  } entry_t ;
+  
+  vector<entry_t> _request ;
+  int  _size ;
+
+  int  _selected ;
+  int _highest_pri;
+  int _best_input;
+
+public:
+  int  _num_reqs ;
+  // Constructors
+  Arbiter( Module *parent, const string &name, int size ) ;
+  
+  // Print priority matrix to standard output
+  virtual void PrintState() const = 0 ;
+  
+  // Register request with arbiter
+  virtual void AddRequest( int input, int id, int pri ) ;
+
+  // Update priority matrix based on last aribtration result
+  virtual void UpdateState() = 0 ; 
+
+  // Arbitrate amongst requests. Returns winning input and 
+  // updates pointers to metadata when valid pointers are passed
+  virtual int Arbitrate( int* id = 0, int* pri = 0 ) ;
+
+  virtual void Clear();
+
+  inline int LastWinner() const {
+    return _selected;
+  }
+
+  static Arbiter *NewArbiter( Module *parent, const string &name,
+			      const string &arb_type, int size );
+} ;
+
+#endif