src/utils/ProgressBar.cpp

/*
 * Copyright (c) 2010 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. 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 "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).          
 * [4]  Vardeman, Stocker & Gezelter, in progress (2010).                        
 */

#include <iostream>
#include <stdio.h>
#include <cstdlib>
#include <sys/ioctl.h>
#ifdef IS_MPI
#include <mpi.h>
#endif
#include "utils/ProgressBar.hpp"

using namespace std;

namespace OpenMD {

  const char * progressSpinner_ = "|/-\\";

  ProgressBar::ProgressBar() : value_(0.0), maximum_(-1.0), iteration_(0), start_(time(NULL)) {
  }
  
  void ProgressBar::clear() {
#ifdef IS_MPI
    if (MPI::COMM_WORLD.Get_rank() == 0) {
#endif
      cout << endl;
      cout.flush();
#ifdef IS_MPI
    }
#endif
    iteration_ = 0;
    value_ = 0;
    maximum_ = -1;
    start_ = time(NULL);
  }
  
  void ProgressBar::update() {

    int width;

#ifdef IS_MPI
    if (MPI::COMM_WORLD.Get_rank() == 0) {
#endif
      
      // only do the progress bar if we are actually running in a tty:
      if (isatty(fileno(stdout))  && (getenv("SGE_TASK_ID")==NULL)) {     
        // get the window width:
        struct winsize w;
        ioctl(fileno(stdout), TIOCGWINSZ, &w);
        width = w.ws_col;

        // handle the case when the width is returned as a nonsensical value.
        if (width <= 0) width = 80;

        // We'll use:
        // 31 characters for the completion estimate, 
        //  6 for the % complete, 
        //  2 characters for the open and closing brackets.
        
        int avail = width - 31 - 6 - 2;       

        ++iteration_;

        if (maximum_ > 0.0) {

          // we know the maximum, so draw a progress bar
          
          RealType percent = value_ * 100.0 / maximum_;
          int hashes = int(percent * avail / 100.0);
          
          // compute the best estimate of the ending time:
          time_t current_ = time(NULL);
          time_t end_ = start_ + (current_ - start_) * (100.0/percent);
          struct tm * ender = localtime(&end_);
          char buffer[22];
          strftime(buffer, 22, "%a %b %d @ %I:%M %p", ender);
          
          cout << '\r';
          cout.width(3); 
          cout << right << int(percent);
          cout.width(3); 
          cout << "% [";
          cout.fill('#');
          if (hashes+1 < avail) {
            cout.width(hashes+1); 
            cout << progressSpinner_[iteration_ & 3];
          } else {
            cout.width(avail);
            cout << '#';            
          }
          cout.fill(' ');
          if (avail - hashes - 1  > 0) {
            cout.width(avail - hashes - 1);
            cout << ' ';
          }
          cout.width(11);
          cout << "] Estimate:";
          cout.width(22);
          cout << buffer;
                   
        }
        cout.flush();
      }
#ifdef IS_MPI
    }
#endif
  }
  
  void ProgressBar::setStatus(RealType val, RealType max) {
    value_ = val;
    maximum_ = max;
  }  
}
Revision:	1595
Committed:	Tue Jul 19 18:50:04 2011 UTC (13 years, 9 months ago) by chuckv
File size:	4867 byte(s)
Log Message:	Adding initial OpenMP support using new neighbor lists.
#	Content
1	/*
2	* Copyright (c) 2010 The University of Notre Dame. All Rights Reserved.
3	*
4	* The University of Notre Dame grants you ("Licensee") a
5	* non-exclusive, royalty free, license to use, modify and
6	* redistribute this software in source and binary code form, provided
7	* that the following conditions are met:
8	*
9	* 1. Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.
11	*
12	* 2. Redistributions in binary form must reproduce the above copyright
13	* notice, this list of conditions and the following disclaimer in the
14	* documentation and/or other materials provided with the
15	* distribution.
16	*
17	* This software is provided "AS IS," without a warranty of any
18	* kind. All express or implied conditions, representations and
19	* warranties, including any implied warranty of merchantability,
20	* fitness for a particular purpose or non-infringement, are hereby
21	* excluded. The University of Notre Dame and its licensors shall not
22	* be liable for any damages suffered by licensee as a result of
23	* using, modifying or distributing the software or its
24	* derivatives. In no event will the University of Notre Dame or its
25	* licensors be liable for any lost revenue, profit or data, or for
26	* direct, indirect, special, consequential, incidental or punitive
27	* damages, however caused and regardless of the theory of liability,
28	* arising out of the use of or inability to use software, even if the
29	* University of Notre Dame has been advised of the possibility of
30	* such damages.
31	*
32	* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your
33	* research, please cite the appropriate papers when you publish your
34	* work. Good starting points are:
35	*
36	* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37	* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38	* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39	* [4] Vardeman, Stocker & Gezelter, in progress (2010).
40	*/
41
42	#include <iostream>
43	#include <stdio.h>
44	#include <cstdlib>
45	#include <sys/ioctl.h>
46	#ifdef IS_MPI
47	#include <mpi.h>
48	#endif
49	#include "utils/ProgressBar.hpp"
50
51	using namespace std;
52
53	namespace OpenMD {
54
55	const char * progressSpinner_ = "\|/-\\";
56
57	ProgressBar::ProgressBar() : value_(0.0), maximum_(-1.0), iteration_(0), start_(time(NULL)) {
58	}
59
60	void ProgressBar::clear() {
61	#ifdef IS_MPI
62	if (MPI::COMM_WORLD.Get_rank() == 0) {
63	#endif
64	cout << endl;
65	cout.flush();
66	#ifdef IS_MPI
67	}
68	#endif
69	iteration_ = 0;
70	value_ = 0;
71	maximum_ = -1;
72	start_ = time(NULL);
73	}
74
75	void ProgressBar::update() {
76
77	int width;
78
79	#ifdef IS_MPI
80	if (MPI::COMM_WORLD.Get_rank() == 0) {
81	#endif
82
83	// only do the progress bar if we are actually running in a tty:
84	if (isatty(fileno(stdout)) && (getenv("SGE_TASK_ID")==NULL)) {
85	// get the window width:
86	struct winsize w;
87	ioctl(fileno(stdout), TIOCGWINSZ, &w);
88	width = w.ws_col;
89
90	// handle the case when the width is returned as a nonsensical value.
91	if (width <= 0) width = 80;
92
93	// We'll use:
94	// 31 characters for the completion estimate,
95	// 6 for the % complete,
96	// 2 characters for the open and closing brackets.
97
98	int avail = width - 31 - 6 - 2;
99
100	++iteration_;
101
102	if (maximum_ > 0.0) {
103
104	// we know the maximum, so draw a progress bar
105
106	RealType percent = value_ * 100.0 / maximum_;
107	int hashes = int(percent * avail / 100.0);
108
109	// compute the best estimate of the ending time:
110	time_t current_ = time(NULL);
111	time_t end_ = start_ + (current_ - start_) * (100.0/percent);
112	struct tm * ender = localtime(&end_);
113	char buffer[22];
114	strftime(buffer, 22, "%a %b %d @ %I:%M %p", ender);
115
116	cout << '\r';
117	cout.width(3);
118	cout << right << int(percent);
119	cout.width(3);
120	cout << "% [";
121	cout.fill('#');
122	if (hashes+1 < avail) {
123	cout.width(hashes+1);
124	cout << progressSpinner_[iteration_ & 3];
125	} else {
126	cout.width(avail);
127	cout << '#';
128	}
129	cout.fill(' ');
130	if (avail - hashes - 1 > 0) {
131	cout.width(avail - hashes - 1);
132	cout << ' ';
133	}
134	cout.width(11);
135	cout << "] Estimate:";
136	cout.width(22);
137	cout << buffer;
138
139	}
140	cout.flush();
141	}
142	#ifdef IS_MPI
143	}
144	#endif
145	}
146
147	void ProgressBar::setStatus(RealType val, RealType max) {
148	value_ = val;
149	maximum_ = max;
150	}
151	}