fix: bsearch prevent overflow on mid calculation

Signed-off-by: Eloy Coto <eloy.coto@acalustra.com>

src/builtin.c

@@ -785,13 +785,14 @@ static jv f_sort_by_impl(jq_state *jq, jv input, jv keys) {
 /* If the input is not sorted, bsearch will terminate but with irrelevant results. */
 static jv f_bsearch(jq_state *jq, jv input, jv target) {
   if (jv_get_kind(input) != JV_KIND_ARRAY) {
+    jv_free(input);
     return type_error(input, "cannot be searched from");
   }
   int start = 0;
   int end = jv_array_length(jv_copy(input));
   jv answer = jv_invalid();
   while (start < end) {
-    int mid = (start + end) / 2;
+    int mid = start + (end - start) / 2;
     int result = jv_cmp(jv_copy(target), jv_array_get(jv_copy(input), mid));
     if (result == 0) {
       answer = jv_number(mid);

tests/jq.test

@@ -1559,6 +1559,10 @@ bsearch({x:1})
 [{ "x": 0 },{ "x": 1 },{ "x": 2 }]
 1
 
+bsearch(0)
+"aa"
+jq: error (at <unknown>): string ("aa") cannot be searched from
+
 # strptime tests are in optional.test
 
 strftime("%Y-%m-%dT%H:%M:%SZ")