Do not insert line twice.

[loba.git] / process.h

diff --git a/process.h b/process.h
index 926bf1f9d064e343cd87273bdbdec41f41879cf9..ed6e6cf6fbedffc1ab96657aadda320828ca0a2a 100644 (file)
--- a/process.h
+++ b/process.h
@@ -32,8 +32,16 @@ public:
     process(int argc, char* argv[]);
     virtual ~process();
 
-    double get_comp() const                { return comp; }
-    double get_real_load() const           { return real_load; }
+    double get_real_load() const           { return real_load;            }
+    double get_comp_amount() const         { return acc.comp_amount;      }
+    double get_data_send_amount() const    { return acc.data_send.amount; }
+    double get_data_recv_amount() const    { return acc.data_recv.amount; }
+    unsigned get_data_send_count() const   { return acc.data_send.count;  }
+    unsigned get_data_recv_count() const   { return acc.data_recv.count;  }
+    double get_ctrl_send_amount() const    { return acc.ctrl_send.amount; }
+    double get_ctrl_recv_amount() const    { return acc.ctrl_recv.amount; }
+    unsigned get_ctrl_send_count() const   { return acc.ctrl_send.count;  }
+    unsigned get_ctrl_recv_count() const   { return acc.ctrl_recv.count;  }
 
     int run();
 
@@ -46,8 +54,7 @@ protected:
 
     // Get and set current load, which may be real load, or expected
     // load if opt::bookkeeping is true.
-    double get_load() const;
-    void set_load(double load);
+    double get_load() const                { return expected_load; }
 
     // The load balancing algorithm comes here...
     virtual void load_balance();
@@ -91,8 +98,6 @@ private:
     unsigned lb_iter;           // counter of load-balancing iterations
     unsigned comp_iter;         // counter of computation iterations
 
-    double comp;                // total computing done so far (flops)
-
     double prev_load_broadcast; // used to ensure that we do not send
                                 // a same information messages
     double real_load;           // current load
@@ -101,6 +106,39 @@ private:
     mutex_t mutex;              // synchronization between threads
     condition_t cond;
 
+    struct mesg_accounting {
+        double amount;          // sum of message size
+        unsigned count;         // number of messages
+        mesg_accounting(): amount(0.0), count(0) { }
+    };
+    struct accounting {
+        double comp_amount;        // total computing done so far (flops)
+        mesg_accounting data_send; // data messages sent
+        mesg_accounting data_recv; // data messages received
+        mesg_accounting ctrl_send; // ctrl message sent
+        mesg_accounting ctrl_recv; // ctrl message received
+        accounting(): comp_amount(0.0) { }
+    };
+    accounting acc;
+
+    void add_comp_amount(double amount) { acc.comp_amount += amount; }
+    void add_data_send_mesg(double amount) {
+        ++acc.data_send.count;
+        acc.data_send.amount += amount;
+    }
+    void add_data_recv_mesg(double amount) {
+        ++acc.data_recv.count;
+        acc.data_recv.amount += amount;
+    }
+    void add_ctrl_send_mesg(double amount) {
+        ++acc.ctrl_send.count;
+        acc.ctrl_send.amount += amount;
+    }
+    void add_ctrl_recv_mesg(double amount) {
+        ++acc.ctrl_recv.count;
+        acc.ctrl_recv.amount += amount;
+    }
+
     // Load-balancing loop
     msg_thread* lb_thread;
     void load_balance_loop();
@@ -108,6 +146,7 @@ private:
     // Simulate computation loop
     void compute_loop();
 
+    // Check if we need to stop
     bool still_running();
 
     // Returns the sum of "to_send" for all neighbors.
@@ -127,24 +166,6 @@ private:
     void handle_message(message* msg, m_host_t from);
 };
 
-inline
-double process::get_load() const
-{
-    if (opt::bookkeeping)
-        return expected_load;
-    else
-        return real_load;
-}
-
-inline
-void process::set_load(double load)
-{
-    if (opt::bookkeeping)
-        expected_load = load;
-    else
-        real_load = load;
-}
-
 template <typename Compare>
 void process::pneigh_sort_by_load(const Compare& comp)
 {