| 39 |
|
* [4] Vardeman, Stocker & Gezelter, in progress (2010). |
| 40 |
|
*/ |
| 41 |
|
|
| 42 |
< |
#include <string> |
| 43 |
< |
#include <sstream> |
| 42 |
> |
#include <iostream> |
| 43 |
> |
#include <cstdlib> |
| 44 |
> |
#include <cstdio> |
| 45 |
|
#include <sys/ioctl.h> |
| 46 |
+ |
#include <unistd.h> |
| 47 |
|
#ifdef IS_MPI |
| 48 |
|
#include <mpi.h> |
| 49 |
< |
#endif //is_mpi |
| 49 |
> |
#endif |
| 50 |
|
#include "utils/ProgressBar.hpp" |
| 51 |
|
|
| 52 |
+ |
using namespace std; |
| 53 |
+ |
|
| 54 |
|
namespace OpenMD { |
| 55 |
|
|
| 56 |
|
const char * progressSpinner_ = "|/-\\"; |
| 62 |
|
#ifdef IS_MPI |
| 63 |
|
if (MPI::COMM_WORLD.Get_rank() == 0) { |
| 64 |
|
#endif |
| 65 |
< |
printf("\n"); |
| 66 |
< |
fflush(stdout); |
| 65 |
> |
cout << endl; |
| 66 |
> |
cout.flush(); |
| 67 |
|
#ifdef IS_MPI |
| 68 |
|
} |
| 69 |
|
#endif |
| 74 |
|
} |
| 75 |
|
|
| 76 |
|
void ProgressBar::update() { |
| 77 |
< |
int width = 80; |
| 77 |
> |
|
| 78 |
> |
int width; |
| 79 |
> |
|
| 80 |
|
#ifdef IS_MPI |
| 81 |
|
if (MPI::COMM_WORLD.Get_rank() == 0) { |
| 82 |
|
#endif |
| 77 |
– |
#ifndef IS_MPI |
| 78 |
– |
// get the window width: |
| 79 |
– |
struct winsize w; |
| 80 |
– |
ioctl(STDOUT_FILENO, TIOCGWINSZ, &w); |
| 81 |
– |
width = w.ws_col; |
| 82 |
– |
#endif |
| 83 |
– |
|
| 84 |
– |
// We'll use: |
| 85 |
– |
// 31 characters for the completion estimate, |
| 86 |
– |
// 6 for the % complete, |
| 87 |
– |
// 2 characters for the open and closing brackets. |
| 88 |
– |
|
| 89 |
– |
int avail = width - 31 - 6 - 2; |
| 90 |
– |
|
| 91 |
– |
++iteration_; |
| 92 |
– |
|
| 93 |
– |
if (maximum_ > 0.0) { |
| 94 |
– |
// we know the maximum, so |
| 95 |
– |
// draw a progress bar |
| 83 |
|
|
| 84 |
< |
RealType percent = value_ * 100.0 / maximum_; |
| 85 |
< |
int hashes = int(percent * avail / 100.0); |
| 86 |
< |
std::string progressbar; |
| 87 |
< |
progressbar.assign(hashes, '#'); |
| 84 |
> |
// only do the progress bar if we are actually running in a tty: |
| 85 |
> |
if (isatty(fileno(stdout)) && (getenv("SGE_TASK_ID")==NULL)) { |
| 86 |
> |
// get the window width: |
| 87 |
> |
struct winsize w; |
| 88 |
> |
ioctl(fileno(stdout), TIOCGWINSZ, &w); |
| 89 |
> |
width = w.ws_col; |
| 90 |
|
|
| 91 |
< |
// add the spinner to the end of the progress bar: |
| 92 |
< |
progressbar += progressSpinner_[iteration_ & 3]; |
| 91 |
> |
// handle the case when the width is returned as a nonsensical value. |
| 92 |
> |
if (width <= 0) width = 80; |
| 93 |
|
|
| 94 |
< |
// compute the best estimate of the ending time: |
| 95 |
< |
time_t current_ = time(NULL); |
| 96 |
< |
time_t end_ = start_ + (current_ - start_) * (100.0/percent); |
| 97 |
< |
struct tm * ender = localtime(&end_); |
| 98 |
< |
char buffer[24]; |
| 99 |
< |
strftime(buffer, 24, "%a %b %d @ %I:%M %p", ender); |
| 94 |
> |
// We'll use: |
| 95 |
> |
// 31 characters for the completion estimate, |
| 96 |
> |
// 6 for the % complete, |
| 97 |
> |
// 2 characters for the open and closing brackets. |
| 98 |
> |
|
| 99 |
> |
int avail = width - 31 - 6 - 2; |
| 100 |
|
|
| 101 |
< |
std::stringstream fmt; |
| 113 |
< |
fmt << "\r%3d%% [%-" << avail << "s] Estimate: %s"; |
| 114 |
< |
std::string st = fmt.str(); |
| 101 |
> |
++iteration_; |
| 102 |
|
|
| 103 |
< |
printf(st.c_str(), int(percent), |
| 117 |
< |
progressbar.c_str(), |
| 118 |
< |
buffer); |
| 103 |
> |
if (maximum_ > 0.0) { |
| 104 |
|
|
| 105 |
< |
} else { |
| 106 |
< |
// we don't know the maximum, so we can't draw a progress bar |
| 107 |
< |
int center = (iteration_ % 48) + 1; // 50 spaces, minus 2 |
| 108 |
< |
std::string before; |
| 109 |
< |
std::string after; |
| 110 |
< |
before.assign(std::max(center - 2, 0), ' '); |
| 111 |
< |
after.assign(std::min(center + 2, 50), ' '); |
| 112 |
< |
|
| 113 |
< |
printf("\r[%s###%s] ", |
| 114 |
< |
before.c_str(), after.c_str()); |
| 115 |
< |
} |
| 116 |
< |
fflush(stdout); |
| 105 |
> |
// we know the maximum, so draw a progress bar |
| 106 |
> |
|
| 107 |
> |
RealType percent = value_ * 100.0 / maximum_; |
| 108 |
> |
int hashes = int(percent * avail / 100.0); |
| 109 |
> |
|
| 110 |
> |
// compute the best estimate of the ending time: |
| 111 |
> |
time_t current_ = time(NULL); |
| 112 |
> |
time_t end_ = start_ + (current_ - start_) * (100.0/percent); |
| 113 |
> |
struct tm * ender = localtime(&end_); |
| 114 |
> |
char buffer[22]; |
| 115 |
> |
strftime(buffer, 22, "%a %b %d @ %I:%M %p", ender); |
| 116 |
> |
|
| 117 |
> |
cout << '\r'; |
| 118 |
> |
cout.width(3); |
| 119 |
> |
cout << right << int(percent); |
| 120 |
> |
cout.width(3); |
| 121 |
> |
cout << "% ["; |
| 122 |
> |
cout.fill('#'); |
| 123 |
> |
if (hashes+1 < avail) { |
| 124 |
> |
cout.width(hashes+1); |
| 125 |
> |
cout << progressSpinner_[iteration_ & 3]; |
| 126 |
> |
} else { |
| 127 |
> |
cout.width(avail); |
| 128 |
> |
cout << '#'; |
| 129 |
> |
} |
| 130 |
> |
cout.fill(' '); |
| 131 |
> |
if (avail - hashes - 1 > 0) { |
| 132 |
> |
cout.width(avail - hashes - 1); |
| 133 |
> |
cout << ' '; |
| 134 |
> |
} |
| 135 |
> |
cout.width(11); |
| 136 |
> |
cout << "] Estimate:"; |
| 137 |
> |
cout.width(22); |
| 138 |
> |
cout << buffer; |
| 139 |
> |
|
| 140 |
> |
} |
| 141 |
> |
cout.flush(); |
| 142 |
> |
} |
| 143 |
|
#ifdef IS_MPI |
| 144 |
|
} |
| 145 |
|
#endif |
