GabrielTofvesson/Microcode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Increase bucket sizes

Browse Source
This commit is contained in:
Gabriel Tofvesson 2019-05-06 10:22:55 +02:00
parent 4e3c6d725b
commit d9c7ec81c3
1 changed files with 42 additions and 141 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

183
ucode/sort4.uc
View File

@ -22,8 +22,8 @@
#define LIST_START 0xE0 #define LIST_START 0xE0
#define LIST_END 0x00 #define LIST_END 0x00
#define HIGHEST_BUCKET 0x78 #define HIGHEST_BUCKET 0xD2
#define BUCKET_SIZE 8 #define BUCKET_SIZE 14
#define BUCKET_INDEX_TRACKER 0b11111000 #define BUCKET_INDEX_TRACKER 0b11111000
#optable 0x0 @OT_0 #optable 0x0 @OT_0
@ -43,26 +43,11 @@
#optable 0xe @OT_E #optable 0xe @OT_E
#optable 0xf @OT_F #optable 0xf @OT_F
// Set up buckets (with absolute sizes) // Generate program memory:
// Bucket count: 16 // Addresses 0xE0-0xFF ignored
// Bucket size: 8 // Addresses that are a multiple of 0xE are set to 0
// Motivation: direct mapping from hash to bucket at the cost of bucket size // All other addresses contain a relative pointer to the next bucket start
#data 0x00 0x00 // 0 (POSITIVE) #pmgen if address < 0xE0: print(str(address)+" "+str(0 if (address % 14) == 0 else ((address - (address % 0xE)) - 0xE) if address > 0xD else -1))
#data 0x08 0x00 // 1 (POSITIVE)
#data 0x10 0x00 // 2 (POSITIVE)
#data 0x18 0x00 // 3 (POSITIVE)
#data 0x20 0x00 // 4 (POSITIVE)
#data 0x28 0x00 // 5 (POSITIVE)
#data 0x30 0x00 // 6 (POSITIVE)
#data 0x38 0x00 // 7 (POSITIVE)
#data 0x40 0x00 // 8 (NEGATIVE)
#data 0x48 0x00 // 9 (NEGATIVE)
#data 0x50 0x00 // A (NEGATIVE)
#data 0x58 0x00 // B (NEGATIVE)
#data 0x60 0x00 // C (NEGATIVE)
#data 0x68 0x00 // D (NEGATIVE)
#data 0x70 0x00 // E (NEGATIVE)
#data 0x78 0x00 // F (NEGATIVE)
// Set all GR-registers to -1, so that we always can call "sub gr" to increment // Set all GR-registers to -1, so that we always can call "sub gr" to increment
@ -75,83 +60,53 @@ mov ar ir // GRx=00, M=01
reset gr reset gr
reset grm reset grm
// Initialize PC to point at list // Initialize PC to point at list
const LIST_START const LIST_START
mov ar pc mov ar pc
mov pc asr; incpc mov pc asr
// Perform bucketsort for 32 elements // Perform bucketsort for 32 elements
mov pm ir; call @JTABLE #emit
mov pm ir; incpc; call @JTABLE >for i in range(31):
mov pm ir; incpc; call @JTABLE > print("mov pm ir; incpc; call @JTABLE")
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; incpc; call @JTABLE
mov pm ir; call @JTABLE_SPEC mov pm ir; call @JTABLE_SPEC
//call @BREAK
// Initialize state for merge // Initialize state for merge
const BUCKET_SIZE
mov ar hr
const HIGHEST_BUCKET const HIGHEST_BUCKET
mov ar asr
mov pm lc
sub gr
// Do the merge thing // Do the merge thing
$MERGE $MERGE
mov ar asr; declc; bls @MB_SPEC
// Load bucket size into LC mov pm ir
mov ar asr mov pc asr
mov pm lc mov ir pm; incpc
sub gr
// Copy elements to list // Copy elements to list
$MERGE_MOVE $MERGE_MOVE
sub gr; declc; bls @MERGE_BOTTOM // AR -= -1, branch if there are no more mov ar asr; declc; bls @MB_SPEC
// elements to copy
mov ar asr
mov pm ir mov pm ir
mov pc asr; incpc; bls @MB_SPEC // This branch improves stability mov pc asr // This branch improves stability
mov ir pm; bra @MERGE_MOVE // Transfer value and copy more elements mov ir pm; incpc; bls @MERGE_BOTTOM // Transfer value and copy more elements
sub gr; bra @MERGE_MOVE
$MERGE_BOTTOM
sub gr
mov ar asr
$MB_SPEC $MB_SPEC
mov ir pm // Transfer value and go to next bucket mov pm ar; mov pm asr
sub gr
// Check if we just copied the last bucket mov pm lc; bnz @MERGE
$MERGE_BOTTOM
and BUCKET_INDEX_TRACKER // Mask out element index (lowest 3 bits)
sub hr; bnz @MERGE // Compute index of next bucket and stuff
// Breakpoint hook and program termination point // Breakpoint hook and program termination point
$BREAK $BREAK
$END
halt halt
@ -165,71 +120,17 @@ $JTABLE_SPEC
const LIST_START const LIST_START
mov ar hr; bop mov ar hr; bop
// IR OP-field jump table
$OT_0
const 0x38
mov ar asr; bra @PREPARE_SORT
$OT_1
const 0x30
mov ar asr; bra @PREPARE_SORT
$OT_2
const 0x28
mov ar asr; bra @PREPARE_SORT
$OT_3
const 0x20
mov ar asr; bra @PREPARE_SORT
$OT_4
const 0x18
mov ar asr; bra @PREPARE_SORT
$OT_5
const 0x10
mov ar asr; bra @PREPARE_SORT
$OT_6
const 0x08
mov ar asr; bra @PREPARE_SORT
$OT_7
const 0x00
mov ar asr; bra @PREPARE_SORT
$OT_8
const 0x78
mov ar asr; bra @PREPARE_SORT
$OT_9
const 0x70
mov ar asr; bra @PREPARE_SORT
$OT_A
const 0x68
mov ar asr; bra @PREPARE_SORT
$OT_B
const 0x60
mov ar asr; bra @PREPARE_SORT
$OT_C
const 0x58
mov ar asr; bra @PREPARE_SORT
$OT_D
const 0x50
mov ar asr; bra @PREPARE_SORT
$OT_E
const 0x48
mov ar asr; bra @PREPARE_SORT
$OT_F
const 0x40
mov ar asr; bra @PREPARE_SORT
// Generate jump table
#emit
>bucket_size=14
>for i in range(16):
> print("$OT_"+hex(i)[2::])
> if i < 8:
> print("const "+str(bucket_size*(7-i)))
> else:
> print("const "+str(bucket_size*(23-i)))
> print("mov ar asr; bra @PREPARE_SORT")
// Actual bucketsort // Actual bucketsort