Memory Allocator (ITI8510) - Redigeerimiste ajalugu

Irve – 27. aprill 2012, kell 08:49

2012-04-27T08:49:31Z

←Vanem redaktsioon		Redaktsioon: 27. aprill 2012, kell 10:49
2. rida:		2. rida:
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until May, 18).		You have '''three weeks''' to complete the task (until May, 11).

	== Task ==		== Task ==

Irve – 20. aprill 2012, kell 08:54

2012-04-20T08:54:24Z

←Vanem redaktsioon		Redaktsioon: 20. aprill 2012, kell 10:54
2. rida:		2. rida:
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until May, 11).		You have '''three weeks''' to complete the task (until May, 18).

	== Task ==		== Task ==

Irve – 20. aprill 2011, kell 17:58

2011-04-20T17:58:30Z

←Vanem redaktsioon		Redaktsioon: 20. aprill 2011, kell 19:58
2. rida:		2. rida:
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until ~~April~~, 11).		You have '''three weeks''' to complete the task (until May, 11).

	== Task ==		== Task ==

Irve – 20. aprill 2011, kell 17:57

2011-04-20T17:57:48Z

←Vanem redaktsioon		Redaktsioon: 20. aprill 2011, kell 19:57
2. rida:		2. rida:
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until April, 29).		You have '''three weeks''' to complete the task (until April, 11).

	== Task ==		== Task ==

Irve: /* Testing */

2010-05-13T15:06:09Z

Testing

←Vanem redaktsioon		Redaktsioon: 13. mai 2010, kell 17:06
78. rida:		78. rida:
	/* copy content */		/* copy content */
	chp = mindex->loc;		chp = mindex->loc;
	i = length;		i = length - 1;
	do {		do {
	*chp++=ch;		*chp++=ch;

Irve: /* Testing */

2010-05-13T13:15:14Z

Testing

←Vanem redaktsioon		Redaktsioon: 13. mai 2010, kell 15:15
24. rida:		24. rida:
	== Testing ==		== Testing ==

	I used the following code for testing (and it works with ~~normal~~ malloc):		I used the following code for testing (and it works with standard malloc):
	<pre><nowiki>		<pre><nowiki>
	#include <stdio.h>		#include <stdio.h>

Irve: /* Testing */

2010-05-13T13:15:04Z

Testing

←Vanem redaktsioon		Redaktsioon: 13. mai 2010, kell 15:15
24. rida:		24. rida:
	== Testing ==		== Testing ==

	~~There will be a~~ testing ~~program~~ and ~~its details will arrive here when ready~~.		I used the following code for testing (and it works with normal malloc):
			<pre><nowiki>
			#include <stdio.h>
			#include <stdlib.h>
			#include <string.h>
			#include "allocator.h"

			#define MAXSTR 2
			#define MAXLEN 1024
			#define MAXCHAR 'x'
			#define MAXALL 1024

			typedef struct memloc {
			char * loc;
			int size;
			char ch;
			} Mloc;

			int depth = 0;
			Mloc mloc[MAXALL];
			Mloc * mindex = mloc;


			void writestring(char ch, char * ptr, int length) {
			ptr[length-1] = '\0';
			length--;
			while(length--) {
			*ptr++ = ch;
			}
			}

			void readstring(char ch, char *ptr, int length) {
			if(ptr[length-1] != '\0') error(EXIT_FAILURE, 0, "Problem with strings (not 0 terminated\n");
			length--;
			while (length--) {
			if(ptr++ != ch) error(EXIT_FAILURE, 0, "Problem with strings (%c != %c\n", (ptr-1), ch-1);
			}
			}

			void allocate_str() {
			int length, i;
			char ch, *chp;

			/* iterate over str length*/
			for(length=2; length <= MAXLEN; length = length << 1) {
			printf("Allocations with %d bytes\n", length);
			for (ch = 'a'; ch <= MAXCHAR; ch++) {
			mindex->loc = Malloc(length); /* store memloc*/
			if(!mindex->loc) {
			error(EXIT_FAILURE, 0, "Malloc failure\n");
			}

			/* copy content */
			chp = mindex->loc;
			i = length;
			do {
			*chp++=ch;
			} while ( i--);
			chp = '\0';

			mindex->ch = ch;
			mindex->size = length;
			mindex++;
			}
			}

			}

			void test_str() {
			Mloc * loc = mloc;

			char ch, *chp;
			int len;
			/* testing routine for all the memory */
			while(loc->loc) { /* global is 0 by default inside the array */
			ch = loc->ch;
			chp = loc->loc;
			len = loc->size -1; /* \0 skip */
			while(len) {
			if(*chp != ch) error(EXIT_FAILURE, 0, "Error with string, not %d, length %d\n", ch, loc->size);

			chp++;
			len--;
			}

			loc++;
			mindex = loc;
			}
			}

			void testmem() {
			/* allocate some stuff */

			allocate_str();


			/* some non-symmetric allocations */

			char * ptr = Malloc(2);
			writestring('x', ptr, 2);
			puts(ptr);
			readstring('x', ptr,2);
			Free(ptr);
			putchar('\n');

			test_str();


			}

			int main(int argc, char ** argv){
			testmem();
			return EXIT_SUCCESS;

			}
			</nowiki></pre>

Irve – 8. aprill 2010, kell 15:01

2010-04-08T15:01:10Z

←Vanem redaktsioon		Redaktsioon: 8. aprill 2010, kell 17:01
1. rida:		1. rida:
	{{iti8510}}		{{iti8510}}
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c (and don't forget allocator.h for compilation) for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until April, 29).		You have '''three weeks''' to complete the task (until April, 29).

Irve – 8. aprill 2010, kell 13:32

2010-04-08T13:32:10Z

←Vanem redaktsioon		Redaktsioon: 8. aprill 2010, kell 15:32
2. rida:		2. rida:
	This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c for it to be found for checking-script.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c for it to be found for checking-script.

	You have '''three weeks''' to complete the task (until 29~~. april~~).		You have '''three weeks''' to complete the task (until April, 29).

	== Task ==		== Task ==

Irve – 8. aprill 2010, kell 13:05

2010-04-08T13:05:38Z

←Vanem redaktsioon		Redaktsioon: 8. aprill 2010, kell 15:05
1. rida:		1. rida:
	{{iti8510}}		{{iti8510}}
	This task will be part of the final grading.		This task will be part of the final grading. Keep the program in directory "rtos/lab2" and name it allocator.c for it to be found for checking-script.

			You have '''three weeks''' to complete the task (until 29. april).

	== Task ==		== Task ==
19. rida:		21. rida:

	Use either first-fit or best fit algorithm. Joining of nearby blocks is highly recommended. Memory segregation is not needed (you do not have to create classes for larger and smaller allocations).		Use either first-fit or best fit algorithm. Joining of nearby blocks is highly recommended. Memory segregation is not needed (you do not have to create classes for larger and smaller allocations).

			== Testing ==

			There will be a testing program and its details will arrive here when ready.