mc4_sim-0.2/0000755000175000017500000000000011121134753011054 5ustar vogvogmc4_sim-0.2/README0000644000175000017500000001151310201515144011730 0ustar vogvogMC4_SIM ------- Simulator & Programm-Generator für den "MC4" Microcomputer. MC4 ist ein Lern-Prozessor, erarbeitet in der Technischen Informatik I im WS 2004/05 an der Humboldt-Universität Berlin. Der Simulator wurde implementiert in Python. Er sollte auf jedem neueren Linux-Rechner sofort starten. Dateiliste ---------- Dieses kleine Projekt besteht aus 4 Libraries: mc_sim.py ... Simulator (abstrakt) mc4_sim.py ... Simulator für den MC4 mc_monitor.py ... Beobachtet bestimmte Register eines Programmes tree_search.py ... Baumsuche Und aus 2 Programmen: analyze.py ... startet den Simulator für ein gegebenes Programm find-prog.py ... sucht nach Programmen, die eine bestimmte Ausgabe haben sollen. (z.B. möglichst viele Stellen von PI) Wie in Python üblich, sind auch die 4 Libraries ausführbare Dateien. Beim Starten führen sie ein primitives Test-Programm aus. Der gesamte Programm-Code ist objektorientiert programmiert und hoffentlich auch sauber designt. Leider mangelt es noch an Kommentaren. Ich habe lediglich die für das Verständnis notwendigen, nicht-offensichtlichen Dinge kommentiert. "Analyze" --------- Das Programm "analyze.py" erwartet von der Standard-Eingabe den ROM-Inhalt als Python-Tupel. Es findet keine Validierung statt, also vorsicht! Ich habe mir keine große Mühe mit der Ein/Ausgabe gemacht. Da werde ich noch dran arbeiten :-) Ein Python-Tupel sieht etwa wie folgt aus: (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15) Wenn der Programm-Code Hexadezimal eingegeben werden soll, sieht das so aus: (0x0, 0x1, 0x2, [...] , 0xF) Es dürfen auch weniger als 16 Speicherplätze angegeben werden, dann darf das Programm aber den vorgegebenen Speicherbereich nicht verlassen. Sonst bricht "analyze.py" mit einer Exception ("RomError") ab. (siehe mc_sim.py) Genauso darf das Programm keine uninitialisierten Register benutzen. Das würde einen "ExecuteError" verursachen. Dieses Feature tritt aber nicht in Erscheinung, weil alle Register beim Start mit 0 initialisiert werden, so wie es auch der MC4 bei einem Reset tut. (Das lässt sich jedoch sehr leicht an einer einzigen Stelle ändern, nämlich bei den Default-Werten des Konstruktors von "MC4_LoopState". Siehe mc4_sim.py ... dort lässt sich im Prinzip die gesamte Prozessor- Spezifikation anpassen.) Der Simulator erkennt Endlosschleifen und nutzlose Aktionen, wie z.B. ein "LBA,B" obwohl vorher A und B den selben Wert hatten. Mittels "mc_monitor.py" werden außerdem die Werte-Folgen von A und B ausgegeben, inklusive Erkennung der Periodizität. Die Ausgabe der Folgen erfolgt dezimal. Wiegesagt, die Ein/Ausgabe muss noch etwas aufpoliert werden, damit Arrays und Tupel auch Hexadezimal angezeigt werden. "Find-Prog" ----------- Das Programm "find-prog.py" besitzt gar keine Interaktion. In den untersten Zeilen des Programmcodes sind ein paar Kleinigkeiten zu ändern, wenn er etwas anderes suchen soll als ein Programm für die Dezimalstellen von "e": s = ProgSearch((2,7,1,8,2,8,1,8,2,8,4,5,9,0,4,5,2,3,5)) s.search() Das gegebene Tupel ist die Zahlenfolge, die von dem Programm erwartet wird. Ist sie zu kurz (d.h. wird sie tatsächlich von einem Programm komplett "errechnet"), wird eine Exception geworfen. Die gegebene Zahlenfolge sollte daher lang genug sein. Erfahrungsgemäß mindestens 12 Zahlen. Die Ausgabe sind die gefundenen Programme in dezimaler Tupel-Schreibweise. Diese Tupel können direkt in "analyze.py" hineinkopiert werden, um sich ein bestimmtes berechnetes MC4-Programm genauer anzusehen. Außerdem erhält jedes Programm eine Qualitäts-Nummer, die wie folgt errechnet wird: (Anzahl der korrekt berechneten Folgeglieder) * 1000 + (Anzahl der freien Speicherstellen) Wenn also ein Programm 8 Dezimalstellen von PI berechnet, und dabei nur die ersten 14 Speicherplätze benötigt (d.h. die letzten 2 unbenutzt sind), lautet die Qualität: 8002 Wird eine bestimmte Qualität erreicht, werden nur noch Programme mit höherer Qualität ausgegeben. Die Optimierung hat also das Primärziel, möglichst viele Stellen der gegebenen Folge zu produzieren. Das Sekundärziel lautet, diese Programme dann möglichst "klein" zu machen. Da ein iterativer "Baumsucher" verwendet wird (siehe tree_search.py), kann das Programm bereits vorhandene Berechnungen wiederaufnehmen. Hierzu dient die Funktion "s.resume". In diesem Fall gibt man also statt "s.search()" z.B. folgendes an: s.resume(10003, (5, 2, 6, 5, 9, 5, 1, 5, 8, 11, 11, 14, 5)) Hierbei ist "10003" die minimal erwartete Qualität und "(5,2,...)" das letzte errechnete MC4-Programm. Prinzipiell sind beide Werte beliebig, insbesondere muss das übergebene MC4-Programm nicht unbedingt korrekt oder lauffähig sein. Dieser Parameter sagt lediglich, dass der Baum-Iterator (besser: Tupel-Iterator) keine lexikographisch kleineren Baum-Äste mehr durchgeht. -- Viel Spaß mit dem Simulator! Volker Grabsch mc4_sim-0.2/COPYING0000644000175000017500000004313110201410647012106 0ustar vogvog GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. mc4_sim-0.2/analyze.py0000755000175000017500000000067210201514351013073 0ustar vogvog#!/usr/bin/env python import mc_monitor from mc_monitor import MonitorRom from mc4_sim import MC4_LoopState if __name__=="__main__": print "Bitte den ROM-Inhalt als Tupel eingeben:" tuple = eval(raw_input()) print "Gelesen: %s" % (tuple,) rom = MonitorRom(MC4_LoopState,tuple) rom.run() seq_a = rom.monitor(lambda(state): state.a) seq_b = rom.monitor(lambda(state): state.b) print print "a: %s" % seq_a print "b: %s" % seq_b mc4_sim-0.2/find-prog.py0000755000175000017500000000647010201514570013322 0ustar vogvog#!/usr/bin/env python ############################################################################# # analyze.py ############################################################################# # # # Copyright (C) 2005 Volker Grabsch # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # ############################################################################# import sys import mc_sim from mc_sim import Rom,RomError,ExecuteError from mc4_sim import MC4_LoopState import tree_search from tree_search import RecursiveTreeSearch,IterativeTreeSearch # UsedTreeSearch = RecursiveTreeSearch UsedTreeSearch = IterativeTreeSearch class ProgSearch(UsedTreeSearch): max_depth = 16 max_backlog = 3 range = \ (5,6) + \ (1,2) + \ (8,9,11) + \ (12,13,14) + \ (0,3,4,7,10,15) + \ () def __init__(self,goal,*args): UsedTreeSearch.__init__(self,*args) self.goal = goal def _adjust_min_quality(self,reached_quality): # pass self.min_quality = reached_quality # self.min_quality = reached_quality+1 def _test(self,tuple): max_pc = len(tuple) rom = Rom(tuple) state = MC4_LoopState(rom) def quality(i): return i*1000+self.max_depth-len(tuple) old_loop = 0 a_changed = False old_a = state.a i = 0 while True: # sinnlose Enlosschleife? loop = state.loop() if (old_loop,loop) == (0,1): old_loop = 1 a_changed = False elif (old_loop,loop) == (1,2) and not a_changed: return (False,quality(i)) # A geändert? a = state.a if a != old_a: old_a = a a_changed = True if a == self.goal[i]: i += 1 else: return (False,quality(i)) # Programm weiterlaufen lassen try: state.next() except ExecuteError: # Programm fehlerhaft return (False,i) except RomError: # Programm unvollständig deeper = True if len(tuple) > i*2+self.max_backlog: deeper = False if state.had_useless_action(): deeper = False return (deeper,quality(i)) if __name__=="__main__": import time print "start: %s" % time.asctime() print # s = ProgSearch((3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8)) # s.resume(10000, (5, 3, 2, 15, 5, 1, 9, 5, 1, 6, 4, 9, 9, 11, 9, 8)) # s = ProgSearch((2,7,1,8,2,8,1,8,2,8,4,5,9,0,4,5,2,3,5)) # s.resume(10003, (5, 2, 6, 5, 9, 5, 1, 5, 8, 11, 11, 14, 5)) # (pi = 3.14159265358979323846264338327958) # s = ProgSearch((3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8)) # s.search() # (1/e = 0.36787944117144232159) # s = ProgSearch((3,6,7,8,7,9,4,1,7,1,4,2,3,2,1,5,9)) # s.search() # (e = 2.71828182845904523536) s = ProgSearch((2,7,1,8,2,8,1,8,2,8,4,5,9,0,4,5,2,3,5)) s.search() print print "end: %s" % time.asctime() mc4_sim-0.2/mc4_sim.py0000755000175000017500000000672610201513342012770 0ustar vogvog#!/usr/bin/env python ############################################################################# # mc4_sim.py ############################################################################# # # # Copyright (C) 2005 Volker Grabsch # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # ############################################################################# from mc_sim import Command,CommandDict,LoopState class NOP(Command): name = "NOP" descr = "" is_jump = False def execute(self,status): pass class LDA_B(Command): name = "LDA,B" descr = "A := B" is_jump = False def execute(self,status): status.set_a(status.b) class LDB_A(Command): name = "LDB,A" descr = "B := A" is_jump = False def execute(self,status): status.set_b(status.a) class LDA_S(Command): name = "LDA,s" descr = "A := " is_jump = False def execute(self,status): status.set_a(status.read_rom()) class LDB_S(Command): name = "LDB,s" descr = "B := " is_jump = False def execute(self,status): status.set_b(status.read_rom()) class DEC(Command): name = "DEC" descr = "A := A-1" is_jump = False def execute(self,status): status.set_a_with_flags(status.a+0x0f) class ADD(Command): name = "ADD" descr = "A := A+B" is_jump = False def execute(self,status): status.set_a_with_flags(status.a+status.b) class CPA(Command): name = "CPA" descr = "B := A" is_jump = False def execute(self,status): status.set_b(status.a) class EQU(Command): name = "EQU" descr = "A := A=B" is_jump = False def execute(self,status): status.set_a_with_flags(0xffff-(status.a^status.b)) class JMP(Command): name = "JMP s" descr = "PC := " is_jump = True def execute(self,status): status.set_pc(status.read_rom()) class JMPC(Command): name = "JMPC s" descr = "jmp if c" is_jump = True def execute(self,status): pc = status.read_rom() if status.c: status.set_pc(pc) class JNZ(Command): name = "JNZ s" descr = "jmp if nz" is_jump = True def execute(self,status): pc = status.read_rom() if not status.z: status.set_pc(pc) MC4_CommandDict=CommandDict({ 0x01: LDA_B(), 0x02: LDB_A(), 0x05: LDA_S(), 0x06: LDB_S(), 0x08: DEC(), 0x09: ADD(), 0x0A: CPA(), 0x0B: EQU(), 0x0C: JMP(), 0x0D: JMPC(), 0x0E: JNZ(), },NOP()) class MC4_LoopState(LoopState): def __init__(self,rom,command_dict=MC4_CommandDict,pc=0,a=0,b=0): LoopState.__init__(self,rom,command_dict,pc,a,b) if __name__=="__main__": from mc_sim import Rom rom = Rom([0x5,0x4,0x2,0x9, 0xE,0x3,0x6,0xC, 0xB,0x8,0xD,0x9, 0xA,0x1,0xC,0xE]) state = MC4_LoopState(rom) rom.show() print state.run() print useless = {True: "a",False: "no"}[state.had_useless_action()] print "Had %s useless action" % useless # for i in range(0,50): # print "%24i: %s loop:%i" % (i,state,state.loop()) # print "%s" % state.cmd() # state.next() mc4_sim-0.2/mc_monitor.py0000755000175000017500000000542410201514053013575 0ustar vogvog#!/usr/bin/env python ############################################################################# # mc_monitor.py ############################################################################# # # # Copyright (C) 2005 Volker Grabsch # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # ############################################################################# import sys import mc_sim from mc_sim import Rom,LoopState class MonitorState(LoopState): def __init__(self,*args): LoopState.__init__(self,*args) class Sequence: def __init__(self,first_old=None): self.start = [] self.period = [] self.first_old = first_old def __str__(self): return "%s ... %s ..." % (self.start,self.period) def unify(self): old = self.first_old newlist = [] for item in self.start: if item != old: newlist.append(item) old = item self.start = newlist newlist = [] for item in self.period: if item != old: newlist.append(item) old = item self.period = newlist return self def match(self,list): ownlist = self.start j = 0 for i in range(0,len(list)): if j == len(ownlist): ownlist = self.period if len(ownlist) == 0: return i j = 0 if list[i] != ownlist[j]: return i j += 1 return len(list) class MonitorRom(Rom): def __init__(self,MonitorStateClass,*args): Rom.__init__(self,*args) self.MonitorStateClass = MonitorStateClass def run(self): state = self.MonitorStateClass(self) self.show() print state.run() def monitor(self,f): return self.monitor_state(self.MonitorStateClass(self),f).unify() def monitor_state(self,state,f): seq = Sequence(f(state)) while state.loop()==0: seq.start.append(f(state)) state.next() while state.loop()==1: seq.period.append(f(state)) state.next() return seq if __name__=="__main__": from mc4_sim import MC4_LoopState rom = MonitorRom(MC4_LoopState, [0x5,0x4,0x2,0x9, 0xE,0x3,0x6,0xC, 0xB,0x8,0xD,0x9, 0xA,0x1,0xC,0xE, ]) rom.run() seq = rom.monitor(lambda(state): state.a) print print "a: %s" % seq print "matches: %i" % seq.match([4,8,12,0,3,2,1,0,15,4,8,12,4]) mc4_sim-0.2/mc_sim.py0000755000175000017500000001000610201512777012701 0ustar vogvog#!/usr/bin/env python ############################################################################# # mc_sim.py ############################################################################# # # # Copyright (C) 2005 Volker Grabsch # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # ############################################################################# class Error(Exception): pass def form(a,f): if a == None: return "." else: return f % a class Command: def __init__(self): pass def __str__(self): return "%-6s (%s)" % (self.name,self.descr) class CommandDict: def __init__(self,dict,default): self.dict = dict self.default = default def __getitem__(self,index): return self.dict.get(index,self.default) def __setitem__(self,index,item): if self.dict.has_key(index): pass else: self.dict[index] = item class RomError(Error): def __str__(self): return "Rom Error" class Rom: def __init__(self,content): self.command_dict = None self.content = content def __getitem__(self,index): if index >= len(self.content): raise RomError else: return self.content[index] def __str__(self): return "%s" % self.rom def show(self): print "----------------------------" for i in range(0,len(self.content)): item = self.content[i] cmd = self.command_dict[item] print "| %2i: %X %s" % (i,item,cmd) print "----------------------------" class ExecuteError(Error): def __str__(self): return "Execute Error" class State: def __init__(self,rom,command_dict,pc=0,a=None,b=None): self.command_dict = command_dict self.rom = rom self.a = a self.b = b self.pc = pc self.z = 0 self.c = 0 self.useless_action = False self.rom.command_dict = self.command_dict def set_a(self,a): self.a = a % 16 def set_a_with_flags(self,a): self.set_a(a) self.z = (self.a == 0) self.c = (self.a != a) def set_b(self,b): self.b = b % 16 def set_pc(self,pc): self.pc = pc % 16 def read_rom(self): r = self.rom[self.pc] self.set_pc(self.pc+1) return r def __str__(self): return "a=%s b=%s pc=%2s %s%s" % (form(self.a,"%X"), form(self.b,"%X"), form(self.pc,"%i"), ['.','z'][self.z], ['.','c'][self.c]) def state(self): return (self.a,self.b,self.pc,self.z,self.c) def state2(self): return (self.a,self.b,self.z,self.c) def next(self): item = self.read_rom() cmd = self.command_dict[item] if not cmd.is_jump: state2 = self.state2() try: cmd.execute(self) except TypeError: raise ExecuteError if (not cmd.is_jump) and (state2 == self.state2()): self.useless_action = True def cmd(self): return self.command_dict[self.rom[self.pc]] def had_useless_action(self): return self.useless_action class LoopState(State): def __init__(self,*args): State.__init__(self,*args) self.old_states = {} def next(self): self.update_old_states() State.next(self) def update_old_states(self): st = self.state() self.old_states[st] = self.old_states.get(st,0)+1 def loop(self): return self.old_states.get(self.state(),0) def run(self): i = 0 while not self.loop(): print "%24i: %s" % (i,self) i += 1 print "%s" % self.cmd() self.next() print "%24i: %s" % (i,self) if __name__=="__main__": print "Diese Bibliothek ist zu abstrakt, um sie direkt zu testen." print "Zum Testen bitte 'mc4_sim.py' versuchen." mc4_sim-0.2/tree_search.py0000755000175000017500000000642310201410647013717 0ustar vogvog#!/usr/bin/env python ############################################################################# # tree_search.py ############################################################################# # # # Copyright (C) 2005 Volker Grabsch # # This program is free software; you can redistribute it and/or modify # it under the terms of the GNU General Public License as published by # the Free Software Foundation; either version 2 of the License, or # (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # ############################################################################# import sys class TreeSearch: def __init__(self): pass def search(self,min_quality=0): self.min_quality = min_quality self._search() def resume(self,min_quality,init_tuple): self.min_quality = min_quality self._search(init_tuple) def show(self,tuple,quality): if quality >= self.min_quality: self._adjust_min_quality(quality) self._show(tuple,quality) def test(self,tuple): (deeper,quality) = self._test(tuple) return (deeper and len(tuple) < self.max_depth,quality) def _test(self,tuple): return (True,0) def _show(self,tuple,quality): print "%6i: %s" % (quality,tuple) sys.stdout.flush() def _adjust_min_quality(self,reached_quality): # pass self.min_quality = reached_quality # self.min_quality = reached_quality+1 class RecursiveTreeSearch(TreeSearch): def __init__(self,*args): TreeSearch.__init__(self,*args) def _search(self,tuple=()): (deeper,quality) = self.test(tuple) self.show(tuple,quality) if deeper: for item in self.range: self._search(tuple+(item,)) class IterativeTuple: def __init__(self,range,init_tuple=()): self.list = list(init_tuple) self.next_item = {} key = None for item in range: self.next_item[key] = item key = item def inc(self): i = len(self.list)-1 if i < 0: return False while not self.next_item.has_key(self.list[i]): i -= 1 if i < 0: return False self.list[i] = self.next_item[self.list[i]] self.list = self.list[:i+1] return True def deeper(self): self.list.append(self.next_item[None]) def tuple(self): return tuple(self.list) class IterativeTreeSearch(TreeSearch): def __init__(self,*args): TreeSearch.__init__(self,*args) def _search(self,init_tuple=()): ituple = IterativeTuple(self.range,init_tuple) while True: tuple = ituple.tuple() (deeper,quality) = self.test(tuple) self.show(tuple,quality) if deeper: ituple.deeper() else: if not ituple.inc(): break if __name__=="__main__": r = RecursiveTreeSearch() r.max_depth = 4 r.range = range(0,6) print print " --- FULL (recursive) --- " r.search() i = IterativeTreeSearch() i.max_depth = 4 i.range = range(0,6) print print " --- FULL (iterative) --- " i.search() print print " --- LAST FEW ITEMS --- " i.resume(0,(5,5,2))