projects / thirdparty / git.git / blame
| Commit | Line | Data |
|---|---|---|
| 3443546f LT |
1 | /* |
| 2 | * LibXDiff by Davide Libenzi ( File Differential Library ) | |
| 3 | * Copyright (C) 2003 Davide Libenzi | |
| 4 | * | |
| 5 | * This library is free software; you can redistribute it and/or | |
| 6 | * modify it under the terms of the GNU Lesser General Public | |
| 7 | * License as published by the Free Software Foundation; either | |
| 8 | * version 2.1 of the License, or (at your option) any later version. | |
| 9 | * | |
| 10 | * This library is distributed in the hope that it will be useful, | |
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 13 | * Lesser General Public License for more details. | |
| 14 | * | |
| 15 | * You should have received a copy of the GNU Lesser General Public | |
| 48425792 TZ |
16 | * License along with this library; if not, see |
| 17 | * <http://www.gnu.org/licenses/>. | |
| 3443546f LT |
18 | * |
| 19 | * Davide Libenzi <davidel@xmailserver.org> | |
| 20 | * | |
| 21 | */ | |
| 22 | ||
| 23 | #if !defined(XMACROS_H) | |
| 24 | #define XMACROS_H | |
| 25 | ||
| 26 | ||
| 3443546f LT |
27 | |
| 28 | ||
| 29 | #define XDL_MIN(a, b) ((a) < (b) ? (a): (b)) | |
| 30 | #define XDL_MAX(a, b) ((a) > (b) ? (a): (b)) | |
| 31 | #define XDL_ABS(v) ((v) >= 0 ? (v): -(v)) | |
| 32 | #define XDL_ISDIGIT(c) ((c) >= '0' && (c) <= '9') | |
| 349362cc | 33 | #define XDL_ISSPACE(c) (isspace((unsigned char)(c))) |
| 9de08346 LT |
34 | #define XDL_ADDBITS(v,b) ((v) + ((v) >> (b))) |
| 35 | #define XDL_MASKBITS(b) ((1UL << (b)) - 1) | |
| 36 | #define XDL_HASHLONG(v,b) (XDL_ADDBITS((unsigned long)(v), b) & XDL_MASKBITS(b)) | |
| 3443546f LT |
37 | #define XDL_LE32_PUT(p, v) \ |
| 38 | do { \ | |
| 39 | unsigned char *__p = (unsigned char *) (p); \ | |
| 40 | *__p++ = (unsigned char) (v); \ | |
| 41 | *__p++ = (unsigned char) ((v) >> 8); \ | |
| 42 | *__p++ = (unsigned char) ((v) >> 16); \ | |
| 43 | *__p = (unsigned char) ((v) >> 24); \ | |
| 44 | } while (0) | |
| 45 | #define XDL_LE32_GET(p, v) \ | |
| 46 | do { \ | |
| 47 | unsigned char const *__p = (unsigned char const *) (p); \ | |
| 48 | (v) = (unsigned long) __p[0] | ((unsigned long) __p[1]) << 8 | \ | |
| 49 | ((unsigned long) __p[2]) << 16 | ((unsigned long) __p[3]) << 24; \ | |
| 50 | } while (0) | |
| 51 | ||
| abf04bda PW |
52 | /* Allocate an array of nr elements, returns NULL on failure */ |
| 53 | #define XDL_ALLOC_ARRAY(p, nr) \ | |
| 54 | ((p) = SIZE_MAX / sizeof(*(p)) >= (size_t)(nr) \ | |
| 55 | ? xdl_malloc((nr) * sizeof(*(p))) \ | |
| 56 | : NULL) | |
| 3443546f | 57 | |
| 848fd5ae PW |
58 | /* Allocate an array of nr zeroed out elements, returns NULL on failure */ |
| 59 | #define XDL_CALLOC_ARRAY(p, nr) ((p) = xdl_calloc(nr, sizeof(*(p)))) | |
| 60 | ||
| f7b587bf PW |
61 | /* |
| 62 | * Ensure array p can accommodate at least nr elements, growing the | |
| 63 | * array and updating alloc (which is the number of allocated | |
| 64 | * elements) as necessary. Frees p and returns -1 on failure, returns | |
| 65 | * 0 on success | |
| 66 | */ | |
| 67 | #define XDL_ALLOC_GROW(p, nr, alloc) \ | |
| 68 | (-!((nr) <= (alloc) || \ | |
| 69 | ((p) = xdl_alloc_grow_helper((p), (nr), &(alloc), sizeof(*(p)))))) | |
| 70 | ||
| 3443546f | 71 | #endif /* #if !defined(XMACROS_H) */ |