OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * |
| 3 * Copyright 2015, Google Inc. |
| 4 * All rights reserved. |
| 5 * |
| 6 * Redistribution and use in source and binary forms, with or without |
| 7 * modification, are permitted provided that the following conditions are |
| 8 * met: |
| 9 * |
| 10 * * Redistributions of source code must retain the above copyright |
| 11 * notice, this list of conditions and the following disclaimer. |
| 12 * * Redistributions in binary form must reproduce the above |
| 13 * copyright notice, this list of conditions and the following disclaimer |
| 14 * in the documentation and/or other materials provided with the |
| 15 * distribution. |
| 16 * * Neither the name of Google Inc. nor the names of its |
| 17 * contributors may be used to endorse or promote products derived from |
| 18 * this software without specific prior written permission. |
| 19 * |
| 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 31 * |
| 32 */ |
| 33 |
| 34 #include <grpc++/support/config.h> |
| 35 |
| 36 #ifndef GRPC_CXX0X_NO_CHRONO |
| 37 |
| 38 #include <grpc/support/time.h> |
| 39 #include <grpc++/support/time.h> |
| 40 |
| 41 using std::chrono::duration_cast; |
| 42 using std::chrono::nanoseconds; |
| 43 using std::chrono::seconds; |
| 44 using std::chrono::system_clock; |
| 45 using std::chrono::high_resolution_clock; |
| 46 |
| 47 namespace grpc { |
| 48 |
| 49 void Timepoint2Timespec(const system_clock::time_point& from, |
| 50 gpr_timespec* to) { |
| 51 system_clock::duration deadline = from.time_since_epoch(); |
| 52 seconds secs = duration_cast<seconds>(deadline); |
| 53 if (from == system_clock::time_point::max() || |
| 54 secs.count() >= gpr_inf_future(GPR_CLOCK_REALTIME).tv_sec || |
| 55 secs.count() < 0) { |
| 56 *to = gpr_inf_future(GPR_CLOCK_REALTIME); |
| 57 return; |
| 58 } |
| 59 nanoseconds nsecs = duration_cast<nanoseconds>(deadline - secs); |
| 60 to->tv_sec = (int64_t)secs.count(); |
| 61 to->tv_nsec = (int32_t)nsecs.count(); |
| 62 to->clock_type = GPR_CLOCK_REALTIME; |
| 63 } |
| 64 |
| 65 void TimepointHR2Timespec(const high_resolution_clock::time_point& from, |
| 66 gpr_timespec* to) { |
| 67 high_resolution_clock::duration deadline = from.time_since_epoch(); |
| 68 seconds secs = duration_cast<seconds>(deadline); |
| 69 if (from == high_resolution_clock::time_point::max() || |
| 70 secs.count() >= gpr_inf_future(GPR_CLOCK_REALTIME).tv_sec || |
| 71 secs.count() < 0) { |
| 72 *to = gpr_inf_future(GPR_CLOCK_REALTIME); |
| 73 return; |
| 74 } |
| 75 nanoseconds nsecs = duration_cast<nanoseconds>(deadline - secs); |
| 76 to->tv_sec = (int64_t)secs.count(); |
| 77 to->tv_nsec = (int32_t)nsecs.count(); |
| 78 to->clock_type = GPR_CLOCK_REALTIME; |
| 79 } |
| 80 |
| 81 system_clock::time_point Timespec2Timepoint(gpr_timespec t) { |
| 82 if (gpr_time_cmp(t, gpr_inf_future(t.clock_type)) == 0) { |
| 83 return system_clock::time_point::max(); |
| 84 } |
| 85 t = gpr_convert_clock_type(t, GPR_CLOCK_REALTIME); |
| 86 system_clock::time_point tp; |
| 87 tp += duration_cast<system_clock::time_point::duration>(seconds(t.tv_sec)); |
| 88 tp += |
| 89 duration_cast<system_clock::time_point::duration>(nanoseconds(t.tv_nsec)); |
| 90 return tp; |
| 91 } |
| 92 |
| 93 } // namespace grpc |
| 94 |
| 95 #endif // !GRPC_CXX0X_NO_CHRONO |
OLD | NEW |