flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
revolution 08 Jul 2008, 15:07
If you are using DOS then you have to find a way to switch the CPU into 32bit mode before you can use use32. DMPI (and similar) may be a good way to start. The DOS version of fasm can use DMPI, have a look at "modes32.inc".
|
|||
![]() |
|
LocoDelAssembly 08 Jul 2008, 15:37
Quote:
But, do you really need more memory? You could just write the 32-bit instructions straight without trouble, the penalty will be that each instruction will take extra space (for the override prefixes) and maybe a little more time to execute. |
|||
![]() |
|
HeadCase 08 Jul 2008, 16:35
Hi Revolution and Loco,
Thanks for your replies. Perhaps I haven't explained the situation very well. Let me try again... I've attached the whole program that I would like to change to find primes to 4 billion. Is it simply a case of me using DX:AX register pair to perform calculations or do I need to recode as a 32-bit program?
_________________ HeadCase ![]() |
|||||||||||
![]() |
|
f0dder 08 Jul 2008, 17:23
|
|||
![]() |
|
LocoDelAssembly 08 Jul 2008, 17:37
Quote:
In fact you can but make sure you don't cross the 64KB offset limit with the final calculated address. Code: org $100 mov ah, $09 mov ebx, table mov ecx, -6 .loop: mov dx, [ebx+ecx*2+12] int $21 inc cx jnz .loop xor ax, ax int $16 int $20 struc Table [string] { common .: forward local ..entry dw ..entry forward ..entry db string, '$' } table Table '1', '2', '3', '4', '5', '6' |
|||
![]() |
|
roboman 10 Jul 2008, 03:03
jezzzzz Dex hasn't chimed in yet !! You could use DexOS
![]() |
|||
![]() |
|
revolution 10 Jul 2008, 04:20
roboman wrote: jezzzzz Dex hasn't chimed in yet !! You could use DexOS |
|||
![]() |
|
DOS386 11 Jul 2008, 07:49
Quote: I have recently started using FASMD wow ... the 2nd one ![]() Quote: and managed to develop a reasonably good prime number finder with the "use16" directive, where I use int 21h/xxh to perform I/O to the console ![]() Quote: I would now like to explore the use of 32-bit instructions and data by changing the prime number program to test for primes up to 4 billion 32-bit instructions indeed do work to some degree in 16-bit RM also ... but better to use DPMI. RTFF ! (FAQ on subforum top) ![]() http://board.flatassembler.net/topic.php?t=8670 Quote: New Text Document.txt I wonder whether ^^^ you use DOS at all ... _________________ Bug Nr.: 12345 Title: Hello World program compiles to 100 KB !!! Status: Closed: NOT a Bug |
|||
![]() |
|
HeadCase 11 Jul 2008, 13:11
To all who helped with my problem:
I've managed to get my program to calculate primes to above 4 billion - Thanks. Still have a great deal to learn though. It's obvious from the level of my question that I know very little about the x86 and the various assemblers able to be used on it. I do, however, intend to learn much more about them and you've helped me in the first steps along a very long road. Thanks again, and keep smilin'... _________________ HeadCase ![]() |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2023, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.