fix: warning

Author: tricktux

source/means-to-an-end/asset-prices.c

@@ -14,7 +14,7 @@ void asset_prices_init_data(struct asset_prices* ps, size_t capacity)
   assert(capacity > ps->capacity);
 
   struct asset_price* new_data = NULL;
-  new_data = reallocarray(ps->data, sizeof(struct asset_price), capacity);
+  new_data = reallocarray(ps->data, capacity, sizeof(struct asset_price));
   assert(new_data != NULL);
 
   ps->data = new_data;

source/means-to-an-end/main.c

@@ -72,9 +72,9 @@ int main()
 
   bool complete_req = false, client_found = false;
   char *data, *sddata;
-  int n, fd, res, size, sdsize, rs, result;
+  int n, fd, res, size, sdsize, rs;
   struct epoll_ctl_info epci = {epollfd, 0, 0};
-  struct queue *rcqu = NULL, *sdqu = NULL;
+  struct queue *sdqu = NULL;
   struct clients_session *ca = NULL;
   queue_init(&sdqu, QUEUE_CAPACITY);
 
@@ -137,7 +137,7 @@ int main()
             fd,
             size);
 
-        message_parse(ca->asset, sdqu, data, size);
+        message_parse(ca->asset, sdqu, data, (size_t) size);
         sdsize = queue_pop_no_copy(sdqu, &sddata);
         if (sdsize > 0) {
           rs = sendall(fd, sddata, &sdsize);

source/means-to-an-end/messages.c

@@ -8,7 +8,7 @@
 #include "means-to-an-end/asset-prices.h"
 #include "means-to-an-end/messages.h"
 
-void message_parse(struct asset_price *ps, struct queue* sdqu, char* data, size_t dsize)
+void message_parse(struct asset_prices *ps, struct queue* sdqu, char* data, size_t dsize)
 {
   assert(ps != NULL);
   assert(sdqu != NULL);

source/means-to-an-end/messages.h

@@ -8,6 +8,6 @@
 #define MESSAGE_FIRST_WORD_OFFSET 1  // These are in network byte order
 #define MESSAGE_SECOND_WORD_OFFSET 5  // These are in network byte order
 
-void message_parse(struct asset_price *ps, struct queue* sdqu, char* data, size_t dsize);
+void message_parse(struct asset_prices *ps, struct queue* sdqu, char* data, size_t dsize);
 
 #endif  // INCLUDE_MESSAGES_H_

source/prime-time/is-prime-request.h

@@ -11,7 +11,7 @@
 #define PRIME_RESPONSE_NUMBER_KEY "prime"
 #define PRIME_RESPONSE_FORMAT "{\"method\":\"isPrime\",\"prime\":%s}\n"
 #define PRIME_RESPONSE_ILL_RESPONSE "{\"response to malformed request\"}\n"
-#define PRIME_RESPONSE_ILL_RESPONSE_SIZE 37
+#define PRIME_RESPONSE_ILL_RESPONSE_SIZE 34
 
 #ifdef __cplusplus
 extern "C" {

source/utils/queue.c

@@ -35,11 +35,11 @@ void queue_expand_capacity(struct queue* qu, size_t size)
   if (size ==0)
     return;
 
-  if (qu->size + size < (qu->free_capacity * QUEUE_FREE_CAP_BUFFER))
+  if (qu->size + size < ((size_t) ((double) qu->free_capacity * QUEUE_FREE_CAP_BUFFER)))
     return;
 
   size_t new_cap = qu->capacity * 2, new_free_cap = new_cap - qu->size;
-  while (qu->size + size >= (new_free_cap * QUEUE_FREE_CAP_BUFFER)) {
+  while (qu->size + size >= (size_t) ((double) new_free_cap * QUEUE_FREE_CAP_BUFFER)) {
     new_cap *= 2;
     new_free_cap = new_cap - qu->size;
   }
@@ -115,7 +115,7 @@ void queue_push(struct queue* qu, char* data, size_t size)
     return;
   }
 
-  if (qu->size + size >= (qu->free_capacity * QUEUE_FREE_CAP_BUFFER)) {
+  if (qu->size + size >= (size_t) ((double) qu->free_capacity * QUEUE_FREE_CAP_BUFFER)) {
     queue_expand_capacity(qu, size);
     log_info("queue_push: expanding current capacity to %d\n", qu->capacity);
   }
@@ -145,7 +145,7 @@ void queue_push_ex(struct queue* qu, size_t size)
     return;
   }
 
-  if (qu->size + size >= (qu->free_capacity * QUEUE_FREE_CAP_BUFFER)) {
+  if (qu->size + size >= (size_t) ((double) qu->free_capacity * QUEUE_FREE_CAP_BUFFER)) {
     queue_expand_capacity(qu, size);
     log_info("queue_push: expanding current capacity to %d\n", qu->capacity);
   }