Fulltext results:
- the_secret_of_fast_lzw_crunching
- rts </code> Wow, this would be great! Just some self-modifying code at the "loop" label, and we are set. However... $AE STA ENDE+1 ; some tiny self modifying code here, LDA #$00 ; in order to re... STA $AE ; memory zp locations ($00ae/af ) using self modifying code LDA #$00 ; attention Self modifying code STA $AF LDY #$00 STY $01
- common_pitfalls
- == The 6502 has always been a popular target for self-modifying code. It doesn't have a cache, and in many Situations, self-modifying code is faster then indirect Addressing modes. Even Commodore used self-modifying Code to read Basic-Tokens. Most of the time, the
- making_stable_raster_routines
- n. It even has an entry point for deinstalling itself. But in its robustness it uses self-modifying code to store the original interrupt routine addr... nop nop nop oldirq = * + 1 ; Placeholder for self-modifying code jmp * ; Return to the original int
- practical_memory_move_routines
- TS </code> Even more speed can be gained by using self-modifying code, i.e. replacing the (ZeroPage),Y addressing ... dditional cycles from the added instructions that self-modify the code, but the self-modification occurs only once, and therefore adds these cycles to total n... r of cycles per byte moved. As always, the instructions that are self-modified can't be located in ROM.
- ax_tinyrand8
- his version stores the seed as arguments and uses self-modifying code and requires only 15 bytes for the random fu... his version stores the seed as arguments and uses self-modifying code ;; The name AX+ comes from the ASL, XOR and
- double_irq_explained
- mulator when we leave the routine. The wonders of self-modifying code. <code> .pc = $0801 :BasicUpstart(main) .... //Registers [4] sty resety1 //using self modifying code [4] lda #<irq2 //Set IRQ Vector
- x_abc_random_number_generator_8_16_bit
- igh byte. The implementation was optimized using self-modifying code, which yields good speed and low resources, ... his version stores the seed as arguments and uses self-modifying code ;; Routine requires 38 cycles (without the r
- 6502_registers
- mode that enables access to any memory place without having to use self-modifying code. </code>
- decoding_bitstreams
- bit, which is quite often. Instead we'll use some self-modifying code, and keep a pointer to the next byte inside ... ite, and thus to inline the call to the decoder itself. For a real-world example of this, please have a
- dots_and_plots
- ct memory pointer set up. We can do this by using self modifying code but since the address is used twice (ORA/STA... ,y sta ($fb),y rts </code> The plotter itself will net us a blitzing 33/34 cycles (vaires due t
- flexible_32_sprite_multiplexer_2
- IC2SpriteXMSB .switch jmp Multiplex_exitinter ; Self modifying for jmp or bit clc ; MPi: During heavy use (>... 3 ; MPi: When uncommented demonstrate how only modifying some sprite Y values each frame and keeping other
- freeload_v5.0_saver
- DA #$58 STA ALECLI ; Self modifying CLI byte LDA #$1B S
- kernal_floating_point_mathematics
- pied to the ZP from RAM on startup, it contains a self-modifying vector that points to the next byte in a text lin
- opening_up_the_borders_-_a_further_explanation
- //Registers [4] sty resety1 //using self modifying code [4] lda #<irq2 //Set IRQ Vector
- sprite_multiplexing
- r the previous sprite row has started displaying (modifying the Y-coord in the middle of a sprite display won... sprite rejection can be inserted. It also lends itself well to completely unrolling the inner compare lo... example, is only proportional to N but the code itself can be relatively slow. It follows the "bucket" i