Sujet : Re: A state transition diagram proves ...
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 18. Oct 2024, 02:47:09
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vesemu$2v7sh$1@dont-email.me>
References : 1 2
User-Agent : Mozilla Thunderbird
On 10/17/2024 8:13 PM, Richard Damon wrote:
On 10/17/24 7:31 PM, olcott wrote:
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
>
When DDD is correctly emulated by HHH according
to the semantics of the x86 language DDD cannot
possibly reach its own machine address [00002183]
no matter what HHH does.
>
+-->[00002172]-->[00002173]-->[00002175]-->[0000217a]--+
+------------------------------------------------------+
>
That may not line up that same way when view
>
>
>
>
https://en.wikipedia.org/wiki/State_diagram
>
Except that 0000217a doesn't go to 00002172, but to 000015d2
IS THIS OVER YOUR HEAD?
What is the first machine address of DDD that HHH
emulating itself emulating DDD would reach?
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer