wonbe.c 54 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601
  1. /* wonbe: WonderWitch Basic Environment */
  2. /* First Created: Nov.3,2000 by Pie Dey Co.,Ltd. */
  3. /* This source code is distributed under GNU General Public License (GPL) */
  4. /* see http://www.gnu.org/ about GPL */
  5. /* This source code is for: */
  6. /* Visual C++ 1.5 (for WW binary) */
  7. /* Visual C++ 6.0 (for Win32 binary) */
  8. /* Turbo C++ 1.0 (for WW binary, by Hirotaka JOE Ohkubo) */
  9. /* GNU Win32 gcc (for Win32 binary, by Hirotaka JOE Ohkubo) */
  10. #include <stdio.h>
  11. #include <string.h>
  12. #include <stdlib.h>
  13. #ifdef WIN32
  14. #include <assert.h>
  15. #endif
  16. #ifdef WW
  17. #include <sys/comm.h>
  18. #include <sys/process.h>
  19. #include <sys/fcntl.h>
  20. #include <sys/bios.h>
  21. #define assert(x)
  22. #endif
  23. #include "keywords.h"
  24. #ifdef WIN32
  25. #include "win32text.h"
  26. #endif
  27. /* cygwin でなぜか stdarg.h が読み込まれてない & __GNUC__ が効かない... */
  28. #ifdef CYGWIN
  29. #include <stdarg.h>
  30. #endif
  31. char myVersion[] = "0.05";
  32. #ifdef WW
  33. #define NEWLINE "\xa\xd"
  34. #else
  35. #define NEWLINE "\n"
  36. #endif
  37. #ifdef WW
  38. #define MEMMOVE mymemmove
  39. #define FAR far
  40. #else
  41. #define MEMMOVE mymemmove
  42. #define FAR
  43. #endif
  44. #ifdef WIN32
  45. typedef unsigned char BYTE;
  46. #endif
  47. typedef unsigned short WORD;
  48. typedef signed short SHORT;
  49. typedef unsigned long DWORD;
  50. #define EOL (0x0d)
  51. #ifdef WIN32
  52. typedef int BOOL;
  53. #endif
  54. #define FALSE 0
  55. #define TRUE 1
  56. typedef void (*NEARPROC)();
  57. #define WORKAREA_SIZE ((WORD)49152)
  58. #define LINE_SIZE (256)
  59. /* PLAY statement support */
  60. #ifdef WW
  61. #include <il_sound.h>
  62. SoundIL soundIL;
  63. extern BYTE *_heap;
  64. BOOL soundAvailable;
  65. #endif
  66. /* 実行のみのモードで動いているとき (シリアル経由で端末が居ないとき) */
  67. BOOL runtimeOnly;
  68. #ifdef WW
  69. void fatalExit( const char * msg )
  70. {
  71. text_screen_init();
  72. text_put_string( 0, 0, (char*)msg );
  73. text_put_string( 0, 3, "PUSH ANY BUTTON" );
  74. key_wait();
  75. }
  76. #endif
  77. BOOL commonPrint( FILE FAR * fp, const char * msg,... )
  78. {
  79. #ifdef WW
  80. static
  81. #endif
  82. char buf[256];
  83. vsprintf(buf, msg, (va_list)(&msg+1) );
  84. if( fp != NULL ) {
  85. int r;
  86. r = fprintf( fp, buf );
  87. return r >= 0;
  88. } else {
  89. #ifdef WW
  90. if( runtimeOnly ) {
  91. fatalExit( buf );
  92. } else {
  93. comm_send_string( buf );
  94. }
  95. #else
  96. printf( buf );
  97. #endif
  98. }
  99. return TRUE;
  100. }
  101. void consoleInput( BYTE * buf, WORD len )
  102. {
  103. #ifdef WW
  104. WORD cursor;
  105. if( runtimeOnly ) {
  106. fatalExit("consoleInput not allowed in runtime mode");
  107. } else {
  108. cursor = 0;
  109. while( TRUE ) {
  110. int ch;
  111. ch = comm_receive_char();
  112. if( ch == 0x0d ) { /* CR */
  113. buf[cursor] = '\0';
  114. return;
  115. }
  116. if( ch == 0x09 ) { /* TAB */
  117. goto inputAsChar;
  118. }
  119. if( ch == 0x08 ) { /* BS */
  120. if( cursor > 0 ) {
  121. cursor--;
  122. comm_send_char( (unsigned char)ch );
  123. continue;
  124. }
  125. }
  126. if( ch >= 0 && ch < ' ' ) {
  127. /* ignore it */
  128. continue;
  129. }
  130. if( ch >= ' ' && ch <= 0xfc ) {
  131. inputAsChar:
  132. if( cursor < len-1 ) {
  133. buf[cursor] = ch;
  134. cursor++;
  135. comm_send_char( (unsigned char)ch );
  136. }
  137. }
  138. }
  139. }
  140. #else
  141. gets(buf);
  142. #endif
  143. }
  144. typedef struct {
  145. WORD id;
  146. const BYTE * name;
  147. } KEYWORDITEM;
  148. KEYWORDITEM keywordsA[] = {
  149. { KEYWORD_AND,"and" },
  150. { KEYWORD_ABS,"abs" },
  151. { KEYWORD_AX,"ax"},
  152. { 0,NULL }
  153. };
  154. KEYWORDITEM keywordsB[] = {
  155. { KEYWORD_BREAK,"break" },
  156. { KEYWORD_BX, "bx" },
  157. { 0,NULL }
  158. };
  159. KEYWORDITEM keywordsC[] = {
  160. { KEYWORD_CHR,"chr" },
  161. { KEYWORD_CLS,"cls" },
  162. { KEYWORD_CONT,"cont" },
  163. { KEYWORD_CALL, "call" },
  164. { KEYWORD_CSEG, "cseg" },
  165. { KEYWORD_CX,"cx" },
  166. { 0,NULL }
  167. };
  168. KEYWORDITEM keywordsD[] = {
  169. { KEYWORD_DEBUG,"debug" },
  170. { KEYWORD_DSEG, "dseg" },
  171. { KEYWORD_DX, "dx" },
  172. { KEYWORD_DI, "di" },
  173. { KEYWORD_DS, "ds" },
  174. { KEYWORD_DEFSEG, "defseg" },
  175. { 0,NULL }
  176. };
  177. KEYWORDITEM keywordsE[] = {
  178. { KEYWORD_END,"end" },
  179. { KEYWORD_EXIT,"exit" },
  180. { KEYWORD_ES, "es" },
  181. { 0,NULL }
  182. };
  183. KEYWORDITEM keywordsF[] = {
  184. { KEYWORD_FOR,"for" },
  185. { KEYWORD_FILES,"files" },
  186. { 0,NULL }
  187. };
  188. KEYWORDITEM keywordsG[] = {
  189. { KEYWORD_GOTO,"goto" },
  190. { KEYWORD_GOSUB,"gosub" },
  191. { 0,NULL }
  192. };
  193. KEYWORDITEM keywordsI[] = {
  194. { KEYWORD_IF,"if" },
  195. { KEYWORD_INT, "int" },
  196. { 0,NULL }
  197. };
  198. KEYWORDITEM keywordsL[] = {
  199. { KEYWORD_LOCATE,"locate" },
  200. { KEYWORD_LIST,"list" },
  201. { KEYWORD_LOAD,"load" },
  202. { 0,NULL }
  203. };
  204. KEYWORDITEM keywordsM[] = {
  205. { KEYWORD_MERGE,"merge" },
  206. { 0,NULL }
  207. };
  208. KEYWORDITEM keywordsN[] = {
  209. { KEYWORD_NEXT,"next" },
  210. { KEYWORD_NOT,"not" },
  211. { KEYWORD_NEW,"new" },
  212. { 0,NULL }
  213. };
  214. KEYWORDITEM keywordsO[] = {
  215. { KEYWORD_OR,"or" },
  216. { 0,NULL }
  217. };
  218. KEYWORDITEM keywordsP[] = {
  219. { KEYWORD_PRINT,"print" },
  220. { KEYWORD_PLAY,"play" },
  221. { KEYWORD_PEEK, "peek" },
  222. { KEYWORD_POKE, "poke" },
  223. { 0,NULL }
  224. };
  225. KEYWORDITEM keywordsR[] = {
  226. { KEYWORD_REM,"rem" },
  227. { KEYWORD_RETURN,"return" },
  228. { KEYWORD_RND,"rnd" },
  229. { KEYWORD_RUN,"run" },
  230. { KEYWORD_RANDOMIZE,"randomize" },
  231. { 0,NULL }
  232. };
  233. KEYWORDITEM keywordsS[] = {
  234. { KEYWORD_STEP,"step" },
  235. { KEYWORD_SCAN_A,"scan_a" },
  236. { KEYWORD_SCAN_B,"scan_b" },
  237. { KEYWORD_SCAN_X1,"scan_x1" },
  238. { KEYWORD_SCAN_X2,"scan_x2" },
  239. { KEYWORD_SCAN_X3,"scan_x3" },
  240. { KEYWORD_SCAN_X4,"scan_x4" },
  241. { KEYWORD_SCAN_Y1,"scan_y1" },
  242. { KEYWORD_SCAN_Y2,"scan_y2" },
  243. { KEYWORD_SCAN_Y3,"scan_y3" },
  244. { KEYWORD_SCAN_Y4,"scan_y4" },
  245. { KEYWORD_SCAN,"scan" }, /* scanはscna_Xより後になければならない */
  246. { KEYWORD_SAVE,"save" },
  247. { KEYWORD_SSEG, "sseg" },
  248. { KEYWORD_SI, "si" },
  249. { 0,NULL }
  250. };
  251. KEYWORDITEM keywordsT[] = {
  252. { KEYWORD_THEN,"then" },
  253. { KEYWORD_TO,"to" },
  254. { KEYWORD_TICK,"tick" },
  255. { KEYWORD_TRON,"tron" },
  256. { KEYWORD_TROFF,"troff" },
  257. { 0,NULL }
  258. };
  259. KEYWORDITEM keywordsV[] = {
  260. { KEYWORD_VARPTR, "varptr" },
  261. { KEYWORD_VARSEG, "varseg" },
  262. { 0,NULL }
  263. };
  264. KEYWORDITEM keywordsW[] = {
  265. { KEYWORD_WAITVB,"waitvb" },
  266. { KEYWORD_WAIT,"wait" }, // waitはwaitvbより後になければならない
  267. { 0,NULL }
  268. };
  269. KEYWORDITEM keywordsX[] = {
  270. { KEYWORD_XOR,"xor" },
  271. { 0,NULL }
  272. };
  273. KEYWORDITEM * keywordsIndex[26] = {
  274. keywordsA, keywordsB, keywordsC, keywordsD,
  275. keywordsE, keywordsF, keywordsG, NULL,
  276. keywordsI, NULL, NULL, keywordsL,
  277. keywordsM, keywordsN, keywordsO, keywordsP,
  278. NULL, keywordsR, keywordsS, keywordsT,
  279. NULL, keywordsV, keywordsW, keywordsX,
  280. NULL, NULL
  281. };
  282. /* インタラクティブモード時の1行バッファ */
  283. BYTE waRawLine[LINE_SIZE];
  284. BYTE waCookedLine[LINE_SIZE];
  285. /* コードとデータを収める領域 */
  286. WORD codeTop;
  287. WORD dataTop;
  288. /*WORD savedPointer; /* breakしたときの実行中位置 */
  289. BYTE wa[WORKAREA_SIZE];
  290. /* グローバル変数領域 */
  291. #define NUMBER_OF_SIMPLE_VARIABLES (26)
  292. SHORT globalVariables[NUMBER_OF_SIMPLE_VARIABLES];
  293. SHORT topLevelVariables[NUMBER_OF_SIMPLE_VARIABLES];
  294. SHORT * localVariables; /* あるスコープで有効なローカル変数領域を持つ */
  295. /* 現在実行中の位置に関する情報 */
  296. /* waかwaCookedLineのどちらかの中を示すかNULL */
  297. BYTE * executionPointer;
  298. /* contコマンドで実行を再開するポイント */
  299. BYTE * resumePointer;
  300. /* 現在処理中の行番号 (0ならダイレクトモード) */
  301. WORD currentLineNumber;
  302. /* gosubとforのためのスタック */
  303. #define STACK_TYPE_GOSUB 1
  304. #define STACK_TYPE_FOR 2
  305. typedef struct {
  306. WORD type; /* 1==GOSUB, 2==FOR */
  307. /* for GOSUB and FOR */
  308. BYTE * returnPointer;
  309. /* for GOSUB */
  310. SHORT * lastLocalVariables;
  311. SHORT simpleVariables[NUMBER_OF_SIMPLE_VARIABLES];
  312. /* for FOR */
  313. SHORT * pvar; /* counter variable */
  314. SHORT limit; /* limit value */
  315. SHORT step; /* step value */
  316. } STACK;
  317. #define STACK_MAX 8
  318. STACK stacks[STACK_MAX];
  319. int stackPointer;
  320. /* インタラクティブモードかインタプリタモードか */
  321. BOOL bInteractive;
  322. /* インタプリタ脱出後の振る舞いのリクエスト */
  323. BOOL bForceToReturnSuper;
  324. int requestNextAction; /* 以下のいずれか */
  325. /* 何もせず現状のまま */
  326. #define REQUEST_NO_ACTION 0
  327. /* 対話モードへ行け */
  328. #define REQUEST_INTERACTIVE 1
  329. /* runLineNumberから実行を開始せよ */
  330. #define REQUEST_RUN_LINENUMBER 2
  331. /* waRawLineに入っている文字列をファイル名としてそれを読み込んで実行せよ */
  332. #define REQUEST_RUN_FILE 3
  333. /* newせよ */
  334. #define REQUEST_NEW 4
  335. /* waRawLineに入っている文字列をファイル名としてそれをロード */
  336. #define REQUEST_LOAD_FILE 5
  337. /* WONBEを終了してOSに戻れ */
  338. #define REQUEST_EXIT_SYSTEM 6
  339. /* waRawLineに入っている文字列をファイル名としてそれをマージ */
  340. #define REQUEST_MERGE_FILE 7
  341. /* REQUEST_RUN_LINENUMBERで実行開始をリクエストする行番号 */
  342. WORD runLineNumber;
  343. // 編集機能が追加専用モードであることを示す
  344. // REQUEST_RUN_FILE or REQUEST_LOAD_FILE経由で処理するときだけTRUEとなる
  345. BOOL appendMode = FALSE;
  346. // Read/Writeされる擬似変数の置き場所
  347. WORD defseg;
  348. WORD registers[KEYWORD_ES-KEYWORD_AX+1];
  349. // トレースモード(tron/troff)
  350. BOOL traceFlag = FALSE;
  351. // マシン語アクセス関連
  352. #ifdef VC15
  353. // VC++1.5のときに使うコード
  354. WORD getdseg()
  355. {
  356. WORD s;
  357. __asm mov s, ds;
  358. return s;
  359. }
  360. WORD getsseg()
  361. {
  362. WORD s;
  363. __asm mov s, ss;
  364. return s;
  365. }
  366. WORD getcseg()
  367. {
  368. WORD s;
  369. __asm mov s, cs;
  370. return s;
  371. }
  372. #else
  373. WORD getdseg()
  374. {
  375. return 0; // DUMMY VALUE
  376. }
  377. WORD getsseg()
  378. {
  379. return 0; // DUMMY VALUE
  380. }
  381. WORD getcseg()
  382. {
  383. return 0; // DUMMY VALUE
  384. }
  385. #endif
  386. /* エラー発生 */
  387. void syntaxError()
  388. {
  389. commonPrint(NULL, "Syntax Error in %d\x7" NEWLINE, currentLineNumber );
  390. bForceToReturnSuper = TRUE;
  391. requestNextAction = REQUEST_INTERACTIVE;
  392. }
  393. void divideByZero()
  394. {
  395. commonPrint(NULL, "Divide by 0 in %d\x7" NEWLINE, currentLineNumber );
  396. bForceToReturnSuper = TRUE;
  397. requestNextAction = REQUEST_INTERACTIVE;
  398. }
  399. void outOfArraySubscription()
  400. {
  401. commonPrint(NULL, "Out of Array Subscription in %d\x7" NEWLINE, currentLineNumber );
  402. bForceToReturnSuper = TRUE;
  403. requestNextAction = REQUEST_INTERACTIVE;
  404. }
  405. void lineNumberNotFound( WORD lineNumber )
  406. {
  407. commonPrint(NULL, "Line Number %d not Found in %d\x7" NEWLINE, lineNumber, currentLineNumber );
  408. bForceToReturnSuper = TRUE;
  409. requestNextAction = REQUEST_INTERACTIVE;
  410. }
  411. void stackOverflow()
  412. {
  413. commonPrint(NULL, "Stack Overflow in %d\x7" NEWLINE, currentLineNumber );
  414. bForceToReturnSuper = TRUE;
  415. requestNextAction = REQUEST_INTERACTIVE;
  416. }
  417. void stackUnderflow()
  418. {
  419. commonPrint(NULL, "Stack Underflow in %d\x7" NEWLINE, currentLineNumber );
  420. bForceToReturnSuper = TRUE;
  421. requestNextAction = REQUEST_INTERACTIVE;
  422. }
  423. void nextWithoutFor()
  424. {
  425. commonPrint(NULL, "Next without For in %d\x7" NEWLINE, currentLineNumber );
  426. bForceToReturnSuper = TRUE;
  427. requestNextAction = REQUEST_INTERACTIVE;
  428. }
  429. void outOfMemory()
  430. {
  431. commonPrint(NULL, "Out of memory in %d\x7" NEWLINE, currentLineNumber );
  432. bForceToReturnSuper = TRUE;
  433. requestNextAction = REQUEST_INTERACTIVE;
  434. }
  435. void loadError()
  436. {
  437. commonPrint(NULL, "File Not Found or Load Error in %d\x7" NEWLINE, currentLineNumber );
  438. bForceToReturnSuper = TRUE;
  439. requestNextAction = REQUEST_INTERACTIVE;
  440. }
  441. void cantContinue()
  442. {
  443. commonPrint(NULL, "Can't Continue in %d\x7" NEWLINE, currentLineNumber );
  444. bForceToReturnSuper = TRUE;
  445. requestNextAction = REQUEST_INTERACTIVE;
  446. }
  447. void saveError()
  448. {
  449. commonPrint(NULL, "Save Erroor in %d\x7" NEWLINE, currentLineNumber );
  450. bForceToReturnSuper = TRUE;
  451. requestNextAction = REQUEST_INTERACTIVE;
  452. }
  453. void paramError()
  454. {
  455. commonPrint(NULL, "Parameter Erroor in %d\x7" NEWLINE, currentLineNumber );
  456. bForceToReturnSuper = TRUE;
  457. requestNextAction = REQUEST_INTERACTIVE;
  458. }
  459. void lineNumberZeroError()
  460. {
  461. // このエラーはエディタが出すものなのでランタイムで発生することはあり得ない
  462. // なので現在行番号を報告する意味がない
  463. //commonPrint(NULL, "Invalid Line Number 0 in %d\x7" NEWLINE, currentLineNumber );
  464. commonPrint(NULL, "Invalid Line Number 0\x7" NEWLINE );
  465. bForceToReturnSuper = TRUE;
  466. requestNextAction = REQUEST_INTERACTIVE;
  467. }
  468. /* ユーティリティ関数達 */
  469. void mymemmove( BYTE * dst, const BYTE * src, WORD len )
  470. {
  471. WORD i;
  472. if( dst < src ) {
  473. for( i=0; i<len; i++ ) {
  474. *dst++ = *src++;
  475. }
  476. } else {
  477. dst += len;
  478. src += len;
  479. for( i=0; i<len; i++ ) {
  480. *--dst = *--src;
  481. }
  482. }
  483. }
  484. BYTE * skipToEOL( BYTE * p )
  485. {
  486. while( TRUE ) {
  487. if( *p == EOL ) return p;
  488. switch( *p++ ) {
  489. case 0x01: /* 次にあるのは10進2バイト整数 */
  490. case 0x02: /* 次にあるのは16進2バイト整数 */
  491. p += 2;
  492. break;
  493. case 0x03: /* 次にあるのは可変長文字列 0x00でターミネート */
  494. {
  495. while( TRUE ) {
  496. if( *p++ == '\0' ) break;
  497. }
  498. }
  499. break;
  500. }
  501. }
  502. }
  503. // 短い関数をインライン展開しないコンパイラ向けの最適化としてマクロ化
  504. #define skipToNextLine(p) ( skipToEOL(p+4)+1 )
  505. //BYTE * skipToNextLine( BYTE * p )
  506. //{
  507. // return skipToEOL( p+4 ); // +4は行番号2バイト行長さ2バイト
  508. //}
  509. #if 1
  510. #define mytolower(ch) ((ch >= 'A' && ch <= 'Z')? ch - 'A' + 'a' : ch)
  511. #else
  512. BYTE mytolower( BYTE ch )
  513. {
  514. if( ch >= 'A' && ch <= 'Z' ) {
  515. return ch - 'A' + 'a';
  516. }
  517. return ch;
  518. }
  519. #endif
  520. /* シフトJISの1バイト目かどうか判断。マクロなので副作用に注意 */
  521. #define IsDBCSLeadByte(ch) ((ch >= 0x81 && ch <= 0x9f) || (ch >= 0xe0 && ch <= 0xfc))
  522. /* 実行時情報のクリア (contできなくなる) */
  523. void clearRuntimeInfo()
  524. {
  525. memset( globalVariables, 0, sizeof(globalVariables) );
  526. memset( topLevelVariables, 0, sizeof(topLevelVariables) );
  527. memset( stacks, 0, sizeof(stacks) );
  528. memset( registers, 0, sizeof(registers) );
  529. executionPointer = NULL;
  530. resumePointer = NULL;
  531. currentLineNumber = 0;
  532. localVariables = topLevelVariables;
  533. stackPointer = 0;
  534. defseg = getdseg();
  535. srand(0);
  536. }
  537. /* 行頭の行番号の、実行時の定型処理 */
  538. void processLineHeader()
  539. {
  540. if( !bInteractive ) {
  541. currentLineNumber = *((WORD *)executionPointer);
  542. if( traceFlag ) {
  543. commonPrint( NULL, "[%d]", currentLineNumber );
  544. }
  545. executionPointer += 4; // +4は行番号2バイト行長さ2バイト
  546. } else {
  547. currentLineNumber = 0;
  548. }
  549. }
  550. /* 行番号処理 */
  551. BYTE * getLineReferenceFromLineNumber( WORD lineNumber )
  552. {
  553. BYTE * p;
  554. WORD t;
  555. p = wa;
  556. while( TRUE ) {
  557. t = *((WORD *)p);
  558. if( t == 0 ) {
  559. return NULL;
  560. }
  561. if( lineNumber == t ) {
  562. return p;
  563. }
  564. p += *((WORD *)(p+2));
  565. }
  566. }
  567. BYTE * getInsertionPointFromLineNumber( WORD lineNumber )
  568. {
  569. BYTE * p;
  570. WORD t;
  571. p = wa;
  572. while( TRUE ) {
  573. t = *((WORD *)p);
  574. if( t == 0 ) {
  575. return p;
  576. }
  577. if( lineNumber <= t ) {
  578. return p;
  579. }
  580. p += *((WORD *)(p+2));
  581. }
  582. }
  583. /* 配列管理 */
  584. int availableArrayItems()
  585. {
  586. return (WORKAREA_SIZE-dataTop) >> 1;
  587. }
  588. SHORT * derefArrayItem( int index )
  589. {
  590. if( index < 0 || index >= availableArrayItems() ) {
  591. outOfArraySubscription();
  592. return NULL; /* そのインデックスは使えません */
  593. }
  594. return (SHORT*)(&wa[dataTop+index*2]);
  595. }
  596. /* 物理テキストの管理 */
  597. #define SCREEN_SIZE_X (224/8)
  598. #define SCREEN_SIZE_Y (144/8)
  599. WORD screen[SCREEN_SIZE_X][SCREEN_SIZE_Y];
  600. SHORT xCursor, yCursor;
  601. #define TABSTOP 8
  602. void ptextScrollUp()
  603. {
  604. int x, y;
  605. for( y=0; y<SCREEN_SIZE_Y-1; y++ ) {
  606. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  607. screen[x][y] = screen[x][y+1];
  608. }
  609. }
  610. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  611. screen[x][SCREEN_SIZE_Y-1] = ' ';
  612. }
  613. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  614. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  615. #ifdef WIN32
  616. drawChar( x, y, screen[x][y] );
  617. #endif
  618. #ifdef WW
  619. text_put_char( x, y, screen[x][y] );
  620. #endif
  621. }
  622. }
  623. }
  624. void ptextNewline()
  625. {
  626. xCursor = 0;
  627. yCursor++;
  628. if( yCursor >= SCREEN_SIZE_Y ) {
  629. ptextScrollUp();
  630. yCursor = SCREEN_SIZE_Y-1;
  631. }
  632. }
  633. void ptextTab()
  634. {
  635. if( xCursor+TABSTOP >= SCREEN_SIZE_X ) {
  636. ptextNewline();
  637. return;
  638. }
  639. xCursor = (xCursor+TABSTOP) / TABSTOP * TABSTOP;
  640. }
  641. void ptextString( const BYTE FAR * msg )
  642. {
  643. while( TRUE ) {
  644. WORD ch;
  645. if( *msg == '\0' ) break;
  646. if( IsDBCSLeadByte(*msg) ) {
  647. ch = (msg[0] << 8) + msg[1];
  648. msg+=2;
  649. } else {
  650. ch = msg[0];
  651. msg++;
  652. }
  653. screen[xCursor][yCursor] = ch;
  654. #ifdef WIN32
  655. drawChar( xCursor, yCursor, ch );
  656. #endif
  657. #ifdef WW
  658. text_put_char( xCursor, yCursor, ch );
  659. #endif
  660. xCursor++;
  661. if( xCursor >= SCREEN_SIZE_X ) {
  662. xCursor = 0;
  663. yCursor++;
  664. if( yCursor >= SCREEN_SIZE_Y ) {
  665. ptextScrollUp();
  666. yCursor = SCREEN_SIZE_Y-1;
  667. }
  668. }
  669. }
  670. }
  671. void ptextLocate( int x, int y )
  672. {
  673. if( x < 0 ) x = 0;
  674. if( x >= SCREEN_SIZE_X ) x = SCREEN_SIZE_X-1;
  675. if( y < 0 ) y = 0;
  676. if( y >= SCREEN_SIZE_Y ) y = SCREEN_SIZE_Y-1;
  677. xCursor = x;
  678. yCursor = y;
  679. }
  680. void ptextCLS()
  681. {
  682. int x,y;
  683. xCursor = 0;
  684. yCursor = 0;
  685. #ifdef WIN32
  686. clearText();
  687. #endif
  688. #ifdef WW
  689. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  690. text_fill_char(0, y, SCREEN_SIZE_X, ' ' );
  691. }
  692. #endif
  693. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  694. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  695. screen[x][y] = ' ';
  696. }
  697. }
  698. }
  699. /* 中間コードからソーステキストに戻しながら出力(listとsaveで使う) */
  700. BOOL sourceDump( FILE FAR * fp, WORD from, WORD to )
  701. {
  702. BYTE * p;
  703. BOOL b;
  704. p = getInsertionPointFromLineNumber( from );
  705. while( TRUE ) {
  706. WORD lineNumber;
  707. lineNumber = *((WORD*)p);
  708. if( lineNumber == 0 ) break;
  709. if( lineNumber > to ) break;
  710. p += 4;
  711. b = commonPrint(fp,"%d",lineNumber);
  712. if( b == FALSE ) return FALSE;
  713. while( TRUE ) {
  714. if( *p == EOL ) {
  715. p++;
  716. break;
  717. }
  718. if( *p == 0x01 ) {
  719. WORD n;
  720. p++;
  721. n = *((WORD*)p);
  722. p += 2;
  723. b = commonPrint(fp,"%d",n);
  724. if( b == FALSE ) return FALSE;
  725. } else if( *p == 0x02 ) {
  726. WORD n;
  727. p++;
  728. n = *((WORD*)p);
  729. p += 2;
  730. b = commonPrint(fp,"0x%x",n);
  731. if( b == FALSE ) return FALSE;
  732. } else if( *p == 0x03 ) {
  733. p++;
  734. b = commonPrint(fp,"\"%s\"",p);
  735. if( b == FALSE ) return FALSE;
  736. p += strlen(p)+1;
  737. } else if( *p == '\'' ) { /* コメントのあとはそのまま行末まで転送 */
  738. while( TRUE ) {
  739. if( *p == EOL ) break;
  740. b = commonPrint(fp,"%c",*p);
  741. if( b == FALSE ) return FALSE;
  742. p++;
  743. }
  744. } else if( *p >= 0x80 ) {
  745. int i;
  746. BOOL found;
  747. found = FALSE;
  748. for( i=0; i<26; i++ ) {
  749. KEYWORDITEM * k;
  750. if( found ) break;
  751. k = keywordsIndex[i];
  752. if( k == NULL ) continue;
  753. while( TRUE ) {
  754. if( k->id == 0 ) break;
  755. if( k->id == *p ) {
  756. b = commonPrint(fp, k->name );
  757. if( b == FALSE ) return FALSE;
  758. p++;
  759. if( k->id == KEYWORD_REM ) { /* コメントのあとはそのまま行末まで転送 */
  760. while( TRUE ) {
  761. if( *p == EOL ) break;
  762. b = commonPrint(fp,"%c",*p);
  763. if( b == FALSE ) return FALSE;
  764. p++;
  765. }
  766. }
  767. found = TRUE;
  768. break;
  769. }
  770. k++;
  771. }
  772. }
  773. if( !found ) {
  774. b = commonPrint(fp,"[?%x?]", *p );
  775. if( b == FALSE ) return FALSE;
  776. p++;
  777. }
  778. } else {
  779. b = commonPrint(fp,"%c",*p);
  780. if( b == FALSE ) return FALSE;
  781. p++;
  782. }
  783. }
  784. b = commonPrint(fp,NEWLINE);
  785. if( b == FALSE ) return FALSE;
  786. }
  787. return TRUE;
  788. }
  789. /* 式計算機能 */
  790. SHORT expr(); /* forward decl */
  791. SHORT * getArrayReference()
  792. {
  793. BYTE ch;
  794. int index;
  795. SHORT * pvar;
  796. while( TRUE ) {
  797. ch = *executionPointer++;
  798. if( ch != ' ' && ch != '\t' ) break;
  799. }
  800. if( ch != '(' && ch != '[' ) {
  801. syntaxError();
  802. return NULL;
  803. }
  804. index = expr();
  805. if( bForceToReturnSuper ) return NULL;
  806. pvar = derefArrayItem( index );
  807. if( pvar == NULL ) return NULL;
  808. while( TRUE ) {
  809. ch = *executionPointer++;
  810. if( ch != ' ' && ch != '\t' ) break;
  811. }
  812. if( ch != ')' && ch != ']' ) {
  813. syntaxError();
  814. return NULL;
  815. }
  816. return pvar;
  817. }
  818. SHORT calcValue()
  819. {
  820. BYTE ch;
  821. while( TRUE ) {
  822. ch = *executionPointer++;
  823. if( ch != ' ' && ch != '\t' ) break;
  824. }
  825. if( ch >= 'A' && ch <= 'Z' ) {
  826. return globalVariables[ch-'A'];
  827. }
  828. if( ch >= 'a' && ch <= 'z' ) {
  829. return localVariables[ch-'a'];
  830. }
  831. if( ch == '@' ) {
  832. SHORT * pvar;
  833. pvar = getArrayReference();
  834. if( pvar == NULL ) return -1;
  835. return *pvar;
  836. }
  837. if( ch >= KEYWORD_AX && ch <= KEYWORD_ES ) {
  838. return registers[ch-KEYWORD_AX];
  839. }
  840. switch( ch ) {
  841. case 0x01: /* 次にあるのは10進2バイト整数 */
  842. case 0x02: /* 次にあるのは16進2バイト整数 */
  843. {
  844. SHORT t;
  845. t = *((SHORT *)executionPointer);
  846. executionPointer += 2;
  847. return t;
  848. }
  849. case '(':
  850. {
  851. SHORT t;
  852. t = expr();
  853. while( TRUE ) {
  854. ch = *executionPointer++;
  855. if( ch != ' ' && ch != '\t' ) break;
  856. }
  857. if( ch != ')' ) {
  858. syntaxError();
  859. return -1;
  860. }
  861. return t;
  862. }
  863. case '-':
  864. return -calcValue();
  865. case KEYWORD_NOT:
  866. return ~calcValue();
  867. case KEYWORD_SCAN:
  868. #ifdef WW
  869. return key_press_check();
  870. #else
  871. return win32_scan();
  872. #endif
  873. case KEYWORD_WAIT:
  874. #ifdef WW
  875. return key_wait();
  876. #else
  877. return win32_wait();
  878. #endif
  879. case KEYWORD_RND:
  880. {
  881. SHORT t;
  882. t = calcValue();
  883. return rand() % t;
  884. }
  885. case KEYWORD_ABS:
  886. {
  887. SHORT t;
  888. t = calcValue();
  889. if( t < 0 ) return -t;
  890. return t;
  891. }
  892. case KEYWORD_TICK:
  893. #ifdef WW
  894. return sys_get_tick_count();
  895. #else
  896. return win32_get_tick_count();
  897. #endif
  898. case KEYWORD_SCAN_A:
  899. return 4;
  900. case KEYWORD_SCAN_B:
  901. return 8;
  902. case KEYWORD_SCAN_X1:
  903. return 16;
  904. case KEYWORD_SCAN_X2:
  905. return 32;
  906. case KEYWORD_SCAN_X3:
  907. return 64;
  908. case KEYWORD_SCAN_X4:
  909. return 128;
  910. case KEYWORD_SCAN_Y1:
  911. return 256;
  912. case KEYWORD_SCAN_Y2:
  913. return 512;
  914. case KEYWORD_SCAN_Y3:
  915. return 1024;
  916. case KEYWORD_SCAN_Y4:
  917. return 2048;
  918. case KEYWORD_DEFSEG:
  919. return defseg;
  920. case KEYWORD_DSEG:
  921. return getdseg();
  922. case KEYWORD_CSEG:
  923. return getcseg();
  924. case KEYWORD_SSEG:
  925. return getsseg();
  926. case KEYWORD_VARPTR:
  927. case KEYWORD_VARSEG:
  928. {
  929. BOOL requestSeg;
  930. SHORT * refer;
  931. requestSeg = (ch == KEYWORD_VARSEG);
  932. while( TRUE ) {
  933. ch = *executionPointer++;
  934. if( ch != ' ' && ch != '\t' ) break;
  935. }
  936. if( ch != '(' ) {
  937. syntaxError();
  938. return -1;
  939. }
  940. while( TRUE ) {
  941. ch = *executionPointer++;
  942. if( ch != ' ' && ch != '\t' ) break;
  943. }
  944. if( ch == '@' ) { /* is it l-value? */
  945. SHORT * pvar;
  946. pvar = getArrayReference();
  947. if( pvar == NULL ) return -1;
  948. refer = pvar;
  949. } else if( ch >= 'A' && ch <= 'Z' ) {
  950. refer = &globalVariables[ch-'A'];
  951. } else if( ch >= 'a' && ch <= 'z' ) {
  952. refer = &localVariables[ch-'a'];
  953. } else if( ch >= KEYWORD_AX && ch <= KEYWORD_ES ) {
  954. refer = &registers[ch-KEYWORD_AX];
  955. } else if( ch == KEYWORD_DEFSEG ) {
  956. refer = &defseg;
  957. } else {
  958. syntaxError();
  959. return -1;
  960. }
  961. while( TRUE ) {
  962. ch = *executionPointer++;
  963. if( ch != ' ' && ch != '\t' ) break;
  964. }
  965. if( ch != ')' ) {
  966. syntaxError();
  967. return -1;
  968. }
  969. #ifdef WW
  970. if( requestSeg ) {
  971. return getdseg();
  972. } else {
  973. return (SHORT)refer;
  974. }
  975. #else
  976. printf("varseg/varptr: %08x\n", refer );
  977. return 0;
  978. #endif
  979. }
  980. case KEYWORD_PEEK:
  981. {
  982. SHORT t;
  983. BYTE FAR * fulladdr;
  984. t = calcValue();
  985. fulladdr = (BYTE FAR *)(((DWORD)defseg << 16) + (WORD)t);
  986. #ifdef WW
  987. return *fulladdr;
  988. #else
  989. printf("peek: %08x\n", fulladdr );
  990. return 0;
  991. #endif
  992. }
  993. }
  994. syntaxError();
  995. return -1;
  996. }
  997. SHORT expr4th()
  998. {
  999. SHORT acc;
  1000. acc = calcValue();
  1001. if( bForceToReturnSuper ) return -1;
  1002. while( TRUE ) {
  1003. BYTE ch;
  1004. while( TRUE ) {
  1005. ch = *executionPointer++;
  1006. if( ch != ' ' && ch != '\t' ) break;
  1007. }
  1008. switch( ch ) {
  1009. case '*':
  1010. acc = acc * calcValue();
  1011. break;
  1012. case '/':
  1013. {
  1014. SHORT t;
  1015. t = calcValue();
  1016. if( t == 0 ) {
  1017. divideByZero();
  1018. } else {
  1019. acc = acc / t;
  1020. }
  1021. }
  1022. break;
  1023. default:
  1024. executionPointer--; /* unget it */
  1025. return acc;
  1026. }
  1027. if( bForceToReturnSuper ) return -1;
  1028. }
  1029. }
  1030. SHORT expr3nd()
  1031. {
  1032. SHORT acc;
  1033. acc = expr4th();
  1034. if( bForceToReturnSuper ) return -1;
  1035. while( TRUE ) {
  1036. BYTE ch;
  1037. while( TRUE ) {
  1038. ch = *executionPointer++;
  1039. if( ch != ' ' && ch != '\t' ) break;
  1040. }
  1041. switch( ch ) {
  1042. case '+':
  1043. acc = acc + expr4th();
  1044. break;
  1045. case '-':
  1046. acc = acc - expr4th();
  1047. break;
  1048. default:
  1049. executionPointer--; /* unget it */
  1050. return acc;
  1051. }
  1052. if( bForceToReturnSuper ) return -1;
  1053. }
  1054. }
  1055. SHORT expr2nd()
  1056. {
  1057. SHORT acc;
  1058. acc = expr3nd();
  1059. if( bForceToReturnSuper ) return -1;
  1060. while( TRUE ) {
  1061. BYTE ch;
  1062. while( TRUE ) {
  1063. ch = *executionPointer++;
  1064. if( ch != ' ' && ch != '\t' ) break;
  1065. }
  1066. switch( ch ) {
  1067. case '>':
  1068. {
  1069. BYTE ch2;
  1070. while( TRUE ) {
  1071. ch2 = *executionPointer++;
  1072. if( ch2 != ' ' && ch2 != '\t' ) break;
  1073. }
  1074. if( ch2 == '=' ) {
  1075. acc = (acc >= expr3nd());
  1076. if( acc != 0 ) acc = -1;
  1077. } else {
  1078. executionPointer--;
  1079. acc = (acc > expr3nd());
  1080. if( acc != 0 ) acc = -1;
  1081. }
  1082. }
  1083. break;
  1084. case '<':
  1085. {
  1086. BYTE ch2;
  1087. while( TRUE ) {
  1088. ch2 = *executionPointer++;
  1089. if( ch2 != ' ' && ch2 != '\t' ) break;
  1090. }
  1091. if( ch2 == '=' ) {
  1092. acc = (acc <= expr3nd());
  1093. if( acc != 0 ) acc = -1;
  1094. } else if( ch2 == '>' ) {
  1095. acc = (acc != expr3nd());
  1096. if( acc != 0 ) acc = -1;
  1097. } else {
  1098. executionPointer--;
  1099. acc = (acc < expr3nd());
  1100. if( acc != 0 ) acc = -1;
  1101. }
  1102. }
  1103. break;
  1104. case '=':
  1105. acc = (acc == expr3nd());
  1106. if( acc != 0 ) acc = -1;
  1107. break;
  1108. default:
  1109. executionPointer--; /* unget it */
  1110. return acc;
  1111. }
  1112. if( bForceToReturnSuper ) return -1;
  1113. }
  1114. }
  1115. SHORT expr()
  1116. {
  1117. SHORT acc;
  1118. acc = expr2nd();
  1119. if( bForceToReturnSuper ) return -1;
  1120. while( TRUE ) {
  1121. BYTE ch;
  1122. while( TRUE ) {
  1123. ch = *executionPointer++;
  1124. if( ch != ' ' && ch != '\t' ) break;
  1125. }
  1126. switch( ch ) {
  1127. case KEYWORD_AND:
  1128. acc = acc & expr2nd();
  1129. break;
  1130. case KEYWORD_OR:
  1131. acc = acc | expr2nd();
  1132. break;
  1133. case KEYWORD_XOR:
  1134. acc = acc ^ expr2nd();
  1135. break;
  1136. default:
  1137. executionPointer--; /* unget it */
  1138. return acc;
  1139. }
  1140. if( bForceToReturnSuper ) return -1;
  1141. }
  1142. }
  1143. /* 各ステートメント実行処理メイン */
  1144. void st_assignment( SHORT * pvar ) /* 代入ステートメントだけ例外的に処理する */
  1145. {
  1146. BYTE ch;
  1147. SHORT val;
  1148. while( TRUE ) {
  1149. ch = *executionPointer++;
  1150. if( ch != ' ' && ch != '\t' ) break;
  1151. }
  1152. if( ch != '=' ) {
  1153. syntaxError();
  1154. return;
  1155. }
  1156. val = expr();
  1157. if( bForceToReturnSuper ) return;
  1158. *pvar = val;
  1159. }
  1160. void printOrDebug( BOOL bPrint )
  1161. {
  1162. WORD lastChar;
  1163. BYTE ch;
  1164. lastChar = '\0';
  1165. while( TRUE ) {
  1166. while( TRUE ) {
  1167. ch = *executionPointer++;
  1168. if( ch != ' ' && ch != '\t' ) break;
  1169. }
  1170. if( ch == EOL || ch == ':' || ch == '\'' ) {
  1171. executionPointer--; /* unget it */
  1172. break;
  1173. }
  1174. lastChar = ch;
  1175. switch( ch ) {
  1176. case 0x03:
  1177. if( bPrint ) {
  1178. ptextString( executionPointer );
  1179. } else {
  1180. commonPrint( NULL, executionPointer );
  1181. }
  1182. while( TRUE ) {
  1183. ch = *executionPointer++;
  1184. if( ch == '\0' ) break;
  1185. }
  1186. break;
  1187. case ';':
  1188. break;
  1189. case ',':
  1190. if( bPrint ) {
  1191. ptextTab();
  1192. } else {
  1193. commonPrint( NULL, "\t" );
  1194. }
  1195. break;
  1196. case KEYWORD_CHR:
  1197. {
  1198. WORD val;
  1199. #ifdef WW
  1200. static
  1201. #endif
  1202. BYTE str[3];
  1203. val = expr();
  1204. if( bForceToReturnSuper ) return;
  1205. if( val >= 0x100 ) {
  1206. str[0] = (val >> 8);
  1207. str[1] = (val & 0xff);
  1208. str[2] = '\0';
  1209. } else {
  1210. str[0] = (BYTE)val;
  1211. str[1] = '\0';
  1212. }
  1213. if( bPrint ) {
  1214. ptextString( str );
  1215. } else {
  1216. commonPrint( NULL, str );
  1217. }
  1218. }
  1219. break;
  1220. default:
  1221. {
  1222. SHORT val;
  1223. #ifdef WW
  1224. static
  1225. #endif
  1226. BYTE str[10];
  1227. executionPointer--; /* unget it */
  1228. val = expr();
  1229. if( bForceToReturnSuper ) return;
  1230. sprintf( str, "%d", val );
  1231. if( bPrint ) {
  1232. ptextString( str );
  1233. } else {
  1234. commonPrint( NULL, str );
  1235. }
  1236. }
  1237. break;
  1238. }
  1239. }
  1240. if( lastChar != ';' && lastChar != ',' ) {
  1241. if( bPrint ) {
  1242. ptextNewline();
  1243. } else {
  1244. commonPrint( NULL, NEWLINE );
  1245. }
  1246. }
  1247. }
  1248. void st_print()
  1249. {
  1250. printOrDebug( TRUE );
  1251. }
  1252. void st_debug()
  1253. {
  1254. printOrDebug( FALSE );
  1255. }
  1256. void st_locate()
  1257. {
  1258. SHORT x, y;
  1259. BYTE ch;
  1260. x = expr();
  1261. if( bForceToReturnSuper ) return;
  1262. while( TRUE ) {
  1263. ch = *executionPointer++;
  1264. if( ch != ' ' && ch != '\t' ) break;
  1265. }
  1266. if( ch != ',' ) {
  1267. syntaxError();
  1268. return;
  1269. }
  1270. y = expr();
  1271. if( bForceToReturnSuper ) return;
  1272. ptextLocate( x, y );
  1273. }
  1274. void st_cls()
  1275. {
  1276. ptextCLS();
  1277. }
  1278. void st_goto()
  1279. {
  1280. SHORT val;
  1281. BYTE * t;
  1282. val = expr();
  1283. if( bForceToReturnSuper ) return;
  1284. t = getLineReferenceFromLineNumber( val );
  1285. if( t == NULL ) {
  1286. lineNumberNotFound( val );
  1287. return;
  1288. }
  1289. executionPointer = t;
  1290. bInteractive = FALSE;
  1291. processLineHeader();
  1292. }
  1293. void st_gosub()
  1294. {
  1295. SHORT val;
  1296. BYTE * t;
  1297. val = expr();
  1298. if( bForceToReturnSuper ) return;
  1299. t = getLineReferenceFromLineNumber( val );
  1300. if( t == NULL ) {
  1301. lineNumberNotFound( val );
  1302. return;
  1303. }
  1304. if( stackPointer+1 >= STACK_MAX ) {
  1305. stackOverflow();
  1306. return;
  1307. }
  1308. stacks[stackPointer].type = STACK_TYPE_GOSUB;
  1309. stacks[stackPointer].returnPointer = executionPointer;
  1310. stacks[stackPointer].lastLocalVariables = localVariables;
  1311. localVariables = stacks[stackPointer].simpleVariables;
  1312. stackPointer++;
  1313. executionPointer = t;
  1314. bInteractive = FALSE;
  1315. processLineHeader();
  1316. }
  1317. void st_return()
  1318. {
  1319. while( TRUE ) {
  1320. if( stackPointer == 0 ) {
  1321. stackUnderflow();
  1322. return;
  1323. }
  1324. stackPointer--;
  1325. if( stacks[stackPointer].type == STACK_TYPE_GOSUB ) break;
  1326. }
  1327. executionPointer = stacks[stackPointer].returnPointer;
  1328. if( executionPointer >= waCookedLine && executionPointer < waCookedLine+LINE_SIZE ) {
  1329. bInteractive = TRUE;
  1330. }
  1331. localVariables = stacks[stackPointer].lastLocalVariables;
  1332. }
  1333. void st_if()
  1334. {
  1335. SHORT val;
  1336. BYTE ch;
  1337. val = expr();
  1338. if( bForceToReturnSuper ) return;
  1339. while( TRUE ) {
  1340. ch = *executionPointer++;
  1341. if( ch != ' ' && ch != '\t' ) break;
  1342. }
  1343. if( ch != KEYWORD_THEN ) {
  1344. syntaxError();
  1345. return;
  1346. }
  1347. if( val != 0 ) {
  1348. while( TRUE ) {
  1349. ch = *executionPointer;
  1350. if( ch != ' ' && ch != '\t' ) break;
  1351. executionPointer++;
  1352. }
  1353. if( ch == 0x01 ) {
  1354. // thenのあとに整数が直接書かれた場合は、それにgotoする。
  1355. st_goto();
  1356. return;
  1357. }
  1358. return; /* thenの次から継続実行する */
  1359. }
  1360. /* 条件不成立につき、行末まで読み飛ばす */
  1361. executionPointer = skipToEOL( executionPointer );
  1362. }
  1363. void st_for()
  1364. {
  1365. BYTE ch;
  1366. SHORT from, to, step;
  1367. SHORT * pvar;
  1368. while( TRUE ) {
  1369. ch = *executionPointer++;
  1370. if( ch != ' ' && ch != '\t' ) break;
  1371. }
  1372. if( ch == '@' ) { /* is it l-value? */
  1373. pvar = getArrayReference();
  1374. if( pvar == NULL ) return;
  1375. } else if( ch >= 'A' && ch <= 'Z' ) {
  1376. pvar = &globalVariables[ch-'A'];
  1377. } else if( ch >= 'a' && ch <= 'z' ) {
  1378. pvar = &localVariables[ch-'a'];
  1379. } else {
  1380. syntaxError();
  1381. return;
  1382. }
  1383. while( TRUE ) {
  1384. ch = *executionPointer++;
  1385. if( ch != ' ' && ch != '\t' ) break;
  1386. }
  1387. if( ch != '=' ) {
  1388. syntaxError();
  1389. return;
  1390. }
  1391. from = expr();
  1392. if( bForceToReturnSuper ) return;
  1393. while( TRUE ) {
  1394. ch = *executionPointer++;
  1395. if( ch != ' ' && ch != '\t' ) break;
  1396. }
  1397. if( ch != KEYWORD_TO ) {
  1398. syntaxError();
  1399. return;
  1400. }
  1401. to = expr();
  1402. if( bForceToReturnSuper ) return;
  1403. while( TRUE ) {
  1404. ch = *executionPointer++;
  1405. if( ch != ' ' && ch != '\t' ) break;
  1406. }
  1407. if( ch == KEYWORD_STEP ) {
  1408. step = expr();
  1409. if( bForceToReturnSuper ) return;
  1410. } else {
  1411. step = 1;
  1412. executionPointer--; /* unget it */
  1413. }
  1414. if( stackPointer+1 >= STACK_MAX ) {
  1415. stackOverflow();
  1416. return;
  1417. }
  1418. stacks[stackPointer].type = STACK_TYPE_FOR;
  1419. stacks[stackPointer].returnPointer = executionPointer;
  1420. *pvar = from;
  1421. stacks[stackPointer].pvar = pvar;
  1422. stacks[stackPointer].limit = to;
  1423. stacks[stackPointer].step = step;
  1424. stackPointer++;
  1425. }
  1426. void st_next()
  1427. {
  1428. if( stackPointer == 0 ) {
  1429. nextWithoutFor();
  1430. return;
  1431. }
  1432. if( stacks[stackPointer-1].type != STACK_TYPE_FOR ) {
  1433. nextWithoutFor();
  1434. return;
  1435. }
  1436. if( stacks[stackPointer-1].limit == *(stacks[stackPointer-1].pvar) ) {
  1437. /* loop done */
  1438. stackPointer--;
  1439. return;
  1440. }
  1441. /* count step and loop again */
  1442. *(stacks[stackPointer-1].pvar) += stacks[stackPointer-1].step;
  1443. /* counter overflow? */
  1444. if( stacks[stackPointer-1].step > 0 ) {
  1445. if( stacks[stackPointer-1].limit < *(stacks[stackPointer-1].pvar) ) {
  1446. /* loop done */
  1447. stackPointer--;
  1448. return;
  1449. }
  1450. } else {
  1451. if( stacks[stackPointer-1].limit > *(stacks[stackPointer-1].pvar) ) {
  1452. /* loop done */
  1453. stackPointer--;
  1454. return;
  1455. }
  1456. }
  1457. executionPointer = stacks[stackPointer-1].returnPointer;
  1458. }
  1459. /* endステートメント: 正常な終了 */
  1460. void st_end()
  1461. {
  1462. bForceToReturnSuper = TRUE;
  1463. requestNextAction = REQUEST_INTERACTIVE;
  1464. }
  1465. /* breakステートメント: デバッグ用の中断 */
  1466. void st_break()
  1467. {
  1468. commonPrint(NULL, "Break in %d\x7" NEWLINE, currentLineNumber);
  1469. bForceToReturnSuper = TRUE;
  1470. requestNextAction = REQUEST_INTERACTIVE;
  1471. resumePointer = executionPointer; /* contする場所はbreakの次。breakのみの例外処理 */
  1472. }
  1473. void st_rem()
  1474. {
  1475. executionPointer = skipToEOL( executionPointer );
  1476. }
  1477. void st_new()
  1478. {
  1479. bForceToReturnSuper = TRUE;
  1480. requestNextAction = REQUEST_NEW;
  1481. }
  1482. void st_list()
  1483. {
  1484. WORD from, to;
  1485. BYTE ch;
  1486. while( TRUE ) {
  1487. ch = *executionPointer++;
  1488. if( ch != ' ' && ch != '\t' ) break;
  1489. }
  1490. if( ch == ':' || ch == EOL || ch == '\'' ) {
  1491. executionPointer--; /* unget */
  1492. from = 1;
  1493. to = 32767;
  1494. } else {
  1495. if( ch == 0x01 ) {
  1496. from = *((WORD*)executionPointer);
  1497. executionPointer += 2;
  1498. while( TRUE ) {
  1499. ch = *executionPointer++;
  1500. if( ch != ' ' && ch != '\t' ) break;
  1501. }
  1502. } else {
  1503. from = 1;
  1504. }
  1505. if( ch != '-' ) {
  1506. executionPointer--; /* unget */
  1507. to = from;
  1508. } else {
  1509. while( TRUE ) {
  1510. ch = *executionPointer++;
  1511. if( ch != ' ' && ch != '\t' ) break;
  1512. }
  1513. if( ch == 0x01 ) {
  1514. to = *((WORD*)executionPointer);
  1515. executionPointer += 2;
  1516. } else {
  1517. executionPointer--; /* unget */
  1518. to = 32767;
  1519. }
  1520. }
  1521. }
  1522. sourceDump( NULL, from, to ); /* リスト出力の本体を呼ぶ */
  1523. }
  1524. void st_run()
  1525. {
  1526. BYTE ch;
  1527. while( TRUE ) {
  1528. ch = *executionPointer++;
  1529. if( ch != ' ' && ch != '\t' ) break;
  1530. }
  1531. if( ch == ':' || ch == EOL || ch == '\'' ) {
  1532. bForceToReturnSuper = TRUE;
  1533. requestNextAction = REQUEST_RUN_LINENUMBER;
  1534. runLineNumber = 0;
  1535. } else if( ch == 0x03 ) {
  1536. strcpy( waRawLine, executionPointer );
  1537. bForceToReturnSuper = TRUE;
  1538. requestNextAction = REQUEST_RUN_FILE;
  1539. } else {
  1540. SHORT val;
  1541. executionPointer--; /* unget it */
  1542. val = expr();
  1543. if( bForceToReturnSuper ) return;
  1544. bForceToReturnSuper = TRUE;
  1545. requestNextAction = REQUEST_RUN_LINENUMBER;
  1546. runLineNumber = val;
  1547. }
  1548. }
  1549. void st_cont()
  1550. {
  1551. if( resumePointer == NULL ) {
  1552. cantContinue();
  1553. return;
  1554. }
  1555. executionPointer = resumePointer;
  1556. bInteractive = FALSE;
  1557. }
  1558. void st_save()
  1559. {
  1560. BYTE ch;
  1561. BOOL b;
  1562. FILE FAR * fp;
  1563. while( TRUE ) {
  1564. ch = *executionPointer++;
  1565. if( ch != ' ' && ch != '\t' ) break;
  1566. }
  1567. if( ch != 0x03 ) {
  1568. syntaxError();
  1569. return;
  1570. }
  1571. fp = fopen( executionPointer, "w" );
  1572. if( fp == NULL ) {
  1573. saveError();
  1574. return;
  1575. }
  1576. b = sourceDump( fp, 1, 32767 );
  1577. fclose( fp );
  1578. if( b == FALSE ) {
  1579. saveError();
  1580. remove( executionPointer );
  1581. return;
  1582. }
  1583. executionPointer += strlen(executionPointer)+1;
  1584. }
  1585. void st_load()
  1586. {
  1587. BYTE ch;
  1588. while( TRUE ) {
  1589. ch = *executionPointer++;
  1590. if( ch != ' ' && ch != '\t' ) break;
  1591. }
  1592. if( ch == 0x03 ) {
  1593. strcpy( waRawLine, executionPointer );
  1594. bForceToReturnSuper = TRUE;
  1595. requestNextAction = REQUEST_LOAD_FILE;
  1596. } else {
  1597. syntaxError();
  1598. return;
  1599. }
  1600. }
  1601. void st_merge()
  1602. {
  1603. BYTE ch;
  1604. while( TRUE ) {
  1605. ch = *executionPointer++;
  1606. if( ch != ' ' && ch != '\t' ) break;
  1607. }
  1608. if( ch == 0x03 ) {
  1609. strcpy( waRawLine, executionPointer );
  1610. bForceToReturnSuper = TRUE;
  1611. requestNextAction = REQUEST_MERGE_FILE;
  1612. } else {
  1613. syntaxError();
  1614. return;
  1615. }
  1616. }
  1617. void st_randomize()
  1618. {
  1619. SHORT val;
  1620. val = expr();
  1621. srand( val );
  1622. }
  1623. void st_exit()
  1624. {
  1625. bForceToReturnSuper = TRUE;
  1626. requestNextAction = REQUEST_EXIT_SYSTEM;
  1627. }
  1628. void st_waitvb()
  1629. {
  1630. SHORT val;
  1631. val = expr();
  1632. if( bForceToReturnSuper ) return;
  1633. if( val < 0 || val > 750 ) {
  1634. paramError();
  1635. return;
  1636. }
  1637. #ifdef WW
  1638. sys_wait( val );
  1639. #endif
  1640. #ifdef WIN32
  1641. win32_sys_wait( val );
  1642. #endif
  1643. }
  1644. void st_files()
  1645. {
  1646. #ifdef WIN32
  1647. commonPrint( NULL, "files statement not implemented in Win32\x7" NEWLINE );
  1648. #endif
  1649. #ifdef WW
  1650. int i;
  1651. struct stat statbuf;
  1652. int nent;
  1653. /*chdir("/rom0");*/
  1654. nent = nument(NULL);
  1655. for (i = 0; i < nent; i++) {
  1656. int result = getent(NULL, i, &statbuf);
  1657. if (result == E_FS_SUCCESS) {
  1658. if (statbuf.count != -1) {
  1659. /* Freya OSのバグ? 回避コード */
  1660. int p, q;
  1661. p = 0;
  1662. q = 0;
  1663. waRawLine[p++] = '"';
  1664. while( TRUE ) {
  1665. if( statbuf.name[q] == '\0' ) break;
  1666. waRawLine[p++] = statbuf.name[q++];
  1667. }
  1668. waRawLine[p++] = '"';
  1669. waRawLine[p++] = ',';
  1670. q = 0;
  1671. while( TRUE ) {
  1672. if( statbuf.info[q] == '\0' ) break;
  1673. waRawLine[p++] = statbuf.info[q++];
  1674. }
  1675. waRawLine[p++] = '\0';
  1676. commonPrint( NULL, "%s,%ld,%d" NEWLINE, waRawLine, statbuf.len, statbuf.count );
  1677. }
  1678. } else {
  1679. commonPrint( NULL, "*File Access Error\x7" NEWLINE );
  1680. }
  1681. }
  1682. #endif
  1683. }
  1684. void st_play()
  1685. {
  1686. BYTE ch;
  1687. ch = *executionPointer++;
  1688. while ( ch == ' ' || ch == '\t' ) {
  1689. ch = *executionPointer++;
  1690. }
  1691. if ( ch != 0x03 ) {
  1692. syntaxError();
  1693. return;
  1694. }
  1695. #ifdef WIN32
  1696. win32_play_mml( executionPointer );
  1697. #endif
  1698. #ifdef WW
  1699. if ( soundAvailable ) {
  1700. parse_mml( _heap, executionPointer, 0 );
  1701. bgm_play( _heap, PLAY_SINGLE );
  1702. }
  1703. #endif
  1704. executionPointer += strlen(executionPointer)+1;
  1705. }
  1706. void st_poke()
  1707. {
  1708. SHORT addr, data;
  1709. BYTE ch;
  1710. BYTE FAR * fulladdr;
  1711. addr = expr();
  1712. if( bForceToReturnSuper ) return;
  1713. while( TRUE ) {
  1714. ch = *executionPointer++;
  1715. if( ch != ' ' && ch != '\t' ) break;
  1716. }
  1717. if( ch != ',' ) {
  1718. syntaxError();
  1719. return;
  1720. }
  1721. data = expr();
  1722. if( bForceToReturnSuper ) return;
  1723. fulladdr = (BYTE FAR *)(((DWORD)defseg << 16) + (WORD)addr);
  1724. #ifdef WW
  1725. *fulladdr = data;
  1726. #else
  1727. printf("poke: %08x %02x\n", fulladdr, data );
  1728. #endif
  1729. }
  1730. void st_call()
  1731. {
  1732. SHORT addr;
  1733. BYTE FAR * fulladdr;
  1734. addr = expr();
  1735. if( bForceToReturnSuper ) return;
  1736. fulladdr = (BYTE FAR *)(((DWORD)defseg << 16) + (WORD)addr);
  1737. #ifdef WW
  1738. #ifdef VC15
  1739. // VC++1.5のときに使うコード
  1740. __asm {
  1741. push si
  1742. push di
  1743. push bp
  1744. mov ax,registers[(KEYWORD_AX-KEYWORD_AX)*2]
  1745. mov bx,registers[(KEYWORD_BX-KEYWORD_AX)*2]
  1746. mov cx,registers[(KEYWORD_CX-KEYWORD_AX)*2]
  1747. mov dx,registers[(KEYWORD_DX-KEYWORD_AX)*2]
  1748. mov si,registers[(KEYWORD_SI-KEYWORD_AX)*2]
  1749. mov di,registers[(KEYWORD_DI-KEYWORD_AX)*2]
  1750. mov es,registers[(KEYWORD_ES-KEYWORD_AX)*2]
  1751. push ds
  1752. mov ds,registers[(KEYWORD_DS-KEYWORD_AX)*2]
  1753. call far ptr ss:[fulladdr]
  1754. pop ds
  1755. mov registers[(KEYWORD_AX-KEYWORD_AX)*2],ax
  1756. mov registers[(KEYWORD_BX-KEYWORD_AX)*2],bx
  1757. mov registers[(KEYWORD_CX-KEYWORD_AX)*2],cx
  1758. mov registers[(KEYWORD_DX-KEYWORD_AX)*2],dx
  1759. mov registers[(KEYWORD_SI-KEYWORD_AX)*2],si
  1760. mov registers[(KEYWORD_DI-KEYWORD_AX)*2],di
  1761. mov registers[(KEYWORD_ES-KEYWORD_AX)*2],es
  1762. pop bp
  1763. pop di
  1764. pop si
  1765. }
  1766. #else
  1767. // VC++ 1.5以外の処理系のためのコードは作っていません。欲しい人、自作しましょう
  1768. #endif
  1769. #else
  1770. printf("call: %08x\n", fulladdr );
  1771. #endif
  1772. }
  1773. void st_int()
  1774. {
  1775. SHORT number;
  1776. number = expr();
  1777. if( bForceToReturnSuper ) return;
  1778. #ifdef WW
  1779. #ifdef VC15
  1780. // VC++1.5のときに使うコード
  1781. {
  1782. static BYTE specialIntCallCode[3] = { 0xcd, 0x00, 0xcb };
  1783. DWORD specialPtr;
  1784. specialIntCallCode[1] = (BYTE)number;
  1785. specialPtr = (((DWORD)getdseg() << 16) + (WORD)specialIntCallCode);
  1786. __asm {
  1787. push si
  1788. push di
  1789. push bp
  1790. mov ax,registers[(KEYWORD_AX-KEYWORD_AX)*2]
  1791. mov bx,registers[(KEYWORD_BX-KEYWORD_AX)*2]
  1792. mov cx,registers[(KEYWORD_CX-KEYWORD_AX)*2]
  1793. mov dx,registers[(KEYWORD_DX-KEYWORD_AX)*2]
  1794. mov si,registers[(KEYWORD_SI-KEYWORD_AX)*2]
  1795. mov di,registers[(KEYWORD_DI-KEYWORD_AX)*2]
  1796. mov es,registers[(KEYWORD_ES-KEYWORD_AX)*2]
  1797. push ds
  1798. mov ds,registers[(KEYWORD_DS-KEYWORD_AX)*2]
  1799. call far ptr ss:[specialPtr]
  1800. pop ds
  1801. mov registers[(KEYWORD_AX-KEYWORD_AX)*2],ax
  1802. mov registers[(KEYWORD_BX-KEYWORD_AX)*2],bx
  1803. mov registers[(KEYWORD_CX-KEYWORD_AX)*2],cx
  1804. mov registers[(KEYWORD_DX-KEYWORD_AX)*2],dx
  1805. mov registers[(KEYWORD_SI-KEYWORD_AX)*2],si
  1806. mov registers[(KEYWORD_DI-KEYWORD_AX)*2],di
  1807. mov registers[(KEYWORD_ES-KEYWORD_AX)*2],es
  1808. pop bp
  1809. pop di
  1810. pop si
  1811. }
  1812. }
  1813. #else
  1814. // VC++ 1.5以外の処理系のためのコードは作っていません。欲しい人、自作しましょう
  1815. #endif
  1816. #else
  1817. printf("int: %04x\n", number );
  1818. #endif
  1819. }
  1820. void st_tron()
  1821. {
  1822. traceFlag = TRUE;
  1823. }
  1824. void st_troff()
  1825. {
  1826. traceFlag = FALSE;
  1827. }
  1828. /* 行エディタ */
  1829. void editLine()
  1830. {
  1831. WORD wishLineNumber;
  1832. BYTE ch, * p, * target;
  1833. WORD lineNumber;
  1834. // プログラム領域に行を格納する場合は
  1835. // 先頭に2バイトの行番号と2バイトの行長さの情報が格納される
  1836. // 一方、中間言語翻訳の結果は先頭に0x01で始まる10進整数が行番号として入っている
  1837. // このギャップを転送時に解消しなければならない
  1838. // ここに来ているということは、waCookedLine[0]が0x01つまり10進整数である //
  1839. assert( waCookedLine[0] == 0x01 );
  1840. wishLineNumber = *((WORD*)&waCookedLine[1]);
  1841. /* 行番号 0 はだめ */
  1842. if ( wishLineNumber == 0 ) {
  1843. lineNumberZeroError();
  1844. return;
  1845. }
  1846. p = waCookedLine+3;
  1847. //target = getLineReferenceFromLineNumber( wishLineNumber );
  1848. target = getInsertionPointFromLineNumber( wishLineNumber );
  1849. lineNumber = *((WORD*)target);
  1850. while( TRUE ) {
  1851. ch = *p++;
  1852. if( ch != ' ' && ch != '\t' ) break;
  1853. }
  1854. if( ch == EOL ) {
  1855. BYTE * from;
  1856. /* removing the line */
  1857. if( lineNumber == 0 || lineNumber != wishLineNumber ) {
  1858. lineNumberNotFound( wishLineNumber );
  1859. return;
  1860. }
  1861. from = skipToNextLine(target);
  1862. MEMMOVE( target, from, (WORD)(dataTop-(from-wa)) );
  1863. dataTop -= from-target;
  1864. } else {
  1865. WORD len; // プログラム領域上に収めるときのサイズ
  1866. len = skipToEOL(p)-waCookedLine-1+2+1; //-1は0x01の分。+2は長さ情報。+1はEOL
  1867. if( lineNumber == 0 || lineNumber != wishLineNumber ) {
  1868. /* insert new line */
  1869. if( dataTop + len >= WORKAREA_SIZE ) {
  1870. outOfMemory();
  1871. return;
  1872. }
  1873. MEMMOVE( target+len, target, (WORD)(dataTop-(target-wa)) );
  1874. dataTop += len;
  1875. } else {
  1876. /* replace line */
  1877. WORD lost;
  1878. BYTE * nextline;
  1879. int delta;
  1880. nextline = skipToNextLine(target);
  1881. lost = nextline-target;
  1882. delta = len-lost;
  1883. if( dataTop + delta >= WORKAREA_SIZE ) {
  1884. outOfMemory();
  1885. return;
  1886. }
  1887. MEMMOVE( nextline+delta, nextline, (WORD)(dataTop-(nextline-wa)) );
  1888. dataTop += delta;
  1889. }
  1890. // まず行番号をコピーする
  1891. *((WORD*)target) = *((WORD*)&waCookedLine[1]);
  1892. // 行の長さを収める
  1893. *((WORD*)(target+2)) = len;
  1894. // 残りをコピーする
  1895. MEMMOVE( target+4, waCookedLine+3, (WORD)(len-4) );
  1896. }
  1897. }
  1898. /* 追加専門の行エディタ */
  1899. void appendLine()
  1900. {
  1901. BYTE * target;
  1902. WORD len; // プログラム領域上に収めるときのサイズ
  1903. len = skipToEOL(waCookedLine+3)-waCookedLine-1+2+1; //-1は0x01の分。+2は長さ情報。+1はEOL
  1904. if( dataTop + len >= WORKAREA_SIZE ) {
  1905. outOfMemory();
  1906. return;
  1907. }
  1908. target = &wa[dataTop-5]; // -5 is len of last-line-marker
  1909. // まず行番号をコピーする
  1910. *((WORD*)target) = *((WORD*)&waCookedLine[1]);
  1911. // 行の長さを収める
  1912. *((WORD*)(target+2)) = len;
  1913. // 残りをコピーする
  1914. MEMMOVE( target+4, waCookedLine+3, (WORD)(len-4) );
  1915. dataTop += len;
  1916. wa[dataTop-5] = 0;
  1917. wa[dataTop-4] = 0;
  1918. wa[dataTop-3] = 0;
  1919. wa[dataTop-2] = 0;
  1920. wa[dataTop-1] = EOL;
  1921. }
  1922. /* 中間言語に翻訳する */
  1923. BOOL convertInternalCode( BYTE * waCookedLine, const BYTE * waRawLine )
  1924. {
  1925. const BYTE * src = waRawLine;
  1926. BYTE * dst = waCookedLine;
  1927. while( TRUE ) {
  1928. if( *src == '\0' ) break;
  1929. if( *src == '\n' ) break;
  1930. if( *src == '\r' ) break;
  1931. if( *src == ' ' || *src == '\t' ) {
  1932. *dst++ = *src++;
  1933. } else if( *src < 0x20 ) {
  1934. syntaxError();
  1935. return FALSE;
  1936. } else if( *src >= '0' && *src <= '9' ) {
  1937. if( *src == '0' && *(src+1) == 'x' ) {
  1938. WORD acc;
  1939. /* 16進のとき */
  1940. *dst++ = 0x02;
  1941. acc = 0;
  1942. src += 2;
  1943. while( TRUE ) {
  1944. if( *src >= '0' && *src <= '9' ) {
  1945. acc *= 16;
  1946. acc += *src - '0';
  1947. } else if( *src >= 'a' && *src <= 'f' ) {
  1948. acc *= 16;
  1949. acc += *src - 'a' + 10;
  1950. } else if( *src >= 'A' && *src <= 'F' ) {
  1951. acc *= 16;
  1952. acc += *src - 'A' + 10;
  1953. } else {
  1954. break;
  1955. }
  1956. src++;
  1957. }
  1958. *((WORD*)dst) = acc;
  1959. dst += 2;
  1960. } else {
  1961. SHORT acc;
  1962. /* 10進のとき */
  1963. *dst++ = 0x01;
  1964. acc = *src-'0';
  1965. src++;
  1966. while( TRUE ) {
  1967. if( *src < '0' || *src > '9' ) break;
  1968. acc *= 10;
  1969. acc += *src - '0';
  1970. src++;
  1971. if( acc < 0 ) { /* overflow case */
  1972. syntaxError();
  1973. return FALSE;
  1974. }
  1975. }
  1976. *((SHORT*)dst) = acc;
  1977. dst += 2;
  1978. }
  1979. #if 0
  1980. /* 以下のコードは、2項演算子の-を負数と解釈することがあるので使えない */
  1981. } else if( *src == '-' && (*(src+1) >= '0' && *(src+1) <= '9' ) ) {
  1982. WORD acc;
  1983. /* 負数の10進のとき */
  1984. *dst++ = 0x01;
  1985. src++;
  1986. acc = *src-'0';
  1987. src++;
  1988. while( TRUE ) {
  1989. if( *src < '0' || *src > '9' ) break;
  1990. acc *= 10;
  1991. acc += *src - '0';
  1992. src++;
  1993. if( acc > 32768 ) { /* overflow case */
  1994. syntaxError();
  1995. return FALSE;
  1996. }
  1997. }
  1998. *((SHORT*)dst) = -((SHORT)acc);
  1999. dst += 2;
  2000. #endif
  2001. } else if( (*src >= 'a' && *src <= 'z') || (*src >= 'A' && *src <= 'Z') ) {
  2002. BYTE next = *(src+1);
  2003. if( (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z') ) {
  2004. WORD id;
  2005. KEYWORDITEM * p = keywordsIndex[mytolower(*src)-'a'];
  2006. if( p == NULL ) {
  2007. syntaxError();
  2008. return FALSE;
  2009. }
  2010. id = 0;
  2011. while( TRUE ) {
  2012. const BYTE * ps, * pd;
  2013. if( p->id == 0 ) {
  2014. syntaxError();
  2015. return FALSE;
  2016. }
  2017. ps = src;
  2018. pd = p->name;
  2019. while( TRUE ) {
  2020. if( *pd == '\0' ) {
  2021. id = p->id;
  2022. src = ps;
  2023. break;
  2024. }
  2025. if( mytolower(*ps) != mytolower(*pd) ) break;
  2026. ps++;
  2027. pd++;
  2028. }
  2029. if( id != 0 ) break;
  2030. p++;
  2031. }
  2032. *dst++ = (BYTE)id;
  2033. if( id == KEYWORD_REM ) {
  2034. /* コメント文の場合は行末まで何もかもそのままコピーする */
  2035. while( TRUE ) {
  2036. if( *src == '\0' ) break;
  2037. *dst++ = *src++;
  2038. }
  2039. }
  2040. } else {
  2041. *dst++ = *src++;
  2042. }
  2043. } else if( *src == '\'' ) {
  2044. *dst++ = *src++;
  2045. /* コメント文の場合は行末まで何もかもそのままコピーする */
  2046. while( TRUE ) {
  2047. if( *src == '\0' ) break;
  2048. *dst++ = *src++;
  2049. }
  2050. } else if( *src == '"' ) {
  2051. src++;
  2052. *dst++ = 0x03;
  2053. while( TRUE ) {
  2054. if( *src == '\0' ) {
  2055. syntaxError();
  2056. return FALSE;
  2057. }
  2058. if( *src == '"' ) break;
  2059. *dst++ = *src++;
  2060. }
  2061. *dst++ = '\0';
  2062. src++;
  2063. } else {
  2064. *dst++ = *src++;
  2065. }
  2066. }
  2067. *dst = EOL;
  2068. return TRUE;
  2069. }
  2070. /* ステートメント実行処理関数のリスト */
  2071. NEARPROC statements[KEYWORDS_STATEMENT_TO-KEYWORDS_STATEMENT_FROM+1] = {
  2072. st_if,
  2073. st_print,
  2074. st_locate,
  2075. st_cls,
  2076. st_goto,
  2077. st_gosub,
  2078. st_return,
  2079. st_for,
  2080. st_next,
  2081. st_end,
  2082. st_break,
  2083. st_rem,
  2084. st_new,
  2085. st_list,
  2086. st_run,
  2087. st_cont,
  2088. st_save,
  2089. st_load,
  2090. st_merge,
  2091. st_randomize,
  2092. st_exit,
  2093. st_debug,
  2094. st_waitvb,
  2095. st_files,
  2096. st_play,
  2097. st_poke,
  2098. st_call,
  2099. st_int,
  2100. st_tron,
  2101. st_troff
  2102. };
  2103. void interpreterMain()
  2104. {
  2105. WORD keyscan;
  2106. while( TRUE ) {
  2107. /* 行の開始 */
  2108. processLineHeader();
  2109. /* 最後に達してしまった? */
  2110. if( !bInteractive && currentLineNumber == 0 ) {
  2111. bForceToReturnSuper = TRUE;
  2112. requestNextAction = REQUEST_INTERACTIVE;
  2113. return;
  2114. }
  2115. while( TRUE ) {
  2116. BYTE ch;
  2117. if( !bInteractive ) {
  2118. resumePointer = executionPointer; /* contする場所を記憶する */
  2119. }
  2120. #ifdef WW
  2121. keyscan = key_press_check();
  2122. #else
  2123. keyscan = win32_scan();
  2124. #endif
  2125. if( keyscan & 0x02 ) {
  2126. st_break();
  2127. return;
  2128. }
  2129. ch = *executionPointer++;
  2130. if( ch == EOL ) break;
  2131. if( ch == ' ' || ch == '\t' || ch == ':' ) {
  2132. /* nop */
  2133. } else if( ch == '\'' ) { /* comment */
  2134. st_rem();
  2135. } else if( ch == '@' ) { /* is it l-value? */
  2136. SHORT * pvar;
  2137. pvar = getArrayReference();
  2138. if( pvar == NULL ) return;
  2139. st_assignment( pvar );
  2140. } else if( ch >= 'A' && ch <= 'Z' ) {
  2141. st_assignment( &globalVariables[ch-'A'] );
  2142. } else if( ch >= 'a' && ch <= 'z' ) {
  2143. st_assignment( &localVariables[ch-'a'] );
  2144. } else if( ch >= KEYWORD_AX && ch <= KEYWORD_ES ) {
  2145. st_assignment( &registers[ch-KEYWORD_AX] );
  2146. } else if( ch == KEYWORD_DEFSEG ) {
  2147. st_assignment( &defseg );
  2148. } else if( ch >= KEYWORDS_STATEMENT_FROM && ch <= KEYWORDS_STATEMENT_TO ) {
  2149. (*(statements[ch-KEYWORDS_STATEMENT_FROM]))();
  2150. } else if( ch == '?' ) {
  2151. st_debug();
  2152. } else {
  2153. syntaxError();
  2154. }
  2155. if( bForceToReturnSuper ) return;
  2156. }
  2157. if( bInteractive ) return;
  2158. }
  2159. }
  2160. void interactiveMain( FILE FAR * fp )
  2161. {
  2162. if( fp == NULL ) {
  2163. commonPrint(NULL,"OK" NEWLINE);
  2164. }
  2165. while( TRUE ) {
  2166. BOOL b;
  2167. WORD l;
  2168. if( fp == NULL ) {
  2169. consoleInput( waRawLine, LINE_SIZE );
  2170. } else {
  2171. char FAR * r;
  2172. r = fgets( waRawLine, LINE_SIZE, fp );
  2173. if( r == NULL ) break;
  2174. /* ファイル中に LF があると残ってしまうのを消す */
  2175. l = strlen(waRawLine)-1;
  2176. if ( waRawLine[l] == '\x0a' ){
  2177. waRawLine[l] = '\0';
  2178. }
  2179. }
  2180. #ifdef WW
  2181. if( fp == NULL ) {
  2182. commonPrint( NULL, NEWLINE );
  2183. }
  2184. #endif
  2185. /* 中間言語に翻訳する */
  2186. b = convertInternalCode( waCookedLine, waRawLine );
  2187. if( b == FALSE ) {
  2188. bForceToReturnSuper = FALSE;
  2189. continue;
  2190. }
  2191. /* 数値で開始されているか? */
  2192. if( waCookedLine[0] == 0x01 ) {
  2193. /* 行エディタを呼び出す */
  2194. if( appendMode ) {
  2195. appendLine();
  2196. } else {
  2197. editLine();
  2198. }
  2199. if( fp == NULL ) {
  2200. clearRuntimeInfo();
  2201. }
  2202. } else {
  2203. /* その行を実行する */
  2204. executionPointer = waCookedLine;
  2205. interpreterMain();
  2206. }
  2207. if( bForceToReturnSuper ) return;
  2208. }
  2209. }
  2210. /* プログラムの実行開始 */
  2211. void do_run( WORD runLineNumber )
  2212. {
  2213. BYTE * target;
  2214. if( runLineNumber == 0 ) {
  2215. target = &wa[codeTop];
  2216. } else {
  2217. target = getLineReferenceFromLineNumber( runLineNumber );
  2218. if( target == NULL ) {
  2219. lineNumberNotFound( runLineNumber );
  2220. return;
  2221. }
  2222. }
  2223. clearRuntimeInfo();
  2224. bInteractive = FALSE;
  2225. executionPointer = target;
  2226. }
  2227. void do_new()
  2228. {
  2229. clearRuntimeInfo();
  2230. bInteractive = TRUE;
  2231. traceFlag = FALSE;
  2232. codeTop = 0;
  2233. wa[0] = 0;
  2234. wa[1] = 0;
  2235. wa[2] = 0;
  2236. wa[3] = 0;
  2237. wa[4] = EOL;
  2238. dataTop = 5;
  2239. }
  2240. BOOL do_merge( const BYTE * filename )
  2241. {
  2242. FILE FAR * fp;
  2243. fp = fopen( filename, "r" );
  2244. if( fp == NULL ) {
  2245. loadError();
  2246. return FALSE;
  2247. }
  2248. interactiveMain( fp );
  2249. fclose( fp );
  2250. clearRuntimeInfo();
  2251. if( bForceToReturnSuper ) return FALSE;
  2252. return TRUE;
  2253. }
  2254. void superMain()
  2255. {
  2256. while( TRUE ) {
  2257. BOOL b;
  2258. bForceToReturnSuper = FALSE;
  2259. switch( requestNextAction ) {
  2260. case REQUEST_INTERACTIVE:
  2261. bInteractive = TRUE;
  2262. break;
  2263. case REQUEST_RUN_LINENUMBER:
  2264. do_run( runLineNumber );
  2265. break;
  2266. case REQUEST_RUN_FILE:
  2267. do_new();
  2268. appendMode=TRUE;
  2269. b = do_merge( waRawLine );
  2270. appendMode=FALSE;
  2271. if( b ) {
  2272. do_run( 0 );
  2273. }
  2274. break;
  2275. case REQUEST_LOAD_FILE:
  2276. do_new();
  2277. appendMode=TRUE;
  2278. do_merge( waRawLine );
  2279. appendMode=FALSE;
  2280. break;
  2281. case REQUEST_MERGE_FILE:
  2282. do_merge( waRawLine );
  2283. break;
  2284. case REQUEST_NEW:
  2285. do_new();
  2286. break;
  2287. case REQUEST_EXIT_SYSTEM:
  2288. return;
  2289. }
  2290. requestNextAction = REQUEST_NO_ACTION;
  2291. if( bInteractive ) {
  2292. if( runtimeOnly ) return; /* ランタイムモードのときは絶対にインタラクティブモードに行かない */
  2293. interactiveMain( NULL );
  2294. } else {
  2295. interpreterMain();
  2296. }
  2297. bForceToReturnSuper = FALSE;
  2298. }
  2299. }
  2300. #ifdef WW
  2301. BOOL entranceUI()
  2302. {
  2303. #define MAX_ENT 15
  2304. int i;
  2305. struct stat statbuf[MAX_ENT];
  2306. int nent;
  2307. int c, select;
  2308. ptextCLS();
  2309. ptextString( "ワンべぇ V" );
  2310. ptextString( myVersion );
  2311. ptextNewline();
  2312. ptextString( "↑↓Aでファイル選択 Y2で開発環境 STARTで中止" );
  2313. c = 0;
  2314. nent = nument(NULL);
  2315. for (i = 0; i < nent; i++) {
  2316. int result;
  2317. if( c >= MAX_ENT ) break;
  2318. result = getent(NULL, i, &statbuf[c]);
  2319. if (result == E_FS_SUCCESS) {
  2320. if (statbuf[c].count != -1) {
  2321. char FAR * p;
  2322. int l;
  2323. p = statbuf[c].name;
  2324. l = strlen(p);
  2325. if( l >= 3 ) {
  2326. if( p[l-3] == '.' && p[l-2] == 'w' && p[l-1] == 'b' ) {
  2327. ptextLocate(1,c+2);
  2328. ptextString( statbuf[c].info );
  2329. c++;
  2330. }
  2331. }
  2332. }
  2333. }
  2334. }
  2335. /* 選択の開始 */
  2336. select = 0;
  2337. while( TRUE ) {
  2338. int key;
  2339. for( i=0; i<c; i++ ) {
  2340. ptextLocate(0,i+2);
  2341. ptextString( " " );
  2342. }
  2343. if( c > 0 ) {
  2344. ptextLocate(0,select+2);
  2345. ptextString( "→" );
  2346. }
  2347. key = key_wait();
  2348. /* START button */
  2349. if( key & 0x02 ) return FALSE; /* 中止 */
  2350. /* B button */
  2351. if( key & 0x08 ) return FALSE; /* 中止 */
  2352. if( c > 0 ) {
  2353. /* A button */
  2354. if( key & 0x04 ) {
  2355. strcpy( waRawLine, statbuf[select].name );
  2356. requestNextAction = REQUEST_RUN_FILE;
  2357. runtimeOnly = TRUE;
  2358. return TRUE;
  2359. }
  2360. /* X1 or Y1 */
  2361. if( (key & 0x10) != 0 || (key & 0x100) != 0 ) {
  2362. select = select-1;
  2363. if( select < 0 ) {
  2364. select = c-1;
  2365. }
  2366. }
  2367. /* X3 or Y3 */
  2368. if( (key & 0x40) != 0 || (key & 0x400) != 0 ) {
  2369. select = select+1;
  2370. if( select >= c ) {
  2371. select = 0;
  2372. }
  2373. }
  2374. }
  2375. /* Y2 button */
  2376. if( (key & 0x200) != 0 ) {
  2377. return TRUE;
  2378. }
  2379. }
  2380. }
  2381. #endif
  2382. int main( int argc, char *argv[] )
  2383. {
  2384. #ifdef WW
  2385. BOOL b;
  2386. #endif
  2387. runtimeOnly = FALSE;
  2388. requestNextAction = REQUEST_NO_ACTION;
  2389. #ifdef WIN32
  2390. createText();
  2391. #endif
  2392. #ifdef WW
  2393. #ifdef CURRENT_DIR_IS_RAM0
  2394. // シンボルCURRENT_DIR_IS_RAM0を定義してビルドすると
  2395. // カレントディレクトリは/ram0で走る
  2396. // 定義しなければ/rom0で走る
  2397. chdir("/ram0");
  2398. #endif
  2399. text_screen_init();
  2400. b = entranceUI();
  2401. if( b == FALSE ) return 0;
  2402. if( !runtimeOnly ) {
  2403. comm_set_baudrate(1);
  2404. comm_open();
  2405. }
  2406. /* PLAY statement support */
  2407. soundAvailable = FALSE;
  2408. if (open_sound_il(&soundIL) == E_FS_SUCCESS) {
  2409. soundAvailable = TRUE;
  2410. // sounddrv_init(); いらないならわざわざ呼ばない。
  2411. sound_open();
  2412. }
  2413. #endif
  2414. ptextCLS();
  2415. if( requestNextAction == REQUEST_NO_ACTION ) {
  2416. do_new();
  2417. }
  2418. if( !runtimeOnly ) {
  2419. commonPrint(NULL,"ワンべぇ WonderWitch Tiny BASIC Environment Ver %s" NEWLINE,myVersion);
  2420. commonPrint(NULL,"Authors: Pie Dey Co.,Ltd., Hirotaka JOE Ohkubo" NEWLINE);
  2421. commonPrint(NULL,"This program is distributed under GNU General Public License" NEWLINE);
  2422. }
  2423. superMain();
  2424. #ifdef WIN32
  2425. deleteText();
  2426. #endif
  2427. #ifdef WW
  2428. /* PLAY statement support */
  2429. if (soundAvailable) {
  2430. sound_close();
  2431. sounddrv_release();
  2432. }
  2433. if( !runtimeOnly ) {
  2434. comm_close();
  2435. }
  2436. #endif
  2437. return 0;
  2438. }
  2439. /* end of wonbe.c */