wonbe.c 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974
  1. /* wonbe: WonderWitch Basic Environment */
  2. /* First Created: Nov.3,2000 by Nashiko */
  3. /* Copyright 2000 (c) by Pie Dey Co.,Ltd. */
  4. /* This source code is for both VC++6.0 and Turbo C 2.0 */
  5. #include <stdio.h>
  6. #include <string.h>
  7. #include <stdlib.h>
  8. #ifdef WW
  9. #include <sys/comm.h>
  10. #include <sys/process.h>
  11. #include <sys/fcntl.h>
  12. #include <sys/bios.h>
  13. #endif
  14. #include "keywords.h"
  15. #ifdef WIN32
  16. #include "win32text.h"
  17. #endif
  18. char myVersion[] = "0.01";
  19. #ifdef WW
  20. #define MEMMOVE mymemmove
  21. #define FAR far
  22. #else
  23. #define MEMMOVE mymemmove
  24. #define FAR
  25. #endif
  26. #ifdef WIN32
  27. typedef unsigned char BYTE;
  28. #endif
  29. typedef unsigned short WORD;
  30. typedef signed short SHORT;
  31. #define EOL (0x0d)
  32. #ifdef WIN32
  33. typedef int BOOL;
  34. #endif
  35. #define FALSE 0
  36. #define TRUE 1
  37. typedef void (*NEARPROC)();
  38. #define WORKAREA_SIZE ((WORD)49152)
  39. #define LINE_SIZE (256)
  40. /* 実行のみのモードで動いているとき (シリアル経由で端末が居ないとき) */
  41. BOOL runtimeOnly;
  42. #ifdef WW
  43. void fatalExit( const char * msg )
  44. {
  45. text_screen_init();
  46. text_put_string( 0, 0, (char*)msg );
  47. text_put_string( 0, 3, "PUSH ANY BUTTON" );
  48. key_wait();
  49. }
  50. #endif
  51. BOOL commonPrint( FILE FAR * fp, const char * msg,... )
  52. {
  53. #ifdef WW
  54. static
  55. #endif
  56. char buf[256];
  57. vsprintf(buf, msg, (va_list)(&msg+1) );
  58. if( fp != NULL ) {
  59. int r;
  60. r = fprintf( fp, buf );
  61. return r >= 0;
  62. } else {
  63. #ifdef WW
  64. if( runtimeOnly ) {
  65. fatalExit( buf );
  66. } else {
  67. comm_send_string( buf );
  68. }
  69. #else
  70. printf( buf );
  71. #endif
  72. }
  73. return TRUE;
  74. }
  75. void consoleInput( BYTE * buf, WORD len )
  76. {
  77. #ifdef WW
  78. WORD cursor;
  79. if( runtimeOnly ) {
  80. fatalExit("consoleInput not allowed in runtime mode");
  81. } else {
  82. cursor = 0;
  83. while( TRUE ) {
  84. int ch;
  85. ch = comm_receive_char();
  86. if( ch == 0x0d ) { /* CR */
  87. buf[cursor] = '\0';
  88. return;
  89. }
  90. if( ch == 0x09 ) { /* TAB */
  91. goto inputAsChar;
  92. }
  93. if( ch == 0x08 ) { /* BS */
  94. if( cursor > 0 ) {
  95. cursor--;
  96. comm_send_char( ch );
  97. continue;
  98. }
  99. }
  100. if( ch >= 0 && ch < ' ' ) {
  101. /* ignore it */
  102. continue;
  103. }
  104. if( ch >= ' ' && ch <= 0xfc ) {
  105. inputAsChar:
  106. if( cursor < len-1 ) {
  107. buf[cursor] = ch;
  108. cursor++;
  109. comm_send_char( ch );
  110. }
  111. }
  112. }
  113. }
  114. #else
  115. gets(buf);
  116. #endif
  117. }
  118. typedef struct {
  119. WORD id;
  120. const BYTE * name;
  121. } KEYWORDITEM;
  122. KEYWORDITEM keywords[] = {
  123. { KEYWORD_IF,"if" },
  124. { KEYWORD_PRINT,"print" },
  125. { KEYWORD_LOCATE,"locate" },
  126. { KEYWORD_CLS,"cls" },
  127. { KEYWORD_GOTO,"goto" },
  128. { KEYWORD_GOSUB,"gosub" },
  129. { KEYWORD_RETURN,"return" },
  130. { KEYWORD_FOR,"for" },
  131. { KEYWORD_NEXT,"next" },
  132. { KEYWORD_END,"end" },
  133. { KEYWORD_BREAK,"break" },
  134. { KEYWORD_REM,"rem" },
  135. { KEYWORD_NEW,"new" },
  136. { KEYWORD_LIST,"list" },
  137. { KEYWORD_RUN,"run" },
  138. { KEYWORD_CONT,"cont" },
  139. { KEYWORD_SAVE,"save" },
  140. { KEYWORD_LOAD,"load" },
  141. { KEYWORD_MERGE,"merge" },
  142. { KEYWORD_RANDOMIZE,"randomize" },
  143. { KEYWORD_EXIT,"exit" },
  144. { KEYWORD_DEBUG,"debug" },
  145. { KEYWORD_WAITVB,"waitvb" },
  146. { KEYWORD_FILES,"files" },
  147. { KEYWORD_AND,"and" },
  148. { KEYWORD_OR,"or" },
  149. { KEYWORD_XOR,"xor" },
  150. { KEYWORD_NOT,"not" },
  151. { KEYWORD_SCAN,"scan" },
  152. { KEYWORD_WAIT,"wait" },
  153. { KEYWORD_RND,"rnd" },
  154. { KEYWORD_ABS,"abs" },
  155. { KEYWORD_TICK,"tick" },
  156. { KEYWORD_SCAN_A,"scan_a" },
  157. { KEYWORD_SCAN_B,"scan_b" },
  158. { KEYWORD_SCAN_X1,"scan_x1" },
  159. { KEYWORD_SCAN_X2,"scan_x2" },
  160. { KEYWORD_SCAN_X3,"scan_x3" },
  161. { KEYWORD_SCAN_X4,"scan_x4" },
  162. { KEYWORD_SCAN_Y1,"scan_y1" },
  163. { KEYWORD_SCAN_Y2,"scan_y2" },
  164. { KEYWORD_SCAN_Y3,"scan_y3" },
  165. { KEYWORD_SCAN_Y4,"scan_y4" },
  166. { KEYWORD_THEN,"then" },
  167. { KEYWORD_CHR,"chr" },
  168. { KEYWORD_TO,"to" },
  169. { KEYWORD_STEP,"step" },
  170. { 0,NULL }
  171. };
  172. /* インタラクティブモード時の1行バッファ */
  173. BYTE waRawLine[LINE_SIZE];
  174. BYTE waCoockedLine[LINE_SIZE];
  175. /* コードとデータを収める領域 */
  176. WORD codeTop;
  177. WORD dataTop;
  178. /*WORD savedPointer; /* breakしたときの実行中位置 */
  179. BYTE wa[WORKAREA_SIZE];
  180. /* グローバル変数領域 */
  181. #define NUMBER_OF_SIMPLE_VARIABLES (26)
  182. SHORT globalVariables[NUMBER_OF_SIMPLE_VARIABLES];
  183. SHORT topLevelVariables[NUMBER_OF_SIMPLE_VARIABLES];
  184. SHORT * localVariables; /* あるスコープで有効なローカル変数領域を持つ */
  185. /* 現在実行中の位置に関する情報 */
  186. /* waかwaCookedLineのどちらかの中を示すかNULL */
  187. BYTE * executionPointer;
  188. /* contコマンドで実行を再開するポイント */
  189. BYTE * resumePointer;
  190. /* 現在処理中の行番号 (0ならダイレクトモード) */
  191. WORD currentLineNumber;
  192. /* gosubとforのためのスタック */
  193. #define STACK_TYPE_GOSUB 1
  194. #define STACK_TYPE_FOR 2
  195. typedef struct {
  196. WORD type; /* 1==GOSUB, 2==FOR */
  197. /* for GOSUB and FOR */
  198. BYTE * returnPointer;
  199. /* for GOSUB */
  200. SHORT * lastLocalVariables;
  201. SHORT simpleVariables[NUMBER_OF_SIMPLE_VARIABLES];
  202. /* for FOR */
  203. SHORT * pvar; /* counter variable */
  204. SHORT limit; /* limit value */
  205. SHORT step; /* step value */
  206. } STACK;
  207. #define STACK_MAX 8
  208. STACK stacks[STACK_MAX];
  209. int stackPointer;
  210. /* インタラクティブモードかインタプリタモードか */
  211. BOOL bInteractive;
  212. /* インタプリタ脱出後の振る舞いのリクエスト */
  213. BOOL bForceToReturnSuper;
  214. int requestNextAction; /* 以下のいずれか */
  215. /* 何もせず現状のまま */
  216. #define REQUEST_NO_ACTION 0
  217. /* 対話モードへ行け */
  218. #define REQUEST_INTERACTIVE 1
  219. /* runLineNumberから実行を開始せよ */
  220. #define REQUEST_RUN_LINENUMBER 2
  221. /* waRawLineに入っている文字列をファイル名としてそれを読み込んで実行せよ */
  222. #define REQUEST_RUN_FILE 3
  223. /* newせよ */
  224. #define REQUEST_NEW 4
  225. /* waRawLineに入っている文字列をファイル名としてそれをロード */
  226. #define REQUEST_LOAD_FILE 5
  227. /* WONBEを終了してOSに戻れ */
  228. #define REQUEST_EXIT_SYSTEM 6
  229. /* waRawLineに入っている文字列をファイル名としてそれをマージ */
  230. #define REQUEST_MERGE_FILE 7
  231. /* REQUEST_RUN_LINENUMBERで実行開始をリクエストする行番号 */
  232. WORD runLineNumber;
  233. /* エラー発生 */
  234. void syntaxError()
  235. {
  236. commonPrint(NULL, "Syntax Error in %d\x07\n", currentLineNumber );
  237. bForceToReturnSuper = TRUE;
  238. requestNextAction = REQUEST_INTERACTIVE;
  239. }
  240. void divideByZero()
  241. {
  242. commonPrint(NULL, "Divide by 0 in %d\x07\n", currentLineNumber );
  243. bForceToReturnSuper = TRUE;
  244. requestNextAction = REQUEST_INTERACTIVE;
  245. }
  246. void outOfArraySubscription()
  247. {
  248. commonPrint(NULL, "Out of Array Subscription in %d\x07\n", currentLineNumber );
  249. bForceToReturnSuper = TRUE;
  250. requestNextAction = REQUEST_INTERACTIVE;
  251. }
  252. void lineNumberNotFound( WORD lineNumber )
  253. {
  254. commonPrint(NULL, "Line Number %d not Found in %d\x07\n", lineNumber, currentLineNumber );
  255. bForceToReturnSuper = TRUE;
  256. requestNextAction = REQUEST_INTERACTIVE;
  257. }
  258. void stackOverflow()
  259. {
  260. commonPrint(NULL, "Stack Overflow in %d\x07\n", currentLineNumber );
  261. bForceToReturnSuper = TRUE;
  262. requestNextAction = REQUEST_INTERACTIVE;
  263. }
  264. void stackUnderflow()
  265. {
  266. commonPrint(NULL, "Stack Underflow in %d\x07\n", currentLineNumber );
  267. bForceToReturnSuper = TRUE;
  268. requestNextAction = REQUEST_INTERACTIVE;
  269. }
  270. void nextWithoutFor()
  271. {
  272. commonPrint(NULL, "Next without For in %d\x07\n", currentLineNumber );
  273. bForceToReturnSuper = TRUE;
  274. requestNextAction = REQUEST_INTERACTIVE;
  275. }
  276. void outOfMemory()
  277. {
  278. commonPrint(NULL, "Out of memory in %d\x07\n", currentLineNumber );
  279. bForceToReturnSuper = TRUE;
  280. requestNextAction = REQUEST_INTERACTIVE;
  281. }
  282. void loadError()
  283. {
  284. commonPrint(NULL, "File Not Found or Load Error in %d\x07\n", currentLineNumber );
  285. bForceToReturnSuper = TRUE;
  286. requestNextAction = REQUEST_INTERACTIVE;
  287. }
  288. void cantContinue()
  289. {
  290. commonPrint(NULL, "Can't Continue in %d\x07\n", currentLineNumber );
  291. bForceToReturnSuper = TRUE;
  292. requestNextAction = REQUEST_INTERACTIVE;
  293. }
  294. void saveError()
  295. {
  296. commonPrint(NULL, "Save Erroor in %d\x07\n", currentLineNumber );
  297. bForceToReturnSuper = TRUE;
  298. requestNextAction = REQUEST_INTERACTIVE;
  299. }
  300. void paramError()
  301. {
  302. commonPrint(NULL, "Parameter Erroor in %d\x07\n", currentLineNumber );
  303. bForceToReturnSuper = TRUE;
  304. requestNextAction = REQUEST_INTERACTIVE;
  305. }
  306. /* ユーティリティ関数達 */
  307. void mymemmove( BYTE * dst, const BYTE * src, WORD len )
  308. {
  309. WORD i;
  310. if( dst < src ) {
  311. for( i=0; i<len; i++ ) {
  312. *dst++ = *src++;
  313. }
  314. } else {
  315. dst += len;
  316. src += len;
  317. for( i=0; i<len; i++ ) {
  318. *--dst = *--src;
  319. }
  320. }
  321. }
  322. BYTE * skipToEOL( BYTE * p )
  323. {
  324. while( TRUE ) {
  325. if( *p == EOL ) return p;
  326. switch( *p++ ) {
  327. case 0x01: /* 次にあるのは10進2バイト整数 */
  328. case 0x02: /* 次にあるのは16進2バイト整数 */
  329. p += 2;
  330. break;
  331. case 0x03: /* 次にあるのは可変長文字列 0x00でターミネート */
  332. {
  333. while( TRUE ) {
  334. if( *p++ == '\0' ) break;
  335. }
  336. }
  337. break;
  338. }
  339. }
  340. }
  341. BYTE mytolower( BYTE ch )
  342. {
  343. if( ch >= 'A' && ch <= 'Z' ) {
  344. return ch - 'A' + 'a';
  345. }
  346. return ch;
  347. }
  348. /* シフトJISの1バイト目かどうか判断。マクロなので副作用に注意 */
  349. #define IsDBCSLeadByte(ch) ((ch >= 0x81 && ch <= 0x9f) || (ch >= 0xe0 && ch <= 0xfc))
  350. /* 実行時情報のクリア (contできなくなる) */
  351. void clearRuntimeInfo()
  352. {
  353. memset( globalVariables, 0, sizeof(globalVariables) );
  354. memset( topLevelVariables, 0, sizeof(topLevelVariables) );
  355. memset( stacks, 0, sizeof(globalVariables) );
  356. executionPointer = NULL;
  357. resumePointer = NULL;
  358. currentLineNumber = 0;
  359. localVariables = topLevelVariables;
  360. stackPointer = 0;
  361. srand(0);
  362. }
  363. /* 行頭の行番号の、実行時の定型処理 */
  364. void processLineHeader()
  365. {
  366. if( !bInteractive ) {
  367. currentLineNumber = *((WORD *)executionPointer);
  368. executionPointer += 2;
  369. } else {
  370. currentLineNumber = 0;
  371. }
  372. }
  373. /* 行番号処理 */
  374. BYTE * getLineReferenceFromLineNumber( WORD lineNumber )
  375. {
  376. BYTE * p;
  377. WORD t;
  378. p = wa;
  379. while( TRUE ) {
  380. t = *((WORD *)p);
  381. if( t == 0 ) {
  382. return NULL;
  383. }
  384. if( lineNumber == t ) {
  385. return p;
  386. }
  387. p += 2;
  388. p = skipToEOL( p );
  389. p++;
  390. }
  391. }
  392. BYTE * getInsertionPointFromLineNumber( WORD lineNumber )
  393. {
  394. BYTE * p;
  395. WORD t;
  396. p = wa;
  397. while( TRUE ) {
  398. t = *((WORD *)p);
  399. if( t == 0 ) {
  400. return p;
  401. }
  402. if( lineNumber <= t ) {
  403. return p;
  404. }
  405. p += 2;
  406. p = skipToEOL( p );
  407. p++;
  408. }
  409. }
  410. /* 配列管理 */
  411. int availableArrayItems()
  412. {
  413. return (WORKAREA_SIZE-dataTop) >> 1;
  414. }
  415. SHORT * derefArrayItem( int index )
  416. {
  417. if( index < 0 || index >= availableArrayItems() ) {
  418. outOfArraySubscription();
  419. return NULL; /* そのインデックスは使えません */
  420. }
  421. return (SHORT*)(&wa[dataTop+index*2]);
  422. }
  423. /* 物理テキストの管理 */
  424. #define SCREEN_SIZE_X (224/8)
  425. #define SCREEN_SIZE_Y (144/8)
  426. WORD screen[SCREEN_SIZE_X][SCREEN_SIZE_Y];
  427. SHORT xCursor, yCursor;
  428. #define TABSTOP 8
  429. void ptextScrollUp()
  430. {
  431. int x, y;
  432. for( y=0; y<SCREEN_SIZE_Y-1; y++ ) {
  433. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  434. screen[x][y] = screen[x][y+1];
  435. }
  436. }
  437. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  438. screen[x][SCREEN_SIZE_Y-1] = ' ';
  439. }
  440. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  441. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  442. #ifdef WIN32
  443. drawChar( x, y, screen[x][y] );
  444. #endif
  445. #ifdef WW
  446. text_put_char( x, y, screen[x][y] );
  447. #endif
  448. }
  449. }
  450. }
  451. void ptextNewline()
  452. {
  453. xCursor = 0;
  454. yCursor++;
  455. if( yCursor >= SCREEN_SIZE_Y ) {
  456. ptextScrollUp();
  457. yCursor = SCREEN_SIZE_Y-1;
  458. }
  459. }
  460. void ptextTab()
  461. {
  462. if( xCursor+TABSTOP >= SCREEN_SIZE_X ) {
  463. ptextNewline();
  464. return;
  465. }
  466. xCursor = (xCursor+TABSTOP) / TABSTOP * TABSTOP;
  467. }
  468. void ptextString( const BYTE * msg )
  469. {
  470. while( TRUE ) {
  471. WORD ch;
  472. if( *msg == '\0' ) break;
  473. if( IsDBCSLeadByte(*msg) ) {
  474. ch = (msg[0] << 8) + msg[1];
  475. msg+=2;
  476. } else {
  477. ch = msg[0];
  478. msg++;
  479. }
  480. screen[xCursor][yCursor] = ch;
  481. #ifdef WIN32
  482. drawChar( xCursor, yCursor, ch );
  483. #endif
  484. #ifdef WW
  485. text_put_char( xCursor, yCursor, ch );
  486. #endif
  487. xCursor++;
  488. if( xCursor >= SCREEN_SIZE_X ) {
  489. xCursor = 0;
  490. yCursor++;
  491. if( yCursor >= SCREEN_SIZE_Y ) {
  492. ptextScrollUp();
  493. yCursor = SCREEN_SIZE_Y-1;
  494. }
  495. }
  496. }
  497. }
  498. void ptextLocate( int x, int y )
  499. {
  500. if( x < 0 ) x = 0;
  501. if( x >= SCREEN_SIZE_X ) x = SCREEN_SIZE_X-1;
  502. if( y < 0 ) y = 0;
  503. if( y >= SCREEN_SIZE_Y ) y = SCREEN_SIZE_Y-1;
  504. xCursor = x;
  505. yCursor = y;
  506. }
  507. void ptextCLS()
  508. {
  509. int x,y;
  510. xCursor = 0;
  511. yCursor = 0;
  512. #ifdef WIN32
  513. clearText();
  514. #endif
  515. #ifdef WW
  516. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  517. text_fill_char(0, y, SCREEN_SIZE_X, ' ' );
  518. }
  519. #endif
  520. for( y=0; y<SCREEN_SIZE_Y; y++ ) {
  521. for( x=0; x<SCREEN_SIZE_X; x++ ) {
  522. screen[x][y] = ' ';
  523. }
  524. }
  525. }
  526. /* 中間コードからソーステキストに戻しながら出力(listとsaveで使う) */
  527. BOOL sourceDump( FILE FAR * fp, WORD from, WORD to )
  528. {
  529. BYTE * p;
  530. BOOL b;
  531. p = getInsertionPointFromLineNumber( from );
  532. while( TRUE ) {
  533. WORD lineNumber;
  534. lineNumber = *((WORD*)p);
  535. if( lineNumber == 0 ) break;
  536. if( lineNumber > to ) break;
  537. p += 2;
  538. b = commonPrint(fp,"%d",lineNumber);
  539. if( b == FALSE ) return FALSE;
  540. while( TRUE ) {
  541. if( *p == EOL ) {
  542. p++;
  543. break;
  544. }
  545. if( *p == 0x01 ) {
  546. WORD n;
  547. p++;
  548. n = *((WORD*)p);
  549. p += 2;
  550. b = commonPrint(fp,"%d",n);
  551. if( b == FALSE ) return FALSE;
  552. } else if( *p == 0x02 ) {
  553. WORD n;
  554. p++;
  555. n = *((WORD*)p);
  556. p += 2;
  557. b = commonPrint(fp,"0x%x",n);
  558. if( b == FALSE ) return FALSE;
  559. } else if( *p == 0x03 ) {
  560. p++;
  561. b = commonPrint(fp,"\"%s\"",p);
  562. if( b == FALSE ) return FALSE;
  563. p += strlen(p)+1;
  564. } else if( *p == '\'' ) { /* コメントのあとはそのまま行末まで転送 */
  565. while( TRUE ) {
  566. if( *p == EOL ) break;
  567. b = commonPrint(fp,"%c",*p);
  568. if( b == FALSE ) return FALSE;
  569. p++;
  570. }
  571. } else if( *p >= 0x80 ) {
  572. KEYWORDITEM * k = keywords;
  573. while( TRUE ) {
  574. if( k->id == 0 ) {
  575. b = commonPrint(fp,"[?%x?]", *p );
  576. if( b == FALSE ) return FALSE;
  577. p++;
  578. break;
  579. }
  580. if( k->id == *p ) {
  581. b = commonPrint(fp, k->name );
  582. if( b == FALSE ) return FALSE;
  583. p++;
  584. if( k->id == KEYWORD_REM ) { /* コメントのあとはそのまま行末まで転送 */
  585. while( TRUE ) {
  586. if( *p == EOL ) break;
  587. b = commonPrint(fp,"%c",*p);
  588. if( b == FALSE ) return FALSE;
  589. p++;
  590. }
  591. }
  592. break;
  593. }
  594. k++;
  595. }
  596. } else {
  597. b = commonPrint(fp,"%c",*p);
  598. if( b == FALSE ) return FALSE;
  599. p++;
  600. }
  601. }
  602. b = commonPrint(fp,"\n");
  603. if( b == FALSE ) return FALSE;
  604. }
  605. return TRUE;
  606. }
  607. /* 式計算機能 */
  608. SHORT expr(); /* forward decl */
  609. SHORT * getArrayReference()
  610. {
  611. BYTE ch;
  612. int index;
  613. SHORT * pvar;
  614. while( TRUE ) {
  615. ch = *executionPointer++;
  616. if( ch != ' ' && ch != '\t' ) break;
  617. }
  618. if( ch != '(' && ch != '[' ) {
  619. syntaxError();
  620. return NULL;
  621. }
  622. index = expr();
  623. if( bForceToReturnSuper ) return NULL;
  624. pvar = derefArrayItem( index );
  625. if( pvar == NULL ) return NULL;
  626. while( TRUE ) {
  627. ch = *executionPointer++;
  628. if( ch != ' ' && ch != '\t' ) break;
  629. }
  630. if( ch != ')' && ch != ']' ) {
  631. syntaxError();
  632. return NULL;
  633. }
  634. return pvar;
  635. }
  636. SHORT calcValue()
  637. {
  638. BYTE ch;
  639. while( TRUE ) {
  640. ch = *executionPointer++;
  641. if( ch != ' ' && ch != '\t' ) break;
  642. }
  643. if( ch >= 'A' && ch <= 'Z' ) {
  644. return globalVariables[ch-'A'];
  645. }
  646. if( ch >= 'a' && ch <= 'z' ) {
  647. return localVariables[ch-'a'];
  648. }
  649. if( ch == '@' ) {
  650. SHORT * pvar;
  651. pvar = getArrayReference();
  652. if( pvar == NULL ) return -1;
  653. return *pvar;
  654. }
  655. switch( ch ) {
  656. case 0x01: /* 次にあるのは10進2バイト整数 */
  657. case 0x02: /* 次にあるのは16進2バイト整数 */
  658. {
  659. SHORT t;
  660. t = *((SHORT *)executionPointer);
  661. executionPointer += 2;
  662. return t;
  663. }
  664. case '(':
  665. {
  666. SHORT t;
  667. t = expr();
  668. while( TRUE ) {
  669. ch = *executionPointer++;
  670. if( ch != ' ' && ch != '\t' ) break;
  671. }
  672. if( ch != ')' ) {
  673. syntaxError();
  674. return -1;
  675. }
  676. return t;
  677. }
  678. case '-':
  679. return -calcValue();
  680. case KEYWORD_NOT:
  681. return ~calcValue();
  682. case KEYWORD_SCAN:
  683. #ifdef WW
  684. return key_press_check();
  685. #else
  686. return win32_scan();
  687. #endif
  688. case KEYWORD_WAIT:
  689. #ifdef WW
  690. return key_wait();
  691. #else
  692. return win32_wait();
  693. #endif
  694. case KEYWORD_RND:
  695. {
  696. SHORT t;
  697. t = calcValue();
  698. return rand() % t;
  699. }
  700. case KEYWORD_ABS:
  701. {
  702. SHORT t;
  703. t = calcValue();
  704. if( t < 0 ) return -t;
  705. return t;
  706. }
  707. case KEYWORD_TICK:
  708. #ifdef WW
  709. return sys_get_tick_count();
  710. #else
  711. return win32_get_tick_count();
  712. #endif
  713. case KEYWORD_SCAN_A:
  714. return 4;
  715. case KEYWORD_SCAN_B:
  716. return 8;
  717. case KEYWORD_SCAN_X1:
  718. return 16;
  719. case KEYWORD_SCAN_X2:
  720. return 32;
  721. case KEYWORD_SCAN_X3:
  722. return 64;
  723. case KEYWORD_SCAN_X4:
  724. return 128;
  725. case KEYWORD_SCAN_Y1:
  726. return 256;
  727. case KEYWORD_SCAN_Y2:
  728. return 512;
  729. case KEYWORD_SCAN_Y3:
  730. return 1024;
  731. case KEYWORD_SCAN_Y4:
  732. return 2048;
  733. }
  734. syntaxError();
  735. return -1;
  736. }
  737. SHORT expr()
  738. {
  739. SHORT acc;
  740. acc = calcValue();
  741. if( bForceToReturnSuper ) return -1;
  742. while( TRUE ) {
  743. BYTE ch;
  744. while( TRUE ) {
  745. ch = *executionPointer++;
  746. if( ch != ' ' && ch != '\t' ) break;
  747. }
  748. switch( ch ) {
  749. case '+':
  750. acc = acc + calcValue();
  751. break;
  752. case '-':
  753. acc = acc - calcValue();
  754. break;
  755. case '*':
  756. acc = acc * calcValue();
  757. break;
  758. case '/':
  759. {
  760. SHORT t;
  761. t = calcValue();
  762. if( t == 0 ) {
  763. divideByZero();
  764. } else {
  765. acc = acc / t;
  766. }
  767. }
  768. break;
  769. case KEYWORD_AND:
  770. acc = acc & calcValue();
  771. break;
  772. case KEYWORD_OR:
  773. acc = acc | calcValue();
  774. break;
  775. case KEYWORD_XOR:
  776. acc = acc ^ calcValue();
  777. break;
  778. case '>':
  779. {
  780. BYTE ch2;
  781. while( TRUE ) {
  782. ch2 = *executionPointer++;
  783. if( ch2 != ' ' && ch2 != '\t' ) break;
  784. }
  785. if( ch2 == '=' ) {
  786. acc = (acc >= calcValue());
  787. } else {
  788. executionPointer--;
  789. acc = (acc > calcValue());
  790. }
  791. }
  792. break;
  793. case '<':
  794. {
  795. BYTE ch2;
  796. while( TRUE ) {
  797. ch2 = *executionPointer++;
  798. if( ch2 != ' ' && ch2 != '\t' ) break;
  799. }
  800. if( ch2 == '=' ) {
  801. acc = (acc <= calcValue());
  802. } else if( ch2 == '>' ) {
  803. acc = (acc != calcValue());
  804. } else {
  805. executionPointer--;
  806. acc = (acc < calcValue());
  807. }
  808. }
  809. break;
  810. case '=':
  811. acc = (acc == calcValue());
  812. break;
  813. default:
  814. executionPointer--; /* unget it */
  815. return acc;
  816. }
  817. if( bForceToReturnSuper ) return -1;
  818. }
  819. }
  820. /* 各ステートメント実行処理メイン */
  821. void st_assignment( SHORT * pvar ) /* 代入ステートメントだけ例外的に処理する */
  822. {
  823. BYTE ch;
  824. SHORT val;
  825. while( TRUE ) {
  826. ch = *executionPointer++;
  827. if( ch != ' ' && ch != '\t' ) break;
  828. }
  829. if( ch != '=' ) {
  830. syntaxError();
  831. return;
  832. }
  833. val = expr();
  834. if( bForceToReturnSuper ) return;
  835. *pvar = val;
  836. }
  837. void st_if()
  838. {
  839. SHORT val;
  840. BYTE ch;
  841. val = expr();
  842. if( bForceToReturnSuper ) return;
  843. while( TRUE ) {
  844. ch = *executionPointer++;
  845. if( ch != ' ' && ch != '\t' ) break;
  846. }
  847. if( ch != KEYWORD_THEN ) {
  848. syntaxError();
  849. return;
  850. }
  851. if( val != 0 ) {
  852. return; /* thenの次から継続実行する */
  853. }
  854. /* 条件不成立につき、行末まで読み飛ばす */
  855. executionPointer = skipToEOL( executionPointer );
  856. }
  857. void printOrDebug( BOOL bPrint )
  858. {
  859. WORD lastChar;
  860. BYTE ch;
  861. lastChar = '\0';
  862. while( TRUE ) {
  863. while( TRUE ) {
  864. ch = *executionPointer++;
  865. if( ch != ' ' && ch != '\t' ) break;
  866. }
  867. if( ch == EOL || ch == ':' || ch == '\'' ) {
  868. executionPointer--; /* unget it */
  869. break;
  870. }
  871. lastChar = ch;
  872. switch( ch ) {
  873. case 0x03:
  874. if( bPrint ) {
  875. ptextString( executionPointer );
  876. } else {
  877. commonPrint( NULL, executionPointer );
  878. }
  879. while( TRUE ) {
  880. ch = *executionPointer++;
  881. if( ch == '\0' ) break;
  882. }
  883. break;
  884. case ';':
  885. break;
  886. case ',':
  887. if( bPrint ) {
  888. ptextTab();
  889. } else {
  890. commonPrint( NULL, "\t" );
  891. }
  892. break;
  893. case KEYWORD_CHR:
  894. {
  895. WORD val;
  896. #ifdef WW
  897. static
  898. #endif
  899. BYTE str[3];
  900. val = expr();
  901. if( bForceToReturnSuper ) return;
  902. if( val >= 0x100 ) {
  903. str[0] = (val >> 8);
  904. str[1] = (val & 0xff);
  905. str[2] = '\0';
  906. } else {
  907. str[0] = (BYTE)val;
  908. str[1] = '\0';
  909. }
  910. if( bPrint ) {
  911. ptextString( str );
  912. } else {
  913. commonPrint( NULL, str );
  914. }
  915. }
  916. break;
  917. default:
  918. {
  919. WORD val;
  920. #ifdef WW
  921. static
  922. #endif
  923. BYTE str[10];
  924. executionPointer--; /* unget it */
  925. val = expr();
  926. if( bForceToReturnSuper ) return;
  927. sprintf( str, "%d", val );
  928. if( bPrint ) {
  929. ptextString( str );
  930. } else {
  931. commonPrint( NULL, str );
  932. }
  933. }
  934. break;
  935. }
  936. }
  937. if( lastChar != ';' && lastChar != ',' ) {
  938. if( bPrint ) {
  939. ptextNewline();
  940. } else {
  941. commonPrint( NULL, "\r\n" );
  942. }
  943. }
  944. }
  945. void st_print()
  946. {
  947. printOrDebug( TRUE );
  948. }
  949. void st_debug()
  950. {
  951. printOrDebug( FALSE );
  952. }
  953. void st_locate()
  954. {
  955. SHORT x, y;
  956. BYTE ch;
  957. x = expr();
  958. if( bForceToReturnSuper ) return;
  959. while( TRUE ) {
  960. ch = *executionPointer++;
  961. if( ch != ' ' && ch != '\t' ) break;
  962. }
  963. if( ch != ',' ) {
  964. syntaxError();
  965. return;
  966. }
  967. y = expr();
  968. if( bForceToReturnSuper ) return;
  969. ptextLocate( x, y );
  970. }
  971. void st_cls()
  972. {
  973. ptextCLS();
  974. }
  975. void st_goto()
  976. {
  977. SHORT val;
  978. BYTE * t;
  979. val = expr();
  980. if( bForceToReturnSuper ) return;
  981. t = getLineReferenceFromLineNumber( val );
  982. if( t == NULL ) {
  983. lineNumberNotFound( val );
  984. return;
  985. }
  986. executionPointer = t;
  987. bInteractive = FALSE;
  988. processLineHeader();
  989. }
  990. void st_gosub()
  991. {
  992. SHORT val;
  993. BYTE * t;
  994. val = expr();
  995. if( bForceToReturnSuper ) return;
  996. t = getLineReferenceFromLineNumber( val );
  997. if( t == NULL ) {
  998. lineNumberNotFound( val );
  999. return;
  1000. }
  1001. if( stackPointer+1 >= STACK_MAX ) {
  1002. stackOverflow();
  1003. return;
  1004. }
  1005. stacks[stackPointer].type = STACK_TYPE_GOSUB;
  1006. stacks[stackPointer].returnPointer = executionPointer;
  1007. stacks[stackPointer].lastLocalVariables = localVariables;
  1008. localVariables = stacks[stackPointer].simpleVariables;
  1009. stackPointer++;
  1010. executionPointer = t;
  1011. bInteractive = FALSE;
  1012. processLineHeader();
  1013. }
  1014. void st_return()
  1015. {
  1016. while( TRUE ) {
  1017. if( stackPointer == 0 ) {
  1018. stackUnderflow();
  1019. return;
  1020. }
  1021. stackPointer--;
  1022. if( stacks[stackPointer].type == STACK_TYPE_GOSUB ) break;
  1023. }
  1024. executionPointer = stacks[stackPointer].returnPointer;
  1025. if( executionPointer >= waCoockedLine && executionPointer < waCoockedLine+LINE_SIZE ) {
  1026. bInteractive = TRUE;
  1027. }
  1028. localVariables = stacks[stackPointer].lastLocalVariables;
  1029. }
  1030. void st_for()
  1031. {
  1032. BYTE ch;
  1033. SHORT from, to, step;
  1034. SHORT * pvar;
  1035. while( TRUE ) {
  1036. ch = *executionPointer++;
  1037. if( ch != ' ' && ch != '\t' ) break;
  1038. }
  1039. if( ch == '@' ) { /* is it l-value? */
  1040. pvar = getArrayReference();
  1041. if( pvar == NULL ) return;
  1042. } else if( ch >= 'A' && ch <= 'Z' ) {
  1043. pvar = &globalVariables[ch-'A'];
  1044. } else if( ch >= 'a' && ch <= 'z' ) {
  1045. pvar = &localVariables[ch-'a'];
  1046. } else {
  1047. syntaxError();
  1048. return;
  1049. }
  1050. while( TRUE ) {
  1051. ch = *executionPointer++;
  1052. if( ch != ' ' && ch != '\t' ) break;
  1053. }
  1054. if( ch != '=' ) {
  1055. syntaxError();
  1056. return;
  1057. }
  1058. from = expr();
  1059. if( bForceToReturnSuper ) return;
  1060. while( TRUE ) {
  1061. ch = *executionPointer++;
  1062. if( ch != ' ' && ch != '\t' ) break;
  1063. }
  1064. if( ch != KEYWORD_TO ) {
  1065. syntaxError();
  1066. return;
  1067. }
  1068. to = expr();
  1069. if( bForceToReturnSuper ) return;
  1070. while( TRUE ) {
  1071. ch = *executionPointer++;
  1072. if( ch != ' ' && ch != '\t' ) break;
  1073. }
  1074. if( ch == KEYWORD_STEP ) {
  1075. step = expr();
  1076. if( bForceToReturnSuper ) return;
  1077. } else {
  1078. step = 1;
  1079. executionPointer--; /* unget it */
  1080. }
  1081. if( stackPointer+1 >= STACK_MAX ) {
  1082. stackOverflow();
  1083. return;
  1084. }
  1085. stacks[stackPointer].type = STACK_TYPE_FOR;
  1086. stacks[stackPointer].returnPointer = executionPointer;
  1087. *pvar = from;
  1088. stacks[stackPointer].pvar = pvar;
  1089. stacks[stackPointer].limit = to;
  1090. stacks[stackPointer].step = step;
  1091. stackPointer++;
  1092. }
  1093. void st_next()
  1094. {
  1095. if( stackPointer == 0 ) {
  1096. nextWithoutFor();
  1097. return;
  1098. }
  1099. if( stacks[stackPointer-1].type != STACK_TYPE_FOR ) {
  1100. nextWithoutFor();
  1101. return;
  1102. }
  1103. if( stacks[stackPointer-1].limit == *(stacks[stackPointer-1].pvar) ) {
  1104. /* loop done */
  1105. stackPointer--;
  1106. return;
  1107. }
  1108. /* count step and loop again */
  1109. *(stacks[stackPointer-1].pvar) += stacks[stackPointer-1].step;
  1110. executionPointer = stacks[stackPointer-1].returnPointer;
  1111. }
  1112. /* endステートメント: 正常な終了 */
  1113. void st_end()
  1114. {
  1115. bForceToReturnSuper = TRUE;
  1116. requestNextAction = REQUEST_INTERACTIVE;
  1117. }
  1118. /* breakステートメント: デバッグ用の中断 */
  1119. void st_break()
  1120. {
  1121. commonPrint(NULL, "Break in %d\x07\n", currentLineNumber);
  1122. bForceToReturnSuper = TRUE;
  1123. requestNextAction = REQUEST_INTERACTIVE;
  1124. resumePointer = executionPointer; /* contする場所はbreakの次。breakのみの例外処理 */
  1125. }
  1126. void st_rem()
  1127. {
  1128. executionPointer = skipToEOL( executionPointer );
  1129. }
  1130. void st_new()
  1131. {
  1132. bForceToReturnSuper = TRUE;
  1133. requestNextAction = REQUEST_NEW;
  1134. }
  1135. void st_list()
  1136. {
  1137. WORD from, to;
  1138. BYTE ch;
  1139. while( TRUE ) {
  1140. ch = *executionPointer++;
  1141. if( ch != ' ' && ch != '\t' ) break;
  1142. }
  1143. if( ch == ':' || ch == EOL || ch == '\'' ) {
  1144. executionPointer--; /* unget */
  1145. from = 1;
  1146. to = 32767;
  1147. } else {
  1148. if( ch == 0x01 ) {
  1149. from = *((WORD*)executionPointer);
  1150. executionPointer += 2;
  1151. while( TRUE ) {
  1152. ch = *executionPointer++;
  1153. if( ch != ' ' && ch != '\t' ) break;
  1154. }
  1155. } else {
  1156. from = 1;
  1157. }
  1158. if( ch != '-' ) {
  1159. executionPointer--; /* unget */
  1160. to = from;
  1161. } else {
  1162. while( TRUE ) {
  1163. ch = *executionPointer++;
  1164. if( ch != ' ' && ch != '\t' ) break;
  1165. }
  1166. if( ch == 0x01 ) {
  1167. to = *((WORD*)executionPointer);
  1168. executionPointer += 2;
  1169. } else {
  1170. executionPointer--; /* unget */
  1171. to = 32767;
  1172. }
  1173. }
  1174. }
  1175. sourceDump( NULL, from, to ); /* リスト出力の本体を呼ぶ */
  1176. }
  1177. void st_run()
  1178. {
  1179. BYTE ch;
  1180. while( TRUE ) {
  1181. ch = *executionPointer++;
  1182. if( ch != ' ' && ch != '\t' ) break;
  1183. }
  1184. if( ch == ':' || ch == EOL || ch == '\'' ) {
  1185. bForceToReturnSuper = TRUE;
  1186. requestNextAction = REQUEST_RUN_LINENUMBER;
  1187. runLineNumber = 0;
  1188. } else if( ch == 0x03 ) {
  1189. strcpy( waRawLine, executionPointer );
  1190. bForceToReturnSuper = TRUE;
  1191. requestNextAction = REQUEST_RUN_FILE;
  1192. } else {
  1193. SHORT val;
  1194. executionPointer--; /* unget it */
  1195. val = expr();
  1196. if( bForceToReturnSuper ) return;
  1197. bForceToReturnSuper = TRUE;
  1198. requestNextAction = REQUEST_RUN_LINENUMBER;
  1199. runLineNumber = val;
  1200. }
  1201. }
  1202. void st_cont()
  1203. {
  1204. if( resumePointer == NULL ) {
  1205. cantContinue();
  1206. return;
  1207. }
  1208. executionPointer = resumePointer;
  1209. bInteractive = FALSE;
  1210. }
  1211. void st_save()
  1212. {
  1213. BYTE ch;
  1214. BOOL b;
  1215. FILE FAR * fp;
  1216. while( TRUE ) {
  1217. ch = *executionPointer++;
  1218. if( ch != ' ' && ch != '\t' ) break;
  1219. }
  1220. if( ch != 0x03 ) {
  1221. syntaxError();
  1222. return;
  1223. }
  1224. fp = fopen( executionPointer, "w" );
  1225. if( fp == NULL ) {
  1226. saveError();
  1227. return;
  1228. }
  1229. b = sourceDump( fp, 1, 32767 );
  1230. fclose( fp );
  1231. if( b == FALSE ) {
  1232. saveError();
  1233. remove( executionPointer );
  1234. return;
  1235. }
  1236. executionPointer += strlen(executionPointer)+1;
  1237. }
  1238. void st_load()
  1239. {
  1240. BYTE ch;
  1241. while( TRUE ) {
  1242. ch = *executionPointer++;
  1243. if( ch != ' ' && ch != '\t' ) break;
  1244. }
  1245. if( ch == 0x03 ) {
  1246. strcpy( waRawLine, executionPointer );
  1247. bForceToReturnSuper = TRUE;
  1248. requestNextAction = REQUEST_LOAD_FILE;
  1249. } else {
  1250. syntaxError();
  1251. return;
  1252. }
  1253. }
  1254. void st_merge()
  1255. {
  1256. BYTE ch;
  1257. while( TRUE ) {
  1258. ch = *executionPointer++;
  1259. if( ch != ' ' && ch != '\t' ) break;
  1260. }
  1261. if( ch == 0x03 ) {
  1262. strcpy( waRawLine, executionPointer );
  1263. bForceToReturnSuper = TRUE;
  1264. requestNextAction = REQUEST_MERGE_FILE;
  1265. } else {
  1266. syntaxError();
  1267. return;
  1268. }
  1269. }
  1270. void st_randomize()
  1271. {
  1272. SHORT val;
  1273. val = expr();
  1274. srand( val );
  1275. }
  1276. void st_exit()
  1277. {
  1278. bForceToReturnSuper = TRUE;
  1279. requestNextAction = REQUEST_EXIT_SYSTEM;
  1280. }
  1281. void st_waitvb()
  1282. {
  1283. SHORT val;
  1284. val = expr();
  1285. if( bForceToReturnSuper ) return;
  1286. if( val < 0 || val > 750 ) {
  1287. paramError();
  1288. return;
  1289. }
  1290. #ifdef WW
  1291. sys_wait( val );
  1292. #endif
  1293. #ifdef WIN32
  1294. win32_sys_wait( val );
  1295. #endif
  1296. }
  1297. void st_files()
  1298. {
  1299. #ifdef WIN32
  1300. commonPrint( NULL, "files statement not implemented in Win32\x07\n" );
  1301. #endif
  1302. #ifdef WW
  1303. int i;
  1304. struct stat statbuf;
  1305. int nent;
  1306. /*chdir("/rom0");*/
  1307. nent = nument(NULL);
  1308. for (i = 0; i < nent; i++) {
  1309. int result = getent(NULL, i, &statbuf);
  1310. if (result == E_FS_SUCCESS) {
  1311. if (statbuf.count != -1) {
  1312. /* Freya OSのバグ? 回避コード */
  1313. int p, q;
  1314. p = 0;
  1315. q = 0;
  1316. waRawLine[p++] = '"';
  1317. while( TRUE ) {
  1318. if( statbuf.name[q] == '\0' ) break;
  1319. waRawLine[p++] = statbuf.name[q++];
  1320. }
  1321. waRawLine[p++] = '"';
  1322. waRawLine[p++] = ',';
  1323. q = 0;
  1324. while( TRUE ) {
  1325. if( statbuf.info[q] == '\0' ) break;
  1326. waRawLine[p++] = statbuf.info[q++];
  1327. }
  1328. waRawLine[p++] = '\0';
  1329. commonPrint( NULL, "%s,%ld,%d\n", waRawLine, statbuf.len, statbuf.count );
  1330. }
  1331. } else {
  1332. commonPrint( NULL, "*File Access Error\x07\n" );
  1333. }
  1334. }
  1335. #endif
  1336. }
  1337. /* 行エディタ */
  1338. void editLine()
  1339. {
  1340. WORD wishLineNumber;
  1341. BYTE ch, * p, * target;
  1342. /* トリックに注意! */
  1343. /* 行頭の整数を、行番号に変換するには結果的に先頭の0x01を取り去るだけで良い */
  1344. MEMMOVE( waCoockedLine, waCoockedLine+1, LINE_SIZE-1 );
  1345. /* トリック終わり。この時点でwsCoockedLineは、プログラム内部表現の形式に一致している */
  1346. wishLineNumber = *((WORD*)waCoockedLine);
  1347. p = waCoockedLine+2;
  1348. target = getLineReferenceFromLineNumber( wishLineNumber );
  1349. while( TRUE ) {
  1350. ch = *p++;
  1351. if( ch != ' ' && ch != '\t' ) break;
  1352. }
  1353. if( ch == EOL ) {
  1354. WORD delta;
  1355. BYTE * from;
  1356. /* removing the line */
  1357. if( target == NULL ) {
  1358. lineNumberNotFound( wishLineNumber );
  1359. return;
  1360. }
  1361. from = skipToEOL(target)+1;
  1362. delta = from-target;
  1363. MEMMOVE( target, from, (WORD)(dataTop-(from-wa)) );
  1364. dataTop -= delta;
  1365. clearRuntimeInfo();
  1366. } else {
  1367. WORD len;
  1368. len = skipToEOL(waCoockedLine+2)-waCoockedLine+1;
  1369. if( target == NULL ) {
  1370. /* insert new line */
  1371. /*const BYTE * to;*/
  1372. if( dataTop + len >= WORKAREA_SIZE ) {
  1373. outOfMemory();
  1374. return;
  1375. }
  1376. target = getInsertionPointFromLineNumber( wishLineNumber );
  1377. /* to = skipToEOL(target)+1; */
  1378. MEMMOVE( target+len, target, (WORD)(dataTop-(target-wa)) );
  1379. MEMMOVE( target, waCoockedLine, len );
  1380. dataTop += len;
  1381. clearRuntimeInfo();
  1382. } else {
  1383. /* replace line */
  1384. WORD lost;
  1385. BYTE * nextline;
  1386. int delta;
  1387. nextline = skipToEOL(target)+1;
  1388. lost = nextline-target;
  1389. delta = len-lost;
  1390. if( dataTop + delta >= WORKAREA_SIZE ) {
  1391. outOfMemory();
  1392. return;
  1393. }
  1394. MEMMOVE( nextline+delta, nextline, (WORD)(dataTop-(nextline-wa)) );
  1395. MEMMOVE( target, waCoockedLine, len );
  1396. dataTop += delta;
  1397. clearRuntimeInfo();
  1398. }
  1399. }
  1400. }
  1401. /* 中間言語に翻訳する */
  1402. BOOL convertInternalCode( BYTE * waCoockedLine, const BYTE * waRawLine )
  1403. {
  1404. const BYTE * src = waRawLine;
  1405. BYTE * dst = waCoockedLine;
  1406. while( TRUE ) {
  1407. if( *src == '\0' ) break;
  1408. if( *src == ' ' || *src == '\t' ) {
  1409. *dst++ = *src++;
  1410. } else if( *src < 0x20 ) {
  1411. syntaxError();
  1412. return FALSE;
  1413. } else if( *src >= '0' && *src <= '9' ) {
  1414. if( *src == '0' && *(src+1) == 'x' ) {
  1415. WORD acc;
  1416. /* 16進のとき */
  1417. *dst++ = 0x02;
  1418. acc = 0;
  1419. src += 2;
  1420. while( TRUE ) {
  1421. if( *src >= '0' && *src <= '9' ) {
  1422. acc *= 16;
  1423. acc += *src - '0';
  1424. } else if( *src >= 'a' && *src <= 'f' ) {
  1425. acc *= 16;
  1426. acc += *src - 'a' + 10;
  1427. } else if( *src >= 'A' && *src <= 'F' ) {
  1428. acc *= 16;
  1429. acc += *src - 'A' + 10;
  1430. } else {
  1431. break;
  1432. }
  1433. src++;
  1434. }
  1435. *((WORD*)dst) = acc;
  1436. dst += 2;
  1437. } else {
  1438. SHORT acc;
  1439. /* 10進のとき */
  1440. *dst++ = 0x01;
  1441. acc = *src-'0';
  1442. src++;
  1443. while( TRUE ) {
  1444. if( *src < '0' || *src > '9' ) break;
  1445. acc *= 10;
  1446. acc += *src - '0';
  1447. src++;
  1448. }
  1449. if( acc < 0 ) { /* overflow case */
  1450. syntaxError();
  1451. return FALSE;
  1452. }
  1453. *((SHORT*)dst) = acc;
  1454. dst += 2;
  1455. }
  1456. } else if( (*src >= 'a' && *src <= 'z') || (*src >= 'A' && *src <= 'Z') ) {
  1457. BYTE next = *(src+1);
  1458. if( (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z') ) {
  1459. WORD id;
  1460. KEYWORDITEM * p = keywords;
  1461. id = 0;
  1462. while( TRUE ) {
  1463. const BYTE * ps, * pd;
  1464. if( p->id == 0 ) {
  1465. syntaxError();
  1466. return FALSE;
  1467. }
  1468. ps = src;
  1469. pd = p->name;
  1470. while( TRUE ) {
  1471. if( *pd == '\0' ) {
  1472. id = p->id;
  1473. src = ps;
  1474. break;
  1475. }
  1476. if( mytolower(*ps) != mytolower(*pd) ) break;
  1477. ps++;
  1478. pd++;
  1479. }
  1480. if( id != 0 ) break;
  1481. p++;
  1482. }
  1483. *dst++ = (BYTE)id;
  1484. if( id == KEYWORD_REM ) {
  1485. /* コメント文の場合は行末まで何もかもそのままコピーする */
  1486. while( TRUE ) {
  1487. if( *src == '\0' ) break;
  1488. *dst++ = *src++;
  1489. }
  1490. }
  1491. } else {
  1492. *dst++ = *src++;
  1493. }
  1494. } else if( *src == '\'' ) {
  1495. *dst++ = *src++;
  1496. /* コメント文の場合は行末まで何もかもそのままコピーする */
  1497. while( TRUE ) {
  1498. if( *src == '\0' ) break;
  1499. *dst++ = *src++;
  1500. }
  1501. } else if( *src == '"' ) {
  1502. src++;
  1503. *dst++ = 0x03;
  1504. while( TRUE ) {
  1505. if( *src == '\0' ) {
  1506. syntaxError();
  1507. return FALSE;
  1508. }
  1509. if( *src == '"' ) break;
  1510. *dst++ = *src++;
  1511. }
  1512. *dst++ = '\0';
  1513. src++;
  1514. } else {
  1515. *dst++ = *src++;
  1516. }
  1517. }
  1518. *dst = EOL;
  1519. return TRUE;
  1520. }
  1521. /* ステートメント実行処理関数のリスト */
  1522. NEARPROC statements[KEYWORDS_STATEMENT_TO-KEYWORDS_STATEMENT_FROM+1] = {
  1523. st_if,
  1524. st_print,
  1525. st_locate,
  1526. st_cls,
  1527. st_goto,
  1528. st_gosub,
  1529. st_return,
  1530. st_for,
  1531. st_next,
  1532. st_end,
  1533. st_break,
  1534. st_rem,
  1535. st_new,
  1536. st_list,
  1537. st_run,
  1538. st_cont,
  1539. st_save,
  1540. st_load,
  1541. st_merge,
  1542. st_randomize,
  1543. st_exit,
  1544. st_debug,
  1545. st_waitvb,
  1546. st_files
  1547. };
  1548. void interpreterMain()
  1549. {
  1550. WORD keyscan;
  1551. while( TRUE ) {
  1552. /* 行の開始 */
  1553. processLineHeader();
  1554. /* 最後に達してしまった? */
  1555. if( !bInteractive && currentLineNumber == 0 ) {
  1556. bForceToReturnSuper = TRUE;
  1557. requestNextAction = REQUEST_INTERACTIVE;
  1558. return;
  1559. }
  1560. while( TRUE ) {
  1561. BYTE ch;
  1562. if( !bInteractive ) {
  1563. resumePointer = executionPointer; /* contする場所を記憶する */
  1564. }
  1565. #ifdef WW
  1566. keyscan = key_press_check();
  1567. #else
  1568. keyscan = win32_scan();
  1569. #endif
  1570. if( keyscan & 0x02 ) {
  1571. st_break();
  1572. return;
  1573. }
  1574. ch = *executionPointer++;
  1575. if( ch == EOL ) break;
  1576. if( ch == ' ' || ch == '\t' || ch == ':' ) {
  1577. /* nop */
  1578. } else if( ch == '\'' ) { /* comment */
  1579. st_rem();
  1580. } else if( ch == '@' ) { /* is it l-value? */
  1581. SHORT * pvar;
  1582. pvar = getArrayReference();
  1583. if( pvar == NULL ) return;
  1584. st_assignment( pvar );
  1585. } else if( ch >= 'A' && ch <= 'Z' ) {
  1586. st_assignment( &globalVariables[ch-'A'] );
  1587. } else if( ch >= 'a' && ch <= 'z' ) {
  1588. st_assignment( &localVariables[ch-'a'] );
  1589. } else if( ch >= KEYWORDS_STATEMENT_FROM && ch <= KEYWORDS_STATEMENT_TO ) {
  1590. (*(statements[ch-KEYWORDS_STATEMENT_FROM]))();
  1591. } else {
  1592. syntaxError();
  1593. }
  1594. if( bForceToReturnSuper ) return;
  1595. }
  1596. if( bInteractive ) return;
  1597. }
  1598. }
  1599. void interactiveMain( FILE FAR * fp )
  1600. {
  1601. if( fp == NULL ) {
  1602. commonPrint(NULL,"*Ready\n");
  1603. }
  1604. while( TRUE ) {
  1605. BOOL b;
  1606. if( fp == NULL ) {
  1607. consoleInput( waRawLine, LINE_SIZE );
  1608. } else {
  1609. char FAR * r;
  1610. char * p;
  1611. r = fgets( waRawLine, LINE_SIZE, fp );
  1612. if( r == NULL ) break;
  1613. p = waRawLine;
  1614. while( TRUE ) {
  1615. if( *p == '\0' ) break;
  1616. if( *p == '\n' || *p == '\r') {
  1617. *p = '\0';
  1618. break;
  1619. }
  1620. p++;
  1621. }
  1622. }
  1623. #ifdef WW
  1624. if( fp == NULL ) {
  1625. commonPrint( NULL, "\r\n" );
  1626. }
  1627. #endif
  1628. /* 中間言語に翻訳する */
  1629. b = convertInternalCode( waCoockedLine, waRawLine );
  1630. if( b == FALSE ) {
  1631. bForceToReturnSuper = FALSE;
  1632. continue;
  1633. }
  1634. /* 数値で開始されているか? */
  1635. if( waCoockedLine[0] == 0x01 ) {
  1636. /* 行エディタを呼び出す */
  1637. editLine();
  1638. } else {
  1639. /* その行を実行する */
  1640. executionPointer = waCoockedLine;
  1641. interpreterMain();
  1642. }
  1643. if( bForceToReturnSuper ) return;
  1644. }
  1645. }
  1646. /* プログラムの実行開始 */
  1647. void do_run( WORD runLineNumber )
  1648. {
  1649. BYTE * target;
  1650. if( runLineNumber == 0 ) {
  1651. target = &wa[codeTop];
  1652. } else {
  1653. target = getLineReferenceFromLineNumber( runLineNumber );
  1654. if( target == NULL ) {
  1655. lineNumberNotFound( runLineNumber );
  1656. return;
  1657. }
  1658. }
  1659. clearRuntimeInfo();
  1660. bInteractive = FALSE;
  1661. executionPointer = target;
  1662. }
  1663. void do_new()
  1664. {
  1665. clearRuntimeInfo();
  1666. bInteractive = TRUE;
  1667. codeTop = 0;
  1668. wa[0] = 0;
  1669. wa[1] = 0;
  1670. wa[2] = EOL;
  1671. dataTop = 3;
  1672. }
  1673. BOOL do_merge( const BYTE * filename )
  1674. {
  1675. FILE FAR * fp;
  1676. fp = fopen( filename, "r" );
  1677. if( fp == NULL ) {
  1678. loadError();
  1679. return FALSE;
  1680. }
  1681. interactiveMain( fp );
  1682. fclose( fp );
  1683. if( bForceToReturnSuper ) return FALSE;
  1684. return TRUE;
  1685. }
  1686. void superMain()
  1687. {
  1688. while( TRUE ) {
  1689. BOOL b;
  1690. bForceToReturnSuper = FALSE;
  1691. switch( requestNextAction ) {
  1692. case REQUEST_INTERACTIVE:
  1693. bInteractive = TRUE;
  1694. break;
  1695. case REQUEST_RUN_LINENUMBER:
  1696. do_run( runLineNumber );
  1697. break;
  1698. case REQUEST_RUN_FILE:
  1699. do_new();
  1700. b = do_merge( waRawLine );
  1701. if( b ) {
  1702. do_run( 0 );
  1703. }
  1704. break;
  1705. case REQUEST_LOAD_FILE:
  1706. do_new();
  1707. do_merge( waRawLine );
  1708. break;
  1709. case REQUEST_MERGE_FILE:
  1710. do_merge( waRawLine );
  1711. break;
  1712. case REQUEST_NEW:
  1713. do_new();
  1714. break;
  1715. case REQUEST_EXIT_SYSTEM:
  1716. return;
  1717. }
  1718. requestNextAction = REQUEST_NO_ACTION;
  1719. if( bInteractive ) {
  1720. if( runtimeOnly ) return; /* ランタイムモードのときは絶対にインタラクティブモードに行かない */
  1721. interactiveMain( NULL );
  1722. } else {
  1723. interpreterMain();
  1724. }
  1725. bForceToReturnSuper = FALSE;
  1726. }
  1727. }
  1728. #ifdef WW
  1729. BOOL entranceUI()
  1730. {
  1731. #define MAX_ENT 15
  1732. /* この関数内のstaticはTurbo-C 2.0のSS!=DS問題を回避するために必要なもの */
  1733. static int i;
  1734. struct stat statbuf;
  1735. static char names[MAX_ENT][MAXFNAME];
  1736. static int nent;
  1737. static int c, select;
  1738. ptextCLS();
  1739. ptextString( "ワンべぇ V" );
  1740. ptextString( myVersion );
  1741. ptextNewline();
  1742. ptextString( "↑↓Aでファイル選択 Y2で開発環境 STARTで中止" );
  1743. c = 0;
  1744. nent = nument(NULL);
  1745. for (i = 0; i < nent; i++) {
  1746. int result;
  1747. if( c >= MAX_ENT ) break;
  1748. result = getent(NULL, i, &statbuf);
  1749. if (result == E_FS_SUCCESS) {
  1750. if (statbuf.count != -1) {
  1751. /* Freya OSのバグ? 回避コード */
  1752. {
  1753. static int p;
  1754. int q;
  1755. p = 0;
  1756. q = 0;
  1757. waRawLine[p++] = statbuf.info[q++];
  1758. waRawLine[p++] = statbuf.info[q++];
  1759. while( TRUE ) {
  1760. if( statbuf.info[q] == '\0' ) break;
  1761. waRawLine[p++] = statbuf.info[q++];
  1762. }
  1763. waRawLine[p++] = '\0';
  1764. ptextLocate(1,c+2);
  1765. ptextString( waRawLine );
  1766. }
  1767. {
  1768. static int r;
  1769. int q;
  1770. q = 0;
  1771. r = 0;
  1772. while( TRUE ) {
  1773. if( statbuf.name[q] == '\0' ) break;
  1774. names[c][r++] = statbuf.name[q++];
  1775. }
  1776. names[c][r] = '\0';
  1777. }
  1778. c++;
  1779. }
  1780. }
  1781. }
  1782. /* 選択の開始 */
  1783. select = 0;
  1784. while( TRUE ) {
  1785. int key;
  1786. for( i=0; i<c; i++ ) {
  1787. ptextLocate(0,i+2);
  1788. ptextString( " " );
  1789. }
  1790. ptextLocate(0,select+2);
  1791. ptextString( "→" );
  1792. key = key_wait();
  1793. /* START */
  1794. if( key & 0x02 ) return FALSE; /* 中止 */
  1795. /* A */
  1796. if( key & 0x04 ) {
  1797. strcpy( waRawLine, names[select] );
  1798. requestNextAction = REQUEST_RUN_FILE;
  1799. runtimeOnly = TRUE;
  1800. return TRUE;
  1801. }
  1802. /* B */
  1803. if( key & 0x08 ) return FALSE; /* 中止 */
  1804. /* X1 or Y1 */
  1805. if( (key & 0x10) != 0 || (key & 0x100) != 0 ) {
  1806. select = select-1;
  1807. if( select < 0 ) {
  1808. select = c-1;
  1809. }
  1810. }
  1811. /* X3 or Y3 */
  1812. if( (key & 0x40) != 0 || (key & 0x400) != 0 ) {
  1813. select = select+1;
  1814. if( select >= c ) {
  1815. select = 0;
  1816. }
  1817. }
  1818. if( (key & 0x200) != 0 ) {
  1819. return TRUE;
  1820. }
  1821. }
  1822. }
  1823. #endif
  1824. int main( int argc, char *argv[] )
  1825. {
  1826. #ifdef WW
  1827. BOOL b;
  1828. #endif
  1829. runtimeOnly = FALSE;
  1830. requestNextAction = REQUEST_NO_ACTION;
  1831. #ifdef WIN32
  1832. createText();
  1833. #endif
  1834. #ifdef WW
  1835. text_screen_init();
  1836. b = entranceUI();
  1837. if( b == FALSE ) return 0;
  1838. if( !runtimeOnly ) {
  1839. comm_set_baudrate(1);
  1840. comm_open();
  1841. }
  1842. #endif
  1843. ptextCLS();
  1844. if( requestNextAction == REQUEST_NO_ACTION ) {
  1845. do_new();
  1846. }
  1847. if( !runtimeOnly ) {
  1848. commonPrint(NULL,"ワンべぇ WonderWitch Tiny BASIC Environment Ver %s\n",myVersion);
  1849. commonPrint(NULL,"Copyright 2000 (c) by Pie Dey Co.,Ltd.\n");
  1850. }
  1851. superMain();
  1852. #ifdef WIN32
  1853. deleteText();
  1854. #endif
  1855. #ifdef WW
  1856. if( !runtimeOnly ) {
  1857. comm_close();
  1858. }
  1859. #endif
  1860. return 0;
  1861. }
  1862. /* end of wonbe.c */