003 File Manager
Current Path:
/usr/src/contrib/bmake
usr
/
src
/
contrib
/
bmake
/
📁
..
📄
ChangeLog
(110.6 KB)
📄
FILES
(23.09 KB)
📄
LICENSE
(2.58 KB)
📄
Makefile
(4.57 KB)
📄
Makefile.config.in
(520 B)
📁
PSD.doc
📄
README
(1.46 KB)
📄
VERSION
(63 B)
📄
aclocal.m4
(1.89 KB)
📄
arch.c
(30.67 KB)
📄
bmake.1
(65.42 KB)
📄
bmake.cat1
(80.42 KB)
📄
boot-strap
(10.85 KB)
📄
bsd.after-import.mk
(3.9 KB)
📄
buf.c
(6.7 KB)
📄
buf.h
(5.09 KB)
📄
compat.c
(18.84 KB)
📄
cond.c
(33.51 KB)
📄
config.h.in
(8.83 KB)
📄
configure
(201.92 KB)
📄
configure.in
(10.66 KB)
📄
dir.c
(44.23 KB)
📄
dir.h
(4.61 KB)
📄
dirname.c
(3.11 KB)
📄
enum.c
(2.81 KB)
📄
enum.h
(8.46 KB)
📁
filemon
📄
find_lib.sh
(138 B)
📄
for.c
(12.15 KB)
📄
getopt.c
(4.78 KB)
📄
hash.c
(9.05 KB)
📄
hash.h
(6.11 KB)
📄
import.sh
(2.14 KB)
📄
install-sh
(3.8 KB)
📄
job.c
(76.85 KB)
📄
job.h
(7.05 KB)
📄
lst.c
(6.47 KB)
📄
lst.h
(6.85 KB)
📄
machine.sh
(2.18 KB)
📄
main.c
(52.56 KB)
📄
make-bootstrap.sh.in
(2.02 KB)
📄
make-conf.h
(5.64 KB)
📄
make.1
(65.55 KB)
📄
make.c
(39.48 KB)
📄
make.h
(25.84 KB)
📄
make_malloc.c
(2.54 KB)
📄
make_malloc.h
(2.15 KB)
📄
makefile.in
(282 B)
📄
meta.c
(40.12 KB)
📄
meta.h
(2.38 KB)
📄
metachar.c
(3.6 KB)
📄
metachar.h
(1.85 KB)
📁
missing
📁
mk
📄
mkdeps.sh
(7.27 KB)
📄
nonints.h
(11.82 KB)
📄
os.sh
(5.54 KB)
📄
parse.c
(80.74 KB)
📄
pathnames.h
(2.4 KB)
📄
ranlib.h
(1008 B)
📄
realpath.c
(5.06 KB)
📄
setenv.c
(4.64 KB)
📄
sigcompat.c
(8.46 KB)
📄
str.c
(10.2 KB)
📄
stresep.c
(2.93 KB)
📄
strlcpy.c
(1.74 KB)
📄
suff.c
(55.28 KB)
📄
targ.c
(15.81 KB)
📄
trace.c
(2.99 KB)
📄
trace.h
(1.83 KB)
📁
unit-tests
📄
util.c
(11.92 KB)
📄
var.c
(107.64 KB)
📄
wait.h
(2 KB)
Editing: buf.c
/* $NetBSD: buf.c,v 1.47 2020/12/30 10:03:16 rillig Exp $ */ /* * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. * All rights reserved. * * This code is derived from software contributed to Berkeley by * Adam de Boor. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. 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. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. */ /* * Copyright (c) 1988, 1989 by Adam de Boor * Copyright (c) 1989 by Berkeley Softworks * All rights reserved. * * This code is derived from software contributed to Berkeley by * Adam de Boor. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. 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. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. */ /* Automatically-expanding null-terminated character buffers. */ #include <limits.h> #include "make.h" /* "@(#)buf.c 8.1 (Berkeley) 6/6/93" */ MAKE_RCSID("$NetBSD: buf.c,v 1.47 2020/12/30 10:03:16 rillig Exp $"); /* Make space in the buffer for adding at least 16 more bytes. */ void Buf_Expand(Buffer *buf) { buf->cap += buf->cap > 16 ? buf->cap : 16; buf->data = bmake_realloc(buf->data, buf->cap); } /* Add the bytes to the buffer. */ void Buf_AddBytes(Buffer *buf, const char *bytes, size_t bytes_len) { size_t old_len = buf->len; char *end; if (__predict_false(old_len + bytes_len >= buf->cap)) { size_t minIncr = bytes_len + 16; buf->cap += buf->cap > minIncr ? buf->cap : minIncr; buf->data = bmake_realloc(buf->data, buf->cap); } end = buf->data + old_len; buf->len = old_len + bytes_len; memcpy(end, bytes, bytes_len); end[bytes_len] = '\0'; } /* Add the bytes between start and end to the buffer. */ void Buf_AddBytesBetween(Buffer *buf, const char *start, const char *end) { Buf_AddBytes(buf, start, (size_t)(end - start)); } /* Add the string to the buffer. */ void Buf_AddStr(Buffer *buf, const char *str) { Buf_AddBytes(buf, str, strlen(str)); } /* Add the number to the buffer. */ void Buf_AddInt(Buffer *buf, int n) { enum { bits = sizeof(int) * CHAR_BIT, max_octal_digits = (bits + 2) / 3, max_decimal_digits = /* at most */ max_octal_digits, max_sign_chars = 1, str_size = max_sign_chars + max_decimal_digits + 1 }; char str[str_size]; size_t len = (size_t)snprintf(str, sizeof str, "%d", n); Buf_AddBytes(buf, str, len); } /* * Get the data (usually a string) from the buffer. * The returned data is valid until the next modifying operation * on the buffer. * * Returns the data and optionally the length of the data. */ char * Buf_GetAll(Buffer *buf, size_t *out_len) { if (out_len != NULL) *out_len = buf->len; return buf->data; } /* Mark the buffer as empty, so it can be filled with data again. */ void Buf_Empty(Buffer *buf) { buf->len = 0; buf->data[0] = '\0'; } /* Initialize a buffer. */ void Buf_InitSize(Buffer *buf, size_t cap) { buf->cap = cap; buf->len = 0; buf->data = bmake_malloc(cap); buf->data[0] = '\0'; } void Buf_Init(Buffer *buf) { Buf_InitSize(buf, 256); } /* * Reset the buffer. * If freeData is TRUE, the data from the buffer is freed as well. * Otherwise it is kept and returned. */ char * Buf_Destroy(Buffer *buf, Boolean freeData) { char *data = buf->data; if (freeData) { free(data); data = NULL; } buf->cap = 0; buf->len = 0; buf->data = NULL; return data; } #ifndef BUF_COMPACT_LIMIT # define BUF_COMPACT_LIMIT 128 /* worthwhile saving */ #endif /* * Reset the buffer and return its data. * * If the buffer size is much greater than its content, * a new buffer will be allocated and the old one freed. */ char * Buf_DestroyCompact(Buffer *buf) { #if BUF_COMPACT_LIMIT > 0 if (buf->cap - buf->len >= BUF_COMPACT_LIMIT) { /* We trust realloc to be smart */ char *data = bmake_realloc(buf->data, buf->len + 1); data[buf->len] = '\0'; /* XXX: unnecessary */ Buf_Destroy(buf, FALSE); return data; } #endif return Buf_Destroy(buf, FALSE); }
Upload File
Create Folder