OSDev.org

Combuster wrote:It's a donation, not a hired job. At least he's trying to give him his pennies worth, and if I wasn't epicly busy I would've done that it for that price (after all, someone else would need a stack too in due time).

Brynet-Inc wrote:

turdus wrote:But TCP is, and TCP is build on top of UDP, ICMP and ARP.

No.

TCP and UDP are independent protocols, you do not need to implement both, but you should for sake of completness.

Brynet-Inc wrote:I still say this bounty is rather absurd and poorly thought out, this supposed payout of $500 is hardly worth the effort of writing an entirely TCP/IP stack in assembly.. especially in the time allotted.

turdus wrote: For the OP:
From another thread, there was a link to a promo video of generating primes (ca. 10000 primes in 10 secs on a 1.5GHz). You are doing it wrong.

Seriously ReturnInfinity, what kind of crappy prime generating algorithm did you use? I wrote a small unoptimized C code to generate primes, and tested on a 1733Mhz machine (that was the closest to your's I could get) in a multitask environment (linux). It took less than a sec to generate 10 000 primes. Within 16 secs I could generate 100 000. And it can be even faster if rewritten and optimized in assembly and run alone on a bare metal node. Do you need the algorithm? It would look better on promo video, don't you think?
I won't write TCP/IP stack for your OS, but I can give you the C code (no more than 40 lines) or rewrite it in x86_64 asm if you like.

guyfawkes wrote:I agree, for example you may not have the right Ethernet card and need to buy one etc.

turdus wrote:No, not only for completeness. As I wrote: "The point is, you'll need to implement datagram service anyway, even if you don't want UDP. That's all I say."

guyfawkes wrote:From my understanding, it's written in C

Kevin wrote:...that may actually take more effort than the actual UDP implementation itself.

Kevin wrote:You don't strictly need UDP for it. It's also defined for TCP, even though it's rather uncommon to use that.

turdus wrote:For the OP:
From another thread, there was a link to a promo video of generating primes (ca. 10000 primes in 10 secs on a 1.5GHz). You are doing it wrong.

Seriously ReturnInfinity, what kind of crappy prime generating algorithm did you use? I wrote a small unoptimized C code to generate primes, and tested on a 1733Mhz machine (that was the closest to your's I could get) in a multitask environment (linux). It took less than a sec to generate 10 000 primes. Within 16 secs I could generate 100 000. And it can be even faster if rewritten and optimized in assembly and run alone on a bare metal node. Do you need the algorithm? It would look better on promo video, don't you think?
I won't write TCP/IP stack for your OS, but I can give you the C code (no more than 40 lines) or rewrite it in x86_64 asm if you like.

ReturnInfinity wrote: The code for what was shown in the video is here: http://cl.ly/CSCE

If you have something better then I would gladly use it. The code above was from before I implemented newlib to get the standard ANSI C calls.

As for hardware none should be required. BareMetal OS has drivers for the Intel 8254x (E1000) so the entire dev setup can be virtual. Personally I use VirtualBox.

There is no set date to have this completed by and any help would be appreciated. I'm going to start looking into it myself as well.

-Ian

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

//global variables
long *primes=NULL;      //array to hold the primes
long num_primes=0;      //number of elements in primes array

void is_prime(long n)
{
        long prime=0,i,third;
        //sort out even numbers (sanity check)
        if(n%2==0) return;
        //shortcut for the first 4 primes
        if(n==1 || n==3 || n==5 || n==7) prime=n;
        else {
                prime=n; third=n/3;
                for(i=1;i<num_primes && primes[i]<=third;i++) if(n%(primes[i])==0) { prime=0; break; }
        }
        //if it's a prime, append it to our list
        if(prime){
                primes=realloc(primes,(num_primes+1)*sizeof(long));
                primes[num_primes]=prime;
                num_primes++;
        }
}

//the main function
int main(int argc,char **argv)
{
        long argument,i;
        time_t s=0,e=0;
        FILE *f;
        //if we have an argument then use it, if not, ask for it
        if(argv[1]!=NULL) argument=strtol(argv[1],NULL,10);
        else {
                printf("Number of primes to generate? ");
                scanf("%ld",&argument);
        }
        printf("Generating primes... "); fflush(stdout);
        time(&s);
        //check every odd number
        for(i=1;num_primes<argument;i+=2) is_prime(i);
        time(&e);
        printf("OK (%d secs)\n",(int)(e-s));
        //save primes for later
        f=fopen("primes.txt","w+");
        for(i=0;i<num_primes;i++) fprintf(f,"%ld\n",primes[i]);
        fclose(f);
}

Thomas wrote:500$ is a lot of money for someone in India.