MMSTest.java

import MMS.*;
/*
           Assignment number :10
           File Name : MMSTest.java
           Name: Ran Zaaroor
           Student ID : 209374040
           Email : Ran.zaaroor@gmail.com
       */
/* This program runs a test of the Memory Management System.
 * The test involves allocating and freeing memory blocks, and observing
 * the impact on the free list and the allocated list. If the MMS is well written,
 * it should produce exactly the same outputs as those of this test.
 * 
 * This test class provides the final test of the Memory Management System (for Homework 10).
 * Before using this test class, you must unit-test each step of your development, separately. 
 * In particular, you must unit-test every method of the List and MemorySpace classes, 
 * before executing the tests given here.
 */
public class MMSTest {
	public static void main (String[] args) {
		MemorySpace m = new MemorySpace(1000);
		System.out.println(m + "\n");
		// Expected output:
		// (0 , 1000) 
		
		// Executes 20 independent calls to the malloc(length) function.
        // For each call, creates an arbitrary length, and keeps the 20 values
        // returned by malloc in an array. 
		int[] addresses = new int[20];
		for (int i = 0; i < addresses.length; i++) {
			addresses[i] = m.malloc( (int) Math.pow(i + 2, 5) % 123);
		}
		System.out.println(m + "\n");
		// Expected output:
		// [ (959 , 41) ] 
		// [ (0 , 32) (32 , 120) (152 , 40) (192 , 50) (242 , 27) (269 , 79) (348 , 50) (398 , 9) (407 , 1) (408 , 44) (452 , 3) (455 , 79) (534 , 68) (602 , 96) (698 , 1) (699 , 68) (767 , 42) (809 , 109) (918 , 32) (950 , 9) ] 
		
		// Executes 10 independent calls to the free(address) function.
		for (int i = 0; i < addresses.length; i += 2) {
			m.free(addresses[i]);
		}
		System.out.println(m + "\n");
		// Expected output:
		// [ (959 , 41) (0 , 32) (152 , 40) (242 , 27) (348 , 50) (407 , 1) (452 , 3) (534 , 68) (698 , 1) (767 , 42) (918 , 32) ] 
		// [ (32 , 120) (192 , 50) (269 , 79) (398 , 9) (408 , 44) (455 , 79) (602 , 96) (699 , 68) (809 , 109) (950 , 9) ] 

		// Frees some more memory, and tests the defrag method.
		m.free(addresses[1]);
		m.free(addresses[3]);
		m.defrag();
		System.out.println(m);
		// Expected output:
		// [ (959 , 41) (0 , 269) (348 , 50) (407 , 1) (452 , 3) (534 , 68) (698 , 1) (767 , 42) (918 , 32) ] 
		// [ (269 , 79) (398 , 9) (408 , 44) (455 , 79) (602 , 96) (699 , 68) (809 , 109) (950 , 9) ]
	}
}