| /* | |
| * | |
| * Copyright 2015, Google Inc. | |
| * All rights reserved. | |
| * | |
| * Redistribution and use in source and binary forms, with or without | |
| * modification, are permitted provided that the following conditions are | |
| * met: | |
| * | |
| * * Redistributions of source code must retain the above copyright | |
| * notice, this list of conditions and the following disclaimer. | |
| * * Redistributions in binary form must reproduce the above | |
| * copyright notice, this list of conditions and the following disclaimer | |
| * in the documentation and/or other materials provided with the | |
| * distribution. | |
| * * Neither the name of Google Inc. nor the names of its | |
| * contributors may be used to endorse or promote products derived from | |
| * this software without specific prior written permission. | |
| * | |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| * | |
| */ | |
| #include <grpc++/support/config.h> | |
| #ifndef GRPC_CXX0X_NO_CHRONO | |
| #include <grpc/support/time.h> | |
| #include <grpc++/support/time.h> | |
| using std::chrono::duration_cast; | |
| using std::chrono::nanoseconds; | |
| using std::chrono::seconds; | |
| using std::chrono::system_clock; | |
| using std::chrono::high_resolution_clock; | |
| namespace grpc { | |
| void Timepoint2Timespec(const system_clock::time_point& from, | |
| gpr_timespec* to) { | |
| system_clock::duration deadline = from.time_since_epoch(); | |
| seconds secs = duration_cast<seconds>(deadline); | |
| if (from == system_clock::time_point::max() || | |
| secs.count() >= gpr_inf_future(GPR_CLOCK_REALTIME).tv_sec || | |
| secs.count() < 0) { | |
| *to = gpr_inf_future(GPR_CLOCK_REALTIME); | |
| return; | |
| } | |
| nanoseconds nsecs = duration_cast<nanoseconds>(deadline - secs); | |
| to->tv_sec = (int64_t)secs.count(); | |
| to->tv_nsec = (int32_t)nsecs.count(); | |
| to->clock_type = GPR_CLOCK_REALTIME; | |
| } | |
| void TimepointHR2Timespec(const high_resolution_clock::time_point& from, | |
| gpr_timespec* to) { | |
| high_resolution_clock::duration deadline = from.time_since_epoch(); | |
| seconds secs = duration_cast<seconds>(deadline); | |
| if (from == high_resolution_clock::time_point::max() || | |
| secs.count() >= gpr_inf_future(GPR_CLOCK_REALTIME).tv_sec || | |
| secs.count() < 0) { | |
| *to = gpr_inf_future(GPR_CLOCK_REALTIME); | |
| return; | |
| } | |
| nanoseconds nsecs = duration_cast<nanoseconds>(deadline - secs); | |
| to->tv_sec = (int64_t)secs.count(); | |
| to->tv_nsec = (int32_t)nsecs.count(); | |
| to->clock_type = GPR_CLOCK_REALTIME; | |
| } | |
| system_clock::time_point Timespec2Timepoint(gpr_timespec t) { | |
| if (gpr_time_cmp(t, gpr_inf_future(t.clock_type)) == 0) { | |
| return system_clock::time_point::max(); | |
| } | |
| t = gpr_convert_clock_type(t, GPR_CLOCK_REALTIME); | |
| system_clock::time_point tp; | |
| tp += duration_cast<system_clock::time_point::duration>(seconds(t.tv_sec)); | |
| tp += | |
| duration_cast<system_clock::time_point::duration>(nanoseconds(t.tv_nsec)); | |
| return tp; | |
| } | |
| } // namespace grpc | |
| #endif // !GRPC_CXX0X_NO_CHRONO |