OnlineWoerterBuecher.de
Internes

Lexikon

peephole optimisation


A kind of code optimisation that considers only a few adjacent instructions at a time and looks for certain combinations which can be replaced with more efficient sequences. E.g. ADD R0, #1 ADD R0, #1 (add one to register R0) could be replaced by ADD R0, #2 (1995-03-28)

In addition suitable contents:
[ 2 ] [ = ] [ AD ] [ ad ] [ adjacent ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ b ] [ be ] [ bi ] [ by ] [ ca ] [ ch ] [ ci ] [ co ] [ code ] [ com ] [ combination ] [ compiler ] [ con ] [ cons ] [ D ] [ DD ] [ dd ] [ de ] [ dj ] [ du ] [ E ] [ ed ] [ eg ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ for ] [ gi ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ is ] [ it ] [ ki ] [ la ] [ ld ] [ Lex ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ nl ] [ ns ] [ om ] [ op ] [ ph ] [ pl ] [ pt ] [ query ] [ rc ] [ re ] [ register ] [ ru ] [ sa ] [ se ] [ si ] [ st ] [ struct ] [ th ] [ to ] [ tr ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2191 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.1037 Seconds, with 17 Database-Queries
Zurück zur Startseite