Online UNIX Utility Homework Help By Adept Tutors
A UNIX Utility That Inspects System and Produces A summarized Report
Our journey through the operating system starts in user space, outside the kernel. In this project, we’ll implement a UNIX utility that inspects the system it runs on and creates a summarized report for the user. If you’ve ever used the top command from a shell, our program will be somewhat similar. To give you an idea of how your program will work, here’s a quick example:
Hostname: snuggly-bunny | Kernel Version: 5.4.15
CPU: AMD EPYC Processor (with IBPB), Processing Units: 2
Uptime: 3 days, 23 hours, 51 minutes, 19 seconds
Load Average (1/5/15 min): 0.05 0.02 0.00
CPU Usage: [######--------------] 30.0%
Memory Usage: [##################--] 90.6% (14.5 / 16.0 GB)
Tasks: 101 total
2 running, 0 waiting, 98 sleeping, 1 stopped, 0 zombie
||Task Name |
To get this information, you will use the proc, the process information pseudo-filesystem. While there are other ways to get the information displayed above, you are restricted to using procin this homework . There are two great resources for finding out what information is available in proc:
● Simply cd /proc in your shell and then run lsto view the files. You’ll see process IDs and several other virtual files that are updated dynamically with system information. Each line shown above in the process listing corresponds to a numbered directory in /proc.
● Check out the man page: man procfs. (If this doesn’t work, you probably need
to install the man pages: pacman -Sy man-pages). The manual has a complete description of every file and directory stored under /proc.
For a quick example, try running cat /proc/uptime. You’ll see the number of seconds the system has been running printed to the terminal.
In this homework , you will get experience working with:
● The open(), read(), and close()system calls for reading file data
● Tokenizing text files
● opendirand readdirfunctions for listing directory contents
● Argument parsing with getopt
● Load averages, calculating CPU usage, and Linux tasks
● Text-based UIs with ncurses
The program supports a few command line options. We’ll let the program do the talking by printing usage information (-h option):
[magical-unicorn:~/P1-malensek]$ ./inspector -h
Usage: ./inspector [-ho] [-i interval] [-p procfs_dir]
|* -i interval
||update interval (default: 1000ms)
|* -p procfs_dir
||expected procfs mount point
||in one-shot mode (no curses or
Pay particular attention to the -pflag. This allows us to change the directory where procis mounted (/procby default). We will use this option to test your code with our own pre-populated copy of proc.
Populating the Output
Your main responsibility in this project is implementing a variety of procfs-related functions (prefixed pfs_*) to retrieve the required information. The UI for the program was written using the ncurseslibrary – assuming your pfs_*functions work properly, you shouldn’t need to worry about modifying the UI (although you are welcome to do so). In ‘one-shot’ mode, the simple UI is disabled and printed directly to the terminal instead.
Here’s some tips to guide your implementation:
● Remember to close the files/directories you open! If too many file descriptors are left open, subsequent open calls will fail.
● Truncate strings that are too long to display (applicable to the process and user names). Process names should be no longer than 25 characters and usernames must be no longer than 15 characters. Otherwise, you can run into memory issues.
● Use the totaland availablememory when reporting memory usage.
● If you need to store a list of items that you don’t know the size of ahead of time, realloccan be a good option.
When calculating uptime, don’t report years, days, or hours if their respective values are 0. If a machine has just booted up, you’ll display Uptime: 0 minutes, 42
seconds, for example (note that we’re onlyshowing the minutes and seconds fields).
The fields you need to support are:
CPU usage is calculated by sampling over a period of time, i.e., the CPU was active for 70% of one second. You will record the CPU usage, sleep for one second (this is handled by the UI code), and then get a second reading to determine the usage percentage. The CPU metrics in /proc/statwill add up to 100% because idle time is included. You’ll need to track idle time separately, so the calculation will look something like:
1 - ( (idle2 - idle1) / (total2 - total1) )
If the CPU usage percentage is NaN (not a number), or you encounter errors performing the calculation, report 0%. Since this calculation requires two samples, your function should take the previous sample as one of its arguments.
You should support all of the process states listed in the procman pages. Additionally, for our purposes, we will consider ‘idle’ processes equivalent to ‘sleeping.’ To build the “running, waiting, sleeping, …” output, the specific state flags you’ll be interested in are R, S, I, D, Z, T, and t.
Idle and sleeping processes are not shown in the program output.
You’ll notice that procdoesn’t contain information about the username associated with running processes, but it doesprovide their ID numbers (UIDs). To map UIDs to usernames, you will need to parse the contents of /etc/passwd. While there are functions that will do this for you, such as getpwuid, you are required to build your own lookup functionality. (Note: getpwuidcan seemingly leak memory in certain situations, so we’re avoiding it here).
Restrictions: you may use any standard C library functionality. External libraries are not allowed unless permission is granted in advance. Your code must compile and run on your VM set up with Arch Linux as described in class – failure to do so will receive a grade of 0.
While there are several ways to retrieve the system information displayed by your project, you must retrieve the data from /proconly.
One of the major components of this homework is reading and parsing text files. To read the files, you are required to use the readsystem call instead of the fancier C library functions like fgets, getline, scanf, etc. You also shouldn’t use getpwuid or strtok.
Rationale: we’re using readhere to get familiar with how I/O works at a lower level. You will need to be able to understand readfor subsequent homework . As for strtok, it has several pitfalls (including not being reentrant or thread safe) that make it a bad choice. You can either use strsepor the next_tokenimplementation provided in class.
Failure to follow these guidelines will result in severe deductions (at least 10 points) or a 0.
Testing Your Code
Check your code against the provided test cases. You should make sure your code runs on your Arch Linux VM. We’ll have interactive grading for projects, where you will demonstrate program functionality and walk through your logic.
Submission: submit via GitHub by checking in your code before the project deadline.