From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id B75A93858C20; Fri, 2 Jun 2023 10:53:38 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org B75A93858C20 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1685703218; bh=nIcgb8dO0nRWU8jMBINlqEh/jMz7Y7Vqpx92A3VVkac=; h=From:To:Subject:Date:In-Reply-To:References:From; b=SOe+5yP10epzwLJCsBREXL5TTaVAw5JObNtz+4Pw+lLSTRIt+uTtfBoXUc6dtwo8W q7Td+vj07zsAItWL3WXc+ar2RGwrvOWCRg3s9OjkNHtV1yr+OafNT2n6OiKMeP2AM3 HPcj8m1GZLmbWIEUy0IkoIBbJ1wKsu7eH96jRFcY= From: "jakub at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug c/102989] Implement C2x's n2763 (_BitInt) Date: Fri, 02 Jun 2023 10:53:38 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: c X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: enhancement X-Bugzilla-Who: jakub at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: Message-ID: In-Reply-To: References: Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated MIME-Version: 1.0 List-Id: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D102989 --- Comment #55 from Jakub Jelinek --- (In reply to rguenther@suse.de from comment #54) > At least for -Os we probably want to consider moving everything but=20 > small and maybe middle to out of line library functions? Not sure about that, we need to judge the space savings vs. having all those routines in libgcc_s.so.1 where the size price would be paid by all processes even w= hen they don't use the large/huge _BitInt at all. I certainly plan to have multiplication and division/modulo on libgcc_s.so.= 1. Admittedly, some entrypoints could be just in libgcc.a and not libgcc_s.so.= 1. Don't we already have a case for that - the DFP stuff? There are very cheap operations (say bitwise &/|/^/~) which have no dependencies in between limbs, then some with small dependencies (e.g. +/- = or shifts or rotates by constant), but e.g. already shifts/rotates by variable count is already going to be ugly at least for the huge ones.=