mosix lab lewy

//Piotr Holewa

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

//zalozenie n podzielne przez k bez reszty
//sume posylamy do rodzica
//sume w potomku
int ciag(int n,  int k);
int sum = 0;

int oblicz(int i, int n)
{
	int a = n*n*n;
	int b = ((i*i) - 12);
	int licznik = b*b*b;
	int mianownik = a*i*i*i;
	return licznik/mianownik;
}

int main(int argc, char **argv)
{
	int n = atoi(argv[1]);

	int k = atoi(argv[2]);

	int i = 1;
	int j = 0;

	int suma = 0, e = 0, tmp = 0;

	int potok[2];
	pid_t pid;

	if(pipe(potok) == -1)
	{
		perror("blad potoku");
		exit(EXIT_FAILURE);
	}

	while(i <= n)
	{
		for(j=0; j<k; j++)
		{
			if(i > n)
				break;
			pid = fork();

			if(pid == -1)
			{
				perror("blad fork'a");
				exit(EXIT_FAILURE);
			}

			if(pid == 0)
			{
				e = oblicz(i, n);
				write(potok[1], &e, sizeof(e));
				exit(EXIT_SUCCES);
			}
			else
			{

			}
			i++;

		}
	}

	close(potok[1]);
	while(read(potok[0], &tmp, sizeof(e)))

		suma += tmp;
		printf("Suma = %d", suma);
		return EXIT_SUCCESS;