Differential D20102

Use fls to avoid a loop in isqrt
ClosedPublic
Actions

Authored by dougm on Apr 30 2019, 6:12 AM.

Tags

None

Referenced Files

	F161413510: D20102.id56841.diff
	Fri, Jul 3, 1:17 PM

	Unknown Object (File)
	Fri, Jul 3, 1:43 AM

	Unknown Object (File)
	Thu, Jul 2, 9:18 PM

	Unknown Object (File)
	Wed, Jul 1, 5:14 AM

	Unknown Object (File)
	May 18 2026, 6:04 PM

	Unknown Object (File)
	May 18 2026, 6:04 PM

	Unknown Object (File)
	Apr 26 2026, 9:30 PM

	Unknown Object (File)
	Apr 26 2026, 12:22 PM

View All Files

Subscribers

imp

Details

Reviewers

markj
kib

Commits

rS347043: fls() should find the most significant bit of an int faster than a

Summary

fls() should find the most significant bit of an int faster than a linear search can, so use it to avoid a linear search in isqrt.

Diff Detail

Repository

rS FreeBSD src repository - subversion

Lint

Lint Not Applicable

Unit

Tests Not Applicable

Event Timeline

dougm created this revision.Apr 30 2019, 6:12 AM

kib accepted this revision.Apr 30 2019, 10:52 AM

This revision is now accepted and ready to land.Apr 30 2019, 10:52 AM

markj accepted this revision.Apr 30 2019, 2:17 PM

Closed by commit rS347043: fls() should find the most significant bit of an int faster than a (authored by dougm). · Explain WhyMay 3 2019, 2:56 AM

This revision was automatically updated to reflect the committed changes.

Herald added a subscriber: imp. · View Herald TranscriptMay 3 2019, 2:56 AM

Revision Contents
Changeset List

Path

Size

head/

sys/

vm/

vm_pageout.c

4 lines

Diff 56989

View Options

Use fls to avoid a loop in isqrtClosedPublicActions