| 1 | /* |
| 2 | * Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved. |
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | * |
| 5 | * This code is free software; you can redistribute it and/or modify it |
| 6 | * under the terms of the GNU General Public License version 2 only, as |
| 7 | * published by the Free Software Foundation. Oracle designates this |
| 8 | * particular file as subject to the "Classpath" exception as provided |
| 9 | * by Oracle in the LICENSE file that accompanied this code. |
| 10 | * |
| 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 14 | * version 2 for more details (a copy is included in the LICENSE file that |
| 15 | * accompanied this code). |
| 16 | * |
| 17 | * You should have received a copy of the GNU General Public License version |
| 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 20 | * |
| 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 22 | * or visit www.oracle.com if you need additional information or have any |
| 23 | * questions. |
| 24 | */ |
| 25 | |
| 26 | //Definitions of our util functions |
| 27 | |
| 28 | void* must_malloc(size_t size); |
| 29 | #ifndef USE_MTRACE |
| 30 | #define mtrace(c, ptr, size) |
| 31 | #else |
| 32 | void mtrace(char c, void* ptr, size_t size); |
| 33 | #endif |
| 34 | |
| 35 | // overflow management |
| 36 | #define POVERFLOW ((uint)-1) |
| 37 | #define PSIZE_MAX (POVERFLOW/2) /* normal size limit */ |
| 38 | |
| 39 | inline size_t scale_size(size_t size, size_t scale) { |
| 40 | return (size > PSIZE_MAX / scale) ? POVERFLOW : size * scale; |
| 41 | } |
| 42 | |
| 43 | inline size_t add_size(size_t size1, size_t size2) { |
| 44 | return ((size1 | size2 | (size1 + size2)) > PSIZE_MAX) |
| 45 | ? POVERFLOW |
| 46 | : size1 + size2; |
| 47 | } |
| 48 | |
| 49 | inline size_t add_size(size_t size1, size_t size2, int size3) { |
| 50 | return add_size(add_size(size1, size2), size3); |
| 51 | } |
| 52 | |
| 53 | // These may be expensive, because they have to go via Java TSD, |
| 54 | // if the optional u argument is missing. |
| 55 | struct unpacker; |
| 56 | extern void unpack_abort(const char* msg, unpacker* u = null); |
| 57 | extern bool unpack_aborting(unpacker* u = null); |
| 58 | |
| 59 | #ifndef PRODUCT |
| 60 | inline bool endsWith(const char* str, const char* suf) { |
| 61 | size_t len1 = strlen(str); |
| 62 | size_t len2 = strlen(suf); |
| 63 | return (len1 > len2 && 0 == strcmp(str + (len1-len2), suf)); |
| 64 | } |
| 65 | #endif |
| 66 | |
| 67 | void mkdirs(int oklen, char* path); |
| 68 | |