On 2018-02-06, at 23:34:29, Bernd Oppolzer wrote: > Something important about these AVL trees which would make > an ASSEMBLER implementation difficult (not impossible, of course) > is the recursive nature of the problem. The searching is done using > a recursive function which calls itself as often as the tree has levels. > > With ASSEMBLER, you would either have to change the algorithm > or you would have to do all the bookkeeping of the recursive calls > yourself (which both is about the same effort). > > Maybe you already have an existing mechanism for providing > automatic variables in ASSEMBLER ... but you will still have to take > care to stack the return addresses (and maybe base registers) > of the search function ... > Don't dynamically opbtained work areas and chained register save areas provide that function?
-- gil
