2000-07-21 21:36:06 +00:00
|
|
|
;
|
|
|
|
; Ullrich von Bassewitz, 21.7.2000
|
|
|
|
;
|
|
|
|
; Add a block to the heap free list
|
|
|
|
;
|
2003-02-01 10:20:35 +00:00
|
|
|
; void __fastcall__ _heapadd (void* mem, size_t size);
|
2000-07-21 21:36:06 +00:00
|
|
|
;
|
|
|
|
;
|
|
|
|
|
|
|
|
.importzp ptr1, ptr2
|
|
|
|
.import popax
|
2003-02-01 10:20:35 +00:00
|
|
|
.import heapadd
|
2003-02-01 12:22:09 +00:00
|
|
|
.export __heapadd
|
2000-07-21 21:36:06 +00:00
|
|
|
|
2003-02-01 12:22:09 +00:00
|
|
|
.include "_heap.inc"
|
2000-07-21 21:36:06 +00:00
|
|
|
|
2003-02-01 12:22:09 +00:00
|
|
|
.macpack generic
|
2000-07-21 21:36:06 +00:00
|
|
|
|
2003-02-01 12:22:09 +00:00
|
|
|
;-----------------------------------------------------------------------------
|
2000-07-21 21:36:06 +00:00
|
|
|
; Code
|
|
|
|
|
2003-02-01 12:22:09 +00:00
|
|
|
__heapadd:
|
2003-02-01 10:20:35 +00:00
|
|
|
sta ptr1 ; Store size in ptr1
|
2000-07-21 21:36:06 +00:00
|
|
|
stx ptr1+1
|
|
|
|
jsr popax ; Get the block pointer
|
|
|
|
sta ptr2
|
|
|
|
stx ptr2+1 ; Store block pointer in ptr2
|
|
|
|
|
|
|
|
; Check if size is greater or equal than min_size. Otherwise we don't care
|
|
|
|
; about the block (this may only happen for user supplied blocks, blocks
|
|
|
|
; from the heap are always large enough to hold a freeblock structure).
|
|
|
|
|
|
|
|
lda ptr1 ; Load low byte
|
|
|
|
ldx ptr1+1 ; Load/check high byte
|
|
|
|
bne @L1
|
2003-02-01 12:22:09 +00:00
|
|
|
cmp #HEAP_MIN_BLOCKSIZE
|
2000-07-21 21:36:06 +00:00
|
|
|
bcs @L1
|
|
|
|
|
|
|
|
rts ; Block not large enough
|
|
|
|
|
|
|
|
; The block is large enough. Set the size field in the block.
|
|
|
|
|
2005-01-05 21:04:35 +00:00
|
|
|
@L1: ldy #usedblock::size
|
2000-07-21 21:36:06 +00:00
|
|
|
sta (ptr2),y
|
|
|
|
iny
|
|
|
|
txa
|
|
|
|
sta (ptr2),y
|
|
|
|
|
|
|
|
; Call the internal function since variables are now setup correctly
|
|
|
|
|
2003-02-01 10:20:35 +00:00
|
|
|
jmp heapadd
|
2000-07-21 21:36:06 +00:00
|
|
|
|