chrisdunelm / dotnetanywhere Goto Github PK
View Code? Open in Web Editor NEWSmall .NET interpreter
License: MIT License
Small .NET interpreter
License: MIT License
Was porting over my C# benchmark: https://github.com/zezba9000/RayTraceBenchmark
But I run into bad memory access errors that i'm pretty sure are coming from the heap.
I was unable to find the location of the issue in the C code. I can post up the code that fails if anyone still cares about this project anymore?
The inevitable F# questions :)
Thanks!
I've pushed changes to DNA, please see my fork:
https://github.com/amerkoleci/DotNetAnywhere
More .NET 4.0 support.
Improved generics and heap support.
Android support.
Multi dimensional array.
PInvoke on windows with better function invocation.
Improved reflection.
Clear code and fix some op code issues.
Resx file support.
Improved Linq and add support for nUnit.
Could anybody take care of my changes and maybe revive this project?
I have some null references once GarbageCollect gets called, could take look please?
Hi,
First of all, congrats on your so tiny but nice looking .NET framework.
I'm trying to integrate it into my project and make it run on Android using the Android NDK.
When i compile with VS 2012 or android NDK, i'm getting those issues and hopefully you can help me out.
Heap.c
// Use pSync to point to next entry in this linked-list.
(tHeapEntry*)(pNode->pSync) = pToDelete;
pToDelete = pNode;
MetaData.c in MetaData_DecodeSigEntry
unsigned int MetaData_DecodeSigEntry(SIG pSig) {
unsigned char a,b,c,d;
a = *((unsigned char)*pSig)++;
if ((a & 0x80) == 0) {
// 1-byte entry
return a;
}
// Special case
if (a == 0xff) {
return 0;
}
b = *((unsigned char*)*pSig)++; <!--- error: lvalue required as incremental operand -->
if ((a & 0xc0) == 0x80) {
// 2-byte entry
return ((int)(a & 0x3f)) << 8 | b;
}
// 4-byte entry
c = *((unsigned char*)*pSig)++; <!--- error: lvalue required as incremental operand -->
d = *((unsigned char*)*pSig)++; <!--- error: lvalue required as incremental operand -->
return ((int)(a & 0x1f)) << 24 | ((int)b) << 16 | ((int)c) << 8 | d;
}
Could you help me out here?
Thanks,
Amer Koleci
When trying to load the website, it just says "Not Found".
I thought the author of DNA might know the answer to this... I'd like to run some untrusted .NET code in a sandbox without a browser and thought DNA's progeny might help... but can Blazor's interpreter be used without a browser? Does it even have a name?
I get an error: "Bad table index:0x7a"
https://dropmefiles.com/2MQwP this is link to assembly
Hey Chris!
I was really inspired by your discourse "So you want to create your own .NET runtime?" so I want to reimplement it in Rust. But it would be much easier if you share your net-demo
project.
Could you do it, please? Because it's much nicer to have the simplified example rather than learning this repo or CLI specification.
Thank you.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.