7d7b8bfe55
* acinclude.m4 (LIBGFOR_CHECK_ATTRIBUTE_VISIBILITY): New.
(LIBGFOR_CHECK_ATTRIBUTE_DLLEXPORT): New.
(LIBGFOR_CHECK_ATTRIBUTE_ALIAS): New.
* configure.ac: Use them.
* configure, config.h.in, aclocal.m4: Rebuild.
* libgfortran.h (prefix): Remove.
(PREFIX, IPREFIX): New.
(sym_rename, sym_rename1, sym_rename2): New.
(internal_proto, export_proto, export_proto_np): New.
(iexport_proto, iexport): New.
(iexport_data_proto, iexport_data): New.
* intrinsics/abort.c, intrinsics/args.c, intrinsics/associated.c,
intrinsics/cpu_time.c, intrinsics/cshift0.c,
intrinsics/date_and_time.c, intrinsics/env.c, intrinsics/eoshift0.c,
intrinsics/eoshift2.c, intrinsics/etime.c, intrinsics/exit.c,
intrinsics/flush.c, intrinsics/fnum.c, intrinsics/getXid.c,
intrinsics/getcwd.c, intrinsics/ishftc.c, intrinsics/mvbits.c,
intrinsics/pack_generic.c, intrinsics/rand.c, intrinsics/random.c,
intrinsics/reshape_generic.c, intrinsics/size.c,
intrinsics/spread_generic.c, intrinsics/stat.c,
intrinsics/string_intrinsics.c, intrinsics/system.c,
intrinsics/system_clock.c, intrinsics/transpose_generic.c,
intrinsics/umask.c, intrinsics/unlink.c, intrinsics/unpack_generic.c,
io/backspace.c, io/close.c, io/endfile.c, io/inquire.c, io/io.h,
io/open.c, io/rewind.c, io/transfer.c, libgfortran.h, m4/cshift1.m4,
m4/dotprod.m4, m4/dotprodc.m4, m4/dotprodl.m4, m4/eoshift1.m4,
m4/eoshift3.m4, m4/exponent.m4, m4/fraction.m4, m4/iforeach.m4,
m4/ifunction.m4, m4/matmul.m4, m4/matmull.m4, m4/nearest.m4,
m4/pow.m4, m4/reshape.m4, m4/set_exponent.m4, m4/shape.m4,
m4/transpose.m4, runtime/environ.c, runtime/error.c,
runtime/in_pack_generic.c, runtime/in_unpack_generic.c,
runtime/main.c, runtime/memory.c, runtime/pause.c, runtime/select.c,
runtime/stop.c: Use them to mark symbols internal or external.
* generated/*: Rebuild.
From-SVN: r92045
129 lines
3.1 KiB
C
129 lines
3.1 KiB
C
/* Implement the SELECT statement for character variables.
|
|
Contributed by Andy Vaught
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfor).
|
|
|
|
Libgfor is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
any later version.
|
|
|
|
Libgfor is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with libgfor; see the file COPYING. If not, write to
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "libgfortran.h"
|
|
|
|
typedef struct
|
|
{
|
|
char *low;
|
|
int low_len;
|
|
char *high;
|
|
int high_len;
|
|
void *address;
|
|
}
|
|
select_struct;
|
|
|
|
extern void * select_string (select_struct *table, int table_len,
|
|
void *default_jump, const char *selector,
|
|
int selector_len);
|
|
export_proto(select_string);
|
|
|
|
|
|
/* select_string()-- Given a selector string and a table of
|
|
* select_struct structures, return the address to jump to. */
|
|
|
|
void *
|
|
select_string (select_struct *table, int table_len, void *default_jump,
|
|
const char *selector, int selector_len)
|
|
{
|
|
select_struct *t;
|
|
int i, low, high, mid;
|
|
|
|
if (table_len == 0)
|
|
return default_jump;
|
|
|
|
/* Record the default address if present */
|
|
|
|
if (table->low == NULL && table->high == NULL)
|
|
{
|
|
default_jump = table->address;
|
|
|
|
table++;
|
|
table_len--;
|
|
if (table_len == 0)
|
|
return default_jump;
|
|
}
|
|
|
|
/* Try the high and low bounds if present. */
|
|
|
|
if (table->low == NULL)
|
|
{
|
|
if (compare_string (table->high_len, table->high,
|
|
selector_len, selector) >= 0)
|
|
return table->address;
|
|
|
|
table++;
|
|
table_len--;
|
|
if (table_len == 0)
|
|
return default_jump;
|
|
}
|
|
|
|
t = table + table_len - 1;
|
|
|
|
if (t->high == NULL)
|
|
{
|
|
if (compare_string (t->low_len, t->low,
|
|
selector_len, selector) <= 0)
|
|
return t->address;
|
|
|
|
table_len--;
|
|
if (table_len == 0)
|
|
return default_jump;
|
|
}
|
|
|
|
/* At this point, the only table entries are bounded entries. Find
|
|
the right entry with a binary chop. */
|
|
|
|
low = -1;
|
|
high = table_len;
|
|
|
|
while (low + 1 < high)
|
|
{
|
|
mid = (low + high) / 2;
|
|
|
|
t = table + mid;
|
|
i = compare_string (t->low_len, t->low, selector_len, selector);
|
|
|
|
if (i == 0)
|
|
return t->address;
|
|
|
|
if (i < 0)
|
|
low = mid;
|
|
else
|
|
high = mid;
|
|
}
|
|
|
|
/* The string now lies between the low indeces of the now-adjacent
|
|
high and low entries. Because it is less than the low entry of
|
|
'high', it can't be that one. If low is still -1, then no
|
|
entries match. Otherwise, we have to check the high entry of
|
|
'low'. */
|
|
|
|
if (low == -1)
|
|
return default_jump;
|
|
|
|
t = table + low;
|
|
if (compare_string (selector_len, selector,
|
|
t->high_len, t->high) <= 0)
|
|
return t->address;
|
|
|
|
return default_jump;
|
|
}
|