first commit

BankersAlgorithmLab/StarterCode_C/C_code/BankerQ1.c

@@ -0,0 +1,285 @@
+/**
+ * CSE lab project 3 -- C version
+ * 
+**/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+int numberOfCustomers = 0; // the number of customers
+int numberOfResources = 0; // the number of resources
+
+int *available;       // the available amount of each resource
+int **maximum;        // the maximum demand of each customer
+int **allocation;     // the amount currently allocated
+int **need;           // the remaining needs of each customer
+
+// Utility function to allocate an int vector.
+int *mallocIntVector(int size) {
+	int i, *a = malloc(sizeof(int) * size);
+	for (i = 0; i < size; i++) a[i] = 0;
+	return a;
+}
+
+// Utility function to free an int vector.
+void freeIntVector(int *a) {
+	free(a);
+}
+
+// Utility function to allocate an int matrix.
+int **mallocIntMatrix(int numRows, int numColumns) {
+	int i, j, **a = malloc(sizeof(int*) * (numRows+1));
+	for (i = 0; i < numRows; i++) {
+		a[i] = malloc(sizeof(int) * numColumns);
+		for (j = 0; j < numColumns; j++) a[i][j] = 0;
+	}
+	a[numRows] = 0;
+	return a;
+}
+
+// Utility function to free an int matrix.
+void freeIntMatrix(int **a) {
+	int i;
+	for (i = 0; a[i] != 0; i++) free(a[i]);
+	free(a);
+}
+
+/**
+ * Initializes the state of the bank.
+ * @param resources  An array of the available count for each resource.
+ * @param m          The number of resources.
+ * @param n          The number of customers.
+ */
+void initBank(int *resources, int m, int n) {
+	// Allocate memory for the vector and matrices
+	available = mallocIntVector(m);
+	need = mallocIntMatrix(n, m);
+	allocation = mallocIntMatrix(n, m);
+	maximum = mallocIntMatrix(n, m);
+
+	// TODO: initialize the numberOfCustomers and numberOfResources
+
+	// TODO: initialize the available vector
+
+}
+
+/**
+ * Frees the memory used to store the state of the bank.
+ */
+void freeBank() {
+	freeIntVector(available);
+	freeIntMatrix(need);
+	freeIntMatrix(allocation);
+	free(maximum);
+}
+
+/**
+ * Prints the state of the bank.
+ */
+void printState() {
+	int i;
+	int j;
+	// TODO: print the current state with a tidy format
+	printf("\nCurrent state:\n");
+
+	// TODO: print available
+	printf("Available:\n");
+	for (i=0; i<numberOfResources; i++){
+		printf("%d ",available[i]);  // leave a space between each print 
+	}
+	printf("\n"); // Leave a line after printing available 
+
+	// TODO: print maximum
+	printf("Maximum:\n");
+	for (i=0; i<numberOfCustomers; i++){
+		for (j=0; j<numberOfResources; j++){
+			printf("%d ", maximum[i][j]); // Leave a space bettern each print 
+		}
+		printf("\n"); // Leave a line after each customer 
+	}
+	printf("\n"); // Leave a line after printing maximum
+
+	// TODO: print allocation
+	printf("Allocation:\n");
+	for (i=0; i<numberOfCustomers; i++){
+		for (j=0; j<numberOfResources; j++){
+			printf("%d ", allocation[i][j]); // Leave a space bettern each print 
+		}
+		printf("\n"); // Leave a line after each customer 
+	} 
+	printf("\n"); // Leave a line after printing Allcoation
+
+	// TODO: print need
+	printf("Need:\n");
+	for (i=0; i<numberOfCustomers; i++){
+		for (j=0; j<numberOfResources; j++){
+			printf("%d ", need[i][j]); // Leave a space bettern each print 
+		}
+		printf("\n"); // Leave a line after each customer 
+	} 
+	printf("\n"); // Leave a line after printing need
+
+}
+
+/**
+ * Sets the maximum number of demand of each resource for a customer.
+ * @param customerIndex  The customer's index (0-indexed).
+ * @param maximumDemand  An array of the maximum demanded count for each resource.
+ */
+void setMaximumDemand(int customerIndex, int *maximumDemand) {
+	// TODO: add customer, update maximum and need
+
+}
+
+/**
+ * Checks if the request will leave the bank in a safe state.
+ * @param customerIndex  The customer's index (0-indexed).
+ * @param request        An array of the requested count for each resource.
+ * @return 1 if the requested resources will leave the bank in a
+ *         safe state, else 0
+ */
+int checkSafe(int customerIndex, int *request) {
+	// Allocate temporary memory to copy the bank state.
+	int *work = mallocIntVector(numberOfResources);
+	int **tempNeed = mallocIntMatrix(numberOfCustomers, numberOfResources);
+	int **tempAllocation = mallocIntMatrix(numberOfCustomers, numberOfResources);
+
+	// TODO: copy the bank's state to the temporary memory and update it with the request.
+
+	// TODO: check if the new state is safe
+
+	return 1;
+}
+
+/**
+ * Requests resources for a customer loan.
+ * If the request leave the bank in a safe state, it is carried out.
+ * @param customerIndex  The customer's index (0-indexed).
+ * @param request        An array of the requested count for each resource.
+ * @return 1 if the requested resources can be loaned, else 0.
+ */
+int requestResources(int customerIndex, int *request) {
+	// TODO: print the request
+
+	// TODO: judge if request larger than need
+
+	// TODO: judge if request larger than available
+
+	// TODO: judge if the new state is safe if grants this request (for question 2)
+
+	// TODO: request is granted, update state
+
+	return 1;
+}
+
+/**
+ * Releases resources borrowed by a customer. Assume release is valid for simplicity.
+ * @param customerIndex  The customer's index (0-indexed).
+ * @param release        An array of the release count for each resource.
+ */
+void releaseResources(int customerIndex, int *release) {
+	// TODO: print the release
+
+	// TODO: deal with release (:For simplicity, we do not judge the release request, just update directly)
+
+}
+
+/**
+ * Parses and runs the file simulating a series of resource request and releases.
+ * Provided for your convenience.
+ * @param filename  The name of the file.
+ */
+void runFile(const char * filename) {
+	FILE *fp = fopen(filename, "r");
+	int c = 0, i = 0, j = 0, m = 0, n = 0, bankInited = 0,
+	lineLen = 0, prevLineEnd = 0, maxLineLen = 0;
+	do {
+		if (c == '\n' || c == EOF) {
+			lineLen = i - prevLineEnd;
+			prevLineEnd = i;
+			if (lineLen > maxLineLen) maxLineLen = lineLen;
+		}
+		i++;
+	} while ((c = fgetc(fp)) != EOF);
+
+	rewind(fp);
+	lineLen++;
+	char *line = malloc(lineLen), *token;
+	i = 0;
+	while (fgets(line, lineLen, fp) != NULL) {
+		for (j = 0; j < lineLen-1; j++) 
+			if (line[j] == '\n') line[j] = '\0';
+		if (i == 0) {
+			token = strtok(line, ",");
+			token = strtok(NULL, ",");
+			n = atoi(token);
+		} else if (i == 1) {
+			token = strtok(line, ",");
+			token = strtok(NULL, ",");
+			m = atoi(token);
+		} else if (i == 2) {
+			token = strtok(line, ",");
+			token = strtok(NULL, ",");
+			int *resources = malloc(sizeof(int) * m);
+			for (j = 0; j < m; j++) {
+				resources[j] = atoi(strtok(j == 0 ? token : NULL, " "));
+			}
+			initBank(resources, m, n);
+			bankInited = 1;
+			free(resources);
+		} else {
+			int *resources = malloc(sizeof(int) * m);
+			token = strtok(line, ",");
+			if (strcmp(token, "c") == 0) {
+				int customerIndex = atoi(strtok(NULL, ","));	
+				int *resources = malloc(sizeof(int) * m);
+				token = strtok(NULL, ",");
+				for (j = 0; j < m; j++) {
+					resources[j] = atoi(strtok(j == 0 ? token : NULL, " "));
+				}
+				setMaximumDemand(customerIndex, resources);
+				free(resources);
+			} else if (strcmp(token, "r") == 0) {
+				int customerIndex = atoi(strtok(NULL, ","));	
+				int *resources = malloc(sizeof(int) * m);
+				token = strtok(NULL, ",");
+				for (j = 0; j < m; j++) {
+					resources[j] = atoi(strtok(j == 0 ? token : NULL, " "));
+				}
+				requestResources(customerIndex, resources);
+				free(resources);
+			} else if (strcmp(token, "f") == 0) {
+				int customerIndex = atoi(strtok(NULL, ","));	
+				int *resources = malloc(sizeof(int) * m);
+				token = strtok(NULL, ",");
+				for (j = 0; j < m; j++) {
+					resources[j] = atoi(strtok(j == 0 ? token : NULL, " "));
+				}
+				releaseResources(customerIndex, resources);
+				free(resources);
+			} else if (strcmp(token, "p") == 0) {
+				printState();
+			}
+		}
+		i++;
+	}
+	if (bankInited) freeBank();
+	free(line);
+	fclose(fp);
+}
+
+/**
+ * Main function
+ * @param args  The command line arguments
+ */
+int main (int argc, const char ** argv) 
+{	
+	if (argc > 1) {
+		runFile(argv[1]);	
+	}
+	return 0;
+}
+
+
+