My assignment is to develop a Linux module that uses

a proc file read request to generate a maze and send it back to the

user.

I am supposed to call my $.$c file with a python file, which is not a problem, but I am having issues with the $.$c file

Below is my code:

#include

#include

#include

#include $//$ for copy$\_$to$\_$user

#include $//$ for kmalloc and kfree

#include $//$ for get$\_$random$\_$bytes

#define PROC$\_$NAME "kruskal$\_$maze"

#define WIDTH $63//$ Maze width $($must be odd$)$

#define HEIGHT $23//$ Maze height $($must be odd$)$

#define BUF$\_$SIZE $($WIDTH $*$ HEIGHT $+$ HEIGHT$)//$ Extra space for newlines

static char $*$maze$\_$data;

$//$ Disjoint set $($Union$-$Find$)$ structures for Kruskal's algorithm

struct disjoint$\_$set $\{$

int parent;

int rank;

$\}$;

static struct disjoint$\_$set $*$sets;

$/*$ Name:

$*$ Date:

$*$ Description: This function finds the root of the disjoint set containing the given element.

$*/$

int find$($int x$)\{$

if $($sets$[$x$].$parent $!=$ x$)\{$

sets$[$x$].$parent $=$ find$($sets$[$x$].$parent$)$;

$\}$

return sets$[$x$].$parent;

$\}$

$/*$ Name:

$*$ Date:

$*$ Description: This function unites two disjoint sets.

$*/$

void union$\_$sets$($int x$,$ int y$)\{$

int rootX $=$ find$($x$)$;

int rootY $=$ find$($y$)$;

if $($rootX $!=$ rootY$)\{$

if $($sets$[$rootX$].$rank $<$ sets$[$rootY$].$rank$)\{$

sets$[$rootX$].$parent $=$ rootY;

$\}$ else if $($sets$[$rootX$].$rank $>$ sets$[$rootY$].$rank$)\{$

sets$[$rootY$].$parent $=$ rootX;

$\}$ else $\{$

sets$[$rootY$].$parent $=$ rootX;

sets$[$rootX$].$rank$++$;

$\}$

$\}$

$\}$

$/*$ Name:

$*$ Date:

$*$ Description: This function initializes the disjoint sets for Kruskal's algorithm.

$*/$

void initialize$\_$sets$($void$)\{$

int i;

sets $=$ kmalloc$($sizeof$($struct disjoint$\_$set$)*$ WIDTH $*$ HEIGHT, GFP$\_$KERNEL$)$;

for $($i $=0$; i $<$ WIDTH $*$ HEIGHT; i$++)\{$

sets$[$i$].$parent $=$ i;

sets$[$i$].$rank $=0$;

$\}$

$\}$

$/*$ Name:

$*$ Date:

$*$ Description: This function generates a maze using Kruskal's algorithm.

$*\text{'}$#$\text{'}$ is used for walls and $\text{'}\text{'}$ is used for paths.

$*/$

void generate$\_$kruskal$\_$maze$($void$)\{$

int i$,$ x$,$ y;

int total$\_$cells $=(($WIDTH $-1)/2)*(($HEIGHT $-1)/2)$;

int $*$edges$,$ edge$\_$count $=0$;

$//$ Initialize maze with walls

memset$($maze$\_$data, $\text{'}$#$\text{'},$ BUF$\_$SIZE$)$;

for $($y $=1$; y $<$ HEIGHT; y $+=2)\{$

for $($x $=1$; x $<$ WIDTH; x $+=2)\{$

maze$\_$data$[$y $*$ WIDTH $+$ x$]=\text{'}\text{'}$; $//$ Cells

$\}$

$\}$

$//$ Generate all potential edges $($vertical and horizontal walls$)$

edges $=$ kmalloc$($sizeof$($int$)*($WIDTH $*$ HEIGHT $*2),$ GFP$\_$KERNEL$)$;

for $($y $=1$; y $<$ HEIGHT; y $+=2)\{$

for $($x $=1$; x $<$ WIDTH; x $+=2)\{$

if $($x $+2<$ WIDTH$)$ edges$[$edge$\_$count$++]=($y $*$ WIDTH $+$ x$)<<16|($y $*$ WIDTH $+$ x $+2)$;

if $($y $+2<$ HEIGHT$)$ edges$[$edge$\_$count$++]=($y $*$ WIDTH $+$ x$)<<16|(($y $+2)*$ WIDTH $+$ x$)$;

$\}$

$\}$

$//$ Randomly shuffle the edges

for $($i $=0$; i $<$ edge$\_$count; i$++)\{$

int j;

get$\_$random$\_$bytes$($&j$,$ sizeof$($j$))$;

j $=$ j $\%$ edge$\_$count;

if $($j $<0)$ j $=-$j;

$//$ Swap edge i and edge j

int temp $=$ edges$[$i$]$;

edges$[$i$]=$ edges$[$j$]$;

edges$[$j$]=$ temp;

$\}$

$//$ Apply Kruskal's algorithm

for $($i $=0$; i $<$ edge$\_$count; i$++)\{$

int cell$1=$ edges$[$i$]>>16$;

int cell$2=$ edges$[$i$]$ & $0$xFFFF;

if $($find$($cell$1)!=$ find$($cell$2))\{$

union$\_$sets$($cell$1,$ cell$2)$;

int wall $=($cell$1+$ cell$2)/2$;

maze$\_$data$[$wall$]=\text{'}\text{'}$; $//$ Knock down the wall

$\}$

$\}$

$//$ Add newline characters for console$-$friendly display

for $($y $=0$; y $<$ HEIGHT; y$++)\{$

maze$\_$data$[$y $*($WIDTH $+1)+$ WIDTH$]=\text{'}$

$\text{'}$; $//$ Insert newline after each row

$\}$

kfree$($edges$)$;

$\}$

$/*$ Name:

$*$ Date:

$*$ Description: This function is called when the proc file is read.

$*$ It copies the maze data into the user buffer.

$*/$

ssize$\_$t proc$\_$read$($struct file $*$file$,$ char $\_\_$user $*$buf$,$ size$\_$t count, loff$\_$t $*$pos$)\{$

ssize$\_$t len $=$ BUF$\_$SIZE;

if $(*$pos $>=$ len $||$ copy$\_$to$\_$user$($buf$,$ maze$\_$data, len$))\{$

return $0$; $//$ End of file

$\}$

$*$pos $+=$ len;

return len;

$\}$

$/*$ Name:

$*$ Date:

$*$ Description: This function is called when the module is loaded.

$*$ It creates the proc file and generates the maze.

$*/$

static int $\_\_$init maze$\_$init$($void$)\{$

maze$\_$data $=$ kmalloc$($BUF$\_$SIZE, GFP$\_$KERNEL$)$;

if $(!$maze$\_$data$)\{$

return $-$ENOMEM;

$\}$

$//$ Initialize disjoint sets

initialize$\_$sets$()$;

$//$ Generate maze using Kruskal's algorithm

generate$\_$kruskal$\_$maze$()$;

$//$ Create proc file

proc$\_$create$($PROC$\_$NAME, $0,$ NULL, &proc$\_$file$\_$ops$)$;

printk$($KERN$\_$INFO "Kruskal Maze module loaded, $/$

What do I need to do to fix the code to work properly?