In other words, the function receives a format (const char *format) and a list of arguments (the magic of variadic functions). So printf inside, take the string format and search for specific patterns, then the pattern that was found it is passed to other function that prints the match pattern
That image shows specifiers that we can use in the printf. In this case, _printf just allow specifiers like
| Specifiers | Functions | Description |
|---|---|---|
| s | print_string | print a string |
| c | print_char | print just a char |
| i | print_integer | print a number in base 10 |
| d | print_integer | print a number in base 10 |
| p | print_pointer | print a memory address in base 16 lowercase |
| b | print_binary | print a number in base 2 |
| x | print_hexadecimal_low | print a number in base 16 lowercase |
| X | print_hexadecimal_upp | print a number in base 16 uppercase |
| o | print_octal | print a number in base 8 |
| R | print_rot | print a string encoded in rot13 format |
These 3 functions are the bases for this project:
- Printf: Is the frontend of all the algorithm, so is the prototype, and just receive the variables
- Handler: Is the controller for the string and the formats, and also does the counter for the numbers of bytes that are printing
- Percent handler: Compare a list of possible specifiers with the current pattern, and return the corresponding function
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent