/programs/cmm/lib/added_sysdir.c |
---|
0,0 → 1,18 |
struct sysdir |
{ |
char name[64]; |
char path[64]; |
} sysdir; |
:int SetAdditionalSystemDirectory(dword tName, tPath) |
{ |
int i; |
strcpy(#sysdir.name, tName); |
strcpy(#sysdir.path, tPath); |
$mov eax, 30 |
$mov ebx, 3 |
ECX = #sysdir; |
$int 0x40 |
} |
/programs/cmm/app_plus/added_sysdir.c |
---|
File deleted |
/programs/cmm/app_plus/app_plus.c |
---|
6,7 → 6,7 |
#include "..\lib\obj\proc_lib.h" |
#include "..\lib\patterns\simple_open_dialog.h" |
#include "..\lib\patterns\restart_process.h" |
#include "added_sysdir.c" |
#include "..\lib\added_sysdir.c" |
#ifndef AUTOBUILD |
#include "lang.h--" |
/programs/cmm/installer/install.c |
---|
114,6 → 114,8 |
void EventInstall() |
{ |
//#include "..\lib\added_sysdir.c"; |
//SetAdditionalSystemDirectory("kolibrios", abspath("install/kolibrios")+1); |
ini_set_int stdcall ("/sys/settings/taskbar.ini", "Flags", "Attachment", 0); |
copyf("/kolibrios/KolibriNext/settings", "/sys/settings"); |
/programs/cmm/examples/Tupfile.lua |
---|
10,4 → 10,5 |
tup.rule("console.c", "c-- /D=AUTOBUILD /D=$(C_LANG) %f" .. tup.getconfig("KPACK_CMD"), "console.com") |
tup.rule("info.c", "c-- /D=AUTOBUILD /D=$(C_LANG) %f" .. tup.getconfig("KPACK_CMD"), "info.com") |
tup.rule("pigex.c", "c-- /D=AUTOBUILD /D=$(C_LANG) %f" .. tup.getconfig("KPACK_CMD"), "pigex.com") |
tup.rule("netcheck.c", "c-- /D=AUTOBUILD /D=$(C_LANG) %f" .. tup.getconfig("KPACK_CMD"), "netcheck.com") |
tup.rule("math.c", "c-- /D=AUTOBUILD /D=$(C_LANG) %f" .. tup.getconfig("KPACK_CMD"), "math.com") |
/programs/cmm/examples/netcheck.c |
---|
0,0 → 1,101 |
/* |
* Network testing utility |
* Leency 2018 |
*/ |
#define MEMSIZE 4096*10 |
#include "../lib/fs.h" |
#include "../lib/gui.h" |
#include "../lib/events.h" |
//===================================================// |
// // |
// DATA // |
// // |
//===================================================// |
char download_file[] = "-d http://kolibri-n.org/files/KolibriN9.zip"; |
EVENTS button; |
EVENTS key; |
//===================================================// |
// // |
// CODE // |
// // |
//===================================================// |
void main() |
{ |
loop() switch(WaitEvent()) |
{ |
case evButton: |
button.press( GetButtonID() ); |
break; |
case evKey: |
GetKeys(); |
key.press( key_scancode ); |
break; |
case evReDraw: |
draw_window(); |
break; |
} |
} |
void draw_window() |
{ |
sc.get(); |
DefineAndDrawWindow(215, 100, 350, 300, 0x34, sc.work, "Network testing utility",0); |
button.init(10); |
key.init(10); |
WriteText(10,10, 0x90, sc.work_text, "Download via:"); |
AddEvent(10, 30, #EventRunAsmDownloader, SCAN_CODE_F1, "ASM Downloader [F1]"); |
AddEvent(10, 60, #EventRunCmmDownloader, SCAN_CODE_F2, "C-- Downloader [F2]"); |
AddEvent(10, 120, #EventRunNetStat, SCAN_CODE_F3, "NetStat [F3]"); |
AddEvent(10, 150, #EventRunNetCfg, SCAN_CODE_F4, "NetCfg [F4]"); |
AddEvent(10, 180, #EventRunBoard, SCAN_CODE_F5, "Board [F5]"); |
button.add_n(1, #ExitProcess); |
key.add_n(SCAN_CODE_ESC, #ExitProcess); |
} |
void AddEvent(dword bx, by, event, hotkey, text) |
{ |
DrawStandartCaptButton(bx, by, button.add(event), text); |
key.add_n(hotkey, event); |
} |
//===================================================// |
// // |
// EVENTS // |
// // |
//===================================================// |
void EventRunAsmDownloader() |
{ |
RunProgram("/sys/network/downloader", #download_file+3); |
} |
void EventRunCmmDownloader() |
{ |
RunProgram("/sys/network/webview", #download_file); |
} |
void EventRunNetStat() |
{ |
RunProgram("/sys/network/netstat", NULL); |
} |
void EventRunNetCfg() |
{ |
RunProgram("/sys/network/netcfg", NULL); |
} |
void EventRunBoard() |
{ |
RunProgram("/sys/develop/board", NULL); |
} |
/programs/cmm/experimental/BrainFuck/compile.sh |
---|
File deleted |
\ No newline at end of file |
Property changes: |
Deleted: svn:executable |
-* |
\ No newline at end of property |
/programs/cmm/experimental/BrainFuck/brainfuck.c |
---|
File deleted |
/programs/cmm/experimental/BrainFuck/example/number.bf |
---|
File deleted |
\ No newline at end of file |
/programs/cmm/experimental/BrainFuck/example/hello.bf |
---|
File deleted |
\ No newline at end of file |
/programs/cmm/experimental/lisp/compile.sh |
---|
File deleted |
\ No newline at end of file |
Property changes: |
Deleted: svn:executable |
-* |
\ No newline at end of property |
/programs/cmm/experimental/lisp/lisp.c |
---|
File deleted |
/programs/cmm/experimental/lisp/stdcall.h |
---|
File deleted |
/programs/cmm/lisp/lisp.c |
---|
0,0 → 1,459 |
/* |
* Author Pavel Iakovlev by PaulCodeman |
*/ |
#define MEMSIZE 4096*10 |
#include "../lib/io.h" |
#include "../lib/obj/console.h" |
#define TString 1 |
#define TSymbol 2 |
#define TNumber 3 |
#define TList 4 |
#define Proc 5 |
#define Lambda 6 |
#define TObject 7 |
#define sizeStruct 4*4 |
byte initConsole = 0; |
dword maxLoop = 100; |
dword buffer = 0; |
dword bufferSize = 1000; |
dword variable = 0; |
dword key = 0; |
dword treeItem = 0; |
dword NIL = 0; |
void consoleInit() |
{ |
IF(!initConsole) |
{ |
load_dll(libConsole, #con_init, 0); |
con_init stdcall (-1, -1, -1, -1, "Lisp interpreter"); |
initConsole = 0xFF; |
} |
} |
dword error_message(dword text) |
{ |
con_printf stdcall (text); |
ExitProcess(); |
} |
dword crc32Table = 0; |
dword makeCRCTable(void) |
{ |
dword i = 0; |
dword c = 0; |
dword ii = 0; |
dword crcTable = 0; |
IF (crc32Table) RETURN 0; |
crc32Table = malloc(4*256); |
crcTable = crc32Table; |
WHILE (i < 256) |
{ |
c = i; |
ii = 0; |
WHILE (ii < 8) |
{ |
IF (c&1) |
{ |
c >>= 1; |
c ^= 0xEDB88320; |
} |
ELSE c >>= 1; |
ii++; |
} |
DSDWORD[crcTable] = c; |
crcTable += 4; |
i++; |
} |
} |
dword crc32(dword bytes) |
{ |
dword crc = 0; |
byte b = 0; |
IF (!crc32Table) makeCRCTable(); |
crc = 0xFFFFFFFF; |
WHILE (DSBYTE[bytes]) |
{ |
b = DSBYTE[bytes]; |
bytes++; |
EDX = crc^b; |
EDX &= 0xFF; |
EDX <<= 2; |
EDX += crc32Table; |
crc >>= 8; |
crc ^= DSDWORD[EDX]; |
} |
RETURN crc ^ 0xFFFFFFFF; |
} |
dword indexArray(dword address, key) |
{ |
dword offset = key&11b; |
dword offsetAddress = offset*4+address; |
IF (key==offset) RETURN 4*4+offsetAddress; |
IF (!DSDWORD[offsetAddress]) DSDWORD[offsetAddress] = malloc(4*4*2); |
RETURN indexArray(DSDWORD[offsetAddress], key>>2); |
} |
void set_procedure(dword name, address) |
{ |
dword data = 0; |
data = malloc(sizeStruct); |
DSDWORD[data] = Proc; |
DSDWORD[data+4] = address; |
indexArray(variable, crc32(name)); |
DSDWORD[EAX] = data; |
} |
void set_variable(dword name, data) |
{ |
indexArray(variable, crc32(name)); |
DSDWORD[EAX] = data; |
} |
dword string(dword lisp) |
{ |
dword buffer = 0; |
if (DSDWORD[lisp] == TList) |
{ |
return ""; |
} |
switch (DSDWORD[lisp]) |
{ |
case TString: |
case TSymbol: |
return DSDWORD[lisp+4]; |
case TNumber: |
return itoa(DSDWORD[lisp+4]); |
case Lambda: |
return "[LAMBDA]"; |
case Proc: |
return "[PROC]"; |
case TObject: |
return "[OBJECT]"; |
case TList: |
return "[LIST]"; |
} |
} |
dword number(dword lisp) |
{ |
if (DSDWORD[lisp] == TNumber) |
{ |
return DSDWORD[lisp+4]; |
} |
if (DSDWORD[lisp] == TString) |
{ |
//return atoi(DSDWORD[lisp+4]); |
} |
return 0; |
} |
dword lexer(dword code) |
{ |
byte s = 0; |
dword alloc = 0; |
dword buffer = 0; |
dword position = 0; |
dword key = 0; |
alloc = malloc(32); |
//con_printf stdcall(code); |
while(DSBYTE[code]) |
{ |
s = DSBYTE[code]; |
code++; |
if (s == ' ') || (s == '\n') || (s == '\t') || (s == '\r') continue; |
if (s == '(') || (s == ')') |
{ |
buffer = malloc(2); |
DSBYTE[buffer] = s; |
indexArray(alloc, key); |
DSDWORD[EAX] = buffer; |
key++; |
continue; |
} |
buffer = malloc(25); |
position = buffer; |
DSBYTE[position] = s; |
if (s == '"') |
{ |
while(DSBYTE[code]) |
{ |
s = DSBYTE[code]; |
position++; |
DSBYTE[position] = s; |
code++; |
if (s == '"') && (DSBYTE[code-2] != '\\') break; |
} |
} |
else |
{ |
while(DSBYTE[code]) |
{ |
s = DSBYTE[code]; |
if (s == ' ') || (s == '\n') || (s == '\t') || (s == '\r') || (s == '(') || (s == ')') break; |
position++; |
DSBYTE[position] = s; |
code++; |
} |
} |
indexArray(alloc, key); |
DSDWORD[EAX] = buffer; |
key++; |
} |
indexArray(alloc, key); |
DSDWORD[EAX] = 0; |
/*key = 0; |
do { |
buffer = indexArray(alloc, key); |
if (!DSDWORD[buffer]) break; |
con_printf stdcall ("\r\n"); |
con_printf stdcall (DSDWORD[buffer]);key++; |
} while(1);*/ |
return alloc; |
} |
dword tree(dword alloc) |
{ |
dword token = 0; |
dword list = 0; |
dword buffer = 0; |
dword temp = 0; |
dword listBuffer = 0; |
dword i = 0; |
token = indexArray(alloc, treeItem); |
treeItem++; |
buffer = DSDWORD[token]; |
if (DSBYTE[buffer] == '(') |
{ |
list = malloc(32); |
while(1) { |
token = indexArray(alloc, treeItem); |
token = DSDWORD[token]; |
if (!token) || (DSBYTE[token] == ')') break; |
buffer = indexArray(list, i); |
DSDWORD[buffer] = tree(alloc); |
i++; |
} |
treeItem++; |
indexArray(list, i); |
DSDWORD[EAX] = 0; |
malloc(sizeStruct); |
DSDWORD[EAX] = TList; |
DSDWORD[EAX+4] = list; |
return EAX; |
} |
return atom(DSDWORD[token]); |
} |
dword hexdec2(dword buffer, length) |
{ |
dword r = 0; |
length += buffer; |
while (length != buffer) |
{ |
length--; |
r <<= 4; |
if (DSBYTE[length] >= 'A') && (DSBYTE[length] <= 'F') r |= DSBYTE[length]-'A'+10; |
else if (DSBYTE[length] >= 'a') && (DSBYTE[length] <= 'f') r |= DSBYTE[length]-'a'+10; |
else if (DSBYTE[length] >= '0') && (DSBYTE[length] <= '9') r |= '9'-DSBYTE[length]; |
} |
return r; |
} |
dword atom(dword token) |
{ |
dword buffer = 0; |
dword pos = 0; |
dword data = 0; |
if (DSBYTE[token] == '-') && (DSBYTE[token+1] >= '0') && (DSBYTE[token+1] <= '9') |
{ |
malloc(sizeStruct); |
DSDWORD[EAX] = TNumber; |
DSDWORD[EAX+4] = atoi(token); |
return EAX; |
} |
if (DSBYTE[token] >= '0') && (DSBYTE[token] <= '9') |
{ |
while (DSBYTE[token]) && (DSBYTE[token] >= '0') && (DSBYTE[token] <= '9') |
{ |
data *= 10; |
data += DSBYTE[token]-'0'; |
token++; |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TNumber; |
DSDWORD[EAX+4] = data; |
return EAX; |
} |
if (DSBYTE[token] == '"') |
{ |
pos = token; |
buffer = token; |
pos++; |
while (DSBYTE[pos]) && (DSBYTE[pos] != '"') |
{ |
if (DSBYTE[pos] == '\\') |
{ |
pos++; |
switch (DSBYTE[pos]) |
{ |
case 'n': DSBYTE[buffer] = 13; break; |
case 'r': DSBYTE[buffer] = 10; break; |
case 't': DSBYTE[buffer] = 9; break; |
case 'x': |
pos++; |
DSBYTE[buffer] = hexdec2(pos, 2); |
pos++; |
break; |
default: |
DSBYTE[buffer] = DSBYTE[pos]; |
} |
} |
else DSBYTE[buffer] = DSBYTE[pos]; |
buffer++; |
pos++; |
} |
DSBYTE[buffer] = 0; |
malloc(sizeStruct); |
DSDWORD[EAX] = TString; |
DSDWORD[EAX+4] = token; |
DSDWORD[EAX+8] = token-buffer; |
return EAX; |
} |
pos = token; |
while (DSBYTE[pos]) |
{ |
if (DSBYTE[pos] >= 'a') && (DSBYTE[pos] <= 'z') DSBYTE[pos] = DSBYTE[pos]-'a'+'A'; |
pos++; |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = token; |
return EAX; |
} |
dword lisp(dword tree) |
{ |
dword buffer = 0; |
dword list = 0; |
dword args = 0; |
dword key = 0; |
dword item = 0; |
switch (DSDWORD[tree]) |
{ |
case TSymbol: |
buffer = indexArray(variable, crc32(DSDWORD[tree+4])); |
IF (!DSDWORD[buffer]) return tree; |
return DSDWORD[buffer]; |
case TNumber: |
case TString: |
return tree; |
case TList: |
list = DSDWORD[tree+4]; |
buffer = indexArray(list, 0); |
if (!buffer) { |
malloc(sizeStruct); |
DSDWORD[buffer] = TSymbol; |
DSDWORD[buffer+4] = NIL; |
return buffer; |
} |
buffer = DSDWORD[buffer]; |
if (DSDWORD[buffer] == TSymbol) || (DSDWORD[buffer] == TList) |
{ |
buffer = DSDWORD[buffer+4]; |
if (DSBYTE[buffer] == '\'') return tree; |
args = malloc(32); |
key = 0; |
while (1) |
{ |
buffer = indexArray(list, key); |
buffer = DSDWORD[buffer]; |
if (!buffer) break; |
item = indexArray(args, key); |
DSDWORD[item] = lisp(buffer); |
key++; |
} |
item = indexArray(args, 0); |
item = DSDWORD[item]; |
if (DSDWORD[item] == Proc) |
{ |
EAX = DSDWORD[item+4]; |
EAX(args); |
if (!EAX) |
{ |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = NIL; |
return EAX; |
} |
return EAX; |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = NIL; |
return EAX; |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = NIL; |
return EAX; |
} |
} |
#include "stdcall.h" |
void main() |
{ |
dword xxx = 0; |
dword item = 0; |
dword data = 0; |
buffer = malloc(bufferSize); |
variable = malloc(32); |
NIL = "NIL"; |
initFunctionLisp(); |
if(DSBYTE[I_Param]) |
{ |
IF(io.read(I_Param)) |
{ |
lisp(tree(lexer(EAX))); |
} |
} |
else |
{ |
consoleInit(); |
con_printf stdcall ("Lisp v2.0\r\n"); |
while(maxLoop) |
{ |
treeItem = 0; |
con_printf stdcall ("\r\n$ "); |
con_gets stdcall(buffer+1, bufferSize); |
DSBYTE[buffer] = '('; |
xxx= lisp(tree(lexer(buffer))); |
con_printf stdcall (string(xxx)); |
maxLoop--; |
} |
} |
IF(initConsole) con_exit stdcall (1); |
ExitProcess(); |
} |
/programs/cmm/lisp/stdcall.h |
---|
0,0 → 1,193 |
/* |
STDCALL function |
Author: PaulCodeman |
*/ |
void initFunctionLisp() |
{ |
set_procedure("TEST", #lisp_test); |
set_procedure("SLEEP", #lisp_sleep); |
set_procedure("PRINT", #lisp_print); |
set_procedure("INPUT", #lisp_input); |
set_procedure("STDCALL", #lisp_stdcall); |
set_procedure("SETQ", #lisp_setq); |
set_procedure("DEFVAR", #lisp_setq); |
set_procedure("+", #lisp_add); |
set_procedure("-", #lisp_sub); |
set_procedure("=", #lisp_cmp); |
} |
dword lisp_test(dword args) |
{ |
malloc(sizeStruct); |
DSDWORD[EAX] = TString; |
DSDWORD[EAX+4] = "ZZZ"; |
return EAX; |
} |
dword lisp_setq(dword args) |
{ |
dword i = 0; |
dword name = 0; |
dword data = 0; |
while(1) |
{ |
i++; |
data = indexArray(args, i); |
data = DSDWORD[data]; |
IF (!data) break; |
if (i&1) |
{ |
name = DSDWORD[data+4]; |
} |
else |
{ |
set_variable(name, data); |
} |
} |
return 0; |
} |
dword lisp_print(dword args) |
{ |
dword i = 0; |
consoleInit(); |
while(1) |
{ |
i++; |
indexArray(args, i); |
IF (!DSDWORD[EAX]) break; |
con_printf stdcall (string(DSDWORD[EAX])); |
} |
con_printf stdcall ("\r\n"); |
return 0; |
} |
dword lisp_stdcall(dword args) |
{ |
dword i = 0; |
dword buffer = 0; |
while(1) |
{ |
i++; |
indexArray(args, i); |
buffer = DSDWORD[EAX]; |
IF (!buffer) break; |
$push DSDWORD[buffer+4]; |
} |
IF (i == 2) $pop eax |
IF (i == 3) $pop ebx |
IF (i == 4) $pop ecx |
$int 0x40 |
return EAX; |
} |
dword lisp_input(dword args) |
{ |
dword buffer = 0; |
consoleInit(); |
buffer = malloc(100); |
con_gets stdcall(buffer, 100); |
malloc(sizeStruct); |
DSDWORD[EAX] = TString; |
DSDWORD[EAX+4] = buffer; |
return EAX; |
} |
dword lisp_inc(dword args) |
{ |
dword i = 0; |
dword sum = 0; |
dword buffer = 0; |
while(1) |
{ |
i++; |
buffer = indexArray(args, i); |
IF (!DSDWORD[buffer]) break; |
buffer = DSDWORD[buffer]; |
} |
return 0; |
} |
dword lisp_add(dword args) |
{ |
dword i = 0; |
dword sum = 0; |
dword buffer = 0; |
while(1) |
{ |
i++; |
buffer = indexArray(args, i); |
IF (!DSDWORD[buffer]) break; |
buffer = DSDWORD[buffer]; |
sum += number(buffer); |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TNumber; |
DSDWORD[EAX+4] = sum; |
return EAX; |
} |
dword lisp_sub(dword args) |
{ |
dword i = 0; |
dword sum = 0; |
while(1) |
{ |
i++; |
indexArray(args, i); |
IF (!DSDWORD[EAX]) break; |
sum -= number(DSDWORD[EAX]); |
} |
malloc(sizeStruct); |
DSDWORD[EAX] = TNumber; |
DSDWORD[EAX+4] = sum; |
return EAX; |
} |
dword lisp_cmp(dword args) |
{ |
dword i = 0; |
dword first = 0; |
dword buffer = 0; |
while(1) |
{ |
i++; |
buffer = indexArray(args, i); |
buffer = DSDWORD[buffer]; |
IF (!buffer) break; |
if (i == 1) |
{ |
first = buffer; |
} |
else |
{ |
if (DSDWORD[first+4] != DSDWORD[buffer+4]) |
{ |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = NIL; |
return EAX; |
} |
} |
} |
if (i == 1) error_message("*** - EVAL: too few arguments given to =: (=)"); |
malloc(sizeStruct); |
DSDWORD[EAX] = TSymbol; |
DSDWORD[EAX+4] = "T"; |
return EAX; |
} |
dword lisp_sleep(dword args) |
{ |
dword time = 0; |
indexArray(args, 1); |
time = number(DSDWORD[EAX]); |
EAX = 5; |
EBX = time; |
$int 0x40 |
return 0; |
} |
/programs/cmm/lisp/compile.sh |
---|
0,0 → 1,5 |
#!/bin/bash |
for file in `find ./ -type f -name "*.c"` |
do |
cmm $file; |
done |
Property changes: |
Added: svn:executable |
+* |
\ No newline at end of property |
/programs/cmm/BrainFuck/example/hello.bf |
---|
0,0 → 1,0 |
++++++++++[>+>+++>+++++++>++++++++++<<<<-]>>>++.>+.+++++++..+++.<<++.>+++++++++++++++.>.+++.------.--------.<<+.<. |
/programs/cmm/BrainFuck/example/number.bf |
---|
0,0 → 1,0 |
++++++++[>++++++<-]++++++++++[>.+<-] |
/programs/cmm/BrainFuck/brainfuck.c |
---|
0,0 → 1,125 |
/* |
* Author Pavel Iakovlev |
*/ |
#define MEMSIZE 4096*10 |
#include "../lib/io.h" |
#include "../lib/obj/console.h" |
#define bufferSize 10000; |
#define memoryBrainfuck 30000 |
#define memoryByteBF 1 |
#define stackBrainFuck 4*1024 |
dword buffer = 0; |
word bufferSymbol = 0; |
dword memory = 0; |
byte initConsole = 0; |
dword stack = 0; |
void consoleInit() |
{ |
IF(!initConsole) |
{ |
load_dll(libConsole, #con_init, 0); |
con_init stdcall (-1, -1, -1, -1, "BrainF*ck interpreter"); |
initConsole = 0xFF; |
} |
} |
void evalBrainFuckCode(dword code) |
{ |
dword offsetMemory = 0; |
dword countStack = 0; |
dword countOffset = memoryBrainfuck / 2 / memoryByteBF; |
offsetMemory = memory; |
// clear memory |
EBX = memoryBrainfuck; |
offsetMemory = memory; |
WHILE(EBX) |
{ |
EBX--; |
DSBYTE[offsetMemory] = 0; |
offsetMemory++; |
} |
//-------- |
offsetMemory = memory + countOffset; |
countStack = stack; |
WHILE(1) |
{ |
switch(DSBYTE[code]) |
{ |
case '+': |
DSBYTE[offsetMemory]++; |
break; |
case '-': |
DSBYTE[offsetMemory]--; |
break; |
case '[': |
DSDWORD[countStack] = code; |
countStack += 4; |
break; |
case ']': |
IF (DSBYTE[offsetMemory]) code = DSDWORD[countStack - 4]; |
ELSE countStack -= 4; |
break; |
case ',': |
consoleInit(); |
con_getch stdcall(); |
DSBYTE[offsetMemory] = AL; |
break; |
case '.': |
consoleInit(); |
DSBYTE[#bufferSymbol] = DSBYTE[offsetMemory]; |
con_printf stdcall (#bufferSymbol); |
break; |
case '>': |
offsetMemory++; |
break; |
case '<': |
offsetMemory--; |
break; |
case 0: |
return; |
break; |
} |
code++; |
} |
} |
void main() |
{ |
dword brainFuckCode = 0; |
word maxLoop = 1000; |
buffer = malloc(bufferSize); |
memory = malloc(memoryBrainfuck); |
stack = malloc(stackBrainFuck); |
IF(DSBYTE[I_Param]) |
{ |
IF(io.read(I_Param)) evalBrainFuckCode(EAX); |
} |
ELSE |
{ |
consoleInit(); |
con_printf stdcall ("BrainF*ck interpreter v1.05"); |
WHILE(maxLoop) |
{ |
con_printf stdcall ("\r\n\r\nEnter code: "); |
con_gets stdcall(buffer, bufferSize); |
brainFuckCode = EAX; |
con_printf stdcall ("Output: "); |
evalBrainFuckCode(brainFuckCode); |
maxLoop--; |
} |
} |
IF(initConsole) con_exit stdcall (0); |
ExitProcess(); |
} |
/programs/cmm/BrainFuck/compile.sh |
---|
0,0 → 1,5 |
#!/bin/bash |
for file in `find ./ -type f -name "*.c"` |
do |
cmm $file; |
done |
Property changes: |
Added: svn:executable |
+* |
\ No newline at end of property |