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