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, 234107 (2008). |
39 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
40 |
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
41 |
*/ |
42 |
|
43 |
#ifdef IS_MPI |
44 |
#include <mpi.h> |
45 |
#endif |
46 |
|
47 |
#include <iostream> |
48 |
#include <cstdlib> |
49 |
|
50 |
#ifdef _MSC_VER |
51 |
#include <Windows.h> |
52 |
#include <stdio.h> |
53 |
#include <io.h> |
54 |
#define isatty _isatty |
55 |
#define fileno _fileno |
56 |
#else |
57 |
#include <cstdio> |
58 |
#include <sys/ioctl.h> |
59 |
#include <unistd.h> |
60 |
#endif |
61 |
|
62 |
#include "utils/ProgressBar.hpp" |
63 |
|
64 |
using namespace std; |
65 |
|
66 |
namespace OpenMD { |
67 |
|
68 |
const char * progressSpinner_ = "|/-\\"; |
69 |
|
70 |
ProgressBar::ProgressBar() : value_(0.0), maximum_(-1.0), iteration_(0), start_(time(NULL)) { |
71 |
} |
72 |
|
73 |
void ProgressBar::clear() { |
74 |
#ifdef IS_MPI |
75 |
int myRank; |
76 |
MPI_Comm_rank( MPI_COMM_WORLD, &myRank); |
77 |
if (myRank == 0) { |
78 |
#endif |
79 |
cout << endl; |
80 |
cout.flush(); |
81 |
#ifdef IS_MPI |
82 |
} |
83 |
#endif |
84 |
iteration_ = 0; |
85 |
value_ = 0; |
86 |
maximum_ = -1; |
87 |
start_ = time(NULL); |
88 |
} |
89 |
|
90 |
void ProgressBar::update() { |
91 |
|
92 |
#ifdef IS_MPI |
93 |
int myRank; |
94 |
MPI_Comm_rank( MPI_COMM_WORLD, &myRank); |
95 |
if (myRank == 0) { |
96 |
#endif |
97 |
|
98 |
// only do the progress bar if we are actually running in a tty: |
99 |
if (isatty(fileno(stdout)) && (getenv("SGE_TASK_ID")==NULL)) { |
100 |
// get the window width: |
101 |
|
102 |
int width = 0; |
103 |
#ifdef _MSC_VER |
104 |
CONSOLE_SCREEN_BUFFER_INFO csbi; |
105 |
HANDLE hConsole = GetStdHandle( STD_OUTPUT_HANDLE ); |
106 |
int ret = GetConsoleScreenBufferInfo(hConsole, &csbi); |
107 |
if(ret) { |
108 |
width = csbi.dwSize.X - 1; |
109 |
} |
110 |
#else |
111 |
struct winsize w; |
112 |
ioctl(fileno(stdout), TIOCGWINSZ, &w); |
113 |
width = w.ws_col; |
114 |
#endif |
115 |
|
116 |
// handle the case when the width is returned as a nonsensical value. |
117 |
if (width <= 0) width = 80; |
118 |
|
119 |
// We'll use: |
120 |
// 31 characters for the completion estimate, |
121 |
// 6 for the % complete, |
122 |
// 2 characters for the open and closing brackets. |
123 |
|
124 |
int avail = width - 31 - 6 - 2; |
125 |
|
126 |
++iteration_; |
127 |
|
128 |
if (maximum_ > 0.0) { |
129 |
|
130 |
// we know the maximum, so draw a progress bar |
131 |
|
132 |
RealType percent = value_ * 100.0 / maximum_; |
133 |
int hashes = int(percent * avail / 100.0); |
134 |
|
135 |
// compute the best estimate of the ending time: |
136 |
time_t current_ = time(NULL); |
137 |
time_t end_ = static_cast<time_t>(start_ + (current_ - start_) * |
138 |
(100.0/percent) ); |
139 |
struct tm * ender = localtime(&end_); |
140 |
char buffer[22]; |
141 |
strftime(buffer, 22, "%a %b %d @ %I:%M %p", ender); |
142 |
|
143 |
#ifdef _MSC_VER |
144 |
csbi.dwCursorPosition.X = 0; |
145 |
SetConsoleCursorPosition(hConsole, csbi.dwCursorPosition); |
146 |
#else |
147 |
cout << '\r'; |
148 |
#endif |
149 |
cout.width(3); |
150 |
cout << right << int(percent); |
151 |
cout.width(3); |
152 |
cout << "% ["; |
153 |
cout.fill('#'); |
154 |
if (hashes+1 < avail) { |
155 |
cout.width(hashes+1); |
156 |
cout << progressSpinner_[iteration_ & 3]; |
157 |
} else { |
158 |
cout.width(avail); |
159 |
cout << '#'; |
160 |
} |
161 |
cout.fill(' '); |
162 |
if (avail - hashes - 1 > 0) { |
163 |
cout.width(avail - hashes - 1); |
164 |
cout << ' '; |
165 |
} |
166 |
cout.width(11); |
167 |
cout << "] Estimate:"; |
168 |
cout.width(22); |
169 |
cout << buffer; |
170 |
|
171 |
} |
172 |
cout.flush(); |
173 |
} |
174 |
#ifdef IS_MPI |
175 |
} |
176 |
#endif |
177 |
} |
178 |
|
179 |
void ProgressBar::setStatus(RealType val, RealType max) { |
180 |
value_ = val; |
181 |
maximum_ = max; |
182 |
} |
183 |
} |