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

	Unknown Object (File)
	Sep 18 2024, 3:22 AM

	Unknown Object (File)
	Sep 17 2024, 2:23 PM

	Unknown Object (File)
	Sep 11 2024, 9:06 AM

	Unknown Object (File)
	Sep 8 2024, 8:10 PM

	Unknown Object (File)
	Sep 8 2024, 4:09 PM

	Unknown Object (File)
	Sep 8 2024, 6:20 AM

	Unknown Object (File)
	Sep 8 2024, 5:50 AM

	Unknown Object (File)
	Sep 1 2024, 6:56 AM

View All 30 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

Lint

Lint Skipped

Unit

Tests Skipped

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

sys/

vm/

vm_pageout.c

4 lines

Diff 56841

View Options

Use fls to avoid a loop in isqrtClosedPublicActions