lint: apply new style

src/util.c

@@ -11,22 +11,21 @@
 
 static int selret_magic();
 
-void strcln(char **dest, const char *source) {
+void strcln(char** dest, const char* source) {
   *dest = malloc(strlen(source) + sizeof(char));
   strcpy(*dest, source);
 }
 
-enum keys find_keyname(char *name) {
+enum keys find_keyname(char* name) {
   for (size_t i = 0; i < sizeof(key_mappings) / sizeof(key_mappings[0]); i++) {
-    if (strcmp(key_names[i], name) == 0)
-      return (enum keys)i;
+    if (strcmp(key_names[i], name) == 0) return (enum keys)i;
   }
 
   perror("key not found");
   exit(1);
 }
 
-enum keys find_ansi(char *seq) {
+enum keys find_ansi(char* seq) {
   for (size_t i = 0; i < sizeof(key_mappings) / sizeof(key_mappings[0]); i++) {
     struct key_mapping mapping = key_mappings[i];
     for (size_t j = 0; mapping.sequences[j] != NULL; j++) {
@@ -39,7 +38,7 @@ enum keys find_ansi(char *seq) {
 }
 
 // https://stackoverflow.com/a/48040042
-void read_press(u_char *length, char *out) {
+void read_press(u_char* length, char* out) {
   *length = 0;
 
   while (true) {
@@ -75,11 +74,10 @@ struct Vector vec_new() {
   return vec;
 }
 
-int vec_resize(struct Vector *vec, size_t size) {
-  void **new_location = realloc(vec->pages, size * sizeof(void*));
+int vec_resize(struct Vector* vec, size_t size) {
+  void** new_location = realloc(vec->pages, size * sizeof(void*));
   if (new_location != NULL) {
-    if (vec->length > size)
-      vec->length = size;
+    if (vec->length > size) vec->length = size;
     vec->capacity = size;
     vec->pages = new_location;
   } else {
@@ -88,15 +86,16 @@ int vec_resize(struct Vector *vec, size_t size) {
   return 0;
 }
 
-int vec_reserve(struct Vector *vec, size_t size) {
+int vec_reserve(struct Vector* vec, size_t size) {
   uint32_t new_capacity = vec->capacity;
   while (vec->length + size > new_capacity) {
-    new_capacity = new_capacity + (new_capacity >> 1) + 1; // cap * 1.5 + 1; 0 1 2 4 7 11...
+    new_capacity = new_capacity + (new_capacity >> 1) +
+                   1; // cap * 1.5 + 1; 0 1 2 4 7 11...
   }
   return vec_resize(vec, new_capacity);
 }
 
-int vec_reserve_exact(struct Vector *vec, size_t size) {
+int vec_reserve_exact(struct Vector* vec, size_t size) {
   uint32_t needed_capacity = vec->length + size;
   if (vec->capacity < needed_capacity) {
     return vec_resize(vec, needed_capacity);
@@ -105,42 +104,40 @@ int vec_reserve_exact(struct Vector *vec, size_t size) {
   }
 }
 
-int vec_push(struct Vector *vec, void *item) {
+int vec_push(struct Vector* vec, void* item) {
   int res_ret = vec_reserve(vec, 1);
-  if(res_ret != 0) return res_ret;
+  if (res_ret != 0) return res_ret;
 
   vec->pages[vec->length++] = item;
   return 0;
 }
 
-void vec_free(struct Vector *vec) {
+void vec_free(struct Vector* vec) {
   while (vec->length > 0)
     free(vec->pages[--vec->length]);
 
   vec_clear(vec);
 }
 
-void vec_clear(struct Vector *vec) {
+void vec_clear(struct Vector* vec) {
   free(vec->pages);
   vec_reset(vec);
 }
 
-void vec_reset(struct Vector *vec) {
+void vec_reset(struct Vector* vec) {
   vec->length = 0;
   vec->capacity = 0;
   vec->pages = NULL;
 }
 
-void *vec_pop(struct Vector *vec) {
-  if (vec->length == 0)
-    return NULL;
+void* vec_pop(struct Vector* vec) {
+  if (vec->length == 0) return NULL;
 
   return vec->pages[--vec->length];
 }
 
-void *vec_get(struct Vector *vec, size_t index) {
-  if (index >= vec->length)
-    return NULL;
+void* vec_get(struct Vector* vec, size_t index) {
+  if (index >= vec->length) return NULL;
 
   return vec->pages[index];
 }