July 24, 2008 07:47pm pdt

1. Infinity08 65,700
2. jkr 5,000
2. evilrix 5,000
4. ravenpl 4,400
5. abith 3,700
6. BrianGEF... 2,850
7. TheLearn... 2,000
7. CraigWag... 2,000
7. ysfx 2,000
7. tedbilly 2,000
7. dbrunton 2,000
7. ozo 2,000
7. Fernando... 2,000
7. DaveHowe 2,000
7. ADSLMark 2,000
7. Chandan... 2,000
7. kaylanreilor 2,000
7. bertlanq 2,000
7. cybrexus 2,000
7. KumarRed... 2,000
7. sdcz 2,000

1. dimitry 158,876
2. grg99 116,208
3. Infinity08 98,912
4. mzvika 56,009
5. BeyondWu 51,715
6. BrianGEF... 50,463
7. PaulCasw... 50,139
8. manish_r... 30,623
9. stefan73 25,328
10. PeterdLo 20,472
11. Dancie 17,898
12. mtmike 15,779
13. abith 13,536
14. billious 12,777
15. DeanHorak 12,698

05.11.2008 at 06:53PM PDT, ID: 23393434

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

3.8

How do I write an x86 assembly recursion function

Zone: Assembly Programming Language

Tags: intel, Assembly

How do I write an x86 assembly function that recursivly calculates exp(2,n) ie 2^n using the stack to pass n.

Please note the code below is stuck in a loop only run in your debugger, plus is is not doing the require calculation yet i am still trying to get the stack working as it iterates through the formula.

         
           
             1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:

           
           
             .model small ; Use the small memory model
.stack 300h  ; Include a stack segment
.data
.code
start:
    push 4
    call factorial
    add sp, 4
    mov ax, bx
    mov ax, 1
    ;int 0x80
    
;.type factorial, @function
factorial:
        push bp
        mov bp, sp
        
        mov ax,[bp+8]
        cmp ax, 1
        je end_factorial
        
        dec ax
        push ax
        call factorial
        mov bx, [bp+8]
        mul ax
        
        end_factorial:
        mov bp, sp
        pop bp
        
        ret
 
end start
           
         

Start your free trial to view this solution

Question Stats

Zone: Programming

Question Asked By: Fang1964

Solution Provided By: Infinity08

Participating Experts: 1

Solution Grade: B

Translate:

Loading Advertisement...

20080236-EE-VQP-29 / EE_QW_2_20070628