Lab46 Wiki

User Tools

Site Tools

You are here: start » haas » fall2017 » discrete » projects » bdt1
haas:fall2017:discrete:projects:bdt1

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
haas:fall2017:discrete:projects:bdt1 [2017/10/02 15:23] – [Task] wedgehaas:fall2017:discrete:projects:bdt1 [2017/10/19 14:28] (current) – wedge
Line 3: Line 3:
 <WRAP><fs 150%>CSCS2330 Discrete Structures</fs></WRAP> <WRAP><fs 150%>CSCS2330 Discrete Structures</fs></WRAP>
 </WRAP> </WRAP>
- 
-~~TOC~~ 
  
 ======Project: Binary Data Tool (bdt1)====== ======Project: Binary Data Tool (bdt1)======
Line 55: Line 53:
  
 So these **bdt#** projects are a specific foray into this special case study of writing our own custom tool that can get a certain job done, faster. Reducing OUR particular need to keep tabs on something the computer is very much better at doing. So these **bdt#** projects are a specific foray into this special case study of writing our own custom tool that can get a certain job done, faster. Reducing OUR particular need to keep tabs on something the computer is very much better at doing.
-=====Experiencing xxd===== 
-If we don't know what it is we are implementing, we won't be all that successful. So, here's a quick overview of the **xxd(1)** tool we will be simulating aspects of; first up, a plain text look at a data file we will be processing: 
  
-<cli> +=====Implementation Restrictions=====
-lab46:~/src/discrete/bdt1$ cat sample0.txt +
->ABCDEFGHIJKLMNOPQRSTUVWXYZ< +
-[abcdefghijklmnopqrstuvwxyz] +
-01:              BINARY +
-01234567:        OCTAL +
-0123456789:      DECIMAL +
-0123456789ABCDEF:HEXADECIMAL +
-)!@#$%^&*( +
-. +
-lab46:~/src/discrete/bdt1$  +
-</cli>+
  
-Note how it is filled with ASCII text- many of our recognizable symbols we use when using a text editor.+As our goal is not only to explore the more subtle concepts of computing but to promote different methods of thinking (and arriving at solutions seemingly in different ways), one of the themes I have been harping on is the stricter adherence to the structured programming philosophy. It isn't just good enough to be able to crank out a solution if you remain blind to the many nuances of the tools we are using, so we will at times be going out of our way to emphasize focus on certain areas that may see less exposure (or avoidance due to it being less familiar).
  
-But, to illustrate how text is just a form of binary, witness what we are shown when we peel away a layer, and view the binary data (represented in hex for convenience) of that same file:+As such, the following implementation restrictions are also in place:
  
-<cli> +  * use any **break** or **continue** statements sparingly. I am not forbidding their use, but I also don't want this to turn into a lazy solution free-for-all. I am letting you use them, but with **justification**. 
-lab46:~/src/discrete/bdt1$ xxd sample0.txt sample1.txt +  * absolutely **NO** infinite loops (**while(1)**). 
-0000000: 3e41 4243 4445 4647 4849 4a4b 4c4d 4e4f  >ABCDEFGHIJKLMNO +  * no forced redirection of the flow of the process (no seeking to the end of the file to grab a max size only to zip back somewhere else: deal with the data in as you are naturally encountering it). 
-0000010: 5051 5253 5455 5657 5859 5a3c 0a5b 6162  PQRSTUVWXYZ<.[ab +  * All "arrays" must be declared and referenced using ONLY pointer notation, NO square brackets. 
-0000020: 6364 6566 6768 696a 6b6c 6d6e 6f70 7172  cdefghijklmnopqr +  * **NO** logic shunts (ie having an if statement nested inside a loop to bypass an undesirable iteration)- this should be handled by the loop condition!
-0000030: 7374 7576 7778 797a 5d0a 3031 3a09 0920  stuvwxyz].01:.. +
-0000040: 4249 4e41 5259 0a30 3132 3334 3536 373a  BINARY.01234567: +
-0000050: 0920 4f43 5441 4c0a 3031 3233 3435 3637  . OCTAL.01234567 +
-0000060: 3839 3a09 2044 4543 494d 414c 0a30 3132  89:. DECIMAL.012 +
-0000070: 3334 3536 3738 3941 4243 4445 463a 4845  3456789ABCDEF:HE +
-0000080: 5841 4445 4349 4d41 4c0a 2921 4023 2425  XADECIMAL.)!@#$% +
-0000090: 5e26 2a28 0a2e 0a                        ^&*(... +
-lab46:~/src/discrete/bdt1$  +
-</cli>+
  
-The EXACT same file, with the EXACT same arrangement of data, only represented more as the computer looks at it (sequentially, one byte immediately following the next).+Basically, I am going loosen my implementation restriction grip for this project: I would like you NOT to disappoint me. Write clean, effective code... show me that you have learned something from this class.
  
-The output of **xxd(1)** has 3 distinct sections: +=====Program Specifications===== 
-  - the address or offset (from the start of file). This is a hexadecimal address, starting at 0 (beginning of the file), and increments according to the number of bytes displayed. You'll notice that there are (at maximum) the same number of bytes on each line, so the offset increments by that amount with each new line it displays. +For this project, I am looking for a minimum subset of functionality. But there are many potential improvements that can be made, which I would consider for bonus points.
-  - the actual data (represented in hex); here we see 8 columns of hex values, grouped together in pairs of two bytes (other hex viewers may separate into 16 columns, isolating each byte for better viewing). +
-  - the ASCII rendering (far right field); if we are viewing an ASCII file, we will easily see the ASCII contents of this file. If we are viewing a non-ASCII file, we may still see random ASCII values, but that is just that the value stored in the particular byte maps to that ASCII value, and should NOT be considered actual ASCII data.+
  
-This is one of those conceptual roadblocks many develop- they think that binary is somehow more complicated than it is, and create all sorts of obstacles to effective access. Here we will try to break down some of those walls, because this is really important stuff to know.+====Basic functionality==== 
 +Your program should:
  
-Your task is to write a C program that takes a file name as a command-line argument, opens that file, reads its contents, and displays that data to the screen in the manner that the **xxd(1)** tool does in the above example (note that while the **xxd(1)** tool has other features, we are not looking to implement them; only this simple rendering view).+  * accept two files as command-line arguments (these would be the files you'd like to compare) 
 +  * display the address/offset on the left just as **xxd(1)** does 
 +  * display the row preceding the first identified byte of difference for the first, then second file 
 +  * display the row containing (and coloring/highlighting) the identified byte of difference for the first, then second file 
 +  * display the row following the identified byte of difference for the first, then second file
  
-Your program must:+The focus is the FIRST byte of difference. The algorithm could get considerably trickier when dealing with additional differences (especially if extra bytes are involved in the difference).
  
-  * Require the user supply a file via the command-line +====Bonus opportunities==== 
-    * if the file specified does not exist/cannot be opened, display an error message and exit. +Some ideas to enhance your program for potential bonus points:
-      * error message should be of the form: **Error: Could not open 'filename' for reading!** +
-        * Where **filename** is the name of the file specified on the command-line (make sure the quotes surround it in the output). +
-    * no further processing should be done if the file is not able to be accessed. +
-  * Detect the current size of the terminal (see "Detecting Terminal Size" section below), and record the lines and columns into variables for use in your program. +
-    * If the terminal your program is being run in is **less than** 80 columns, display an error message and exit. +
-      * error message should be of the form: **Error: Terminal width is less than 80 columns!** +
-      * Your program will only be displaying to an area up to 80 characters wide, so a wider terminal will not influence program output. +
-    * Similarly, if the number of lines in the terminal is **less than** 20, display a similar error message and exit. +
-      * error message should be of the form: **Error: Terminal height is less than 20 lines!** +
-      * Unlike the width, the height can impact program output (taller terminals, if not otherwise throttled by a second command-line argument, can auto-expand if there is more room and data to display). +
-  * The second command-line argument is a sizing throttle (controlling the number of lines your program will display). If no argument, or a **0** is given, assume autosize (use the detected height to be your maximum in your calculations). +
-  * Each row will display: +
-    * a 7-digit hex offset (referring to the first data byte on a given line) +
-    * followed by a colon and a single space +
-    * then eight space separated groups of two bytes +
-    * however you arrive at it: two total spaces following the hex bytes (again, see output example) +
-    * a 16-character ASCII representation field (no separating spaces between the values) +
-      * all printable characters should be displayed. +
-      * all non-printable (and various whitespace) characters should be substituted with a '**.**' +
-    * A newline will be the last character on each line. +
-  * The hex values and rendered ASCII displayed will be sourced from the file specified on the command-line. While the target files for this project are less than 512 bytes, your program should be able to handle larger and smaller files, and update its display accordingly. +
-  * If a line throttle is given, your program is to stop output of data and ASCII rendering at that line, once it completes. +
-  * Once the data in the file has been exhausted, you need to wrap up as appropriate; finish the current line (even if you have to pad spaces), display the corresponding ascii field (padding spaces as appropriate), and display the closing footer. +
-  * Don't forget to **fclose()** any open file pointers! And **free()** any **malloc()**'ed or **calloc()**'ed memory. +
-  * If provided (via command-line arguments), highlight the offset field and the specified address + length (see below). +
-    * If the last pair is not complete (ie only an address given), ignore that request.+
  
-=====Detecting Terminal Size===== +  * accept some sort of mode argument, a number, that would alter the behavior of your tool. Such as: 
-To detect the current size of your terminal, you may make use of the following code, provided in the form of a complete program for you to test, and then adapt into your code as appropriate.+    * 0: display as project specifies 
 +    * 1: display on separate lines, vs. the same line of difference (first file, newline, second file). 
 +    * additional modes as justified 
 +  * accept numeric offset arguments, 1 for each file, to instruct your tool where they should start reading/comparing 
 +    * this would be a way for your tool to natively support "additional" points of difference without needing an overly-complicated algorithm. You would be able to specify the starting points, from visual inspection on previous runs of the tool or **xxd(1)**, which would add considerable debugging value. 
 +    * this would likely require displaying the pertinent offsets for each file.  
 +  * you could endeavor to explore some algorithmic enhancements to automatically detect additional points of difference. Note that this could be rather fragile, depending on the identified differences.
  
-It makes use of a pre-existing **structure**, which when properly populated with an **ioctl()** call, you have the information you need to proceed (we're just using it to retrieve information to help us on our program). +=====Output===== 
- +A basic mockup (pictures coming soon) of desired output:
-<code c> +
-#include <stdio.h> +
-#include <stdlib.h> +
-#include <sys/ioctl.h> +
- +
-int main (void) +
-{ +
-    struct winsize terminal; +
-    ioctl  (0, TIOCGWINSZ, &terminal); +
- +
-    printf ("lines:   %d\n", terminal.ws_row); +
-    printf ("columns: %d\n", terminal.ws_col); +
-    return (0); +
-} +
-</code> +
- +
-An **ioctl(2)** is a method (and system/library call) for manipulating underlying device parameters of special files (for the UNIX people: everything is a file, including your keyboard, and **terminal screen**). We are basically querying the screen (or accessing lower level information made possible by communicating with the driver of the device) to obtain some useful information. If you've ever wondered how drivers work- this **ioctl()** functionality can be rather central to the whole process (basically, reading or writing bytes at specific memory addresses). +
- +
-Here we are accessing the information on our terminal file, retrieving the width and height so that we can make use of them productively in our programs. +
- +
-Compile and run the above code to see how it works. Try it in different size terminals. Then incorporate the logic into your hex viewer for this project. +
- +
-=====Selection highlighting===== +
-The following adds a nice visual twist to things: +
- +
-  * Enhance the program to accept pairs of additional values (offset followed by its length), where each offset through length will be colored using ANSI text escape sequences (for simplicity, you may highlight using the same color). +
-  * For any line containing this colorized text, highlight the address in bold white. +
- +
-====Sample output==== +
- +
-As an example, running the program with the following arguments could produce results like this: +
- +
-{{:haas:fall2017:discrete:projects:bdt1.png?640|}} +
- +
-====ANSI escape sequences for color==== +
-This probably isn't very portable, and depending on the terminal, it may not work for some people. +
- +
-It may be most convenient to set up preprocessor #define statements near the top of your code, as follows: +
- +
-<code c> +
-#define  ANSI_RESET             "\x1b[0m" +
-#define  ANSI_BOLD              "\x1b[1m" +
-#define  ANSI_FG_BLACK          "\x1b[30m" +
-#define  ANSI_FG_RED            "\x1b[31m" +
-#define  ANSI_FG_GREEN          "\x1b[32m" +
-#define  ANSI_FG_YELLOW         "\x1b[33m" +
-#define  ANSI_FG_BLUE           "\x1b[34m" +
-#define  ANSI_FG_MAGENTA        "\x1b[35m" +
-#define  ANSI_FG_CYAN           "\x1b[36m" +
-#define  ANSI_FG_WHITE          "\x1b[37m" +
-#define  ANSI_BG_BLACK          "\x1b[40m" +
-#define  ANSI_BG_RED            "\x1b[41m" +
-#define  ANSI_BG_GREEN          "\x1b[42m" +
-#define  ANSI_BG_YELLOW         "\x1b[43m" +
-#define  ANSI_BG_BLUE           "\x1b[44m" +
-#define  ANSI_BG_MAGENTA        "\x1b[45m" +
-#define  ANSI_BG_CYAN           "\x1b[46m" +
-#define  ANSI_BG_WHITE          "\x1b[47m" +
-</code> +
- +
-To use, you output them: +
- +
-<code> +
-fprintf(stdout, ANSI_FG_GREEN); +
-fprintf(stdout, "This text is green\n"); +
-fprintf(stdout, ANSI_RESET); +
-</code> +
- +
-You have to remember to turn the color or setting off (resetting it) to revert back to the original color. +
- +
-You can mix and match as well: +
- +
-<code> +
-fprintf(stdout, ANSI_FG_YELLOW); +
-fprintf(stdout, ANSI_BG_BLUE); +
-fprintf(stdout, ANSI_BOLD); +
-fprintf(stdout, "This text is bold yellow on blue\n"); +
-fprintf(stdout, ANSI_RESET); +
-</code> +
- +
-While there are 8 available foreground colors, bolding can double that range to 16. +
- +
-=====Implementation Restrictions===== +
- +
-As our goal is not only to explore the more subtle concepts of computing but to promote different methods of thinking (and arriving at solutions seemingly in different ways), one of the themes I have been harping on is the stricter adherence to the structured programming philosophy. It isn't just good enough to be able to crank out a solution if you remain blind to the many nuances of the tools we are using, so we will at times be going out of our way to emphasize focus on certain areas that may see less exposure (or avoidance due to it being less familiar). +
- +
-As such, the following implementation restrictions are also in place: +
- +
-  * absolutely **NO** switch/case, **continue**, **break**, nor other non-structured program flow alteration (jumps, gotos, etc.) +
-  * absolutely **NO** infinite loops (**while(1)**, which are more-or-less unviable anyway if you cannot **break** out of them). +
-  * no forced redirection of the flow of the process (no seeking to the end of the file to grab a max size only to zip back somewhere else: deal with the data in as you are naturally encountering it). +
-  * With the exception of any negative values, all numbers should be transacted in hexadecimal (as in the values you assign and compare and manipulate in your code). +
-  * No line must exceed 80 characters in width. +
-  * All "arrays" must be declared and referenced using ONLY pointer notation, NO square brackets. +
-  * For the highlighted address and lengths, store them in an array of structs (containing the //address// and //length// members). +
-  * **NO** logic shunts (ie having an if statement nested inside a loop to bypass an undesirable iteration)- this should be handled by the loop condition!+
  
 +<cli>
 +lab46:~/src/discrete/bdt1$ ./bdt1 in/sample0.txt in/sample0.off
 +0000090: 0011 2233 4455 6677 8899 aabb ccdd eeff | 0011 2233 4455 6677 8899 aabb ccdd eeff
 +00000a0: 55aa 66bb 0401 77cc 88dd 99ee aaff 89af | 55aa 66bb 0501 77cc 88dd 99ee aaff 89af
 +00000b0: 9988 7766 5544 3322 1100 ffee ddcc bbaa | 9988 7766 5544 3322 1100 ffee ddcc bbaa
 +lab46:~/src/discrete/bdt1$ 
 +</cli>
 =====Submission===== =====Submission=====
 To successfully complete this project, the following criteria must be met: To successfully complete this project, the following criteria must be met:
haas/fall2017/discrete/projects/bdt1.1506957833.txt.gz · Last modified: 2017/10/02 15:23 by wedge

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki