From patchwork Mon Jan 4 12:25:24 2021 Content-Type: text/plain; charset="utf-8" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Patchwork-Submitter: Wilco Dijkstra X-Patchwork-Id: 41623 Return-Path: X-Original-To: patchwork@sourceware.org Delivered-To: patchwork@sourceware.org Received: from server2.sourceware.org (localhost [IPv6:::1]) by sourceware.org (Postfix) with ESMTP id 723DE3857C6F; Mon, 4 Jan 2021 12:25:50 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 723DE3857C6F DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=sourceware.org; s=default; t=1609763150; bh=wl89LMST6bmfBHBc6E1gH5JK3tcUiktjnBzv/ap4QhQ=; h=To:Subject:Date:References:In-Reply-To:List-Id:List-Unsubscribe: List-Archive:List-Post:List-Help:List-Subscribe:From:Reply-To: From; b=avefRicyR+yKTyklOvBE/lhjoPjcSiBvAYvfelXQ5F7i+izrlxUZ26XH3LmkMiSdF Eca7QlqUf+Z3ZorZy0Tq5sHCWx4hQZYDHGktT6SrS5TRbwk0H6duC9M1VT/ku6RA2z T6eTWKC26gssMzKAVhYGl5Yq7/fIuSizprDtosAU= X-Original-To: libc-alpha@sourceware.org Delivered-To: libc-alpha@sourceware.org Received: from EUR04-VI1-obe.outbound.protection.outlook.com (mail-eopbgr80081.outbound.protection.outlook.com [40.107.8.81]) by sourceware.org (Postfix) with ESMTPS id E84E93857C6F for ; Mon, 4 Jan 2021 12:25:39 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.3.2 sourceware.org E84E93857C6F Received: from DB7PR05CA0047.eurprd05.prod.outlook.com (2603:10a6:10:2e::24) by VI1PR0802MB2543.eurprd08.prod.outlook.com (2603:10a6:800:b5::20) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384) id 15.20.3721.21; Mon, 4 Jan 2021 12:25:36 +0000 Received: from DB5EUR03FT026.eop-EUR03.prod.protection.outlook.com (2603:10a6:10:2e:cafe::4e) by DB7PR05CA0047.outlook.office365.com (2603:10a6:10:2e::24) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384) id 15.20.3721.20 via Frontend Transport; Mon, 4 Jan 2021 12:25:36 +0000 X-MS-Exchange-Authentication-Results: spf=pass (sender IP is 63.35.35.123) smtp.mailfrom=arm.com; sourceware.org; dkim=pass (signature was verified) header.d=armh.onmicrosoft.com;sourceware.org; dmarc=pass action=none header.from=arm.com; Received-SPF: Pass (protection.outlook.com: domain of arm.com designates 63.35.35.123 as permitted sender) receiver=protection.outlook.com; client-ip=63.35.35.123; helo=64aa7808-outbound-1.mta.getcheckrecipient.com; Received: from 64aa7808-outbound-1.mta.getcheckrecipient.com (63.35.35.123) by DB5EUR03FT026.mail.protection.outlook.com (10.152.20.159) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384) id 15.20.3721.21 via Frontend Transport; Mon, 4 Jan 2021 12:25:36 +0000 Received: ("Tessian outbound 665ba7fbdfd9:v71"); Mon, 04 Jan 2021 12:25:35 +0000 X-CheckRecipientChecked: true X-CR-MTA-CID: 4732ab9d01622445 X-CR-MTA-TID: 64aa7808 Received: from d87dc4b8b20f.1 by 64aa7808-outbound-1.mta.getcheckrecipient.com id E41306A6-A75F-4700-BB25-DA297D5E4C9B.1; Mon, 04 Jan 2021 12:25:29 +0000 Received: from EUR04-VI1-obe.outbound.protection.outlook.com by 64aa7808-outbound-1.mta.getcheckrecipient.com with ESMTPS id d87dc4b8b20f.1 (version=TLSv1.2 cipher=ECDHE-RSA-AES256-GCM-SHA384); Mon, 04 Jan 2021 12:25:29 +0000 ARC-Seal: i=1; a=rsa-sha256; s=arcselector9901; d=microsoft.com; cv=none; b=WgK4jZ2ZTplgmvg9i4EHLb4StQesgE4X0EtSgrwe9mojOgfLel6m0qwDTD6t3j4EZmqdxWeMKDOkAVA1tP8T1DEp73W79Km7hENsanoSjuzQb7uKJK+tE/YHZmd3/Yq3mDnOrK0b+5O/gZrOSULiY16VZnSciWART6kUiK8Sb7lJpezjJU2EdptZvuk76S7Kedr7KQtG8Q4aHxParLNHHZEPt5jWZER5cDqjfAZYVw+iLhQq8Qtk7Q4e/itgfeyBlk03vzsjkZq5OwZTDoHai5tIVew4EmRoiYxtIxEpLiEqUlMuHN3DbclfR2Tk6vfE0pqmCpYjr5kUv4S4FV+CEg== ARC-Message-Signature: i=1; a=rsa-sha256; c=relaxed/relaxed; d=microsoft.com; s=arcselector9901; h=From:Date:Subject:Message-ID:Content-Type:MIME-Version:X-MS-Exchange-SenderADCheck; bh=wl89LMST6bmfBHBc6E1gH5JK3tcUiktjnBzv/ap4QhQ=; b=LZu51ZwR6OYtMbc3YH2IOxkCL2A3m+D9kmyTxxB8q+ktHvxyzDZMv7RC7zxWJHxciyGCZVJUeyqnE3ZBSQ4ssZi43VGqDdFvBdcnKJDsQZsy5EBl8oEMslakVCeZ7fxo/6mtjCxkb0pi7BTRLEBLbFUGeG5waxHD3YMVRjvNeVusO+R3H9CpdvLeRepYaElY1O9E2IX6N36mrux2pjWjWVqwsn4G1jng6vLIkphqj1Es4kakX9Jue9Kd979PZyLqBPgrNpRYfFfvk6pCpaRj+BzN5sYkTV0ngGD/6X7dNeTBCQho79FOZfwiMOjtns0zK/+PGRD7POyU1hI3qEQ4wg== ARC-Authentication-Results: i=1; mx.microsoft.com 1; spf=pass smtp.mailfrom=arm.com; dmarc=pass action=none header.from=arm.com; dkim=pass header.d=arm.com; arc=none Received: from VE1PR08MB5599.eurprd08.prod.outlook.com (2603:10a6:800:1a1::12) by VI1PR0802MB2158.eurprd08.prod.outlook.com (2603:10a6:800:99::14) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384) id 15.20.3721.22; Mon, 4 Jan 2021 12:25:25 +0000 Received: from VE1PR08MB5599.eurprd08.prod.outlook.com ([fe80::6d00:2694:e0d7:986f]) by VE1PR08MB5599.eurprd08.prod.outlook.com ([fe80::6d00:2694:e0d7:986f%5]) with mapi id 15.20.3721.024; Mon, 4 Jan 2021 12:25:25 +0000 To: 'GNU C Library' Subject: [PATCH 5/5] Remove mpa files Thread-Topic: [PATCH 5/5] Remove mpa files Thread-Index: AQHW4pStV/Eog8XYekCY8HYoeRN3uA== Date: Mon, 4 Jan 2021 12:25:24 +0000 Message-ID: References: In-Reply-To: Accept-Language: en-GB, en-US Content-Language: en-GB X-MS-Has-Attach: X-MS-TNEF-Correlator: Authentication-Results-Original: sourceware.org; dkim=none (message not signed) header.d=none;sourceware.org; dmarc=none action=none header.from=arm.com; x-originating-ip: [82.24.249.100] x-ms-publictraffictype: Email X-MS-Office365-Filtering-HT: Tenant X-MS-Office365-Filtering-Correlation-Id: a8542466-350a-4244-4ad7-08d8b0abd6a7 x-ms-traffictypediagnostic: VI1PR0802MB2158:|VI1PR0802MB2543: X-Microsoft-Antispam-PRVS: x-checkrecipientrouted: true nodisclaimer: true x-ms-oob-tlc-oobclassifiers: OLM:229;OLM:229; X-MS-Exchange-SenderADCheck: 1 X-Microsoft-Antispam-Untrusted: BCL:0; X-Microsoft-Antispam-Message-Info-Original: 8LxTn2Y71B4+Ph37Lu+MZs63xZKBZPX6HNL+keT42GSezSZu678HcCAsgOqoEeSWPRQCAi4DPJyC1prLEcV8UNgzM8VzVbB6HPgl6YE+na9QtyAOzIGAsU4DGw5KWHdEcgNQhRaeygGgeasuQwAGBJiS5U/Xto4/UQIwQ1NiAg6t2txLeW6FSJselN5ihbm8VIh/6zrT2SMenyayPUc2+p5UrwfYrFBXafSSw/NznKTJADedBYpsdGSBJN5mJMndExdwkGNXFl9yQ7LcBhNlFJ2BqdzxCijCrNYuv0MliMLsJtynlYP50BRmT2AZlePuyuFtIBkrRN3E2QsdS6WRJriPGupRHwhPmYUNBIqXP8BaMSVNnwks1f5AglFCoYTcVo65SM2fw3oVvJ0qlkjbXlRliQ9fRSM4Ti8sqCeH1Fm6WJGMaBGzcRBSNORCLTaBXp0txprvIri4+Bj/d7oz9xAn/OZzr0/4izDZ7UyJ4SsgYbTuH2aEROjWfUfMCdPfmiiGlNJa/FVuVOilNHudvK9h9XHIo42+yJkUACaS65I= X-Forefront-Antispam-Report-Untrusted: CIP:255.255.255.255; CTRY:; LANG:en; SCL:1; SRV:; IPV:NLI; SFV:NSPM; H:VE1PR08MB5599.eurprd08.prod.outlook.com; PTR:; CAT:NONE; SFS:(4636009)(39860400002)(376002)(366004)(136003)(346002)(396003)(8676002)(83380400001)(7696005)(86362001)(2906002)(6506007)(33656002)(26005)(316002)(19627235002)(5660300002)(2940100002)(52536014)(186003)(8936002)(478600001)(30864003)(76116006)(66946007)(9686003)(6916009)(91956017)(66476007)(71200400001)(66556008)(66446008)(64756008)(55016002)(2004002)(559001)(569008); DIR:OUT; SFP:1101; x-ms-exchange-antispam-messagedata: =?iso-8859-1?q?0osxk+OI7MYquw8nDQzsWHP5z?= =?iso-8859-1?q?F3H3lYLzi69ArgijIbA1+IFE27LpAIVQ9SGwg6dbW6iQHt5dmrzEHrlSlF0e?= =?iso-8859-1?q?wwRpRbLgngipfP87gTgHlu5Qjn3fD/v/yd/+5C8bSyRgUWRF3kre+8NykuLW?= =?iso-8859-1?q?DtqQHSPKnx3Mox8cYQvrw7qXnDF/tpMi63D2cqT5vQek0vIE56TSlbxBHeND?= =?iso-8859-1?q?GK/gtHrhjkK6aOojVFxPnCXfoS43iSlq6zP/V5kVve+wLn0rW8ZP7bBhSERq?= =?iso-8859-1?q?nvu9ki3RiEZ+syv5wQIwjh59HHCJo7WH80/8h/2JLlKRVvC7XMHEXIpZsBmN?= =?iso-8859-1?q?toXraousK6aZVvOToRHMiTcJkEdy6Y7np9JFh1whE2qU4AWNIyCt4ju3cgNi?= =?iso-8859-1?q?vTPaPZnJFmOAMw8iBCOaRTCFFFcWTOjWmT4YAYbVi7l6re46IqHB5xfl4nsB?= =?iso-8859-1?q?hv05CYsr72Yu+NGJk+rni9iCVXU1zL2tXaO1lb8a/Cx1e70lucQCuc+yLU/R?= =?iso-8859-1?q?c59jjpRGQvSTLxVq1UW5mQdSdLNg07cf0OGjk6H81XvQ74Z+JO4/gELea6dz?= =?iso-8859-1?q?f0UMfiboduI0CMYUFREaJcMocNHnRB2mq9xJfNenRP4BElC2TXi7O+iRJxfB?= =?iso-8859-1?q?vAqh/pvM9ZDtsJ5lyTNTNGxzyBRmjk7lrWDl3Ni8Y45zrFGCaAp7vSK691FE?= =?iso-8859-1?q?UcI4CeAmCimx0au16Poje+y5PXTXB8oXp1l8kouRGMLAbgpS6ZIz/IMntXdi?= =?iso-8859-1?q?p5v6bpweRe/V67StbV6aKeewv2hSupvxfIkb2jOIvcejslUMCswfIC/9gp4o?= =?iso-8859-1?q?AP66ChMZiszrS6m1WmKEMWfsG9LhYcS4hXaUUYOinzIA03EjCzgES9sHdfMb?= =?iso-8859-1?q?cnXdt4CbafqObnpBFWGVbqljF0/AwaZUiHpN3w+cN40wwOcZ8e8AZbrGkhMD?= =?iso-8859-1?q?G+21S/s7pFfyCd1oqLIQuQsdOaGCq/oyLiZuEedYbrdp9CT+VOJKJjcl6hf3?= =?iso-8859-1?q?DeGwuTdbvRqMsdpAmA=3D?= x-ms-exchange-transport-forked: True MIME-Version: 1.0 X-MS-Exchange-Transport-CrossTenantHeadersStamped: VI1PR0802MB2158 Original-Authentication-Results: sourceware.org; dkim=none (message not signed) header.d=none; sourceware.org; dmarc=none action=none header.from=arm.com; X-EOPAttributedMessage: 0 X-MS-Exchange-Transport-CrossTenantHeadersStripped: DB5EUR03FT026.eop-EUR03.prod.protection.outlook.com X-MS-Office365-Filtering-Correlation-Id-Prvs: 2fb26dae-a9a8-4a4a-3133-08d8b0abd023 X-Microsoft-Antispam: BCL:0; X-Microsoft-Antispam-Message-Info: assAzYmj75fVCbJXK5WJtA+p6rreIDKaO9ykUXXW3RKuFnItigdSAv1nqJPrtFgHkzVHpY095CpkZojvK0n54pDVEaR4uDyjqeC4myXvRJujUuF/n2BJv0vNMr01gOZYYeNwDpfCkdgPGtgQYQAnbofsGl4UVlRHGMkpRJ3keBBmf205bKk9ZjJVlnOtKFen0zKeIDLkS5gac36KFFusPksno2Sc5I2QOZlfEICKxFTCTUpsvIrILl3A1krnw0D7oCdcrzMPQBhgGurnb0SmXI4rrAKBLES5NUD0TUZWGqtmjJJrYxCK/VkZxTu9JmwsKig2kraf2cIq3YXmYniJZgqUpyZ8Ta1bqKo4REooFVde6pij0C5gTRhInAfip1A4FeWGksHFHaTaSVpanssWnbjBjkSxtUJyBYCCPE/dxcZ/1NKe80s5rAvNDxKti2QBmAaosIPMxHSzSQtwJECiE1i8nfqLWfE2yK0VWgdrHZBa2Rxb8tKqijDzXF4qajxfWrUKi0oYpAJ+oDaEnMJvcfK7/MaXyHl90roTdu1EsHf+nqn7pwf450+HB9BLCIup X-Forefront-Antispam-Report: CIP:63.35.35.123; CTRY:IE; LANG:en; SCL:1; SRV:; IPV:CAL; SFV:NSPM; H:64aa7808-outbound-1.mta.getcheckrecipient.com; PTR:ec2-63-35-35-123.eu-west-1.compute.amazonaws.com; CAT:NONE; SFS:(4636009)(39860400002)(346002)(376002)(136003)(396003)(46966006)(9686003)(55016002)(8936002)(478600001)(30864003)(19627235002)(5660300002)(52536014)(47076005)(2906002)(336012)(6506007)(186003)(26005)(70586007)(356005)(81166007)(83380400001)(70206006)(8676002)(33656002)(7696005)(82740400003)(6916009)(316002)(2940100002)(86362001)(82310400003)(2004002)(559001)(579004); DIR:OUT; SFP:1101; X-OriginatorOrg: arm.com X-MS-Exchange-CrossTenant-OriginalArrivalTime: 04 Jan 2021 12:25:36.0039 (UTC) X-MS-Exchange-CrossTenant-Network-Message-Id: a8542466-350a-4244-4ad7-08d8b0abd6a7 X-MS-Exchange-CrossTenant-Id: f34e5979-57d9-4aaa-ad4d-b122a662184d X-MS-Exchange-CrossTenant-OriginalAttributedTenantConnectingIp: TenantId=f34e5979-57d9-4aaa-ad4d-b122a662184d; Ip=[63.35.35.123]; Helo=[64aa7808-outbound-1.mta.getcheckrecipient.com] X-MS-Exchange-CrossTenant-AuthSource: DB5EUR03FT026.eop-EUR03.prod.protection.outlook.com X-MS-Exchange-CrossTenant-AuthAs: Anonymous X-MS-Exchange-CrossTenant-FromEntityHeader: HybridOnPrem X-MS-Exchange-Transport-CrossTenantHeadersStamped: VI1PR0802MB2543 X-Spam-Status: No, score=-12.1 required=5.0 tests=BAYES_00, DKIM_SIGNED, DKIM_VALID, GIT_PATCH_0, KAM_LOTSOFHASH, KAM_SHORT, RCVD_IN_DNSWL_NONE, RCVD_IN_MSPIKE_H2, SCC_5_SHORT_WORD_LINES, SPF_HELO_PASS, SPF_PASS, TXREP, UNPARSEABLE_RELAY autolearn=ham autolearn_force=no version=3.4.2 X-Spam-Checker-Version: SpamAssassin 3.4.2 (2018-09-13) on server2.sourceware.org X-BeenThere: libc-alpha@sourceware.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Libc-alpha mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-Patchwork-Original-From: Wilco Dijkstra via Libc-alpha From: Wilco Dijkstra Reply-To: Wilco Dijkstra Errors-To: libc-alpha-bounces@sourceware.org Sender: "Libc-alpha" Finally remove all mpa related files, headers, declarations, probes and update makefiles. Passes GLIBC testsuite and buildmanyglibc. diff --git a/manual/probes.texi b/manual/probes.texi index 61254bc43018d0618c17776603c95c2f8d489678..4aae76b81921f3474e381b2d0c982e9bec1c6380 100644 --- a/manual/probes.texi +++ b/manual/probes.texi @@ -16,7 +16,6 @@ arguments. @menu * Memory Allocation Probes:: Probes in the memory allocation subsystem -* Mathematical Function Probes:: Probes in mathematical functions * Non-local Goto Probes:: Probes in setjmp and longjmp @end menu @@ -255,90 +254,6 @@ is the memory location as passed to @code{free}, Argument @var{$arg2} is the tcache bin it resides in. @end deftp -@node Mathematical Function Probes -@section Mathematical Function Probes - -Some mathematical functions fall back to multiple precision arithmetic for -some inputs to get last bit precision for their return values. This multiple -precision fallback is much slower than the default algorithms and may have a -significant impact on application performance. The systemtap probe markers -described in this section may help you determine if your application calls -mathematical functions with inputs that may result in multiple-precision -arithmetic. - -Unless explicitly mentioned otherwise, a precision of 1 implies 24 bits of -precision in the mantissa of the multiple precision number. Hence, a precision -level of 32 implies 768 bits of precision in the mantissa. - -@deftp Probe slowatan2 (int @var{$arg1}, double @var{$arg2}, double @var{$arg3}, double @var{$arg4}) -This probe is triggered when the @code{atan2} function is called with -an input that results in multiple precision computation. Argument -@var{$arg1} is the precision with which computation succeeded. -Arguments @var{$arg2} and @var{$arg3} are inputs to the @code{atan2} -function and @var{$arg4} is the computed result. -@end deftp - -@deftp Probe slowatan2_inexact (int @var{$arg1}, double @var{$arg2}, double @var{$arg3}, double @var{$arg4}) -This probe is triggered when the @code{atan} function is called with -an input that results in multiple precision computation and none of -the multiple precision computations result in an accurate result. -Argument @var{$arg1} is the maximum precision with which computations -were performed. Arguments @var{$arg2} and @var{$arg3} are inputs to -the @code{atan2} function and @var{$arg4} is the computed result. -@end deftp - -@deftp Probe slowatan (int @var{$arg1}, double @var{$arg2}, double @var{$arg3}) -This probe is triggered when the @code{atan} function is called with -an input that results in multiple precision computation. Argument -@var{$arg1} is the precision with which computation succeeded. -Argument @var{$arg2} is the input to the @code{atan} function and -@var{$arg3} is the computed result. -@end deftp - -@deftp Probe slowatan_inexact (int @var{$arg1}, double @var{$arg2}, double @var{$arg3}) -This probe is triggered when the @code{atan} function is called with -an input that results in multiple precision computation and none of -the multiple precision computations result in an accurate result. -Argument @var{$arg1} is the maximum precision with which computations -were performed. Argument @var{$arg2} is the input to the @code{atan} -function and @var{$arg3} is the computed result. -@end deftp - -@deftp Probe slowtan (double @var{$arg1}, double @var{$arg2}) -This probe is triggered when the @code{tan} function is called with an -input that results in multiple precision computation with precision -32. Argument @var{$arg1} is the input to the function and @var{$arg2} -is the computed result. -@end deftp - -@deftp Probe slowsin (double @var{$arg1}, double @var{$arg2}) -This probe is triggered when the @code{sin} function is called with an -input that results in multiple precision computation with precision -32. Argument @var{$arg1} is the input to the function and @var{$arg2} -is the computed result. -@end deftp - -@deftp Probe slowcos (double @var{$arg1}, double @var{$arg2}) -This probe is triggered when the @code{cos} function is called with an -input that results in multiple precision computation with precision -32. Argument @var{$arg1} is the input to the function and @var{$arg2} -is the computed result. -@end deftp - -@deftp Probe slowsin_dx (double @var{$arg1}, double @var{$arg2}, double @var{$arg3}) -This probe is triggered when the @code{sin} function is called with an -input that results in multiple precision computation with precision -32. Argument @var{$arg1} is the input to the function, @var{$arg2} is -the error bound of @var{$arg1} and @var{$arg3} is the computed result. -@end deftp - -@deftp Probe slowcos_dx (double @var{$arg1}, double @var{$arg2}, double @var{$arg3}) -This probe is triggered when the @code{cos} function is called with an -input that results in multiple precision computation with precision -32. Argument @var{$arg1} is the input to the function, @var{$arg2} is -the error bound of @var{$arg1} and @var{$arg3} is the computed result. -@end deftp - @node Non-local Goto Probes @section Non-local Goto Probes diff --git a/math/Makefile b/math/Makefile index 62667d9186c601d88e87cdbd2e98d6231c96e7fb..80855cc356923170c99fe38128625e338aedb247 100644 --- a/math/Makefile +++ b/math/Makefile @@ -126,8 +126,7 @@ type-ldouble-yes := ldouble # double support type-double-suffix := -type-double-routines := branred doasin dosincos mpa mpatan2 \ - k_rem_pio2 mpatan mpsqrt mptan sincos32 \ +type-double-routines := branred k_rem_pio2 \ sincostab math_err e_exp_data e_log_data \ e_log2_data e_pow_log_data diff --git a/sysdeps/generic/math_private.h b/sysdeps/generic/math_private.h index 10a6fde28dbcbfe55148c744e13515b7c9d0707c..98b54875f51304f966db6d7b304b12073f9b2b2f 100644 --- a/sysdeps/generic/math_private.h +++ b/sysdeps/generic/math_private.h @@ -199,11 +199,5 @@ do { \ extern double __sin (double __x); extern double __cos (double __x); extern int __branred (double __x, double *__a, double *__aa); -extern void __doasin (double __x, double __dx, double __v[]); -extern void __dubsin (double __x, double __dx, double __v[]); -extern void __dubcos (double __x, double __dx, double __v[]); -extern double __mpsin (double __x, double __dx, bool __range_reduce); -extern double __mpcos (double __x, double __dx, bool __range_reduce); -extern void __docos (double __x, double __dx, double __v[]); #endif /* _MATH_PRIVATE_H_ */ diff --git a/sysdeps/ieee754/dbl-64/MathLib.h b/sysdeps/ieee754/dbl-64/MathLib.h deleted file mode 100644 index a273082f93e60fa826c4105d9457e8b4185b2357..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/MathLib.h +++ /dev/null @@ -1,100 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/********************************************************************/ -/* Ultimate math functions. Each function computes the exact */ -/* theoretical value of its argument rounded to nearest or even. */ -/* */ -/* Assumption: Machine arithmetic operations are performed in */ -/* round nearest mode of IEEE 754 standard. */ -/********************************************************************/ - -#ifndef UMATH_LIB -#define UMATH_LIB -/********************************************************************/ -/* Function changes the precision mode to IEEE 754 double precision */ -/* and the rounding mode to nearest or even. */ -/* It returns the original status of these modes. */ -/* See further explanations of usage in DPChange.h */ -/********************************************************************/ -unsigned short Init_Lib (void); - -/********************************************************************/ -/* Function that changes the precision and rounding modes to the */ -/* specified by the argument received. See further explanations in */ -/* DPChange.h */ -/********************************************************************/ -void Exit_Lib (unsigned short); - - -/* The asin() function calculates the arc sine of its argument. */ -/* The function returns the arc sine in radians */ -/* (between -PI/2 and PI/2). */ -/* If the argument is greater than 1 or less than -1 it returns */ -/* a NaN. */ -double uasin (double); - - -/* The acos() function calculates the arc cosine of its argument. */ -/* The function returns the arc cosine in radians */ -/* (between -PI/2 and PI/2). */ -/* If the argument is greater than 1 or less than -1 it returns */ -/* a NaN. */ -double uacos (double); - -/* The atan() function calculates the arctanget of its argument. */ -/* The function returns the arc tangent in radians */ -/* (between -PI/2 and PI/2). */ -double uatan (double); - - -/* The uatan2() function calculates the arc tangent of the two arguments x */ -/* and y (x is the right argument and y is the left one).The signs of both */ -/* arguments are used to determine the quadrant of the result. */ -/* The function returns the result in radians, which is between -PI and PI */ -double uatan2 (double, double); - -/* Compute log(x). The base of log is e (natural logarithm) */ -double ulog (double); - -/* Compute e raised to the power of argument x. */ -double uexp (double); - -/* Compute sin(x). The argument x is assumed to be given in radians.*/ -double usin (double); - -/* Compute cos(x). The argument x is assumed to be given in radians.*/ -double ucos (double); - -/* Compute tan(x). The argument x is assumed to be given in radians.*/ -double utan (double); - -/* Compute the square root of non-negative argument x. */ -/* If x is negative the returned value is NaN. */ -double usqrt (double); - -/* Compute x raised to the power of y, where x is the left argument */ -/* and y is the right argument. The function returns a NaN if x<0. */ -/* If x equals zero it returns -inf */ -double upow (double, double); - -/* Computing x mod y, where x is the left argument and y is the */ -/* right one. */ -double uremainder (double, double); -#endif diff --git a/sysdeps/ieee754/dbl-64/doasin.h b/sysdeps/ieee754/dbl-64/doasin.h deleted file mode 100644 index ecb15aaff00a79b0acc3f3d9ec1a083fc2f702d5..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/doasin.h +++ /dev/null @@ -1,63 +0,0 @@ - -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/************************************************************************/ -/* MODULE_NAME: doasin.h */ -/* */ -/* */ -/* common data and variables definition for BIG or LITTLE ENDIAN */ -/************************************************************************/ - - - -#ifndef DOASIN_H -#define DOASIN_H - -#ifdef BIG_ENDI - - static const mynumber -/**/ c1 = {{0x3FC55555, 0x55555555}}, /* 0.16666666666666666 */ -/**/ cc1 = {{0x3C655555, 0x55775389}}, /* 9.2518585419753846e-18 */ -/**/ c2 = {{0x3FB33333, 0x33333333}}, /* 0.074999999999999997 */ -/**/ cc2 = {{0x3C499993, 0x63F1A115}}, /* 2.7755472886508899e-18 */ -/**/ c3 = {{0x3FA6DB6D, 0xB6DB6DB7}}, /* 0.044642857142857144 */ -/**/ cc3 = {{0xBC320FC0, 0x3D5CF0C5}}, /* -9.7911734574147224e-19 */ -/**/ c4 = {{0x3F9F1C71, 0xC71C71C5}}, /* 0.030381944444444437 */ -/**/ cc4 = {{0xBC02B240, 0xFF23ED1E}}; /* -1.2669108566898312e-19 */ - -#else -#ifdef LITTLE_ENDI - - static const mynumber -/**/ c1 = {{0x55555555, 0x3FC55555}}, /* 0.16666666666666666 */ -/**/ cc1 = {{0x55775389, 0x3C655555}}, /* 9.2518585419753846e-18 */ -/**/ c2 = {{0x33333333, 0x3FB33333}}, /* 0.074999999999999997 */ -/**/ cc2 = {{0x63F1A115, 0x3C499993}}, /* 2.7755472886508899e-18 */ -/**/ c3 = {{0xB6DB6DB7, 0x3FA6DB6D}}, /* 0.044642857142857144 */ -/**/ cc3 = {{0x3D5CF0C5, 0xBC320FC0}}, /* -9.7911734574147224e-19 */ -/**/ c4 = {{0xC71C71C5, 0x3F9F1C71}}, /* 0.030381944444444437 */ -/**/ cc4 = {{0xFF23ED1E, 0xBC02B240}}; /* -1.2669108566898312e-19 */ - - -#endif -#endif - - -#endif diff --git a/sysdeps/ieee754/dbl-64/doasin.c b/sysdeps/ieee754/dbl-64/doasin.c deleted file mode 100644 index f7e2f455664421dfd3a22bdf46aa598c14cb6093..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/doasin.c +++ /dev/null @@ -1,81 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/**********************************************************************/ -/* MODULE_NAME: doasin.c */ -/* */ -/* FUNCTION: doasin */ -/* */ -/* FILES NEEDED:endian.h mydefs.h dla.h doasin.h */ -/* mpa.c */ -/* */ -/* Compute arcsin(x,dx,v) of double-length number (x+dx) the result */ -/* stored in v where v= v[0]+v[1] =arcsin(x+dx) */ -/**********************************************************************/ - -#include "endian.h" -#include "mydefs.h" -#include -#include - -#ifndef SECTION -# define SECTION -#endif - -/********************************************************************/ -/* Compute arcsin(x,dx,v) of double-length number (x+dx) the result */ -/* stored in v where v= v[0]+v[1] =arcsin(x+dx) */ -/********************************************************************/ -void -SECTION -__doasin(double x, double dx, double v[]) { - -#include "doasin.h" - - static const double - d5 = 0.22372159090911789889975459505194491E-01, - d6 = 0.17352764422456822913014975683014622E-01, - d7 = 0.13964843843786693521653681033981614E-01, - d8 = 0.11551791438485242609036067259086589E-01, - d9 = 0.97622386568166960207425666787248914E-02, - d10 = 0.83638737193775788576092749009744976E-02, - d11 = 0.79470250400727425881446981833568758E-02; - - double xx,p,pp,u,uu,r,s; - double tc,tcc; - - -/* Taylor series for arcsin for Double-Length numbers */ - xx = x*x+2.0*x*dx; - p = ((((((d11*xx+d10)*xx+d9)*xx+d8)*xx+d7)*xx+d6)*xx+d5)*xx; - pp = 0; - - MUL2(x,dx,x,dx,u,uu,tc,tcc); - ADD2(p,pp,c4.x,cc4.x,p,pp,r,s); - MUL2(p,pp,u,uu,p,pp,tc,tcc); - ADD2(p,pp,c3.x,cc3.x,p,pp,r,s); - MUL2(p,pp,u,uu,p,pp,tc,tcc); - ADD2(p,pp,c2.x,cc2.x,p,pp,r,s); - MUL2(p,pp,u,uu,p,pp,tc,tcc); - ADD2(p,pp,c1.x,cc1.x,p,pp,r,s); - MUL2(p,pp,u,uu,p,pp,tc,tcc); - MUL2(p,pp,x,dx,p,pp,tc,tcc); - ADD2(p,pp,x,dx,p,pp,r,s); - v[0]=p; - v[1]=pp; /* arcsin(x+dx)=v[0]+v[1] */ -} diff --git a/sysdeps/ieee754/dbl-64/dosincos.h b/sysdeps/ieee754/dbl-64/dosincos.h deleted file mode 100644 index a90667ebc0bdd3045626aade77374689a0a07732..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/dosincos.h +++ /dev/null @@ -1,80 +0,0 @@ - -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/************************************************************************/ -/* MODULE_NAME: dosincos.h */ -/* */ -/* */ -/* common data and variables definition for BIG or LITTLE ENDIAN */ -/************************************************************************/ - - - -#ifndef DOSINCOS_H -#define DOSINCOS_H - - -#ifdef BIG_ENDI -static const mynumber -/**/ s3 = {{0xBFC55555, 0x55555555}},/* -0.16666666666666666 */ -/**/ ss3 = {{0xBC6553AA, 0xE77EE482}},/* -9.2490366677784492e-18 */ -/**/ s5 = {{0x3F811111, 0x11110F15}},/* 0.008333333333332452 */ -/**/ ss5 = {{0xBC21AC06, 0xDA488820}},/* -4.7899996586987931e-19 */ -/**/ s7 = {{0xBF2A019F, 0x5816C78D}},/* -0.00019841261022928957 */ -/**/ ss7 = {{0x3BCDCEC9, 0x6A18BF2A}},/* 1.2624077757871259e-20 */ -/**/ c2 = {{0x3FE00000, 0x00000000}},/* 0.5 */ -/**/ cc2 = {{0xBA282FD8, 0x00000000}},/* -1.5264073330037701e-28 */ -/**/ c4 = {{0xBFA55555, 0x55555555}},/* -0.041666666666666664 */ -/**/ cc4 = {{0xBC4554BC, 0x2FFF257E}},/* -2.312711276085743e-18 */ -/**/ c6 = {{0x3F56C16C, 0x16C16A96}},/* 0.0013888888888888055 */ -/**/ cc6 = {{0xBBD2E846, 0xE6346F14}},/* -1.6015133010194884e-20 */ -/**/ c8 = {{0xBEFA019F, 0x821D5987}},/* -2.480157866754367e-05 */ -/**/ cc8 = {{0x3B7AB71E, 0x72FFE5CC}},/* 3.5357416224857556e-22 */ - -/**/ big = {{0x42c80000, 0x00000000}}, /* 52776558133248 */ - -/**/ hp0 = {{0x3FF921FB, 0x54442D18}}, /* PI / 2 */ -/**/ hp1 = {{0x3C91A626, 0x33145C07}}; /* 6.123233995736766e-17 */ -#else -#ifdef LITTLE_ENDI -static const mynumber -/**/ s3 = {{0x55555555, 0xBFC55555}},/* -0.16666666666666666 */ -/**/ ss3 = {{0xE77EE482, 0xBC6553AA}},/* -9.2490366677784492e-18 */ -/**/ s5 = {{0x11110F15, 0x3F811111}},/* 0.008333333333332452 */ -/**/ ss5 = {{0xDA488820, 0xBC21AC06}},/* -4.7899996586987931e-19 */ -/**/ s7 = {{0x5816C78D, 0xBF2A019F}},/* -0.00019841261022928957 */ -/**/ ss7 = {{0x6A18BF2A, 0x3BCDCEC9}},/* 1.2624077757871259e-20 */ -/**/ c2 = {{0x00000000, 0x3FE00000}},/* 0.5 */ -/**/ cc2 = {{0x00000000, 0xBA282FD8}},/* -1.5264073330037701e-28 */ -/**/ c4 = {{0x55555555, 0xBFA55555}},/* -0.041666666666666664 */ -/**/ cc4 = {{0x2FFF257E, 0xBC4554BC}},/* -2.312711276085743e-18 */ -/**/ c6 = {{0x16C16A96, 0x3F56C16C}},/* 0.0013888888888888055 */ -/**/ cc6 = {{0xE6346F14, 0xBBD2E846}},/* -1.6015133010194884e-20 */ -/**/ c8 = {{0x821D5987, 0xBEFA019F}},/* -2.480157866754367e-05 */ -/**/ cc8 = {{0x72FFE5CC, 0x3B7AB71E}},/* 3.5357416224857556e-22 */ - -/**/ big = {{0x00000000, 0x42c80000}}, /* 52776558133248 */ - -/**/ hp0 = {{0x54442D18, 0x3FF921FB}}, /* PI / 2 */ -/**/ hp1 = {{0x33145C07, 0x3C91A626}}; /* 6.123233995736766e-17 */ -#endif -#endif - -#endif diff --git a/sysdeps/ieee754/dbl-64/dosincos.c b/sysdeps/ieee754/dbl-64/dosincos.c deleted file mode 100644 index 51b2938650140057f49b372a2695d56b02639f58..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/dosincos.c +++ /dev/null @@ -1,217 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/********************************************************************/ -/* */ -/* MODULE_NAME: dosincos.c */ -/* */ -/* */ -/* FUNCTIONS: dubsin */ -/* dubcos */ -/* docos */ -/* FILES NEEDED: endian.h mydefs.h dla.h dosincos.h */ -/* sincos.tbl */ -/* */ -/* Routines compute sin() and cos() as Double-Length numbers */ -/********************************************************************/ - - - -#include "endian.h" -#include "mydefs.h" -#include -#include "dosincos.h" -#include - -#ifndef SECTION -# define SECTION -#endif - -extern const union -{ - int4 i[880]; - double x[440]; -} __sincostab attribute_hidden; - -/***********************************************************************/ -/* Routine receive Double-Length number (x+dx) and computing sin(x+dx) */ -/* as Double-Length number and store it at array v .It computes it by */ -/* arithmetic action on Double-Length numbers */ -/*(x+dx) between 0 and PI/4 */ -/***********************************************************************/ - -void -SECTION -__dubsin (double x, double dx, double v[]) -{ - double r, s, c, cc, d, dd, d2, dd2, e, ee, - sn, ssn, cs, ccs, ds, dss, dc, dcc; - mynumber u; - int4 k; - - u.x = x + big.x; - k = u.i[LOW_HALF] << 2; - x = x - (u.x - big.x); - d = x + dx; - dd = (x - d) + dx; - /* sin(x+dx)=sin(Xi+t)=sin(Xi)*cos(t) + cos(Xi)sin(t) where t ->0 */ - MUL2 (d, dd, d, dd, d2, dd2, c, cc); - sn = __sincostab.x[k]; /* */ - ssn = __sincostab.x[k + 1]; /* sin(Xi) and cos(Xi) */ - cs = __sincostab.x[k + 2]; /* */ - ccs = __sincostab.x[k + 3]; /* */ - /* Taylor series for sin ds=sin(t) */ - MUL2 (d2, dd2, s7.x, ss7.x, ds, dss, c, cc); - ADD2 (ds, dss, s5.x, ss5.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, s3.x, ss3.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - MUL2 (d, dd, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, d, dd, ds, dss, r, s); - - /* Taylor series for cos dc=cos(t) */ - MUL2 (d2, dd2, c8.x, cc8.x, dc, dcc, c, cc); - ADD2 (dc, dcc, c6.x, cc6.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c4.x, cc4.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c2.x, cc2.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - - MUL2 (cs, ccs, ds, dss, e, ee, c, cc); - MUL2 (dc, dcc, sn, ssn, dc, dcc, c, cc); - SUB2 (e, ee, dc, dcc, e, ee, r, s); - ADD2 (e, ee, sn, ssn, e, ee, r, s); /* e+ee=sin(x+dx) */ - - v[0] = e; - v[1] = ee; -} -/**********************************************************************/ -/* Routine receive Double-Length number (x+dx) and computes cos(x+dx) */ -/* as Double-Length number and store it in array v .It computes it by */ -/* arithmetic action on Double-Length numbers */ -/*(x+dx) between 0 and PI/4 */ -/**********************************************************************/ - -void -SECTION -__dubcos (double x, double dx, double v[]) -{ - double r, s, c, cc, d, dd, d2, dd2, e, ee, - sn, ssn, cs, ccs, ds, dss, dc, dcc; - mynumber u; - int4 k; - u.x = x + big.x; - k = u.i[LOW_HALF] << 2; - x = x - (u.x - big.x); - d = x + dx; - dd = (x - d) + dx; /* cos(x+dx)=cos(Xi+t)=cos(Xi)cos(t) - sin(Xi)sin(t) */ - MUL2 (d, dd, d, dd, d2, dd2, c, cc); - sn = __sincostab.x[k]; /* */ - ssn = __sincostab.x[k + 1]; /* sin(Xi) and cos(Xi) */ - cs = __sincostab.x[k + 2]; /* */ - ccs = __sincostab.x[k + 3]; /* */ - MUL2 (d2, dd2, s7.x, ss7.x, ds, dss, c, cc); - ADD2 (ds, dss, s5.x, ss5.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, s3.x, ss3.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - MUL2 (d, dd, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, d, dd, ds, dss, r, s); - - MUL2 (d2, dd2, c8.x, cc8.x, dc, dcc, c, cc); - ADD2 (dc, dcc, c6.x, cc6.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c4.x, cc4.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c2.x, cc2.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - - MUL2 (cs, ccs, ds, dss, e, ee, c, cc); - MUL2 (dc, dcc, sn, ssn, dc, dcc, c, cc); - - MUL2 (d2, dd2, s7.x, ss7.x, ds, dss, c, cc); - ADD2 (ds, dss, s5.x, ss5.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, s3.x, ss3.x, ds, dss, r, s); - MUL2 (d2, dd2, ds, dss, ds, dss, c, cc); - MUL2 (d, dd, ds, dss, ds, dss, c, cc); - ADD2 (ds, dss, d, dd, ds, dss, r, s); - MUL2 (d2, dd2, c8.x, cc8.x, dc, dcc, c, cc); - ADD2 (dc, dcc, c6.x, cc6.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c4.x, cc4.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - ADD2 (dc, dcc, c2.x, cc2.x, dc, dcc, r, s); - MUL2 (d2, dd2, dc, dcc, dc, dcc, c, cc); - MUL2 (sn, ssn, ds, dss, e, ee, c, cc); - MUL2 (dc, dcc, cs, ccs, dc, dcc, c, cc); - ADD2 (e, ee, dc, dcc, e, ee, r, s); - SUB2 (cs, ccs, e, ee, e, ee, r, s); - - v[0] = e; - v[1] = ee; -} -/**********************************************************************/ -/* Routine receive Double-Length number (x+dx) and computes cos(x+dx) */ -/* as Double-Length number and store it in array v */ -/**********************************************************************/ -void -SECTION -__docos (double x, double dx, double v[]) -{ - double y, yy, p, w[2]; - if (x > 0) - { - y = x; yy = dx; - } - else - { - y = -x; yy = -dx; - } - if (y < 0.5 * hp0.x) /* y< PI/4 */ - { - __dubcos (y, yy, w); v[0] = w[0]; v[1] = w[1]; - } - else if (y < 1.5 * hp0.x) /* y< 3/4 * PI */ - { - p = hp0.x - y; /* p = PI/2 - y */ - yy = hp1.x - yy; - y = p + yy; - yy = (p - y) + yy; - if (y > 0) - { - __dubsin (y, yy, w); v[0] = w[0]; v[1] = w[1]; - } - /* cos(x) = sin ( 90 - x ) */ - else - { - __dubsin (-y, -yy, w); v[0] = -w[0]; v[1] = -w[1]; - } - } - else /* y>= 3/4 * PI */ - { - p = 2.0 * hp0.x - y; /* p = PI- y */ - yy = 2.0 * hp1.x - yy; - y = p + yy; - yy = (p - y) + yy; - __dubcos (y, yy, w); - v[0] = -w[0]; - v[1] = -w[1]; - } -} diff --git a/sysdeps/ieee754/dbl-64/e_remainder.c b/sysdeps/ieee754/dbl-64/e_remainder.c index bee5e5f1477bcf5e1411b1424bfe3083fec670ed..895345a2f021aa8b9d0b206227088a1e96e2f54b 100644 --- a/sysdeps/ieee754/dbl-64/e_remainder.c +++ b/sysdeps/ieee754/dbl-64/e_remainder.c @@ -32,7 +32,6 @@ #include "endian.h" #include "mydefs.h" #include "urem.h" -#include "MathLib.h" #include #include #include diff --git a/sysdeps/ieee754/dbl-64/e_sqrt.c b/sysdeps/ieee754/dbl-64/e_sqrt.c index c183d39938fe24262ffbb7fc49f4b6afb3cacc11..c4156cfd4578019770306c9de36c03db331352eb 100644 --- a/sysdeps/ieee754/dbl-64/e_sqrt.c +++ b/sysdeps/ieee754/dbl-64/e_sqrt.c @@ -35,7 +35,6 @@ #include "endian.h" #include "mydefs.h" #include -#include "MathLib.h" #include "root.tbl" #include #include diff --git a/sysdeps/ieee754/dbl-64/mpa-arch.h b/sysdeps/ieee754/dbl-64/mpa-arch.h deleted file mode 100644 index 0b33cb89d06e72d1cf370f5616cc624cd745e306..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpa-arch.h +++ /dev/null @@ -1,47 +0,0 @@ -/* Overridable constants and operations. - Copyright (C) 2013-2020 Free Software Foundation, Inc. - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU Lesser General Public License as published by - the Free Software Foundation; either version 2.1 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU Lesser General Public License for more details. - - You should have received a copy of the GNU Lesser General Public License - along with this program; if not, see . */ - -#include - -typedef long mantissa_t; -typedef int64_t mantissa_store_t; - -#define TWOPOW(i) (1L << i) - -#define RADIX_EXP 24 -#define RADIX TWOPOW (RADIX_EXP) /* 2^24 */ - -/* Divide D by RADIX and put the remainder in R. D must be a non-negative - integral value. */ -#define DIV_RADIX(d, r) \ - ({ \ - r = d & (RADIX - 1); \ - d >>= RADIX_EXP; \ - }) - -/* Put the integer component of a double X in R and retain the fraction in - X. This is used in extracting mantissa digits for MP_NO by using the - integer portion of the current value of the number as the current mantissa - digit and then scaling by RADIX to get the next mantissa digit in the same - manner. */ -#define INTEGER_OF(x, i) \ - ({ \ - i = (mantissa_t) x; \ - x -= i; \ - }) - -/* Align IN down to F. The code assumes that F is a power of two. */ -#define ALIGN_DOWN_TO(in, f) ((in) & - (f)) diff --git a/sysdeps/ieee754/dbl-64/mpa.h b/sysdeps/ieee754/dbl-64/mpa.h deleted file mode 100644 index 76656610b946d695619878b776fb83d2a6b5b284..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpa.h +++ /dev/null @@ -1,123 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/************************************************************************/ -/* MODULE_NAME: mpa.h */ -/* */ -/* FUNCTIONS: */ -/* mcr */ -/* acr */ -/* cpy */ -/* mp_dbl */ -/* dbl_mp */ -/* add */ -/* sub */ -/* mul */ -/* dvd */ -/* */ -/* Arithmetic functions for multiple precision numbers. */ -/* Common types and definition */ -/************************************************************************/ - -#include - -/* The mp_no structure holds the details of a multi-precision floating point - number. - - - The radix of the number (R) is 2 ^ 24. - - - E: The exponent of the number. - - - D[0]: The sign (-1, 1) or 0 if the value is 0. In the latter case, the - values of the remaining members of the structure are ignored. - - - D[1] - D[p]: The mantissa of the number where: - - 0 <= D[i] < R and - P is the precision of the number and 1 <= p <= 32 - - D[p+1] ... D[39] have no significance. - - - The value of the number is: - - D[1] * R ^ (E - 1) + D[2] * R ^ (E - 2) ... D[p] * R ^ (E - p) - - */ -typedef struct -{ - int e; - mantissa_t d[40]; -} mp_no; - -typedef union -{ - int i[2]; - double d; -} number; - -extern const mp_no __mpone; -extern const mp_no __mptwo; - -#define X x->d -#define Y y->d -#define Z z->d -#define EX x->e -#define EY y->e -#define EZ z->e - -#ifndef RADIXI -# define RADIXI 0x1.0p-24 /* 2^-24 */ -#endif - -#ifndef TWO52 -# define TWO52 0x1.0p52 /* 2^52 */ -#endif - -#define TWO5 TWOPOW (5) /* 2^5 */ -#define TWO8 TWOPOW (8) /* 2^52 */ -#define TWO10 TWOPOW (10) /* 2^10 */ -#define TWO18 TWOPOW (18) /* 2^18 */ -#define TWO19 TWOPOW (19) /* 2^19 */ -#define TWO23 TWOPOW (23) /* 2^23 */ - -#define HALFRAD TWO23 - -#define TWO57 0x1.0p57 /* 2^57 */ -#define TWO71 0x1.0p71 /* 2^71 */ -#define TWOM1032 0x1.0p-1032 /* 2^-1032 */ -#define TWOM1022 0x1.0p-1022 /* 2^-1022 */ - -#define HALF 0x1.0p-1 /* 1/2 */ -#define MHALF -0x1.0p-1 /* -1/2 */ - -int __acr (const mp_no *, const mp_no *, int); -void __cpy (const mp_no *, mp_no *, int); -void __mp_dbl (const mp_no *, double *, int); -void __dbl_mp (double, mp_no *, int); -void __add (const mp_no *, const mp_no *, mp_no *, int); -void __sub (const mp_no *, const mp_no *, mp_no *, int); -void __mul (const mp_no *, const mp_no *, mp_no *, int); -void __sqr (const mp_no *, mp_no *, int); -void __dvd (const mp_no *, const mp_no *, mp_no *, int); - -extern void __mpatan (mp_no *, mp_no *, int); -extern void __mpatan2 (mp_no *, mp_no *, mp_no *, int); -extern void __mpsqrt (mp_no *, mp_no *, int); -extern void __c32 (mp_no *, mp_no *, mp_no *, int); -extern int __mpranred (double, mp_no *, int); diff --git a/sysdeps/ieee754/dbl-64/mpa.c b/sysdeps/ieee754/dbl-64/mpa.c deleted file mode 100644 index aed4354bacd8ca569a4e1eab6fc9330cb75f74db..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpa.c +++ /dev/null @@ -1,913 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/************************************************************************/ -/* MODULE_NAME: mpa.c */ -/* */ -/* FUNCTIONS: */ -/* mcr */ -/* acr */ -/* cpy */ -/* norm */ -/* denorm */ -/* mp_dbl */ -/* dbl_mp */ -/* add_magnitudes */ -/* sub_magnitudes */ -/* add */ -/* sub */ -/* mul */ -/* inv */ -/* dvd */ -/* */ -/* Arithmetic functions for multiple precision numbers. */ -/* Relative errors are bounded */ -/************************************************************************/ - - -#include "endian.h" -#include "mpa.h" -#include -#include - -#ifndef SECTION -# define SECTION -#endif - -#ifndef NO__CONST -const mp_no __mpone = { 1, { 1.0, 1.0 } }; -const mp_no __mptwo = { 1, { 1.0, 2.0 } }; -#endif - -#ifndef NO___ACR -/* Compare mantissa of two multiple precision numbers regardless of the sign - and exponent of the numbers. */ -static int -mcr (const mp_no *x, const mp_no *y, int p) -{ - long i; - long p2 = p; - for (i = 1; i <= p2; i++) - { - if (X[i] == Y[i]) - continue; - else if (X[i] > Y[i]) - return 1; - else - return -1; - } - return 0; -} - -/* Compare the absolute values of two multiple precision numbers. */ -int -__acr (const mp_no *x, const mp_no *y, int p) -{ - long i; - - if (X[0] == 0) - { - if (Y[0] == 0) - i = 0; - else - i = -1; - } - else if (Y[0] == 0) - i = 1; - else - { - if (EX > EY) - i = 1; - else if (EX < EY) - i = -1; - else - i = mcr (x, y, p); - } - - return i; -} -#endif - -#ifndef NO___CPY -/* Copy multiple precision number X into Y. They could be the same - number. */ -void -__cpy (const mp_no *x, mp_no *y, int p) -{ - long i; - - EY = EX; - for (i = 0; i <= p; i++) - Y[i] = X[i]; -} -#endif - -#ifndef NO___MP_DBL -/* Convert a multiple precision number *X into a double precision - number *Y, normalized case (|x| >= 2**(-1022))). X has precision - P, which is positive. */ -static void -norm (const mp_no *x, double *y, int p) -{ -# define R RADIXI - long i; - double c; - mantissa_t a, u, v, z[5]; - if (p < 5) - { - if (p == 1) - c = X[1]; - else if (p == 2) - c = X[1] + R * X[2]; - else if (p == 3) - c = X[1] + R * (X[2] + R * X[3]); - else /* p == 4. */ - c = (X[1] + R * X[2]) + R * R * (X[3] + R * X[4]); - } - else - { - for (a = 1, z[1] = X[1]; z[1] < TWO23; ) - { - a *= 2; - z[1] *= 2; - } - - for (i = 2; i < 5; i++) - { - mantissa_store_t d, r; - d = X[i] * (mantissa_store_t) a; - DIV_RADIX (d, r); - z[i] = r; - z[i - 1] += d; - } - - u = ALIGN_DOWN_TO (z[3], TWO19); - v = z[3] - u; - - if (v == TWO18) - { - if (z[4] == 0) - { - for (i = 5; i <= p; i++) - { - if (X[i] == 0) - continue; - else - { - z[3] += 1; - break; - } - } - } - else - z[3] += 1; - } - - c = (z[1] + R * (z[2] + R * z[3])) / a; - } - - c *= X[0]; - - for (i = 1; i < EX; i++) - c *= RADIX; - for (i = 1; i > EX; i--) - c *= RADIXI; - - *y = c; -# undef R -} - -/* Convert a multiple precision number *X into a double precision - number *Y, Denormal case (|x| < 2**(-1022))). */ -static void -denorm (const mp_no *x, double *y, int p) -{ - long i, k; - long p2 = p; - double c; - mantissa_t u, z[5]; - -# define R RADIXI - if (EX < -44 || (EX == -44 && X[1] < TWO5)) - { - *y = 0; - return; - } - - if (p2 == 1) - { - if (EX == -42) - { - z[1] = X[1] + TWO10; - z[2] = 0; - z[3] = 0; - k = 3; - } - else if (EX == -43) - { - z[1] = TWO10; - z[2] = X[1]; - z[3] = 0; - k = 2; - } - else - { - z[1] = TWO10; - z[2] = 0; - z[3] = X[1]; - k = 1; - } - } - else if (p2 == 2) - { - if (EX == -42) - { - z[1] = X[1] + TWO10; - z[2] = X[2]; - z[3] = 0; - k = 3; - } - else if (EX == -43) - { - z[1] = TWO10; - z[2] = X[1]; - z[3] = X[2]; - k = 2; - } - else - { - z[1] = TWO10; - z[2] = 0; - z[3] = X[1]; - k = 1; - } - } - else - { - if (EX == -42) - { - z[1] = X[1] + TWO10; - z[2] = X[2]; - k = 3; - } - else if (EX == -43) - { - z[1] = TWO10; - z[2] = X[1]; - k = 2; - } - else - { - z[1] = TWO10; - z[2] = 0; - k = 1; - } - z[3] = X[k]; - } - - u = ALIGN_DOWN_TO (z[3], TWO5); - - if (u == z[3]) - { - for (i = k + 1; i <= p2; i++) - { - if (X[i] == 0) - continue; - else - { - z[3] += 1; - break; - } - } - } - - c = X[0] * ((z[1] + R * (z[2] + R * z[3])) - TWO10); - - *y = c * TWOM1032; -# undef R -} - -/* Convert multiple precision number *X into double precision number *Y. The - result is correctly rounded to the nearest/even. */ -void -__mp_dbl (const mp_no *x, double *y, int p) -{ - if (X[0] == 0) - { - *y = 0; - return; - } - - if (__glibc_likely (EX > -42 || (EX == -42 && X[1] >= TWO10))) - norm (x, y, p); - else - denorm (x, y, p); -} -#endif - -/* Get the multiple precision equivalent of X into *Y. If the precision is too - small, the result is truncated. */ -void -SECTION -__dbl_mp (double x, mp_no *y, int p) -{ - long i, n; - long p2 = p; - - /* Sign. */ - if (x == 0) - { - Y[0] = 0; - return; - } - else if (x > 0) - Y[0] = 1; - else - { - Y[0] = -1; - x = -x; - } - - /* Exponent. */ - for (EY = 1; x >= RADIX; EY += 1) - x *= RADIXI; - for (; x < 1; EY -= 1) - x *= RADIX; - - /* Digits. */ - n = MIN (p2, 4); - for (i = 1; i <= n; i++) - { - INTEGER_OF (x, Y[i]); - x *= RADIX; - } - for (; i <= p2; i++) - Y[i] = 0; -} - -/* Add magnitudes of *X and *Y assuming that abs (*X) >= abs (*Y) > 0. The - sign of the sum *Z is not changed. X and Y may overlap but not X and Z or - Y and Z. No guard digit is used. The result equals the exact sum, - truncated. */ -static void -SECTION -add_magnitudes (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - long i, j, k; - long p2 = p; - mantissa_t zk; - - EZ = EX; - - i = p2; - j = p2 + EY - EX; - k = p2 + 1; - - if (__glibc_unlikely (j < 1)) - { - __cpy (x, z, p); - return; - } - - zk = 0; - - for (; j > 0; i--, j--) - { - zk += X[i] + Y[j]; - if (zk >= RADIX) - { - Z[k--] = zk - RADIX; - zk = 1; - } - else - { - Z[k--] = zk; - zk = 0; - } - } - - for (; i > 0; i--) - { - zk += X[i]; - if (zk >= RADIX) - { - Z[k--] = zk - RADIX; - zk = 1; - } - else - { - Z[k--] = zk; - zk = 0; - } - } - - if (zk == 0) - { - for (i = 1; i <= p2; i++) - Z[i] = Z[i + 1]; - } - else - { - Z[1] = zk; - EZ += 1; - } -} - -/* Subtract the magnitudes of *X and *Y assuming that abs (*x) > abs (*y) > 0. - The sign of the difference *Z is not changed. X and Y may overlap but not X - and Z or Y and Z. One guard digit is used. The error is less than one - ULP. */ -static void -SECTION -sub_magnitudes (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - long i, j, k; - long p2 = p; - mantissa_t zk; - - EZ = EX; - i = p2; - j = p2 + EY - EX; - k = p2; - - /* Y is too small compared to X, copy X over to the result. */ - if (__glibc_unlikely (j < 1)) - { - __cpy (x, z, p); - return; - } - - /* The relevant least significant digit in Y is non-zero, so we factor it in - to enhance accuracy. */ - if (j < p2 && Y[j + 1] > 0) - { - Z[k + 1] = RADIX - Y[j + 1]; - zk = -1; - } - else - zk = Z[k + 1] = 0; - - /* Subtract and borrow. */ - for (; j > 0; i--, j--) - { - zk += (X[i] - Y[j]); - if (zk < 0) - { - Z[k--] = zk + RADIX; - zk = -1; - } - else - { - Z[k--] = zk; - zk = 0; - } - } - - /* We're done with digits from Y, so it's just digits in X. */ - for (; i > 0; i--) - { - zk += X[i]; - if (zk < 0) - { - Z[k--] = zk + RADIX; - zk = -1; - } - else - { - Z[k--] = zk; - zk = 0; - } - } - - /* Normalize. */ - for (i = 1; Z[i] == 0; i++) - ; - EZ = EZ - i + 1; - for (k = 1; i <= p2 + 1; ) - Z[k++] = Z[i++]; - for (; k <= p2; ) - Z[k++] = 0; -} - -/* Add *X and *Y and store the result in *Z. X and Y may overlap, but not X - and Z or Y and Z. One guard digit is used. The error is less than one - ULP. */ -void -SECTION -__add (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - int n; - - if (X[0] == 0) - { - __cpy (y, z, p); - return; - } - else if (Y[0] == 0) - { - __cpy (x, z, p); - return; - } - - if (X[0] == Y[0]) - { - if (__acr (x, y, p) > 0) - { - add_magnitudes (x, y, z, p); - Z[0] = X[0]; - } - else - { - add_magnitudes (y, x, z, p); - Z[0] = Y[0]; - } - } - else - { - if ((n = __acr (x, y, p)) == 1) - { - sub_magnitudes (x, y, z, p); - Z[0] = X[0]; - } - else if (n == -1) - { - sub_magnitudes (y, x, z, p); - Z[0] = Y[0]; - } - else - Z[0] = 0; - } -} - -/* Subtract *Y from *X and return the result in *Z. X and Y may overlap but - not X and Z or Y and Z. One guard digit is used. The error is less than - one ULP. */ -void -SECTION -__sub (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - int n; - - if (X[0] == 0) - { - __cpy (y, z, p); - Z[0] = -Z[0]; - return; - } - else if (Y[0] == 0) - { - __cpy (x, z, p); - return; - } - - if (X[0] != Y[0]) - { - if (__acr (x, y, p) > 0) - { - add_magnitudes (x, y, z, p); - Z[0] = X[0]; - } - else - { - add_magnitudes (y, x, z, p); - Z[0] = -Y[0]; - } - } - else - { - if ((n = __acr (x, y, p)) == 1) - { - sub_magnitudes (x, y, z, p); - Z[0] = X[0]; - } - else if (n == -1) - { - sub_magnitudes (y, x, z, p); - Z[0] = -Y[0]; - } - else - Z[0] = 0; - } -} - -#ifndef NO__MUL -/* Multiply *X and *Y and store result in *Z. X and Y may overlap but not X - and Z or Y and Z. For P in [1, 2, 3], the exact result is truncated to P - digits. In case P > 3 the error is bounded by 1.001 ULP. */ -void -SECTION -__mul (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - long i, j, k, ip, ip2; - long p2 = p; - mantissa_store_t zk; - const mp_no *a; - mantissa_store_t *diag; - - /* Is z=0? */ - if (__glibc_unlikely (X[0] * Y[0] == 0)) - { - Z[0] = 0; - return; - } - - /* We need not iterate through all X's and Y's since it's pointless to - multiply zeroes. Here, both are zero... */ - for (ip2 = p2; ip2 > 0; ip2--) - if (X[ip2] != 0 || Y[ip2] != 0) - break; - - a = X[ip2] != 0 ? y : x; - - /* ... and here, at least one of them is still zero. */ - for (ip = ip2; ip > 0; ip--) - if (a->d[ip] != 0) - break; - - /* The product looks like this for p = 3 (as an example): - - - a1 a2 a3 - x b1 b2 b3 - ----------------------------- - a1*b3 a2*b3 a3*b3 - a1*b2 a2*b2 a3*b2 - a1*b1 a2*b1 a3*b1 - - So our K needs to ideally be P*2, but we're limiting ourselves to P + 3 - for P >= 3. We compute the above digits in two parts; the last P-1 - digits and then the first P digits. The last P-1 digits are a sum of - products of the input digits from P to P-k where K is 0 for the least - significant digit and increases as we go towards the left. The product - term is of the form X[k]*X[P-k] as can be seen in the above example. - - The first P digits are also a sum of products with the same product term, - except that the sum is from 1 to k. This is also evident from the above - example. - - Another thing that becomes evident is that only the most significant - ip+ip2 digits of the result are non-zero, where ip and ip2 are the - 'internal precision' of the input numbers, i.e. digits after ip and ip2 - are all 0. */ - - k = (__glibc_unlikely (p2 < 3)) ? p2 + p2 : p2 + 3; - - while (k > ip + ip2 + 1) - Z[k--] = 0; - - zk = 0; - - /* Precompute sums of diagonal elements so that we can directly use them - later. See the next comment to know we why need them. */ - diag = alloca (k * sizeof (mantissa_store_t)); - mantissa_store_t d = 0; - for (i = 1; i <= ip; i++) - { - d += X[i] * (mantissa_store_t) Y[i]; - diag[i] = d; - } - while (i < k) - diag[i++] = d; - - while (k > p2) - { - long lim = k / 2; - - if (k % 2 == 0) - /* We want to add this only once, but since we subtract it in the sum - of products above, we add twice. */ - zk += 2 * X[lim] * (mantissa_store_t) Y[lim]; - - for (i = k - p2, j = p2; i < j; i++, j--) - zk += (X[i] + X[j]) * (mantissa_store_t) (Y[i] + Y[j]); - - zk -= diag[k - 1]; - - DIV_RADIX (zk, Z[k]); - k--; - } - - /* The real deal. Mantissa digit Z[k] is the sum of all X[i] * Y[j] where i - goes from 1 -> k - 1 and j goes the same range in reverse. To reduce the - number of multiplications, we halve the range and if k is an even number, - add the diagonal element X[k/2]Y[k/2]. Through the half range, we compute - X[i] * Y[j] as (X[i] + X[j]) * (Y[i] + Y[j]) - X[i] * Y[i] - X[j] * Y[j]. - - This reduction tells us that we're summing two things, the first term - through the half range and the negative of the sum of the product of all - terms of X and Y in the full range. i.e. - - SUM(X[i] * Y[i]) for k terms. This is precalculated above for each k in - a single loop so that it completes in O(n) time and can hence be directly - used in the loop below. */ - while (k > 1) - { - long lim = k / 2; - - if (k % 2 == 0) - /* We want to add this only once, but since we subtract it in the sum - of products above, we add twice. */ - zk += 2 * X[lim] * (mantissa_store_t) Y[lim]; - - for (i = 1, j = k - 1; i < j; i++, j--) - zk += (X[i] + X[j]) * (mantissa_store_t) (Y[i] + Y[j]); - - zk -= diag[k - 1]; - - DIV_RADIX (zk, Z[k]); - k--; - } - Z[k] = zk; - - /* Get the exponent sum into an intermediate variable. This is a subtle - optimization, where given enough registers, all operations on the exponent - happen in registers and the result is written out only once into EZ. */ - int e = EX + EY; - - /* Is there a carry beyond the most significant digit? */ - if (__glibc_unlikely (Z[1] == 0)) - { - for (i = 1; i <= p2; i++) - Z[i] = Z[i + 1]; - e--; - } - - EZ = e; - Z[0] = X[0] * Y[0]; -} -#endif - -#ifndef NO__SQR -/* Square *X and store result in *Y. X and Y may not overlap. For P in - [1, 2, 3], the exact result is truncated to P digits. In case P > 3 the - error is bounded by 1.001 ULP. This is a faster special case of - multiplication. */ -void -SECTION -__sqr (const mp_no *x, mp_no *y, int p) -{ - long i, j, k, ip; - mantissa_store_t yk; - - /* Is z=0? */ - if (__glibc_unlikely (X[0] == 0)) - { - Y[0] = 0; - return; - } - - /* We need not iterate through all X's since it's pointless to - multiply zeroes. */ - for (ip = p; ip > 0; ip--) - if (X[ip] != 0) - break; - - k = (__glibc_unlikely (p < 3)) ? p + p : p + 3; - - while (k > 2 * ip + 1) - Y[k--] = 0; - - yk = 0; - - while (k > p) - { - mantissa_store_t yk2 = 0; - long lim = k / 2; - - if (k % 2 == 0) - yk += X[lim] * (mantissa_store_t) X[lim]; - - /* In __mul, this loop (and the one within the next while loop) run - between a range to calculate the mantissa as follows: - - Z[k] = X[k] * Y[n] + X[k+1] * Y[n-1] ... + X[n-1] * Y[k+1] - + X[n] * Y[k] - - For X == Y, we can get away with summing halfway and doubling the - result. For cases where the range size is even, the mid-point needs - to be added separately (above). */ - for (i = k - p, j = p; i < j; i++, j--) - yk2 += X[i] * (mantissa_store_t) X[j]; - - yk += 2 * yk2; - - DIV_RADIX (yk, Y[k]); - k--; - } - - while (k > 1) - { - mantissa_store_t yk2 = 0; - long lim = k / 2; - - if (k % 2 == 0) - yk += X[lim] * (mantissa_store_t) X[lim]; - - /* Likewise for this loop. */ - for (i = 1, j = k - 1; i < j; i++, j--) - yk2 += X[i] * (mantissa_store_t) X[j]; - - yk += 2 * yk2; - - DIV_RADIX (yk, Y[k]); - k--; - } - Y[k] = yk; - - /* Squares are always positive. */ - Y[0] = 1; - - /* Get the exponent sum into an intermediate variable. This is a subtle - optimization, where given enough registers, all operations on the exponent - happen in registers and the result is written out only once into EZ. */ - int e = EX * 2; - - /* Is there a carry beyond the most significant digit? */ - if (__glibc_unlikely (Y[1] == 0)) - { - for (i = 1; i <= p; i++) - Y[i] = Y[i + 1]; - e--; - } - - EY = e; -} -#endif - -/* Invert *X and store in *Y. Relative error bound: - - For P = 2: 1.001 * R ^ (1 - P) - - For P = 3: 1.063 * R ^ (1 - P) - - For P > 3: 2.001 * R ^ (1 - P) - - *X = 0 is not permissible. */ -static void -SECTION -__inv (const mp_no *x, mp_no *y, int p) -{ - long i; - double t; - mp_no z, w; - static const int np1[] = - { 0, 0, 0, 0, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 - }; - - __cpy (x, &z, p); - z.e = 0; - __mp_dbl (&z, &t, p); - t = 1 / t; - - /* t == 0 will never happen at this point, since 1/t can only be 0 if t is - infinity, but before the division t == mantissa of x (exponent is 0). We - can instruct the compiler to ignore this case. */ - if (t == 0) - __builtin_unreachable (); - - __dbl_mp (t, y, p); - EY -= EX; - - for (i = 0; i < np1[p]; i++) - { - __cpy (y, &w, p); - __mul (x, &w, y, p); - __sub (&__mptwo, y, &z, p); - __mul (&w, &z, y, p); - } -} - -/* Divide *X by *Y and store result in *Z. X and Y may overlap but not X and Z - or Y and Z. Relative error bound: - - For P = 2: 2.001 * R ^ (1 - P) - - For P = 3: 2.063 * R ^ (1 - P) - - For P > 3: 3.001 * R ^ (1 - P) - - *X = 0 is not permissible. */ -void -SECTION -__dvd (const mp_no *x, const mp_no *y, mp_no *z, int p) -{ - mp_no w; - - if (X[0] == 0) - Z[0] = 0; - else - { - __inv (y, &w, p); - __mul (x, &w, z, p); - } -} diff --git a/sysdeps/ieee754/dbl-64/mpatan.h b/sysdeps/ieee754/dbl-64/mpatan.h deleted file mode 100644 index 0c8fd24c2cbf8f0fb503cb2bcb86f1198f92502c..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpatan.h +++ /dev/null @@ -1,145 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/******************************************************************/ -/* */ -/* MODULE_NAME:mpatan.h */ -/* */ -/* common data and variables prototype and definition */ -/******************************************************************/ - -#ifndef MPATAN_H -#define MPATAN_H - -extern const number __atan_xm[8] attribute_hidden; -extern const number __atan_twonm1[33] attribute_hidden; -extern const number __atan_twom[8] attribute_hidden; -extern const int __atan_np[33] attribute_hidden; - - -#ifndef AVOID_MPATAN_H -#ifdef BIG_ENDI - const number - __atan_xm[8] = { /* x[m] */ -/**/ {{0x00000000, 0x00000000} }, /* 0.0 */ -/**/ {{0x3f8930be, 0x00000000} }, /* 0.0123 */ -/**/ {{0x3f991687, 0x00000000} }, /* 0.0245 */ -/**/ {{0x3fa923a2, 0x00000000} }, /* 0.0491 */ -/**/ {{0x3fb930be, 0x00000000} }, /* 0.0984 */ -/**/ {{0x3fc95810, 0x00000000} }, /* 0.198 */ -/**/ {{0x3fda7ef9, 0x00000000} }, /* 0.414 */ -/**/ {{0x3ff00000, 0x00000000} }, /* 1.0 */ - }; - const number - __atan_twonm1[33] = { /* 2n-1 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x40260000, 0x00000000} }, /* 11 */ -/**/ {{0x402e0000, 0x00000000} }, /* 15 */ -/**/ {{0x40330000, 0x00000000} }, /* 19 */ -/**/ {{0x40350000, 0x00000000} }, /* 21 */ -/**/ {{0x40390000, 0x00000000} }, /* 25 */ -/**/ {{0x403d0000, 0x00000000} }, /* 29 */ -/**/ {{0x40408000, 0x00000000} }, /* 33 */ -/**/ {{0x40428000, 0x00000000} }, /* 37 */ -/**/ {{0x40448000, 0x00000000} }, /* 41 */ -/**/ {{0x40468000, 0x00000000} }, /* 45 */ -/**/ {{0x40488000, 0x00000000} }, /* 49 */ -/**/ {{0x404a8000, 0x00000000} }, /* 53 */ -/**/ {{0x404b8000, 0x00000000} }, /* 55 */ -/**/ {{0x404d8000, 0x00000000} }, /* 59 */ -/**/ {{0x404f8000, 0x00000000} }, /* 63 */ -/**/ {{0x4050c000, 0x00000000} }, /* 67 */ -/**/ {{0x4051c000, 0x00000000} }, /* 71 */ -/**/ {{0x4052c000, 0x00000000} }, /* 75 */ -/**/ {{0x4053c000, 0x00000000} }, /* 79 */ -/**/ {{0x4054c000, 0x00000000} }, /* 83 */ -/**/ {{0x40554000, 0x00000000} }, /* 85 */ -/**/ {{0x40564000, 0x00000000} }, /* 89 */ -/**/ {{0x40574000, 0x00000000} }, /* 93 */ -/**/ {{0x40584000, 0x00000000} }, /* 97 */ -/**/ {{0x40594000, 0x00000000} }, /* 101 */ -/**/ {{0x405a4000, 0x00000000} }, /* 105 */ -/**/ {{0x405b4000, 0x00000000} }, /* 109 */ -/**/ {{0x405c4000, 0x00000000} }, /* 113 */ -/**/ {{0x405d4000, 0x00000000} }, /* 117 */ - }; - -#else -#ifdef LITTLE_ENDI - - const number - __atan_xm[8] = { /* x[m] */ -/**/ {{0x00000000, 0x00000000} }, /* 0.0 */ -/**/ {{0x00000000, 0x3f8930be} }, /* 0.0123 */ -/**/ {{0x00000000, 0x3f991687} }, /* 0.0245 */ -/**/ {{0x00000000, 0x3fa923a2} }, /* 0.0491 */ -/**/ {{0x00000000, 0x3fb930be} }, /* 0.0984 */ -/**/ {{0x00000000, 0x3fc95810} }, /* 0.198 */ -/**/ {{0x00000000, 0x3fda7ef9} }, /* 0.414 */ -/**/ {{0x00000000, 0x3ff00000} }, /* 1.0 */ - }; - const number -__atan_twonm1[33] = { /* 2n-1 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x00000000} }, /* 0 */ -/**/ {{0x00000000, 0x40260000} }, /* 11 */ -/**/ {{0x00000000, 0x402e0000} }, /* 15 */ -/**/ {{0x00000000, 0x40330000} }, /* 19 */ -/**/ {{0x00000000, 0x40350000} }, /* 21 */ -/**/ {{0x00000000, 0x40390000} }, /* 25 */ -/**/ {{0x00000000, 0x403d0000} }, /* 29 */ -/**/ {{0x00000000, 0x40408000} }, /* 33 */ -/**/ {{0x00000000, 0x40428000} }, /* 37 */ -/**/ {{0x00000000, 0x40448000} }, /* 41 */ -/**/ {{0x00000000, 0x40468000} }, /* 45 */ -/**/ {{0x00000000, 0x40488000} }, /* 49 */ -/**/ {{0x00000000, 0x404a8000} }, /* 53 */ -/**/ {{0x00000000, 0x404b8000} }, /* 55 */ -/**/ {{0x00000000, 0x404d8000} }, /* 59 */ -/**/ {{0x00000000, 0x404f8000} }, /* 63 */ -/**/ {{0x00000000, 0x4050c000} }, /* 67 */ -/**/ {{0x00000000, 0x4051c000} }, /* 71 */ -/**/ {{0x00000000, 0x4052c000} }, /* 75 */ -/**/ {{0x00000000, 0x4053c000} }, /* 79 */ -/**/ {{0x00000000, 0x4054c000} }, /* 83 */ -/**/ {{0x00000000, 0x40554000} }, /* 85 */ -/**/ {{0x00000000, 0x40564000} }, /* 89 */ -/**/ {{0x00000000, 0x40574000} }, /* 93 */ -/**/ {{0x00000000, 0x40584000} }, /* 97 */ -/**/ {{0x00000000, 0x40594000} }, /* 101 */ -/**/ {{0x00000000, 0x405a4000} }, /* 105 */ -/**/ {{0x00000000, 0x405b4000} }, /* 109 */ -/**/ {{0x00000000, 0x405c4000} }, /* 113 */ -/**/ {{0x00000000, 0x405d4000} }, /* 117 */ - }; - -#endif -#endif - - const int - __atan_np[33] = { 0, 0, 0, 0, 6, 8,10,11,13,15,17,19,21,23,25,27,28, - 30,32,34,36,38,40,42,43,45,47,49,51,53,55,57,59}; - -#endif -#endif diff --git a/sysdeps/ieee754/dbl-64/mpatan.c b/sysdeps/ieee754/dbl-64/mpatan.c deleted file mode 100644 index 97a16673d1a9072a3d3f43494035198a343a260e..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpatan.c +++ /dev/null @@ -1,116 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/******************************************************************/ -/* */ -/* MODULE_NAME:mpatan.c */ -/* */ -/* FUNCTIONS:mpatan */ -/* */ -/* FILES NEEDED: mpa.h endian.h mpatan.h */ -/* mpa.c */ -/* */ -/* Multi-Precision Atan function subroutine, for precision p >= 4.*/ -/* The relative error of the result is bounded by 34.32*r**(1-p), */ -/* where r=2**24. */ -/******************************************************************/ - -#include "endian.h" -#include "mpa.h" -#include - -#ifndef SECTION -# define SECTION -#endif - -#include "mpatan.h" - -void -SECTION -__mpatan (mp_no *x, mp_no *y, int p) -{ - int i, m, n; - double dx; - mp_no mptwoim1 = - { - 0, - { - 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, - 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, - 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 - } - }; - - mp_no mps, mpsm, mpt, mpt1, mpt2, mpt3; - - /* Choose m and initiate mptwoim1. */ - if (EX > 0) - m = 7; - else if (EX < 0) - m = 0; - else - { - __mp_dbl (x, &dx, p); - dx = fabs (dx); - for (m = 6; m > 0; m--) - { - if (dx > __atan_xm[m].d) - break; - } - } - mptwoim1.e = 1; - mptwoim1.d[0] = 1; - - /* Reduce x m times. */ - __sqr (x, &mpsm, p); - if (m == 0) - __cpy (x, &mps, p); - else - { - for (i = 0; i < m; i++) - { - __add (&__mpone, &mpsm, &mpt1, p); - __mpsqrt (&mpt1, &mpt2, p); - __add (&mpt2, &mpt2, &mpt1, p); - __add (&__mptwo, &mpsm, &mpt2, p); - __add (&mpt1, &mpt2, &mpt3, p); - __dvd (&mpsm, &mpt3, &mpt1, p); - __cpy (&mpt1, &mpsm, p); - } - __mpsqrt (&mpsm, &mps, p); - mps.d[0] = X[0]; - } - - /* Evaluate a truncated power series for Atan(s). */ - n = __atan_np[p]; - mptwoim1.d[1] = __atan_twonm1[p].d; - __dvd (&mpsm, &mptwoim1, &mpt, p); - for (i = n - 1; i > 1; i--) - { - mptwoim1.d[1] -= 2; - __dvd (&mpsm, &mptwoim1, &mpt1, p); - __mul (&mpsm, &mpt, &mpt2, p); - __sub (&mpt1, &mpt2, &mpt, p); - } - __mul (&mps, &mpt, &mpt1, p); - __sub (&mps, &mpt1, &mpt, p); - - /* Compute Atan(x). */ - mptwoim1.d[1] = 1 << m; - __mul (&mptwoim1, &mpt, y, p); -} diff --git a/sysdeps/ieee754/dbl-64/mpatan2.c b/sysdeps/ieee754/dbl-64/mpatan2.c deleted file mode 100644 index 1ccc02ef8a876eab340b95f37b1921f668b9ba56..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpatan2.c +++ /dev/null @@ -1,67 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/******************************************************************/ -/* MODULE_NAME: mpatan2.c */ -/* */ -/* FUNCTIONS:mpatan2 */ -/* */ -/* FILES NEEDED: mpa.h */ -/* mpa.c mpatan.c mpsqrt.c */ -/* */ -/* Multi-Precision Atan2(y,x) function subroutine, */ -/* for precision p >= 4. */ -/* y=0 is not permitted if x<=0. No error messages are given. */ -/* The relative error of the result is bounded by 44.84*r**(1-p) */ -/* if x <= 0, y != 0 and by 37.33*r**(1-p) if x>0. here r=2**24. */ -/* */ -/******************************************************************/ - -#include "mpa.h" - -#ifndef SECTION -# define SECTION -#endif - -/* Multi-Precision Atan2 (y, x) function subroutine, for p >= 4. - y = 0 is not permitted if x <= 0. No error messages are given. */ -void -SECTION -__mpatan2 (mp_no *y, mp_no *x, mp_no *z, int p) -{ - mp_no mpt1, mpt2, mpt3; - - if (X[0] <= 0) - { - __dvd (x, y, &mpt1, p); - __mul (&mpt1, &mpt1, &mpt2, p); - if (mpt1.d[0] != 0) - mpt1.d[0] = 1; - __add (&mpt2, &__mpone, &mpt3, p); - __mpsqrt (&mpt3, &mpt2, p); - __add (&mpt1, &mpt2, &mpt3, p); - mpt3.d[0] = Y[0]; - __mpatan (&mpt3, &mpt1, p); - __add (&mpt1, &mpt1, z, p); - } - else - { - __dvd (y, x, &mpt1, p); - __mpatan (&mpt1, z, p); - } -} diff --git a/sysdeps/ieee754/dbl-64/mpsqrt.h b/sysdeps/ieee754/dbl-64/mpsqrt.h deleted file mode 100644 index 0e7d12b3b3eac98f71755b4bba5d76ac3f14990e..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpsqrt.h +++ /dev/null @@ -1,38 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/******************************************************************/ -/* */ -/* MODULE_NAME:mpatan.h */ -/* */ -/* common data and variables prototype and definition */ -/******************************************************************/ - -#ifndef MPSQRT_H -#define MPSQRT_H - -extern const int __mpsqrt_mp[33] attribute_hidden; - - -#ifndef AVOID_MPSQRT_H - const int __mpsqrt_mp[33] = {0,0,0,0,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4, - 4,4,4,4,4,4,4,4,4}; -#endif - -#endif diff --git a/sysdeps/ieee754/dbl-64/mpsqrt.c b/sysdeps/ieee754/dbl-64/mpsqrt.c deleted file mode 100644 index 7a5b3544538fb8cfacf90a2362197cc86b7e0569..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mpsqrt.c +++ /dev/null @@ -1,111 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/****************************************************************************/ -/* MODULE_NAME:mpsqrt.c */ -/* */ -/* FUNCTION:mpsqrt */ -/* fastiroot */ -/* */ -/* FILES NEEDED:endian.h mpa.h mpsqrt.h */ -/* mpa.c */ -/* Multi-Precision square root function subroutine for precision p >= 4. */ -/* The relative error is bounded by 3.501*r**(1-p), where r=2**24. */ -/* */ -/****************************************************************************/ -#include "endian.h" -#include "mpa.h" - -#ifndef SECTION -# define SECTION -#endif - -#include "mpsqrt.h" - -/****************************************************************************/ -/* Multi-Precision square root function subroutine for precision p >= 4. */ -/* The relative error is bounded by 3.501*r**(1-p), where r=2**24. */ -/* Routine receives two pointers to Multi Precision numbers: */ -/* x (left argument) and y (next argument). Routine also receives precision */ -/* p as integer. Routine computes sqrt(*x) and stores result in *y */ -/****************************************************************************/ - -static double fastiroot (double); - -void -SECTION -__mpsqrt (mp_no *x, mp_no *y, int p) -{ - int i, m, ey; - double dx, dy; - static const mp_no mphalf = {0, {1.0, HALFRAD}}; - static const mp_no mp3halfs = {1, {1.0, 1.0, HALFRAD}}; - mp_no mpxn, mpz, mpu, mpt1, mpt2; - - ey = EX / 2; - __cpy (x, &mpxn, p); - mpxn.e -= (ey + ey); - __mp_dbl (&mpxn, &dx, p); - dy = fastiroot (dx); - __dbl_mp (dy, &mpu, p); - __mul (&mpxn, &mphalf, &mpz, p); - - m = __mpsqrt_mp[p]; - for (i = 0; i < m; i++) - { - __sqr (&mpu, &mpt1, p); - __mul (&mpt1, &mpz, &mpt2, p); - __sub (&mp3halfs, &mpt2, &mpt1, p); - __mul (&mpu, &mpt1, &mpt2, p); - __cpy (&mpt2, &mpu, p); - } - __mul (&mpxn, &mpu, y, p); - EY += ey; -} - -/***********************************************************/ -/* Compute a double precision approximation for 1/sqrt(x) */ -/* with the relative error bounded by 2**-51. */ -/***********************************************************/ -static double -SECTION -fastiroot (double x) -{ - union - { - int i[2]; - double d; - } p, q; - double y, z, t; - int n; - static const double c0 = 0.99674, c1 = -0.53380; - static const double c2 = 0.45472, c3 = -0.21553; - - p.d = x; - p.i[HIGH_HALF] = (p.i[HIGH_HALF] & 0x3FFFFFFF) | 0x3FE00000; - q.d = x; - y = p.d; - z = y - 1.0; - n = (q.i[HIGH_HALF] - p.i[HIGH_HALF]) >> 1; - z = ((c3 * z + c2) * z + c1) * z + c0; /* 2**-7 */ - z = z * (1.5 - 0.5 * y * z * z); /* 2**-14 */ - p.d = z * (1.5 - 0.5 * y * z * z); /* 2**-28 */ - p.i[HIGH_HALF] -= n; - t = x * p.d; - return p.d * (1.5 - 0.5 * p.d * t); -} diff --git a/sysdeps/ieee754/dbl-64/mptan.c b/sysdeps/ieee754/dbl-64/mptan.c deleted file mode 100644 index 79fe1b3578046ffb8ba612795c85768a3c87a35d..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/mptan.c +++ /dev/null @@ -1,63 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/**********************************************************************/ -/* MODULE_NAME:mptan.c */ -/* */ -/* FUNCTION: mptan */ -/* */ -/* FILES NEEDED: endian.h mpa.h */ -/* mpa.c sincos32.c branred.c */ -/* */ -/* Multi-Precision tan() function subroutine, for p=32. It is based */ -/* on the routines mpranred() and c32(). mpranred() performs range */ -/* reduction of a double number x into a multiple precision number */ -/* y, such that y=x-n*pi/2, abs(y)d[0] *= -1; - } - /* tan is negative in this area. */ - else - __dvd (&mps, &mpc, mpy, p); -} diff --git a/sysdeps/ieee754/dbl-64/s_sin.c b/sysdeps/ieee754/dbl-64/s_sin.c index 64f81912a125e6382061d0853a8e1b12109128ff..e8f9965b18e89d08bf264810793598adaa93145b 100644 --- a/sysdeps/ieee754/dbl-64/s_sin.c +++ b/sysdeps/ieee754/dbl-64/s_sin.c @@ -38,7 +38,6 @@ #include "endian.h" #include "mydefs.h" #include "usncs.h" -#include "MathLib.h" #include #include #include diff --git a/sysdeps/ieee754/dbl-64/sincos32.h b/sysdeps/ieee754/dbl-64/sincos32.h deleted file mode 100644 index 1fd33c3c448441ad1b5e21b9da6b68cb227af20a..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/sincos32.h +++ /dev/null @@ -1,81 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * Written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ - -/******************************************************************/ -/* */ -/* MODULE_NAME:sincos32.h */ -/* */ -/* common data and variables prototype and definition */ -/******************************************************************/ - -#ifndef SINCOS32_H -#define SINCOS32_H - -#ifdef BIG_ENDI -static const number -/**/ hpinv = {{0x3FE45F30, 0x6DC9C883}}, /* 0.63661977236758138 */ -/**/ toint = {{0x43380000, 0x00000000}}; /* 6755399441055744 */ - -#else -#ifdef LITTLE_ENDI -static const number -/**/ hpinv = {{0x6DC9C883, 0x3FE45F30}}, /* 0.63661977236758138 */ -/**/ toint = {{0x00000000, 0x43380000}}; /* 6755399441055744 */ - -#endif -#endif - -static const mp_no - oofac27 = {-3,{1.0,7.0,4631664.0,12006312.0,13118056.0,6538613.0,646354.0, - 8508025.0,9131256.0,7548776.0,2529842.0,8864927.0,660489.0,15595125.0,12777885.0, - 11618489.0,13348664.0,5486686.0,514518.0,11275535.0,4727621.0,3575562.0, - 13579710.0,5829745.0,7531862.0,9507898.0,6915060.0,4079264.0,1907586.0, - 6078398.0,13789314.0,5504104.0,14136.0}}, - pi = {1,{1.0,3.0, - 2375530.0,8947107.0,578323.0,1673774.0,225395.0,4498441.0,3678761.0, - 10432976.0,536314.0,10021966.0,7113029.0,2630118.0,3723283.0,7847508.0, - 6737716.0,15273068.0,12626985.0,12044668.0,5299519.0,8705461.0,11880201.0, - 1544726.0,14014857.0,7994139.0,13709579.0,10918111.0,11906095.0,16610011.0, - 13638367.0,12040417.0,11529578.0,2522774.0}}, - hp = {1,{1.0, 1.0, - 9576373.0,4473553.0,8677769.0,9225495.0,112697.0,10637828.0, - 10227988.0,13605096.0,268157.0,5010983.0,3556514.0,9703667.0, - 1861641.0,12312362.0,3368858.0,7636534.0,6313492.0,14410942.0, - 2649759.0,12741338.0,14328708.0,9160971.0,7007428.0,12385677.0, - 15243397.0,13847663.0,14341655.0,16693613.0,15207791.0,14408816.0, - 14153397.0,1261387.0,6110792.0,2291862.0,4181138.0,5295267.0}}; - -static const double toverp[75] = { - 10680707.0, 7228996.0, 1387004.0, 2578385.0, 16069853.0, - 12639074.0, 9804092.0, 4427841.0, 16666979.0, 11263675.0, - 12935607.0, 2387514.0, 4345298.0, 14681673.0, 3074569.0, - 13734428.0, 16653803.0, 1880361.0, 10960616.0, 8533493.0, - 3062596.0, 8710556.0, 7349940.0, 6258241.0, 3772886.0, - 3769171.0, 3798172.0, 8675211.0, 12450088.0, 3874808.0, - 9961438.0, 366607.0, 15675153.0, 9132554.0, 7151469.0, - 3571407.0, 2607881.0, 12013382.0, 4155038.0, 6285869.0, - 7677882.0, 13102053.0, 15825725.0, 473591.0, 9065106.0, - 15363067.0, 6271263.0, 9264392.0, 5636912.0, 4652155.0, - 7056368.0, 13614112.0, 10155062.0, 1944035.0, 9527646.0, - 15080200.0, 6658437.0, 6231200.0, 6832269.0, 16767104.0, - 5075751.0, 3212806.0, 1398474.0, 7579849.0, 6349435.0, - 12618859.0, 4703257.0, 12806093.0, 14477321.0, 2786137.0, - 12875403.0, 9837734.0, 14528324.0, 13719321.0, 343717.0 }; - -#endif diff --git a/sysdeps/ieee754/dbl-64/sincos32.c b/sysdeps/ieee754/dbl-64/sincos32.c deleted file mode 100644 index a28932dffef7f7648ba2ed6d670157c34b4282b4..0000000000000000000000000000000000000000 --- a/sysdeps/ieee754/dbl-64/sincos32.c +++ /dev/null @@ -1,307 +0,0 @@ -/* - * IBM Accurate Mathematical Library - * written by International Business Machines Corp. - * Copyright (C) 2001-2020 Free Software Foundation, Inc. - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License as published by - * the Free Software Foundation; either version 2.1 of the License, or - * (at your option) any later version. - * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License for more details. - * - * You should have received a copy of the GNU Lesser General Public License - * along with this program; if not, see . - */ -/****************************************************************/ -/* MODULE_NAME: sincos32.c */ -/* */ -/* FUNCTIONS: ss32 */ -/* cc32 */ -/* c32 */ -/* sin32 */ -/* cos32 */ -/* mpsin */ -/* mpcos */ -/* mpranred */ -/* mpsin1 */ -/* mpcos1 */ -/* */ -/* FILES NEEDED: endian.h mpa.h sincos32.h */ -/* mpa.c */ -/* */ -/* Multi Precision sin() and cos() function with p=32 for sin()*/ -/* cos() arcsin() and arccos() routines */ -/* In addition mpranred() routine performs range reduction of */ -/* a double number x into multi precision number y, */ -/* such that y=x-n*pi/2, abs(y) -#include -#include - -#ifndef SECTION -# define SECTION -#endif - -/* Compute Multi-Precision sin() function for given p. Receive Multi Precision - number x and result stored at y. */ -static void -SECTION -ss32 (mp_no *x, mp_no *y, int p) -{ - int i; - double a; - mp_no mpt1, x2, gor, sum, mpk = {1, {1.0}}; - for (i = 1; i <= p; i++) - mpk.d[i] = 0; - - __sqr (x, &x2, p); - __cpy (&oofac27, &gor, p); - __cpy (&gor, &sum, p); - for (a = 27.0; a > 1.0; a -= 2.0) - { - mpk.d[1] = a * (a - 1.0); - __mul (&gor, &mpk, &mpt1, p); - __cpy (&mpt1, &gor, p); - __mul (&x2, &sum, &mpt1, p); - __sub (&gor, &mpt1, &sum, p); - } - __mul (x, &sum, y, p); -} - -/* Compute Multi-Precision cos() function for given p. Receive Multi Precision - number x and result stored at y. */ -static void -SECTION -cc32 (mp_no *x, mp_no *y, int p) -{ - int i; - double a; - mp_no mpt1, x2, gor, sum, mpk = {1, {1.0}}; - for (i = 1; i <= p; i++) - mpk.d[i] = 0; - - __sqr (x, &x2, p); - mpk.d[1] = 27.0; - __mul (&oofac27, &mpk, &gor, p); - __cpy (&gor, &sum, p); - for (a = 26.0; a > 2.0; a -= 2.0) - { - mpk.d[1] = a * (a - 1.0); - __mul (&gor, &mpk, &mpt1, p); - __cpy (&mpt1, &gor, p); - __mul (&x2, &sum, &mpt1, p); - __sub (&gor, &mpt1, &sum, p); - } - __mul (&x2, &sum, y, p); -} - -/* Compute both sin(x), cos(x) as Multi precision numbers. */ -void -SECTION -__c32 (mp_no *x, mp_no *y, mp_no *z, int p) -{ - mp_no u, t, t1, t2, c, s; - int i; - __cpy (x, &u, p); - u.e = u.e - 1; - cc32 (&u, &c, p); - ss32 (&u, &s, p); - for (i = 0; i < 24; i++) - { - __mul (&c, &s, &t, p); - __sub (&s, &t, &t1, p); - __add (&t1, &t1, &s, p); - __sub (&__mptwo, &c, &t1, p); - __mul (&t1, &c, &t2, p); - __add (&t2, &t2, &c, p); - } - __sub (&__mpone, &c, y, p); - __cpy (&s, z, p); -} - -/* Compute sin() of double-length number (X + DX) as Multi Precision number and - return result as double. If REDUCE_RANGE is true, X is assumed to be the - original input and DX is ignored. */ -double -SECTION -__mpsin (double x, double dx, bool reduce_range) -{ - double y; - mp_no a, b, c, s; - int n; - int p = 32; - - if (reduce_range) - { - n = __mpranred (x, &a, p); /* n is 0, 1, 2 or 3. */ - __c32 (&a, &c, &s, p); - } - else - { - n = -1; - __dbl_mp (x, &b, p); - __dbl_mp (dx, &c, p); - __add (&b, &c, &a, p); - if (x > 0.8) - { - __sub (&hp, &a, &b, p); - __c32 (&b, &s, &c, p); - } - else - __c32 (&a, &c, &s, p); /* b = sin(x+dx) */ - } - - /* Convert result based on which quarter of unit circle y is in. */ - switch (n) - { - case 1: - __mp_dbl (&c, &y, p); - break; - - case 3: - __mp_dbl (&c, &y, p); - y = -y; - break; - - case 2: - __mp_dbl (&s, &y, p); - y = -y; - break; - - /* Quadrant not set, so the result must be sin (X + DX), which is also in - S. */ - case 0: - default: - __mp_dbl (&s, &y, p); - } - LIBC_PROBE (slowsin, 3, &x, &dx, &y); - return y; -} - -/* Compute cos() of double-length number (X + DX) as Multi Precision number and - return result as double. If REDUCE_RANGE is true, X is assumed to be the - original input and DX is ignored. */ -double -SECTION -__mpcos (double x, double dx, bool reduce_range) -{ - double y; - mp_no a, b, c, s; - int n; - int p = 32; - - if (reduce_range) - { - n = __mpranred (x, &a, p); /* n is 0, 1, 2 or 3. */ - __c32 (&a, &c, &s, p); - } - else - { - n = -1; - __dbl_mp (x, &b, p); - __dbl_mp (dx, &c, p); - __add (&b, &c, &a, p); - if (x > 0.8) - { - __sub (&hp, &a, &b, p); - __c32 (&b, &s, &c, p); - } - else - __c32 (&a, &c, &s, p); /* a = cos(x+dx) */ - } - - /* Convert result based on which quarter of unit circle y is in. */ - switch (n) - { - case 1: - __mp_dbl (&s, &y, p); - y = -y; - break; - - case 3: - __mp_dbl (&s, &y, p); - break; - - case 2: - __mp_dbl (&c, &y, p); - y = -y; - break; - - /* Quadrant not set, so the result must be cos (X + DX), which is also - stored in C. */ - case 0: - default: - __mp_dbl (&c, &y, p); - } - LIBC_PROBE (slowcos, 3, &x, &dx, &y); - return y; -} - -/* Perform range reduction of a double number x into multi precision number y, - such that y = x - n * pi / 2, abs (y) < pi / 4, n = 0, +-1, +-2, ... - Return int which indicates in which quarter of circle x is. */ -int -SECTION -__mpranred (double x, mp_no *y, int p) -{ - number v; - double t, xn; - int i, k, n; - mp_no a, b, c; - - if (fabs (x) < 2.8e14) - { - t = (x * hpinv.d + toint.d); - xn = t - toint.d; - v.d = t; - n = v.i[LOW_HALF] & 3; - __dbl_mp (xn, &a, p); - __mul (&a, &hp, &b, p); - __dbl_mp (x, &c, p); - __sub (&c, &b, y, p); - return n; - } - else - { - /* If x is very big more precision required. */ - __dbl_mp (x, &a, p); - a.d[0] = 1.0; - k = a.e - 5; - if (k < 0) - k = 0; - b.e = -k; - b.d[0] = 1.0; - for (i = 0; i < p; i++) - b.d[i + 1] = toverp[i + k]; - __mul (&a, &b, &c, p); - t = c.d[c.e]; - for (i = 1; i <= p - c.e; i++) - c.d[i] = c.d[i + c.e]; - for (i = p + 1 - c.e; i <= p; i++) - c.d[i] = 0; - c.e = 0; - if (c.d[1] >= HALFRAD) - { - t += 1.0; - __sub (&c, &__mpone, &b, p); - __mul (&b, &hp, y, p); - } - else - __mul (&c, &hp, y, p); - n = (int) t; - if (x < 0) - { - y->d[0] = -y->d[0]; - n = -n; - } - return (n & 3); - } -} diff --git a/sysdeps/x86_64/fpu/multiarch/Makefile b/sysdeps/x86_64/fpu/multiarch/Makefile index 3836574f48400eb69e3b8996103cfb3b4f4d3ea8..57892c56bb7705737ac637bed851171dd125b6bc 100644 --- a/sysdeps/x86_64/fpu/multiarch/Makefile +++ b/sysdeps/x86_64/fpu/multiarch/Makefile @@ -9,25 +9,14 @@ libm-sysdep_routines += s_ceil-sse4_1 s_ceilf-sse4_1 s_floor-sse4_1 \ s_trunc-sse4_1 s_truncf-sse4_1 libm-sysdep_routines += e_exp-fma e_log-fma e_pow-fma s_atan-fma \ - e_asin-fma e_atan2-fma s_sin-fma s_tan-fma \ - mpa-fma \ - sincos32-fma doasin-fma dosincos-fma \ - mpatan2-fma mpatan-fma mpsqrt-fma mptan-fma + e_asin-fma e_atan2-fma s_sin-fma s_tan-fma -CFLAGS-doasin-fma.c = -mfma -mavx2 -CFLAGS-dosincos-fma.c = -mfma -mavx2 CFLAGS-e_asin-fma.c = -mfma -mavx2 CFLAGS-e_atan2-fma.c = -mfma -mavx2 CFLAGS-e_exp-fma.c = -mfma -mavx2 CFLAGS-e_log-fma.c = -mfma -mavx2 CFLAGS-e_pow-fma.c = -mfma -mavx2 -CFLAGS-mpa-fma.c = -mfma -mavx2 -CFLAGS-mpatan-fma.c = -mfma -mavx2 -CFLAGS-mpatan2-fma.c = -mfma -mavx2 -CFLAGS-mpsqrt-fma.c = -mfma -mavx2 -CFLAGS-mptan-fma.c = -mfma -mavx2 CFLAGS-s_atan-fma.c = -mfma -mavx2 -CFLAGS-sincos32-fma.c = -mfma -mavx2 CFLAGS-s_sin-fma.c = -mfma -mavx2 CFLAGS-s_tan-fma.c = -mfma -mavx2 @@ -46,36 +35,23 @@ CFLAGS-s_cosf-fma.c = -mfma -mavx2 CFLAGS-s_sincosf-fma.c = -mfma -mavx2 libm-sysdep_routines += e_exp-fma4 e_log-fma4 e_pow-fma4 s_atan-fma4 \ - e_asin-fma4 e_atan2-fma4 s_sin-fma4 s_tan-fma4 \ - mpa-fma4 \ - sincos32-fma4 doasin-fma4 dosincos-fma4 \ - mpatan2-fma4 mpatan-fma4 mpsqrt-fma4 mptan-fma4 + e_asin-fma4 e_atan2-fma4 s_sin-fma4 s_tan-fma4 -CFLAGS-doasin-fma4.c = -mfma4 -CFLAGS-dosincos-fma4.c = -mfma4 CFLAGS-e_asin-fma4.c = -mfma4 CFLAGS-e_atan2-fma4.c = -mfma4 CFLAGS-e_exp-fma4.c = -mfma4 CFLAGS-e_log-fma4.c = -mfma4 CFLAGS-e_pow-fma4.c = -mfma4 -CFLAGS-mpa-fma4.c = -mfma4 -CFLAGS-mpatan-fma4.c = -mfma4 -CFLAGS-mpatan2-fma4.c = -mfma4 -CFLAGS-mpsqrt-fma4.c = -mfma4 -CFLAGS-mptan-fma4.c = -mfma4 CFLAGS-s_atan-fma4.c = -mfma4 -CFLAGS-sincos32-fma4.c = -mfma4 CFLAGS-s_sin-fma4.c = -mfma4 CFLAGS-s_tan-fma4.c = -mfma4 libm-sysdep_routines += e_exp-avx e_log-avx s_atan-avx \ - e_atan2-avx s_sin-avx s_tan-avx \ - mpa-avx + e_atan2-avx s_sin-avx s_tan-avx CFLAGS-e_atan2-avx.c = -msse2avx -DSSE2AVX CFLAGS-e_exp-avx.c = -msse2avx -DSSE2AVX CFLAGS-e_log-avx.c = -msse2avx -DSSE2AVX -CFLAGS-mpa-avx.c = -msse2avx -DSSE2AVX CFLAGS-s_atan-avx.c = -msse2avx -DSSE2AVX CFLAGS-s_sin-avx.c = -msse2avx -DSSE2AVX CFLAGS-s_tan-avx.c = -msse2avx -DSSE2AVX diff --git a/sysdeps/x86_64/fpu/multiarch/doasin-fma.c b/sysdeps/x86_64/fpu/multiarch/doasin-fma.c deleted file mode 100644 index 7a09865fcaa98bc50b5461e5aca181325de9d383..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/doasin-fma.c +++ /dev/null @@ -1,4 +0,0 @@ -#define __doasin __doasin_fma -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/doasin-fma4.c b/sysdeps/x86_64/fpu/multiarch/doasin-fma4.c deleted file mode 100644 index 53eb4194726e605af7acf7f6a6513203acbca5c8..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/doasin-fma4.c +++ /dev/null @@ -1,4 +0,0 @@ -#define __doasin __doasin_fma4 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/dosincos-fma.c b/sysdeps/x86_64/fpu/multiarch/dosincos-fma.c deleted file mode 100644 index 5744586bdbda42646686d103074e6902087e85bf..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/dosincos-fma.c +++ /dev/null @@ -1,6 +0,0 @@ -#define __docos __docos_fma -#define __dubcos __dubcos_fma -#define __dubsin __dubsin_fma -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/dosincos-fma4.c b/sysdeps/x86_64/fpu/multiarch/dosincos-fma4.c deleted file mode 100644 index 1578b2fce0be41bd396abf2da8153444f5578602..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/dosincos-fma4.c +++ /dev/null @@ -1,6 +0,0 @@ -#define __docos __docos_fma4 -#define __dubcos __dubcos_fma4 -#define __dubsin __dubsin_fma4 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpa-avx.c b/sysdeps/x86_64/fpu/multiarch/mpa-avx.c deleted file mode 100644 index 366b0b7134078e79d243502dcc23198f669cf73d..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpa-avx.c +++ /dev/null @@ -1,14 +0,0 @@ -#define __add __add_avx -#define __mul __mul_avx -#define __sqr __sqr_avx -#define __sub __sub_avx -#define __dbl_mp __dbl_mp_avx -#define __dvd __dvd_avx - -#define NO___CPY 1 -#define NO___MP_DBL 1 -#define NO___ACR 1 -#define NO__CONST 1 -#define SECTION __attribute__ ((section (".text.avx"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpa-fma.c b/sysdeps/x86_64/fpu/multiarch/mpa-fma.c deleted file mode 100644 index 177cc2517f66a593ecee4737804e4c771e77e848..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpa-fma.c +++ /dev/null @@ -1,14 +0,0 @@ -#define __add __add_fma -#define __mul __mul_fma -#define __sqr __sqr_fma -#define __sub __sub_fma -#define __dbl_mp __dbl_mp_fma -#define __dvd __dvd_fma - -#define NO___CPY 1 -#define NO___MP_DBL 1 -#define NO___ACR 1 -#define NO__CONST 1 -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpa-fma4.c b/sysdeps/x86_64/fpu/multiarch/mpa-fma4.c deleted file mode 100644 index a4a759407e48c5cf1e375b32b1f9a54ce9f08c40..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpa-fma4.c +++ /dev/null @@ -1,14 +0,0 @@ -#define __add __add_fma4 -#define __mul __mul_fma4 -#define __sqr __sqr_fma4 -#define __sub __sub_fma4 -#define __dbl_mp __dbl_mp_fma4 -#define __dvd __dvd_fma4 - -#define NO___CPY 1 -#define NO___MP_DBL 1 -#define NO___ACR 1 -#define NO__CONST 1 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpatan-fma.c b/sysdeps/x86_64/fpu/multiarch/mpatan-fma.c deleted file mode 100644 index d216f9142de1cb646cc7c0e00816a97f88fc515f..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpatan-fma.c +++ /dev/null @@ -1,10 +0,0 @@ -#define __mpatan __mpatan_fma -#define __add __add_fma -#define __dvd __dvd_fma -#define __mpsqrt __mpsqrt_fma -#define __mul __mul_fma -#define __sub __sub_fma -#define AVOID_MPATAN_H 1 -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpatan-fma4.c b/sysdeps/x86_64/fpu/multiarch/mpatan-fma4.c deleted file mode 100644 index fbd3bd49a2b40a83a12f7589e7e8b233e9dee8c3..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpatan-fma4.c +++ /dev/null @@ -1,10 +0,0 @@ -#define __mpatan __mpatan_fma4 -#define __add __add_fma4 -#define __dvd __dvd_fma4 -#define __mpsqrt __mpsqrt_fma4 -#define __mul __mul_fma4 -#define __sub __sub_fma4 -#define AVOID_MPATAN_H 1 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpatan2-fma.c b/sysdeps/x86_64/fpu/multiarch/mpatan2-fma.c deleted file mode 100644 index 98df336f79fca93aef6d8dbcb5510c064d049ef3..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpatan2-fma.c +++ /dev/null @@ -1,9 +0,0 @@ -#define __mpatan2 __mpatan2_fma -#define __add __add_fma -#define __dvd __dvd_fma -#define __mpatan __mpatan_fma -#define __mpsqrt __mpsqrt_fma -#define __mul __mul_fma -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpatan2-fma4.c b/sysdeps/x86_64/fpu/multiarch/mpatan2-fma4.c deleted file mode 100644 index e6e44d49b09f67d26507a13e4d1b55c4cb5a058b..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpatan2-fma4.c +++ /dev/null @@ -1,9 +0,0 @@ -#define __mpatan2 __mpatan2_fma4 -#define __add __add_fma4 -#define __dvd __dvd_fma4 -#define __mpatan __mpatan_fma4 -#define __mpsqrt __mpsqrt_fma4 -#define __mul __mul_fma4 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma.c b/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma.c deleted file mode 100644 index 44d7a23ae3332b9e4d0f3eabe115f3bf5fe099e9..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma.c +++ /dev/null @@ -1,8 +0,0 @@ -#define __mpsqrt __mpsqrt_fma -#define __dbl_mp __dbl_mp_fma -#define __mul __mul_fma -#define __sub __sub_fma -#define AVOID_MPSQRT_H 1 -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma4.c b/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma4.c deleted file mode 100644 index f8a1ba2d92300ce3ace02bad3bc3311230037e02..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mpsqrt-fma4.c +++ /dev/null @@ -1,8 +0,0 @@ -#define __mpsqrt __mpsqrt_fma4 -#define __dbl_mp __dbl_mp_fma4 -#define __mul __mul_fma4 -#define __sub __sub_fma4 -#define AVOID_MPSQRT_H 1 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mptan-fma.c b/sysdeps/x86_64/fpu/multiarch/mptan-fma.c deleted file mode 100644 index d1a691413c58785b56fa54be0924d42103c2dc50..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mptan-fma.c +++ /dev/null @@ -1,7 +0,0 @@ -#define __mptan __mptan_fma -#define __c32 __c32_fma -#define __dvd __dvd_fma -#define __mpranred __mpranred_fma -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/mptan-fma4.c b/sysdeps/x86_64/fpu/multiarch/mptan-fma4.c deleted file mode 100644 index fb4a9d48cae2737af89d85611d64541e286138ed..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/mptan-fma4.c +++ /dev/null @@ -1,7 +0,0 @@ -#define __mptan __mptan_fma4 -#define __c32 __c32_fma4 -#define __dvd __dvd_fma4 -#define __mpranred __mpranred_fma4 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/sincos32-fma.c b/sysdeps/x86_64/fpu/multiarch/sincos32-fma.c deleted file mode 100644 index 4152b8483535b253c6e9e75978cc0da26d13b7d7..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/sincos32-fma.c +++ /dev/null @@ -1,13 +0,0 @@ -#define __c32 __c32_fma -#define __mpsin __mpsin_fma -#define __mpsin1 __mpsin1_fma -#define __mpcos __mpcos_fma -#define __mpcos1 __mpcos1_fma -#define __mpranred __mpranred_fma -#define __add __add_fma -#define __dbl_mp __dbl_mp_fma -#define __mul __mul_fma -#define __sub __sub_fma -#define SECTION __attribute__ ((section (".text.fma"))) - -#include diff --git a/sysdeps/x86_64/fpu/multiarch/sincos32-fma4.c b/sysdeps/x86_64/fpu/multiarch/sincos32-fma4.c deleted file mode 100644 index 643eedf1381a8ca8bcfd2d83448c410870bba8cf..0000000000000000000000000000000000000000 --- a/sysdeps/x86_64/fpu/multiarch/sincos32-fma4.c +++ /dev/null @@ -1,13 +0,0 @@ -#define __c32 __c32_fma4 -#define __mpsin __mpsin_fma4 -#define __mpsin1 __mpsin1_fma4 -#define __mpcos __mpcos_fma4 -#define __mpcos1 __mpcos1_fma4 -#define __mpranred __mpranred_fma4 -#define __add __add_fma4 -#define __dbl_mp __dbl_mp_fma4 -#define __mul __mul_fma4 -#define __sub __sub_fma4 -#define SECTION __attribute__ ((section (".text.fma4"))) - -#include