| /* ----------------------------------------------------------------------- * |
| * |
| * Copyright 1996-2016 The NASM Authors - All Rights Reserved |
| * See the file AUTHORS included with the NASM distribution for |
| * the specific copyright holders. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following |
| * conditions are met: |
| * |
| * * Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * * Redistributions in binary form must reproduce the above |
| * copyright notice, this list of conditions and the following |
| * disclaimer in the documentation and/or other materials provided |
| * with the distribution. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND |
| * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, |
| * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR |
| * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, |
| * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| * |
| * ----------------------------------------------------------------------- */ |
| |
| /* |
| * nasmlib.c library routines for the Netwide Assembler |
| */ |
| |
| #include "compiler.h" |
| |
| #include <string.h> |
| |
| #include "nasmlib.h" |
| |
| /* |
| * Binary search. |
| */ |
| int bsi(const char *string, const char **array, int size) |
| { |
| int i = -1, j = size; /* always, i < index < j */ |
| while (j - i >= 2) { |
| int k = (i + j) / 2; |
| int l = strcmp(string, array[k]); |
| if (l < 0) /* it's in the first half */ |
| j = k; |
| else if (l > 0) /* it's in the second half */ |
| i = k; |
| else /* we've got it :) */ |
| return k; |
| } |
| return -1; /* we haven't got it :( */ |
| } |
| |
| int bsii(const char *string, const char **array, int size) |
| { |
| int i = -1, j = size; /* always, i < index < j */ |
| while (j - i >= 2) { |
| int k = (i + j) / 2; |
| int l = nasm_stricmp(string, array[k]); |
| if (l < 0) /* it's in the first half */ |
| j = k; |
| else if (l > 0) /* it's in the second half */ |
| i = k; |
| else /* we've got it :) */ |
| return k; |
| } |
| return -1; /* we haven't got it :( */ |
| } |