mirror of
https://github.com/freebsd/freebsd-src.git
synced 2026-10-31 21:06:18 +01:00
MFC r309126 (by emaste):
Correct lld llvm-tblgen dependency file name
MFC r309169:
Get rid of separate Subversion mergeinfo properties for llvm-dwarfdump
and llvm-lto. The mergeinfo confuses Subversion enormously, and these
directories will just use the mergeinfo for llvm itself.
MFC r312765:
Pull in r276136 from upstream llvm trunk (by Wei Mi):
Use ValueOffsetPair to enhance value reuse during SCEV expansion.
In D12090, the ExprValueMap was added to reuse existing value during
SCEV expansion. However, const folding and sext/zext distribution can
make the reuse still difficult.
A simplified case is: suppose we know S1 expands to V1 in
ExprValueMap, and
S1 = S2 + C_a
S3 = S2 + C_b
where C_a and C_b are different SCEVConstants. Then we'd like to
expand S3 as V1 - C_a + C_b instead of expanding S2 literally. It is
helpful when S2 is a complex SCEV expr and S2 has no entry in
ExprValueMap, which is usually caused by the fact that S3 is
generated from S1 after const folding.
In order to do that, we represent ExprValueMap as a mapping from SCEV
to ValueOffsetPair. We will save both S1->{V1, 0} and S2->{V1, C_a}
into the ExprValueMap when we create SCEV for V1. When S3 is
expanded, it will first expand S2 to V1 - C_a because of S2->{V1,
C_a} in the map, then expand S3 to V1 - C_a + C_b.
Differential Revision: https://reviews.llvm.org/D21313
This should fix assertion failures when building OpenCV >= 3.1.
PR: 215649
MFC r312831:
Revert r312765 for now, since it causes assertions when building
lang/spidermonkey24.
Reported by: antoine
PR: 215649
MFC r316511 (by jhb):
Add an implementation of __ffssi2() derived from __ffsdi2().
Newer versions of GCC include an __ffssi2() symbol in libgcc and the
compiler can emit calls to it in generated code. This is true for at
least GCC 6.2 when compiling world for mips and mips64.
Reviewed by: jmallett, dim
Sponsored by: DARPA / AFRL
Differential Revision: https://reviews.freebsd.org/D10086
MFC r318601 (by adrian):
[libcompiler-rt] add bswapdi2/bswapsi2
This is required for mips gcc 6.3 userland to build/run.
Reviewed by: emaste, dim
Approved by: emaste
Differential Revision: https://reviews.freebsd.org/D10838
MFC r318884 (by emaste):
lldb: map TRAP_CAP to a trace trap
In the absense of a more specific handler for TRAP_CAP (generated by
ENOTCAPABLE or ECAPMODE while in capability mode) treat it as a trace
trap.
Example usage (testing the bug in PR219173):
% proccontrol -m trapcap lldb usr.bin/hexdump/obj/hexdump -- -Cv -s 1 /bin/ls
...
(lldb) run
Process 12980 launching
Process 12980 launched: '.../usr.bin/hexdump/obj/hexdump' (x86_64)
Process 12980 stopped
* thread #1, stop reason = trace
frame #0: 0x0000004b80c65f1a libc.so.7`__sys_lseek + 10
...
In the future we should have LLDB control the trapcap procctl itself
(as it does with ASLR), as well as report a specific stop reason.
This change eliminates an assertion failure from LLDB for now.
MFC r319796:
Remove a few unneeded files from libllvm, libclang and liblldb.
MFC r319885 (by emaste):
lld: ELF: Fix ICF crash on absolute symbol relocations.
If two sections contained relocations to absolute symbols with the same
value we would crash when trying to access their sections. Add a check that
both symbols point to sections before accessing their sections, and treat
absolute symbols as equal if their values are equal.
Obtained from: LLD commit r292578
MFC r319918:
Revert r319796 for now, it can cause undefined references when linking
in some circumstances.
Reported by: Shawn Webb <[email protected]>
MFC r319957 (by emaste):
lld: Add armelf emulation mode
Obtained from: LLD r305375
MFC r321369:
Upgrade our copies of clang, llvm, lld, lldb, compiler-rt and libc++ to
5.0.0 (trunk r308421). Upstream has branched for the 5.0.0 release,
which should be in about a month. Please report bugs and regressions,
so we can get them into the release.
Please note that from 3.5.0 onwards, clang, llvm and lldb require C++11
support to build; see UPDATING for more information.
MFC r321420:
Add a few more object files to liblldb, which should solve errors when
linking the lldb executable in some cases. In particular, when the
-ffunction-sections -fdata-sections options are turned off, or
ineffective.
Reported by: Shawn Webb, Mark Millard
MFC r321433:
Cleanup stale Options.inc files from the previous libllvm build for
clang 4.0.0. Otherwise, these can get included before the two newly
generated ones (which are different) for clang 5.0.0.
Reported by: Mark Millard
MFC r321439 (by bdrewery):
Move llvm Options.inc hack from r321433 for NO_CLEAN to lib/clang/libllvm.
The files are only ever generated to .OBJDIR, not to WORLDTMP (as a
sysroot) and are only ever included from a compilation. So using
a beforebuild target here removes the file before the compilation
tries to include it.
MFC r321664:
Pull in r308891 from upstream llvm trunk (by Benjamin Kramer):
[CodeGenPrepare] Cut off FindAllMemoryUses if there are too many uses.
This avoids excessive compile time. The case I'm looking at is
Function.cpp from an old version of LLVM that still had the giant
memcmp string matcher in it. Before r308322 this compiled in about 2
minutes, after it, clang takes infinite* time to compile it. With
this patch we're at 5 min, which is still bad but this is a
pathological case.
The cut off at 20 uses was chosen by looking at other cut-offs in LLVM
for user scanning. It's probably too high, but does the job and is
very unlikely to regress anything.
Fixes PR33900.
* I'm impatient and aborted after 15 minutes, on the bug report it was
killed after 2h.
Pull in r308986 from upstream llvm trunk (by Simon Pilgrim):
[X86][CGP] Reduce memcmp() expansion to 2 load pairs (PR33914)
D35067/rL308322 attempted to support up to 4 load pairs for memcmp
inlining which resulted in regressions for some optimized libc memcmp
implementations (PR33914).
Until we can match these more optimal cases, this patch reduces the
memcmp expansion to a maximum of 2 load pairs (which matches what we
do for -Os).
This patch should be considered for the 5.0.0 release branch as well
Differential Revision: https://reviews.llvm.org/D35830
These fix a hang (or extremely long compile time) when building older
LLVM ports.
Reported by: antoine
PR: 219139
MFC r321719:
Pull in r309503 from upstream clang trunk (by Richard Smith):
PR33902: Invalidate line number cache when adding more text to
existing buffer.
This led to crashes as the line number cache would report a bogus
line number for a line of code, and we'd try to find a nonexistent
column within the line when printing diagnostics.
This fixes an assertion when building the graphics/champlain port.
Reported by: antoine, kwm
PR: 219139
MFC r321723:
Upgrade our copies of clang, llvm, lld and lldb to r309439 from the
upstream release_50 branch. This is just after upstream's 5.0.0-rc1.
MFC r322320:
Upgrade our copies of clang, llvm and libc++ to r310316 from the
upstream release_50 branch.
MFC r322326 (by emaste):
lldb: Make i386-*-freebsd expression work on JIT path
* Enable i386 ABI creation for freebsd
* Added an extra argument in ABISysV_i386::PrepareTrivialCall for mmap
syscall
* Unlike linux, the last argument of mmap is actually 64-bit(off_t).
This requires us to push an additional word for the higher order bits.
* Prior to this change, ktrace dump will show mmap failures due to
invalid argument coming from the 6th mmap argument.
Submitted by: Karnajit Wangkhem
Differential Revision: https://reviews.llvm.org/D34776
MFC r322360 (by emaste):
lldb: Report inferior signals as signals, not exceptions, on FreeBSD
This is the FreeBSD equivalent of LLVM r238549.
This serves 2 purposes:
* LLDB should handle inferior process signals SIGSEGV/SIGILL/SIGBUS/
SIGFPE the way it is suppose to be handled. Prior to this fix these
signals will neither create a coredump, nor exit from the debugger
or work for signal handling scenario.
* eInvalidCrashReason need not report "unknown crash reason" if we have
a valid si_signo
llvm.org/pr23699
Patch by Karnajit Wangkhem
Differential Revision: https://reviews.llvm.org/D35223
Submitted by: Karnajit Wangkhem
Obtained from: LLVM r310591
MFC r322474 (by emaste):
lld: Add `-z muldefs` option.
Obtained from: LLVM r310757
MFC r322740:
Upgrade our copies of clang, llvm, lld and libc++ to r311219 from the
upstream release_50 branch.
MFC r322855:
Upgrade our copies of clang, llvm, lldb and compiler-rt to r311606 from
the upstream release_50 branch.
As of this version, lib/msun's trig test should also work correctly
again (see bug 220989 for more information).
PR: 220989
MFC r323112:
Upgrade our copies of clang, llvm, lldb and compiler-rt to r312293 from
the upstream release_50 branch. This corresponds to 5.0.0 rc4.
As of this version, the cad/stepcode port should now compile in a more
reasonable time on i386 (see bug 221836 for more information).
PR: 221836
MFC r323245:
Upgrade our copies of clang, llvm, lld, lldb, compiler-rt and libc++ to
5.0.0 release (upstream r312559).
Release notes for llvm, clang and lld will be available here soon:
<http://releases.llvm.org/5.0.0/docs/ReleaseNotes.html>
<http://releases.llvm.org/5.0.0/tools/clang/docs/ReleaseNotes.html>
<http://releases.llvm.org/5.0.0/tools/lld/docs/ReleaseNotes.html>
Relnotes: yes
528 lines
16 KiB
C++
528 lines
16 KiB
C++
// -*- C++ -*-
|
|
//===---------------------------- ratio -----------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP_RATIO
|
|
#define _LIBCPP_RATIO
|
|
|
|
/*
|
|
ratio synopsis
|
|
|
|
namespace std
|
|
{
|
|
|
|
template <intmax_t N, intmax_t D = 1>
|
|
class ratio
|
|
{
|
|
public:
|
|
static constexpr intmax_t num;
|
|
static constexpr intmax_t den;
|
|
typedef ratio<num, den> type;
|
|
};
|
|
|
|
// ratio arithmetic
|
|
template <class R1, class R2> using ratio_add = ...;
|
|
template <class R1, class R2> using ratio_subtract = ...;
|
|
template <class R1, class R2> using ratio_multiply = ...;
|
|
template <class R1, class R2> using ratio_divide = ...;
|
|
|
|
// ratio comparison
|
|
template <class R1, class R2> struct ratio_equal;
|
|
template <class R1, class R2> struct ratio_not_equal;
|
|
template <class R1, class R2> struct ratio_less;
|
|
template <class R1, class R2> struct ratio_less_equal;
|
|
template <class R1, class R2> struct ratio_greater;
|
|
template <class R1, class R2> struct ratio_greater_equal;
|
|
|
|
// convenience SI typedefs
|
|
typedef ratio<1, 1000000000000000000000000> yocto; // not supported
|
|
typedef ratio<1, 1000000000000000000000> zepto; // not supported
|
|
typedef ratio<1, 1000000000000000000> atto;
|
|
typedef ratio<1, 1000000000000000> femto;
|
|
typedef ratio<1, 1000000000000> pico;
|
|
typedef ratio<1, 1000000000> nano;
|
|
typedef ratio<1, 1000000> micro;
|
|
typedef ratio<1, 1000> milli;
|
|
typedef ratio<1, 100> centi;
|
|
typedef ratio<1, 10> deci;
|
|
typedef ratio< 10, 1> deca;
|
|
typedef ratio< 100, 1> hecto;
|
|
typedef ratio< 1000, 1> kilo;
|
|
typedef ratio< 1000000, 1> mega;
|
|
typedef ratio< 1000000000, 1> giga;
|
|
typedef ratio< 1000000000000, 1> tera;
|
|
typedef ratio< 1000000000000000, 1> peta;
|
|
typedef ratio< 1000000000000000000, 1> exa;
|
|
typedef ratio< 1000000000000000000000, 1> zetta; // not supported
|
|
typedef ratio<1000000000000000000000000, 1> yotta; // not supported
|
|
|
|
// 20.11.5, ratio comparison
|
|
template <class R1, class R2> constexpr bool ratio_equal_v
|
|
= ratio_equal<R1, R2>::value; // C++17
|
|
template <class R1, class R2> constexpr bool ratio_not_equal_v
|
|
= ratio_not_equal<R1, R2>::value; // C++17
|
|
template <class R1, class R2> constexpr bool ratio_less_v
|
|
= ratio_less<R1, R2>::value; // C++17
|
|
template <class R1, class R2> constexpr bool ratio_less_equal_v
|
|
= ratio_less_equal<R1, R2>::value; // C++17
|
|
template <class R1, class R2> constexpr bool ratio_greater_v
|
|
= ratio_greater<R1, R2>::value; // C++17
|
|
template <class R1, class R2> constexpr bool ratio_greater_equal_v
|
|
= ratio_greater_equal<R1, R2>::value; // C++17
|
|
}
|
|
*/
|
|
|
|
#include <__config>
|
|
#include <cstdint>
|
|
#include <climits>
|
|
#include <type_traits>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
// __static_gcd
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
struct __static_gcd
|
|
{
|
|
static const intmax_t value = __static_gcd<_Yp, _Xp % _Yp>::value;
|
|
};
|
|
|
|
template <intmax_t _Xp>
|
|
struct __static_gcd<_Xp, 0>
|
|
{
|
|
static const intmax_t value = _Xp;
|
|
};
|
|
|
|
template <>
|
|
struct __static_gcd<0, 0>
|
|
{
|
|
static const intmax_t value = 1;
|
|
};
|
|
|
|
// __static_lcm
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
struct __static_lcm
|
|
{
|
|
static const intmax_t value = _Xp / __static_gcd<_Xp, _Yp>::value * _Yp;
|
|
};
|
|
|
|
template <intmax_t _Xp>
|
|
struct __static_abs
|
|
{
|
|
static const intmax_t value = _Xp < 0 ? -_Xp : _Xp;
|
|
};
|
|
|
|
template <intmax_t _Xp>
|
|
struct __static_sign
|
|
{
|
|
static const intmax_t value = _Xp == 0 ? 0 : (_Xp < 0 ? -1 : 1);
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp, intmax_t = __static_sign<_Yp>::value>
|
|
class __ll_add;
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_add<_Xp, _Yp, 1>
|
|
{
|
|
static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
|
|
static const intmax_t max = -min;
|
|
|
|
static_assert(_Xp <= max - _Yp, "overflow in __ll_add");
|
|
public:
|
|
static const intmax_t value = _Xp + _Yp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_add<_Xp, _Yp, 0>
|
|
{
|
|
public:
|
|
static const intmax_t value = _Xp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_add<_Xp, _Yp, -1>
|
|
{
|
|
static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
|
|
static const intmax_t max = -min;
|
|
|
|
static_assert(min - _Yp <= _Xp, "overflow in __ll_add");
|
|
public:
|
|
static const intmax_t value = _Xp + _Yp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp, intmax_t = __static_sign<_Yp>::value>
|
|
class __ll_sub;
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_sub<_Xp, _Yp, 1>
|
|
{
|
|
static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
|
|
static const intmax_t max = -min;
|
|
|
|
static_assert(min + _Yp <= _Xp, "overflow in __ll_sub");
|
|
public:
|
|
static const intmax_t value = _Xp - _Yp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_sub<_Xp, _Yp, 0>
|
|
{
|
|
public:
|
|
static const intmax_t value = _Xp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_sub<_Xp, _Yp, -1>
|
|
{
|
|
static const intmax_t min = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1)) + 1;
|
|
static const intmax_t max = -min;
|
|
|
|
static_assert(_Xp <= max + _Yp, "overflow in __ll_sub");
|
|
public:
|
|
static const intmax_t value = _Xp - _Yp;
|
|
};
|
|
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_mul
|
|
{
|
|
static const intmax_t nan = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1));
|
|
static const intmax_t min = nan + 1;
|
|
static const intmax_t max = -min;
|
|
static const intmax_t __a_x = __static_abs<_Xp>::value;
|
|
static const intmax_t __a_y = __static_abs<_Yp>::value;
|
|
|
|
static_assert(_Xp != nan && _Yp != nan && __a_x <= max / __a_y, "overflow in __ll_mul");
|
|
public:
|
|
static const intmax_t value = _Xp * _Yp;
|
|
};
|
|
|
|
template <intmax_t _Yp>
|
|
class __ll_mul<0, _Yp>
|
|
{
|
|
public:
|
|
static const intmax_t value = 0;
|
|
};
|
|
|
|
template <intmax_t _Xp>
|
|
class __ll_mul<_Xp, 0>
|
|
{
|
|
public:
|
|
static const intmax_t value = 0;
|
|
};
|
|
|
|
template <>
|
|
class __ll_mul<0, 0>
|
|
{
|
|
public:
|
|
static const intmax_t value = 0;
|
|
};
|
|
|
|
// Not actually used but left here in case needed in future maintenance
|
|
template <intmax_t _Xp, intmax_t _Yp>
|
|
class __ll_div
|
|
{
|
|
static const intmax_t nan = (1LL << (sizeof(intmax_t) * CHAR_BIT - 1));
|
|
static const intmax_t min = nan + 1;
|
|
static const intmax_t max = -min;
|
|
|
|
static_assert(_Xp != nan && _Yp != nan && _Yp != 0, "overflow in __ll_div");
|
|
public:
|
|
static const intmax_t value = _Xp / _Yp;
|
|
};
|
|
|
|
template <intmax_t _Num, intmax_t _Den = 1>
|
|
class _LIBCPP_TEMPLATE_VIS ratio
|
|
{
|
|
static_assert(__static_abs<_Num>::value >= 0, "ratio numerator is out of range");
|
|
static_assert(_Den != 0, "ratio divide by 0");
|
|
static_assert(__static_abs<_Den>::value > 0, "ratio denominator is out of range");
|
|
static _LIBCPP_CONSTEXPR const intmax_t __na = __static_abs<_Num>::value;
|
|
static _LIBCPP_CONSTEXPR const intmax_t __da = __static_abs<_Den>::value;
|
|
static _LIBCPP_CONSTEXPR const intmax_t __s = __static_sign<_Num>::value * __static_sign<_Den>::value;
|
|
static _LIBCPP_CONSTEXPR const intmax_t __gcd = __static_gcd<__na, __da>::value;
|
|
public:
|
|
static _LIBCPP_CONSTEXPR const intmax_t num = __s * __na / __gcd;
|
|
static _LIBCPP_CONSTEXPR const intmax_t den = __da / __gcd;
|
|
|
|
typedef ratio<num, den> type;
|
|
};
|
|
|
|
template <intmax_t _Num, intmax_t _Den>
|
|
_LIBCPP_CONSTEXPR const intmax_t ratio<_Num, _Den>::num;
|
|
|
|
template <intmax_t _Num, intmax_t _Den>
|
|
_LIBCPP_CONSTEXPR const intmax_t ratio<_Num, _Den>::den;
|
|
|
|
template <class _Tp> struct __is_ratio : false_type {};
|
|
template <intmax_t _Num, intmax_t _Den> struct __is_ratio<ratio<_Num, _Den> > : true_type {};
|
|
|
|
typedef ratio<1LL, 1000000000000000000LL> atto;
|
|
typedef ratio<1LL, 1000000000000000LL> femto;
|
|
typedef ratio<1LL, 1000000000000LL> pico;
|
|
typedef ratio<1LL, 1000000000LL> nano;
|
|
typedef ratio<1LL, 1000000LL> micro;
|
|
typedef ratio<1LL, 1000LL> milli;
|
|
typedef ratio<1LL, 100LL> centi;
|
|
typedef ratio<1LL, 10LL> deci;
|
|
typedef ratio< 10LL, 1LL> deca;
|
|
typedef ratio< 100LL, 1LL> hecto;
|
|
typedef ratio< 1000LL, 1LL> kilo;
|
|
typedef ratio< 1000000LL, 1LL> mega;
|
|
typedef ratio< 1000000000LL, 1LL> giga;
|
|
typedef ratio< 1000000000000LL, 1LL> tera;
|
|
typedef ratio< 1000000000000000LL, 1LL> peta;
|
|
typedef ratio<1000000000000000000LL, 1LL> exa;
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_multiply
|
|
{
|
|
private:
|
|
static const intmax_t __gcd_n1_d2 = __static_gcd<_R1::num, _R2::den>::value;
|
|
static const intmax_t __gcd_d1_n2 = __static_gcd<_R1::den, _R2::num>::value;
|
|
public:
|
|
typedef typename ratio
|
|
<
|
|
__ll_mul<_R1::num / __gcd_n1_d2, _R2::num / __gcd_d1_n2>::value,
|
|
__ll_mul<_R2::den / __gcd_n1_d2, _R1::den / __gcd_d1_n2>::value
|
|
>::type type;
|
|
};
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2> using ratio_multiply
|
|
= typename __ratio_multiply<_R1, _R2>::type;
|
|
|
|
#else // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_multiply
|
|
: public __ratio_multiply<_R1, _R2>::type {};
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_divide
|
|
{
|
|
private:
|
|
static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
|
|
static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
|
|
public:
|
|
typedef typename ratio
|
|
<
|
|
__ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
|
|
__ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
|
|
>::type type;
|
|
};
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2> using ratio_divide
|
|
= typename __ratio_divide<_R1, _R2>::type;
|
|
|
|
#else // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_divide
|
|
: public __ratio_divide<_R1, _R2>::type {};
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_add
|
|
{
|
|
private:
|
|
static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
|
|
static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
|
|
public:
|
|
typedef typename ratio_multiply
|
|
<
|
|
ratio<__gcd_n1_n2, _R1::den / __gcd_d1_d2>,
|
|
ratio
|
|
<
|
|
__ll_add
|
|
<
|
|
__ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
|
|
__ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
|
|
>::value,
|
|
_R2::den
|
|
>
|
|
>::type type;
|
|
};
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2> using ratio_add
|
|
= typename __ratio_add<_R1, _R2>::type;
|
|
|
|
#else // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_add
|
|
: public __ratio_add<_R1, _R2>::type {};
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_subtract
|
|
{
|
|
private:
|
|
static const intmax_t __gcd_n1_n2 = __static_gcd<_R1::num, _R2::num>::value;
|
|
static const intmax_t __gcd_d1_d2 = __static_gcd<_R1::den, _R2::den>::value;
|
|
public:
|
|
typedef typename ratio_multiply
|
|
<
|
|
ratio<__gcd_n1_n2, _R1::den / __gcd_d1_d2>,
|
|
ratio
|
|
<
|
|
__ll_sub
|
|
<
|
|
__ll_mul<_R1::num / __gcd_n1_n2, _R2::den / __gcd_d1_d2>::value,
|
|
__ll_mul<_R2::num / __gcd_n1_n2, _R1::den / __gcd_d1_d2>::value
|
|
>::value,
|
|
_R2::den
|
|
>
|
|
>::type type;
|
|
};
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2> using ratio_subtract
|
|
= typename __ratio_subtract<_R1, _R2>::type;
|
|
|
|
#else // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_subtract
|
|
: public __ratio_subtract<_R1, _R2>::type {};
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
// ratio_equal
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_equal
|
|
: public _LIBCPP_BOOL_CONSTANT((_R1::num == _R2::num && _R1::den == _R2::den)) {};
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_not_equal
|
|
: public _LIBCPP_BOOL_CONSTANT((!ratio_equal<_R1, _R2>::value)) {};
|
|
|
|
// ratio_less
|
|
|
|
template <class _R1, class _R2, bool _Odd = false,
|
|
intmax_t _Q1 = _R1::num / _R1::den, intmax_t _M1 = _R1::num % _R1::den,
|
|
intmax_t _Q2 = _R2::num / _R2::den, intmax_t _M2 = _R2::num % _R2::den>
|
|
struct __ratio_less1
|
|
{
|
|
static const bool value = _Odd ? _Q2 < _Q1 : _Q1 < _Q2;
|
|
};
|
|
|
|
template <class _R1, class _R2, bool _Odd, intmax_t _Qp>
|
|
struct __ratio_less1<_R1, _R2, _Odd, _Qp, 0, _Qp, 0>
|
|
{
|
|
static const bool value = false;
|
|
};
|
|
|
|
template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M2>
|
|
struct __ratio_less1<_R1, _R2, _Odd, _Qp, 0, _Qp, _M2>
|
|
{
|
|
static const bool value = !_Odd;
|
|
};
|
|
|
|
template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M1>
|
|
struct __ratio_less1<_R1, _R2, _Odd, _Qp, _M1, _Qp, 0>
|
|
{
|
|
static const bool value = _Odd;
|
|
};
|
|
|
|
template <class _R1, class _R2, bool _Odd, intmax_t _Qp, intmax_t _M1,
|
|
intmax_t _M2>
|
|
struct __ratio_less1<_R1, _R2, _Odd, _Qp, _M1, _Qp, _M2>
|
|
{
|
|
static const bool value = __ratio_less1<ratio<_R1::den, _M1>,
|
|
ratio<_R2::den, _M2>, !_Odd>::value;
|
|
};
|
|
|
|
template <class _R1, class _R2, intmax_t _S1 = __static_sign<_R1::num>::value,
|
|
intmax_t _S2 = __static_sign<_R2::num>::value>
|
|
struct __ratio_less
|
|
{
|
|
static const bool value = _S1 < _S2;
|
|
};
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_less<_R1, _R2, 1LL, 1LL>
|
|
{
|
|
static const bool value = __ratio_less1<_R1, _R2>::value;
|
|
};
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_less<_R1, _R2, -1LL, -1LL>
|
|
{
|
|
static const bool value = __ratio_less1<ratio<-_R2::num, _R2::den>, ratio<-_R1::num, _R1::den> >::value;
|
|
};
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_less
|
|
: public _LIBCPP_BOOL_CONSTANT((__ratio_less<_R1, _R2>::value)) {};
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_less_equal
|
|
: public _LIBCPP_BOOL_CONSTANT((!ratio_less<_R2, _R1>::value)) {};
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_greater
|
|
: public _LIBCPP_BOOL_CONSTANT((ratio_less<_R2, _R1>::value)) {};
|
|
|
|
template <class _R1, class _R2>
|
|
struct _LIBCPP_TEMPLATE_VIS ratio_greater_equal
|
|
: public _LIBCPP_BOOL_CONSTANT((!ratio_less<_R1, _R2>::value)) {};
|
|
|
|
template <class _R1, class _R2>
|
|
struct __ratio_gcd
|
|
{
|
|
typedef ratio<__static_gcd<_R1::num, _R2::num>::value,
|
|
__static_lcm<_R1::den, _R2::den>::value> type;
|
|
};
|
|
|
|
#if _LIBCPP_STD_VER > 14 && !defined(_LIBCPP_HAS_NO_VARIABLE_TEMPLATES)
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_equal_v
|
|
= ratio_equal<_R1, _R2>::value;
|
|
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_not_equal_v
|
|
= ratio_not_equal<_R1, _R2>::value;
|
|
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_less_v
|
|
= ratio_less<_R1, _R2>::value;
|
|
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_less_equal_v
|
|
= ratio_less_equal<_R1, _R2>::value;
|
|
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_greater_v
|
|
= ratio_greater<_R1, _R2>::value;
|
|
|
|
template <class _R1, class _R2> _LIBCPP_CONSTEXPR bool ratio_greater_equal_v
|
|
= ratio_greater_equal<_R1, _R2>::value;
|
|
#endif
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP_RATIO
|