Path: csiph.com!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch Newsgroups: comp.lang.c Subject: Re: How to avoid an overflow during multiplication? Date: Fri, 21 Jan 2022 17:02:10 -0800 Organization: A noiseless patient Spider Lines: 9 Message-ID: <86mtjopoq5.fsf@linuxsc.com> References: <8735m954yz.fsf@bsb.me.uk> <877dbk36qu.fsf@nosuchdomain.example.com> <86v8ydp57h.fsf@linuxsc.com> <9_BGJ.170561$X2_b.72894@fx09.ams4> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Info: reader02.eternal-september.org; posting-host="434625eb2bdf5b21805d62a567edd212"; logging-data="31933"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/Gs+jf0fdD6Dgg5xaBGdkRQ3LBE1m/nfU=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:afynJHzeZbmHTT3C8W6UbSDfgPU= sha1:mewxMTy6ExsTaAdURwUxQibTkXA= Xref: csiph.com comp.lang.c:164528 scott@slp53.sl.home (Scott Lurndal) writes: > [...] I've seen some pretty long functions that are not easily > amenable to factorization into smaller functions for structural > or performance reasons. Can you post an example or two of those? Ideally one of each, one where structure impedes refactoring and one where performance impedes refactoring.