Sign in Join
Wiki copytemporary

Case Compiler Optimization: history

RevisionWhenWhoWhat changed
2CuriousKitFrom the Free Pascal wiki's dump of 2024-05-26What changed
1CuriousKitFrom the Free Pascal wiki's dump of 2024-05-26What changed
Edited on wiki.freepascal.org by 1 person, 2018–2019

From the official wiki's backup of 26 May 2024: who edited this page there, and when. Edits made there after that date were not recorded, and the earlier versions are not shown here; the main page says why.

WhenWhoWhat changed
CuriousKitStub of Binary Search Optimization
CuriousKitItalics (minor)
CuriousKitWord choice (minor)
CuriousKitIncorrect offset (minor)
CuriousKitExplanation for "lea 2(%lo), %temp" (minor)
CuriousKitMentioned %temp (minor)
CuriousKitPutting it all together
CuriousKitBinary search algorithm link (minor)
CuriousKitAssumption of %key (minor)
CuriousKitjge -> jg - minor bug. Fix removes unnecessary iteration (minor)
CuriousKitThe table design
CuriousKitExpanded explanation of list size, this time with a list of size 7. (minor)
CuriousKitAn example case where this would be suitable (minor)
CuriousKitSub-title change (minor)
CuriousKitMentioning what happens if a match is found early in the overrun trap (minor)
CuriousKitSome minor simplification (minor)
CuriousKitSome more mathematical explanation (minor)
CuriousKitLooped version shouldn't have the case match jump (minor)
CuriousKitMissing comment regarding common handling of function result (minor)
CuriousKitTypos (minor)
CuriousKitTerminology (minor)
CuriousKitJump Table overview
CuriousKitMinor fix for the optimised case (minor)
CuriousKitCode fixes - mixed up AT&T and Intel (minor)
CuriousKitBranch count is a bit more nebulous (minor)
CuriousKitInserted complexities for individual methods (minor)
CuriousKitCorrected indexing (minor)

Back to the page