macho: Improve macho_calculate_sizes
[nasm.git] / nasmlib / bsi.c
bloba811e45e4ec0614c485ef54aca67763bce4dbee8
1 /* ----------------------------------------------------------------------- *
2 *
3 * Copyright 1996-2016 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
35 * nasmlib.c library routines for the Netwide Assembler
38 #include "compiler.h"
40 #include <string.h>
42 #include "nasmlib.h"
45 * Binary search.
47 int bsi(const char *string, const char **array, int size)
49 int i = -1, j = size; /* always, i < index < j */
50 while (j - i >= 2) {
51 int k = (i + j) / 2;
52 int l = strcmp(string, array[k]);
53 if (l < 0) /* it's in the first half */
54 j = k;
55 else if (l > 0) /* it's in the second half */
56 i = k;
57 else /* we've got it :) */
58 return k;
60 return -1; /* we haven't got it :( */
63 int bsii(const char *string, const char **array, int size)
65 int i = -1, j = size; /* always, i < index < j */
66 while (j - i >= 2) {
67 int k = (i + j) / 2;
68 int l = nasm_stricmp(string, array[k]);
69 if (l < 0) /* it's in the first half */
70 j = k;
71 else if (l > 0) /* it's in the second half */
72 i = k;
73 else /* we've got it :) */
74 return k;
76 return -1; /* we haven't got it :( */