| 1 | /* |
| 2 | * This file is part of DisOrder |
| 3 | * Copyright (C) 2004, 2005 Richard Kettlewell |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or modify |
| 6 | * it under the terms of the GNU General Public License as published by |
| 7 | * the Free Software Foundation; either version 2 of the License, or |
| 8 | * (at your option) any later version. |
| 9 | * |
| 10 | * This program is distributed in the hope that it will be useful, but |
| 11 | * WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 13 | * General Public License for more details. |
| 14 | * |
| 15 | * You should have received a copy of the GNU General Public License |
| 16 | * along with this program; if not, write to the Free Software |
| 17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 |
| 18 | * USA |
| 19 | */ |
| 20 | |
| 21 | #ifndef TABLE_H |
| 22 | #define TABLE_H |
| 23 | |
| 24 | #define TABLE_FIND(TABLE, TYPE, FIELD, NAME) \ |
| 25 | table_find((void *)TABLE, \ |
| 26 | offsetof(TYPE, FIELD), \ |
| 27 | sizeof (TYPE), \ |
| 28 | sizeof TABLE / sizeof (TYPE), \ |
| 29 | NAME) |
| 30 | /* Search TYPE TABLE[] for an element where TABLE[N].FIELD matches NAME |
| 31 | * Returns the index N on success or -1 if not found |
| 32 | * The table must be lexically sorted on FIELD |
| 33 | */ |
| 34 | |
| 35 | int table_find(const void *table, size_t offset, size_t eltsize, size_t nelts, |
| 36 | const char *name); |
| 37 | |
| 38 | #endif /* TABLE_H */ |
| 39 | |
| 40 | /* |
| 41 | Local Variables: |
| 42 | c-basic-offset:2 |
| 43 | comment-column:40 |
| 44 | End: |
| 45 | */ |