2 The software in this package is distributed under the GNU General
3 Public License version 2 (with a special exception described below).
5 A copy of GNU General Public License (GPL) is included in this distribution,
6 in the file COPYING.GPL.
8 As a special exception, if other files instantiate templates or use macros
9 or inline functions from this file, or you compile this file and link it
10 with other works to produce a work based on this file, this file
11 does not by itself cause the resulting work to be covered
12 by the GNU General Public License.
14 However the source code for this file must still be made available
15 in accordance with section (3) of the GNU General Public License.
17 This exception does not invalidate any other reasons why a work based
18 on this file might be covered by the GNU General Public License.
21 * @brief time related functions.
23 * @copyright Copyright © 2001-2008 by Intra2net AG
39 #include <sys/timeb.h>
40 #include <sys/syscall.h>
42 #include <timefunc.hxx>
46 // define missing POSIX.1b constants...
48 #ifndef CLOCK_REALTIME
49 #define CLOCK_REALTIME 0
51 #ifndef CLOCK_MONOTONIC
52 #define CLOCK_MONOTONIC 1
59 double prec_time(void)
66 ret=tb.time+(static_cast<float>(tb.millitm)/1000);
71 // converts ISO-DATE: 2003-06-13
72 int date_to_seconds(const std::string &date)
74 int rtn = -1, year = -1, month = -1, day = -1;
76 string::size_type pos = date.find("-");
77 if (pos == string::npos)
80 istringstream in(string(date,0,pos));
84 string dstr(date, pos+1);
85 if ((pos = dstr.find("-")) == string::npos)
89 in.str(string(dstr, 0, pos));
94 in.str(string(dstr, pos+1));
97 if (year < 0 || month == -1 || day == -1)
101 bzero (&tm_struct, sizeof(struct tm));
102 tm_struct.tm_year = year;
103 tm_struct.tm_mon = month;
104 tm_struct.tm_mday = day;
105 tm_struct.tm_isdst = -1;
107 rtn = mktime (&tm_struct);
111 string make_nice_time(int seconds)
115 int days=seconds/86400;
119 split_daysec(seconds,&hours,&minutes,&seconds);
122 out << i18n("1 day") << ", ";
124 out << days << ' ' << i18n("days") << ", ";
127 out << setw(2) << hours << ':' << setw(2) << minutes << ':' << setw(2) << seconds;
132 string format_full_time(int seconds)
136 struct tm *ta = localtime ((time_t *)&seconds);
138 strftime (buf, 49, "%d.%m.%Y %H:%M", ta);
142 void seconds_to_hour_minute(int seconds, int *hour, int *minute)
146 while (seconds >= 3600) {
152 if (minute != NULL) {
154 while (seconds >= 60) {
162 * Split seconds into hours, minutes and seconds
163 * @param [in] daysec Seconds since start of day
164 * @param [out] outhours hours
165 * @param [out] outminutes minutes
166 * @param [out] outseconds seconds
168 void split_daysec(int daysec, int *outhours, int *outminutes, int *outseconds)
170 int hours=daysec/3600;
173 int minutes=daysec/60;
186 std::string output_hour_minute(int hour, int minute, bool h_for_00, int seconds)
190 if (hour >= 0 && hour < 10)
194 if (!h_for_00 || minute != 0 || seconds > 0)
197 if (minute >= 0 && minute < 10)
207 if (seconds > 0 && seconds < 10)
215 string get_month_name(unsigned char month)
220 rtn = i18n("January");
223 rtn = i18n("February");
241 rtn = i18n("August");
244 rtn = i18n("September");
247 rtn = i18n("October");
250 rtn = i18n("November");
253 rtn = i18n("December");
258 out << i18n("Illegal month:") << " " << month;
268 ** implementaion of Interval
273 * @brief clears the interval (make it empty).
275 void Interval::clear()
277 m_lower_bound = m_upper_bound = 0;
278 } // eo Interval::clear()
282 * @brief tests if there is some overlapping with another interval
283 * @param other the other interval
284 * @return @a true if the two intervals have a non empty intersection.
286 bool Interval::intersects(const Interval& other) const
289 // // other start within this:
290 (other.m_lower_bound >= m_lower_bound and other.m_lower_bound < m_upper_bound )
291 // // other end within this:
292 or (other.m_upper_bound > m_lower_bound and other.m_upper_bound <= m_upper_bound )
293 // // other contains this
294 or (other.m_lower_bound <= m_lower_bound and other.m_upper_bound >= m_upper_bound )
296 } // eo Interval::intersects(const Interval&)
300 * @brief tests if the current interval (fully) contains another one.
301 * @param other the other interval.
302 * @return @a true if the current interval fully contains the other interval.
304 bool Interval::contains(const Interval& other) const
306 return (other.m_lower_bound >= m_lower_bound)
307 and (other.m_upper_bound <= m_upper_bound)
309 } // eo Interval::contains(const Interval& other) const
313 ** implementation of Intervals:
317 Intervals::Intervals()
319 } // eo Intervals::Intervals
322 void Intervals::clear()
325 } // eo Intervals::clear()
328 * @brief tests if one of the intervals of the list intersects with the given interval.
329 * @param other the interval to check for intersection.
330 * @return @a true if there is an intersection.
332 bool Intervals::intersects(const Interval& other) const
334 for(const_iterator it= begin();
338 if ( it->intersects(other) )
344 } // eo Intervals::intersects(const Interval&) const
348 * @brief tests if we have at least one intersection with another Intervals instance.
349 * @param other the other instance.
350 * @return @a true if there is an intersection.
352 bool Intervals::intersects(const Intervals& other) const
354 for(const_iterator it= begin();
358 if ( other.intersects( *it ) )
364 } // eo Intervals::intersects(const Intervals&) const
368 * @brief adds a new interval to the list.
369 * @param new_frame the new interval.
371 * Adds the interval to the list and joins overlapping intervals.
373 * @internal complexity O(n).
375 void Intervals::add(const Interval& new_frame)
377 if (not new_frame.is_valid() or new_frame.empty())
379 // well... we will not insert invalid or empty frames!
382 for (IntervalList::iterator it= m_intervals.begin();
383 it != m_intervals.end();
386 Interval& current_frame = *it;
387 if ( new_frame.m_lower_bound > current_frame.m_upper_bound )
389 // new_frame begins later than current end; go on:
392 // at this point: the begin of the new frame is less then the current end.
393 // now let's determine how we can insert the new frame:
395 if ( new_frame.m_upper_bound < current_frame.m_lower_bound )
397 // new disjoint frame; insert it before the current frame:
398 m_intervals.insert( it, new_frame );
402 // at this point: the end of the new frame is >= current begin.
403 if ( new_frame.m_upper_bound <= current_frame.m_upper_bound )
405 // the end of the new frame is within our current frame; we need to combine
406 if (new_frame.m_lower_bound < current_frame.m_lower_bound)
408 // the new interval starts earlier; we need to adjust our current frame:
409 current_frame.m_lower_bound = new_frame.m_lower_bound;
410 current_frame.m_changed = true;
412 // NOTE no "else" part needed since in that case our current frame already
413 // contains the new one!
418 // at this point: end of new frame > end of current frame
419 // so we need to extend the current frame; at least the end.
420 // But we need to deal with intersects of following frames... *sigh*
422 // first the simple part: let's see if we need to move the start:
423 if ( new_frame.m_lower_bound < current_frame.m_lower_bound)
425 // yes, we need to move the start:
426 current_frame.m_lower_bound = new_frame.m_lower_bound;
427 current_frame.m_changed= true;
430 // now let's extend the end:
431 current_frame.m_upper_bound = new_frame.m_upper_bound;
432 current_frame.m_changed = true;
434 // well... let's walk through the following frames; looking for more joins...:
435 IntervalList::iterator it2 = it;
436 while( ++(it2=it) != m_intervals.end()
437 and current_frame.m_upper_bound >= it2->m_lower_bound
440 Interval next_frame= *it2;
441 if ( current_frame.m_upper_bound < next_frame.m_upper_bound )
443 // in this case our end is within the next frame.
445 current_frame.m_upper_bound = next_frame.m_upper_bound;
447 // and remove the next frame since the current frame contains it (now):
448 m_intervals.erase(it2);
453 // at this point: new frame starts later than the last frame ends
454 // append the new frame:
455 m_intervals.push_back( new_frame );
456 } // eo Intervals::add(const Interval&)
460 * @brief subtracts a time interval from the list.
461 * @param del_frame the time interval to subtract.
463 * removes the time interval from the list; cut off parts from or remove existing
464 * intervals if they overlap.
466 * @internal complexity O(n).
468 void Intervals::sub(const Interval& del_frame)
470 if (not del_frame.is_valid() or del_frame.empty() )
474 for (IntervalList::iterator it= m_intervals.begin();
475 it != m_intervals.end();
478 Interval& current_frame = *it;
479 if ( del_frame.m_lower_bound >= current_frame.m_upper_bound )
481 // del_frame begins later than current end; go on:
485 // at this point: the begin of the del frame is less then the current end.
486 if ( del_frame.m_upper_bound < current_frame.m_lower_bound )
488 // end is before our start; nothing to do.
491 // at this point: the end of the del frame is >= current begin.
492 if ( del_frame.m_upper_bound < current_frame.m_upper_bound )
494 // del frame end point is within our interval.
495 if ( del_frame.m_lower_bound > current_frame.m_lower_bound)
497 // the del frame is within our interval... we need to split:
498 m_intervals.insert(it, Interval( current_frame.m_lower_bound, del_frame.m_lower_bound ) );
500 // adjust start of current frame:
501 if (current_frame.m_lower_bound < del_frame.m_upper_bound)
503 current_frame.m_lower_bound= del_frame.m_upper_bound;
504 current_frame.m_changed= true;
509 // at this point the end of the del frame is >= current end
510 if ( del_frame.m_lower_bound > current_frame.m_lower_bound )
512 // a part of the current interval needs to be preserved..
514 current_frame.m_upper_bound= del_frame.m_lower_bound;
515 current_frame.m_changed= true;
516 // and continue with the next interval:
520 // at this point; the whole frame needs to be deleted..
521 if ( it == m_intervals.begin())
523 m_intervals.erase(it);
524 it= m_intervals.begin();
528 IntervalList::iterator it2= it++;
529 m_intervals.erase(it2);
532 } // eo Intervals::sub(const Interval&)
536 * @brief returns if we contain an interval.
537 * @param other the interval to check.
538 * @return @a true if we cover the given interval, too.
540 bool Intervals::contains(const Interval& other) const
542 for(const_iterator it= begin();
546 if ( it->contains( other ))
552 } // eo Intervals::contains(const Interval&) const
556 * @brief returns if we contain an exact interval.
557 * @param other the interval to check.
558 * @return @a true if we axactly contains the given interval.
560 * @note thsi differs from contain in the way, that we return only @a true
561 * iff we have the given interval in our list; not only cover it.
563 bool Intervals::contains_exact(const Interval& other) const
565 for(const_iterator it= begin();
575 } // eo Intervals::contains_exact(const Interval&)const
579 * @brief returns if we contain another interval combination.
580 * @param other the intervals to check.
581 * @return @a true if we cover the given intervals, too.
583 * @internal we rely on the fact that the lists are sorted and contain
584 * disjoint intervals.
586 * So this method has a complexity of O(n).
588 bool Intervals::contains(const Intervals& other) const
590 const_iterator my_it= begin();
591 const_iterator other_it= other.begin();
592 while( my_it != end() and other_it!= other.end() )
594 // seek the first interval which contains the lower bound of the current other interval
595 while (my_it != end()
596 and my_it->m_lower_bound > other_it->m_lower_bound
597 and other_it->m_lower_bound >= my_it->m_upper_bound
606 if (not my_it->contains( *other_it ))
608 // if we don't contain the current other; we're done:
611 //else check the next other interval:
614 return (other_it == other.end());
615 } // eo Intervals::contains(const Intervals&) const
619 * @brief combines to interval combinates for equality
620 * @param other the other instance.
621 * @return @a true if the other is equal to the current.
623 * @internal since the lists are sorted, we compare the interval lists.
624 * Thus we have a complexity of O(n).
626 bool Intervals::operator==(const Intervals& other) const
628 // since we keep sorted lists: just compare the lists :-)
629 return m_intervals == other.m_intervals;
630 } // eo Intervals::operator==(const Intervals&)
633 Intervals& Intervals::operator+=(const Interval& other)
637 } // eo operator+=(const Interval&)
640 Intervals& Intervals::operator-=(const Interval& other)
644 } // eo operator-=(const Interval&)
648 * @brief adds the intervals of a second instance to us.
649 * @param other the other instance.
650 * @return self reference (allow chaining).
652 * @internal since we do simple loops over the other and our intervals
653 * we have a complexity of O(n^2).
655 * @todo optimize if complexity becomes a problem.
657 Intervals& Intervals::operator+=(const Intervals& other)
659 for(const_iterator it= other.begin();
666 } // eo operator+=(const Intervals&)
670 * @brief subtracts the intervals of a second instance from us.
671 * @param other the other instance.
672 * @return self reference (allow chaining).
674 * @internal since we do simple loops over the other and our intervals
675 * we have a complexity of O(n^2).
677 * @todo optimize if complexity becomes a problem.
679 Intervals& Intervals::operator-=(const Intervals& other)
687 for(const_iterator it= other.begin();
695 } // eo operator-=(const Intervals&)
705 * @brief fetches the value from the monotonic clock source.
706 * @param[out] seconds the seconds.
707 * @param[out] nano_seconds the nano seconds.
708 * @return @a true if the clock was successfully read.
710 bool monotonic_clock_gettime(long int& seconds, long int& nano_seconds)
712 struct timespec tp[1];
713 int res= ::syscall(__NR_clock_gettime, CLOCK_MONOTONIC, tp);
717 nano_seconds= tp->tv_nsec;
720 } // eo monotonic_clock_gettime(long int&,long int&)
724 * @brief fetches the value from the monotonic clock source.
725 * @return the time since system start in nanoseconds, 0 if read was unsuccessful
727 long long monotonic_clock_gettime_nano()
730 long int nano_seconds;
733 if (monotonic_clock_gettime(seconds,nano_seconds))
744 * @brief fetches the value from the monotonic clock source.
745 * @param[out] seconds the seconds.
746 * @param[out] nano_seconds the nano seconds.
747 * @return @a true if the clock was successfully read.
749 bool realtime_clock_gettime(long int& seconds, long int& nano_seconds)
751 struct timespec tp[1];
752 int res= ::syscall(__NR_clock_gettime, CLOCK_REALTIME, tp);
756 nano_seconds= tp->tv_nsec;
759 } // eo realtime_clock_gettime(long int&,long int&)