feat: reformatted code

This commit is contained in:
2021-02-10 18:56:47 +01:00
parent 2b295db30a
commit 90ef4522ca
16 changed files with 47 additions and 38 deletions

View File

@@ -13,7 +13,7 @@
/*
* Integer to string
*/
void print_int(u32 value, u32 width, char* buf, u32 *ptr, u8 base) {
void print_int(u32 value, u32 width, char *buf, u32 *ptr, u8 base) {
// u32 in binary is 32 digits, so never longer than 33 digits
char msg[33];
itoa(value, msg, base);
@@ -53,13 +53,13 @@ u32 vasprintf(char *buf, const char *fmt, va_list args) {
break;
}
case 'c':
buf[ptr++] = (char)va_arg(args, int);
buf[ptr++] = (char) va_arg(args, int);
break;
case 'x':
print_int((u32)va_arg(args, u32), arg_width, buf, &ptr, 16);
print_int((u32) va_arg(args, u32), arg_width, buf, &ptr, 16);
break;
case 'd':
print_int((u32)va_arg(args, u32), arg_width, buf, &ptr, 10);
print_int((u32) va_arg(args, u32), arg_width, buf, &ptr, 10);
break;
case '%':
buf[ptr++] = '%';
@@ -85,7 +85,7 @@ int printf(const char *fmt, ...) {
return result;
}
int sprintf(char* target, const char*fmt, ...) {
int sprintf(char *target, const char *fmt, ...) {
int result;
va_list args;
va_start(args, fmt);

View File

@@ -32,12 +32,13 @@ int abs(int val) {
// next stolen form https://www.techiedelight.com/implement-itoa-function-in-c/
// inline function to swap two numbers
void swap(char *x, char *y) {
char t = *x; *x = *y; *y = t;
char t = *x;
*x = *y;
*y = t;
}
// function to reverse buffer[i..j]
char* reverse(char *buffer, int i, int j)
{
char *reverse(char *buffer, int i, int j) {
while (i < j)
swap(&buffer[i++], &buffer[j--]);
@@ -45,8 +46,7 @@ char* reverse(char *buffer, int i, int j)
}
// Iterative function to implement itoa() function in C
char* itoa(int value, char* buffer, int base)
{
char *itoa(int value, char *buffer, int base) {
// invalid input
if (base < 2 || base > 32)
return buffer;
@@ -55,8 +55,7 @@ char* itoa(int value, char* buffer, int base)
int n = abs(value);
int i = 0;
while (n)
{
while (n) {
int r = n % base;
if (r >= 10)

View File

@@ -11,12 +11,12 @@
#define RESULT_SIZE 256
const char* default_msg = "> ";
const char *default_msg = "> ";
char* readline(const char *prompt) {
char *readline(const char *prompt) {
kprint(prompt == NULL ? default_msg : prompt);
char* result = malloc(RESULT_SIZE);
char *result = malloc(RESULT_SIZE);
memset(result, 0, RESULT_SIZE);
for (int i = 0; i < RESULT_SIZE - 1; ++i) {
result[i] = getc();

View File

@@ -5,6 +5,6 @@
#ifndef NEW_KERNEL_READLINE_H
#define NEW_KERNEL_READLINE_H
char* readline(const char *prompt);
char *readline(const char *prompt);
#endif //NEW_KERNEL_READLINE_H

View File

@@ -46,7 +46,7 @@ void ring_buffer_put(void *buffer, void *item) {
ring_buffer->write_pos++;
};
bool ring_buffer_get(void *buffer, void* target) {
bool ring_buffer_get(void *buffer, void *target) {
ring_buffer_t *ring_buffer = (ring_buffer_t *) buffer;
if (ring_buffer->read_pos == ring_buffer->write_pos) {
// nothing to read

View File

@@ -14,6 +14,6 @@ void free_buffer(void *buffer);
void ring_buffer_put(void *buffer, void *item);
bool ring_buffer_get(void *buffer, void* target);
bool ring_buffer_get(void *buffer, void *target);
#endif //NEW_KERNEL_RINGQUEUE_H

View File

@@ -6,9 +6,9 @@
#define NEW_KERNEL_VA_LIST_H
typedef __builtin_va_list va_list;
#define va_start(ap,last) __builtin_va_start(ap, last)
#define va_start(ap, last) __builtin_va_start(ap, last)
#define va_end(ap) __builtin_va_end(ap)
#define va_arg(ap,type) __builtin_va_arg(ap,type)
#define va_arg(ap, type) __builtin_va_arg(ap,type)
#define va_copy(dest, src) __builtin_va_copy(dest,src)
#endif //NEW_KERNEL_VA_LIST_H