{"bugs":[{"bugid":962702,"firstseen":"2025-09-10T20:58:28.577922","severity":"normal","status":"CONFIRMED","summary":"dev-libs\/libtomfloat-0.02-r1 - [meson] [jdk25] [gcc-16] QA Notice: unstripped LTO libs"}],"categories":[{"categoryid":393,"name":"dev-libs","summary":"The dev-libs category contains various miscellaneous programming libraries."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"a622247d5076378016183b134658a6f7e55fbdd4","committime":"2019-11-29T22:25:51","packageid":42307,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"bman@gentoo.org","authorname":"Aaron Bauman","body":"Signed-off-by: Aaron Bauman ","commitid":"b17b19b933aea02acbb7dac7fb955ea5f70db2da","committime":"2019-11-29T22:18:15","packageid":42307,"repoid":1,"summary":"dev-libs\/libtomfloat: drop old EAPI"},{"authoremail":"bman@gentoo.org","authorname":"Aaron Bauman","body":"Signed-off-by: Aaron Bauman ","commitid":"15ac00fe48d4d797992202afdf3e88ff8147b6cb","committime":"2019-11-29T22:17:47","packageid":42307,"repoid":1,"summary":"dev-libs\/libtomfloat: a few QA fixes"},{"authoremail":"m.mairkeimberger@gmail.com","authorname":"Michael Mair-Keimberger","body":"Closes: https:\/\/bugs.gentoo.org\/686774\nSigned-off-by: Michael Mair-Keimberger \nCloses: https:\/\/github.com\/gentoo\/gentoo\/pull\/12111\nSigned-off-by: Aaron Bauman ","commitid":"5cc0fc86d15fa0fac1f2c1c26a97c5e882900087","committime":"2019-05-26T08:36:32","packageid":42307,"repoid":1,"summary":"dev-libs\/libtomfloat: EAPI=7 bump"},{"authoremail":"m.mairkeimberger@gmail.com","authorname":"Michael Mair-Keimberger","body":"Signed-off-by: Michael Mair-Keimberger \nSigned-off-by: Aaron Bauman ","commitid":"47ccaa12a0f36c10bf4fb9a807eb3180a79ebba4","committime":"2019-05-26T08:32:33","packageid":42307,"repoid":1,"summary":"dev-libs\/libtomfloat: fix HOMEPAGE, SRC_URI"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"25093d6359f778b8d1052f66ba9e26fc29ded21a","committime":"2017-02-28T20:35:29","packageid":42307,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"Signed-off-by: Robin H. Johnson ","commitid":"61b861acd7b49083dab687e133f30f3331cb7480","committime":"2017-02-28T19:47:27","packageid":42307,"repoid":1,"summary":"Drop $Id$ per council decision in bug #611234."},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"945f0d2a26da4f944fd06ad6a874f69d37ce1e06","committime":"2015-08-09T09:26:46","packageid":42307,"repoid":1,"summary":"2015-08-09 09:26:21 UTC"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"This commit represents a new era for Gentoo:\nStoring the gentoo-x86 tree in Git, as converted from CVS.\n\nThis commit is the start of the NEW history.\nAny historical data is intended to be grafted onto this point.\n\nCreation process:\n1. Take final CVS checkout snapshot\n2. Remove ALL ChangeLog* files\n3. Transform all Manifests to thin\n4. Remove empty Manifests\n5. Convert all stale $Header$\/$Id$ CVS keywords to non-expanded Git $Id$\n5.1. Do not touch files with -kb\/-ko keyword flags.\n\nSigned-off-by: Robin H. Johnson \nX-Thanks: Alec Warner - did the GSoC 2006 migration tests\nX-Thanks: Robin H. Johnson - infra guy, herding this project\nX-Thanks: Nguyen Thai Ngoc Duy - Former Gentoo developer, wrote Git features for the migration\nX-Thanks: Brian Harring - wrote much python to improve cvs2svn\nX-Thanks: Rich Freeman - validation scripts\nX-Thanks: Patrick Lauer - Gentoo dev, running new 2014 work in migration\nX-Thanks: Michał Górny - scripts, QA, nagging\nX-Thanks: All of other Gentoo developers - many ideas and lots of paint on the bikeshed","commitid":"56bd759df1d0c750a065b8c845e93d5dfa6b549d","committime":"2015-08-08T20:49:04","packageid":42307,"repoid":1,"summary":"proj\/gentoo: Initial commit"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"a637bd65b7fef8e2be4e7fc6e9097479372e0e2e","committime":"2015-06-19T16:38:33","packageid":42307,"repoid":1,"summary":"2015-06-19 16:35:30 UTC"}],"dependencies":[{"block":false,"categoryid":393,"description":"Optimized and portable routines for integer theoretic applications","ebuildids":[661361],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"patrick@gentoo.org","maintainername":"Patrick Lauer","name":"libtommath","packageid":48695,"summary":"LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C. (phew!). The library is designed to provide a simple to work with API that provides fairly efficient routines that build out of the box without configuration. The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ v6.00 [with SP5] without configuration. The source code is arranged to make it easy to dive into a particular area very quickly. The code is also littered with comments [This is one of the on going goals] that help explain the algorithms and their implementations. Ideally the code will serve as an educational tool in the future for CS students studying number theory. The library provides a vast array of highly optimized routines from various branches of number theory. * Simple Algebraic o Addition o Subtraction o Multiplication o Squaring o Division * Digit Manipulation o Shift left\/right whole digits (mult by 2b by moving digits) o Fast multiplication\/division by 2 and 2k for k>1 o Binary AND, OR and XOR gates * Modular Reductions o Barrett Reduction (fast for any p) o Montgomery Reduction (faster for any odd p) o DR Reduction (faster for any restricted p see manual) o 2k Reduction (fast reduction modulo 2p - k) o The exptmod logic can use any of the four reduction algorithms when appropriate with a single function call. * Number Theoretic o Greatest Common Divisor o Least Common Multiple o Jacobi Symbol Computation (falls back to Legendre for prime moduli) o Multiplicative Inverse o Extended Euclidean Algorithm o Modular Exponentiation o Fermat and Miller-Rabin Primality Tests, utility function such as is_prime and next_prime * Miscellaneous o Root finding over Z o Pseudo-random integers o Signed and Unsigned comparisons * Optimizations o Fast Comba based Multiplier, Squaring and Montgomery routines. o Montgomery, Diminished Radix and Barrett based modular exponentiation. o Karatsuba and Toom-Cook multiplication algorithms. o Many pointer aliasing optimiztions throughout the entire library."}],"depending":[],"ebuilds":[{"archs":["~amd64","~ppc","~x86"],"ebuildid":661361,"firstseen":"2019-11-29T22:29:18.040724","license":"WTFPL-2","moddate":"2026-03-22T20:20:50","packageid":42307,"repoid":1,"slot":"0","uses":[],"version":"0.02-r1"}],"masks":[],"package":{"categoryid":393,"description":"library for floating point number manipulation","firstseen":"2010-05-04T00:54:45.661860","maintainer":"patrick@gentoo.org","maintainername":"Patrick Lauer","name":"libtomfloat","packageid":42307},"rdependencies":[{"block":false,"categoryid":393,"description":"Optimized and portable routines for integer theoretic applications","ebuildids":[661361],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"patrick@gentoo.org","maintainername":"Patrick Lauer","name":"libtommath","packageid":48695,"summary":"LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C. (phew!). The library is designed to provide a simple to work with API that provides fairly efficient routines that build out of the box without configuration. The library builds out of the box with GCC 2.95 [and up] as well as Visual C++ v6.00 [with SP5] without configuration. The source code is arranged to make it easy to dive into a particular area very quickly. The code is also littered with comments [This is one of the on going goals] that help explain the algorithms and their implementations. Ideally the code will serve as an educational tool in the future for CS students studying number theory. The library provides a vast array of highly optimized routines from various branches of number theory. * Simple Algebraic o Addition o Subtraction o Multiplication o Squaring o Division * Digit Manipulation o Shift left\/right whole digits (mult by 2b by moving digits) o Fast multiplication\/division by 2 and 2k for k>1 o Binary AND, OR and XOR gates * Modular Reductions o Barrett Reduction (fast for any p) o Montgomery Reduction (faster for any odd p) o DR Reduction (faster for any restricted p see manual) o 2k Reduction (fast reduction modulo 2p - k) o The exptmod logic can use any of the four reduction algorithms when appropriate with a single function call. * Number Theoretic o Greatest Common Divisor o Least Common Multiple o Jacobi Symbol Computation (falls back to Legendre for prime moduli) o Multiplicative Inverse o Extended Euclidean Algorithm o Modular Exponentiation o Fermat and Miller-Rabin Primality Tests, utility function such as is_prime and next_prime * Miscellaneous o Root finding over Z o Pseudo-random integers o Signed and Unsigned comparisons * Optimizations o Fast Comba based Multiplier, Squaring and Montgomery routines. o Montgomery, Diminished Radix and Barrett based modular exponentiation. o Karatsuba and Toom-Cook multiplication algorithms. o Many pointer aliasing optimiztions throughout the entire library."}],"repos":[{"branch":"master","lastcommit":"52197549fd3431fa256b8edbafdcd3702dd0e134","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/www.libtom.net\/"],"uses":[]}