variables and gosubs???

[mister_e]

I'll try something...

StartPoint:
    Gosub Somewhere
Label1:
    Pause 100
    Goto Start
Somewhere:
    Pause 1
    Return

Nothing hard here right? after the Return... you return to Label1 ... right?

Now...

StartPoint:
    Gosub Somewhere
Label1:
    Pause 100
    Goto Start
Somewhere:
    Goto SomewhereElse
    z: goto z    

SomewhereElse:
    Return

Same thing happen here...

This said...

Start:                         
      for routines=0 to 3
StartPoint:
          gosub subselect
ReturnPoint:
          pause 200
          next
    goto start

SubSelect:
          branchl routines, [Routine0, Routine1, Routine2, Routine3]    
          
Routine0:
         return

Where the Return of Routine0 leads you?... to ReturnPoint

I know i'm a pretty bad teacher...

[sayzer]

and I am a good student.


I thought that once the program jumps, then it will forget where it was and will return to an unknown place. So that it will never be 100% precise.


---------------------

[mister_e]

Gosub and Return are good friends...

As long as you have a GOSUB... you can insert 2789423564875634275624365 432956345634564326586324957243657 234596243652 43656243756243654 356437856 46582436587243657 26435726435 2436 (+/- 1) goto in-between. And when you'll use Return, it will return just under the GOSUB.

[SteveB]

I thought that once the program jumps, then it will forget where it was and will return to an unknown place. So that it will never be 100% precise.

To be even more specific, the GOSUB will put a return address on the top of the "Stack" It will remain there forever (as long as the PIC is not reset) until a RETURN is executed. So, Steve's 2.7894235e+128 GOTOs do nothing to modify the address on the top of the stack. And, no matter when the RETURN is executed, the program will return to that address.

HTH,
Steve B

[mister_e]

SteveB....SteveB....SteveB....
SteveB....SteveB....SteveB....
Whizzz... Woohoo...

<img src="http://www.picbasic.co.uk/forum/attachment.php?attachmentid=1198&stc=1&d=116388100 4">

[Darrel Taylor]

So much for my fancy reply. Too slow.

Got it Sayzer??

[SteveB]

So much for my fancy reply. Too slow.

Ahhhhhhh , I was really looking forward to it. My stab at it was just a down and dirty continuation of what Steve was getting at. We'll let Sayzer and Ryan weigh in on whether it worked for them.

[SteveB]

Steve,
ROFL, Great picture!

[mister_e]

Hehe, Rock and roll, DEVIL!

[sayzer]

I have a new teacher now!

Thanks for this simple and clear explanation SteveB.

I was expecting DT to come up with really complex explanations. heheh


--------------------------

[mister_e]

mmm... not complex Sayzer, let's say detailled.

[rhino]

Yep... makes sense. After all of your responses and looking at the manual for BranchL...

...Index selects one of a list of Labels. Execution resumes at the
indexed Label. For example, if Index is zero, the program jumps to the
first Label specified in the list, if Index is one, the program jumps to the
second Label, and so on. If Index is greater than or equal to the
number of Labels, no action is taken and execution continues with the
statement following the BRANCHL.....(hence the RETURN)

I guess seeing that return in Darrel's code was throwing me off, but now it I see why it's in there. It looked to me like a way of nesting subroutines. Both of the Steves explainations of how the return address in the stack works answers one of the questions I didn't even ask.... scary! Thankyou all.