@zigc/lib 0.17.0-dev.607 → 0.17.0-dev.633

package/libc/include/generic-netbsd/sys/param.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: param.h,v 1.722.2.10 2024/12/16 12:48:46 martin Exp $	*/
+/*	$NetBSD: param.h,v 1.738.2.5 2026/05/12 04:23:51 martin Exp $	*/
 
 /*-
  * Copyright (c) 1982, 1986, 1989, 1993
@@ -395,13 +395,16 @@
 #define	MAXFRAG 	8
 
 /*
- * MAXPATHLEN defines the longest permissible path length after expanding
- * symbolic links. It is used to allocate a temporary buffer from the buffer
- * pool in which to do the name expansion, hence should be a power of two,
- * and must be less than or equal to MAXBSIZE.  MAXSYMLINKS defines the
- * maximum number of symbolic links that may be expanded in a path name.
- * It should be set high enough to allow all legitimate uses, but halt
- * infinite loops reasonably quickly.
+ * MAXPATHLEN defines the longest permissible path length after
+ * expanding symbolic links, including a trailing null terminator
+ * byte. It is used to allocate a temporary buffer from the buffer
+ * pool in which to do the name expansion, hence should be a power of
+ * two, and must be less than or equal to MAXBSIZE. It must be the
+ * same as PATH_MAX from <limits.h>.
+ *
+ * MAXSYMLINKS defines the maximum number of symbolic links that may
+ * be expanded in a path name. It should be set high enough to allow
+ * all legitimate uses, but halt infinite loops reasonably quickly.
  *
  * MAXSYMLINKS should be >= _POSIX_SYMLOOP_MAX (see <limits.h>)
  */

package/libc/include/generic-netbsd/sys/pipe.h

@@ -1,4 +1,4 @@
-/* $NetBSD: pipe.h,v 1.38 2021/01/25 19:21:11 dholland Exp $ */
+/* $NetBSD: pipe.h,v 1.42 2023/11/02 10:31:55 martin Exp $ */
 
 /*
  * Copyright (c) 1996 John S. Dyson
@@ -24,7 +24,7 @@
  */
 
 #ifndef _SYS_PIPE_H_
-#define _SYS_PIPE_H_
+#define	_SYS_PIPE_H_
 
 #include <sys/selinfo.h>		/* for struct selinfo */
 #include <sys/time.h>			/* for struct timespec */
@@ -35,11 +35,11 @@
  * Pipe buffer size, keep moderate in value, pipes take kva space.
  */
 #ifndef PIPE_SIZE
-#define PIPE_SIZE	16384
+#define	PIPE_SIZE	16384
 #endif
 
 #ifndef BIG_PIPE_SIZE
-#define BIG_PIPE_SIZE	(4*PIPE_SIZE)
+#define	BIG_PIPE_SIZE	(4*PIPE_SIZE)
 #endif
 
 /*
@@ -48,7 +48,7 @@
  * size.
  */
 #ifndef PIPE_DIRECT_CHUNK
-#define PIPE_DIRECT_CHUNK	(1*1024*1024)
+#define	PIPE_DIRECT_CHUNK	(1*1024*1024)
 #endif
 
 /*
@@ -56,7 +56,7 @@
  * than PIPE_BUF.
  */
 #ifndef PIPE_MINDIRECT
-#define PIPE_MINDIRECT	8192
+#define	PIPE_MINDIRECT	8192
 #endif
 
 /*
@@ -75,9 +75,9 @@ struct pipebuf {
 /*
  * Bits in pipe_state.
  */
-#define PIPE_ASYNC	0x001	/* Async I/O */
-#define PIPE_EOF	0x010	/* Pipe is in EOF condition */
-#define PIPE_SIGNALR	0x020	/* Do selwakeup() on read(2) */
+#define	PIPE_ASYNC	0x001	/* Async I/O */
+#define	PIPE_EOF	0x010	/* Pipe is in EOF condition */
+#define	PIPE_SIGNALR	0x020	/* Do selwakeup() on read(2) */
 #define	PIPE_LOCKFL	0x100	/* Process has exclusive access to
 				   pointers/data. */
 /*	unused  	0x200	*/
@@ -98,9 +98,8 @@ struct pipe {
 	struct	timespec pipe_atime;	/* time of last access */
 	struct	timespec pipe_mtime;	/* time of last modify */
 	struct	timespec pipe_btime;	/* time of creation */
-	pid_t	pipe_pgid;		/* process group for sigio */
-	u_int	pipe_waiters;		/* number of waiters pending */
 	struct	pipe *pipe_peer;	/* link with other direction */
+	pid_t	pipe_pgid;		/* process group for sigio */
 	u_int	pipe_state;		/* pipe status info */
 	int	pipe_busy;		/* busy flag, to handle rundown */
 	vaddr_t	pipe_kmem;		/* preallocated PIPE_SIZE buffer */

package/libc/include/generic-netbsd/sys/poll.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: poll.h,v 1.16 2020/07/17 15:34:16 kamil Exp $	*/
+/*	$NetBSD: poll.h,v 1.17 2024/11/01 16:37:42 nia Exp $	*/
 
 /*-
  * Copyright (c) 1998 The NetBSD Foundation, Inc.
@@ -83,15 +83,21 @@ __BEGIN_DECLS
 int	poll(struct pollfd *, nfds_t, int);
 __END_DECLS
 
-#ifdef _NETBSD_SOURCE
+/*    
+ * IEEE Std 1003.1-2024 (POSIX.1-2024)
+ */
+#if (_POSIX_C_SOURCE - 0) >= 202405L || (_XOPEN_SOURCE - 0 >= 800) || \
+    defined(_NETBSD_SOURCE)
 #include <sys/sigtypes.h>	/* for sigset_t */
 struct timespec;
 
 __BEGIN_DECLS
 #ifndef __LIBC12_SOURCE__
+#ifdef _NETBSD_SOURCE
 int	pollts(struct pollfd * __restrict, nfds_t,
     const struct timespec * __restrict, const sigset_t * __restrict)
     __RENAME(__pollts50);
+#endif
 int	ppoll(struct pollfd * __restrict, nfds_t,
     const struct timespec * __restrict, const sigset_t * __restrict);
 #endif /* __LIBC12_SOURCE__ */

package/libc/include/generic-netbsd/sys/proc.h

@@ -1,7 +1,7 @@
-/*	$NetBSD: proc.h,v 1.370.4.2 2023/08/09 17:42:01 martin Exp $	*/
+/*	$NetBSD: proc.h,v 1.373 2023/10/04 20:52:07 ad Exp $	*/
 
 /*-
- * Copyright (c) 2006, 2007, 2008, 2020 The NetBSD Foundation, Inc.
+ * Copyright (c) 2006, 2007, 2008, 2020, 2023 The NetBSD Foundation, Inc.
  * All rights reserved.
  *
  * This code is derived from software contributed to The NetBSD Foundation
@@ -252,12 +252,12 @@ struct proc {
 	int		p_exitsig;	/* l: signal to send to parent on exit */
 	int		p_flag;		/* p: PK_* flags */
 	int		p_sflag;	/* p: PS_* flags */
-	int		p_slflag;	/* p, l: PSL_* flags */
-	int		p_lflag;	/* l: PL_* flags */
 	int		p_stflag;	/* t: PST_* flags */
-	char		p_stat;		/* p: S* process status. */
+	short		p_slflag;	/* l, p: PSL_* flags */
+	char		p_stat;		/* l: S* process status. */
+	char		p_lflag;	/* l: PL_* flags */
 	char		p_trace_enabled;/* p: cached by syscall_intern() */
-	char		p_pad1[2];	/*  unused */
+	char		p_pad1[3];	/*  unused */
 
 	pid_t		p_pid;		/* :: Process identifier. */
 	LIST_ENTRY(proc) p_pglist;	/* l: List of processes in pgrp. */
@@ -414,11 +414,11 @@ struct proc {
 #define	PSL_TRACEPOSIX_SPAWN	\
 			0x00000020 /* traced process wants posix_spawn events */
 
-#define	PSL_TRACED	0x00000800 /* Debugged process being traced */
-#define	PSL_TRACEDCHILD 0x00001000 /* Report process birth */
-#define	PSL_CHTRACED	0x00400000 /* Child has been traced & reparented */
-#define	PSL_SYSCALL	0x04000000 /* process has PT_SYSCALL enabled */
-#define	PSL_SYSCALLEMU	0x08000000 /* cancel in-progress syscall */
+#define	PSL_TRACED	0x00000040 /* Debugged process being traced */
+#define	PSL_TRACEDCHILD 0x00000080 /* Report process birth */
+#define	PSL_CHTRACED	0x00000100 /* Child has been traced & reparented */
+#define	PSL_SYSCALL	0x00000200 /* process has PT_SYSCALL enabled */
+#define	PSL_SYSCALLEMU	0x00000400 /* cancel in-progress syscall */
 
 /*
  * Kept in p_stflag and protected by p_stmutex.
@@ -429,10 +429,10 @@ struct proc {
  * Kept in p_lflag and protected by the proc_lock.  Access
  * from process context only.
  */
-#define	PL_CONTROLT	0x00000002 /* Has a controlling terminal */
-#define	PL_PPWAIT	0x00000010 /* Parent is waiting for child exec/exit */
-#define	PL_SIGCOMPAT	0x00000200 /* Has used compat signal trampoline */
-#define	PL_ORPHANPG	0x20000000 /* Member of an orphaned pgrp */
+#define	PL_CONTROLT	0x00000001 /* Has a controlling terminal */
+#define	PL_PPWAIT	0x00000002 /* Parent is waiting for child exec/exit */
+#define	PL_SIGCOMPAT	0x00000004 /* Has used compat signal trampoline */
+#define	PL_ORPHANPG	0x00000008 /* Member of an orphaned pgrp */
 
 #if defined(_KMEMUSER) || defined(_KERNEL)
 

package/libc/include/generic-netbsd/sys/ptrace.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: ptrace.h,v 1.75 2022/06/08 23:12:27 andvar Exp $	*/
+/*	$NetBSD: ptrace.h,v 1.77 2025/01/11 19:42:04 christos Exp $	*/
 
 /*-
  * Copyright (c) 1984, 1993
@@ -68,6 +68,9 @@
 
 #define	PT_FIRSTMACH		32	/* for machine-specific requests */
 #include <machine/ptrace.h>		/* machine-specific requests, if any */
+#ifndef PT_MACHDEP_STRINGS
+# define PT_MACHDEP_STRINGS
+#endif
 
 #define PT_STRINGS \
 /*  0 */    "PT_TRACE_ME", \
@@ -97,7 +100,12 @@
 /* 24 */    "PT_LWPSTATUS", \
 /* 25 */    "PT_LWPNEXT", \
 /* 26 */    "PT_SET_SIGPASS", \
-/* 27 */    "PT_GET_SIGPASS"
+/* 27 */    "PT_GET_SIGPASS", \
+/* 28 */    "*PT_INVALID_28", \
+/* 29 */    "*PT_INVALID_29", \
+/* 30 */    "*PT_INVALID_30", \
+/* 31 */    "*PT_INVALID_31", \
+PT_MACHDEP_STRINGS
 
 /* PT_{G,S}EVENT_MASK */
 typedef struct ptrace_event {
@@ -346,11 +354,20 @@ int	ptrace_machdep_dorequest(struct lwp *, struct lwp **, int,
 typedef int (*ptrace_regrfunc_t)(struct lwp *, void *, size_t *);
 typedef int (*ptrace_regwfunc_t)(struct lwp *, void *, size_t);
 
-#if defined(PT_SETREGS) || defined(PT_GETREGS) || \
-    defined(PT_SETFPREGS) || defined(PT_GETFPREGS) || \
-    defined(PT_SETDBREGS) || defined(PT_GETDBREGS)
-# define PT_REGISTERS
-#endif
+#if defined(PTRACE)
+# if defined(PT_SETREGS) || defined(PT_GETREGS) 
+#  define PT_REGS
+# endif
+# if defined(PT_SETFPREGS) || defined(PT_GETFPREGS) 
+#  define PT_FPREGS
+# endif
+# if defined(PT_SETDBREGS) || defined(PT_GETDBREGS) 
+#  define PT_DBREGS
+# endif
+# if defined(PT_REGS) || defined(PT_FPREGS) || defined(PT_DBREGS)
+#  define PT_REGISTERS
+# endif
+#endif /* PTRACE */
 
 #else /* !_KERNEL */
 

package/libc/include/generic-netbsd/sys/ptree.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: ptree.h,v 1.8 2012/10/06 22:15:09 matt Exp $	*/
+/*	$NetBSD: ptree.h,v 1.9 2024/01/19 18:39:59 christos Exp $	*/
 
 /*-
  * Copyright (c) 2008 The NetBSD Foundation, Inc.
@@ -190,5 +190,6 @@ void *	ptree_find_filtered_node(pt_tree_t *, const void *, pt_filter_t, void *);
 	ptree_find_filtered_node((pt), (key), NULL, NULL)
 void	ptree_remove_node(pt_tree_t *, void *);
 void *	ptree_iterate(pt_tree_t *, const void *, pt_direction_t);
+bool	ptree_check(const pt_tree_t *pt);
 
 #endif /* _SYS_PTREE_H_ */

package/libc/include/generic-netbsd/sys/queue.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: queue.h,v 1.76 2021/01/16 23:51:51 chs Exp $	*/
+/*	$NetBSD: queue.h,v 1.77 2024/05/12 10:34:56 rillig Exp $	*/
 
 /*
  * Copyright (c) 1991, 1993
@@ -136,26 +136,26 @@ struct {								\
  */
 #define	SLIST_INIT(head) do {						\
 	(head)->slh_first = SLIST_END(head);				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\
 	(elm)->field.sle_next = (slistelm)->field.sle_next;		\
 	(slistelm)->field.sle_next = (elm);				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\
 	(elm)->field.sle_next = (head)->slh_first;			\
 	(head)->slh_first = (elm);					\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SLIST_REMOVE_AFTER(slistelm, field) do {			\
 	(slistelm)->field.sle_next =					\
 	    SLIST_NEXT(SLIST_NEXT((slistelm), field), field);		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SLIST_REMOVE_HEAD(head, field) do {				\
 	(head)->slh_first = (head)->slh_first->field.sle_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SLIST_REMOVE(head, elm, type, field) do {			\
 	if ((head)->slh_first == (elm)) {				\
@@ -168,7 +168,7 @@ struct {								\
 		curelm->field.sle_next =				\
 		    curelm->field.sle_next->field.sle_next;		\
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 
 /*
@@ -214,7 +214,7 @@ struct {								\
 		(head2)->lh_first->field.le_prev = &(head2)->lh_first;	\
 		LIST_INIT((head1));					\
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 /*
  * List functions.
@@ -245,7 +245,7 @@ struct {								\
 
 #define	LIST_INIT(head) do {						\
 	(head)->lh_first = LIST_END(head);				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\
 	QUEUEDEBUG_LIST_OP((listelm), field)				\
@@ -255,7 +255,7 @@ struct {								\
 		    &(elm)->field.le_next;				\
 	(listelm)->field.le_next = (elm);				\
 	(elm)->field.le_prev = &(listelm)->field.le_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
 	QUEUEDEBUG_LIST_OP((listelm), field)				\
@@ -263,7 +263,7 @@ struct {								\
 	(elm)->field.le_next = (listelm);				\
 	*(listelm)->field.le_prev = (elm);				\
 	(listelm)->field.le_prev = &(elm)->field.le_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	LIST_INSERT_HEAD(head, elm, field) do {				\
 	QUEUEDEBUG_LIST_INSERT_HEAD((head), (elm), field)		\
@@ -271,7 +271,7 @@ struct {								\
 		(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
 	(head)->lh_first = (elm);					\
 	(elm)->field.le_prev = &(head)->lh_first;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	LIST_REMOVE(elm, field) do {					\
 	QUEUEDEBUG_LIST_OP((elm), field)				\
@@ -280,7 +280,7 @@ struct {								\
 		    (elm)->field.le_prev;				\
 	*(elm)->field.le_prev = (elm)->field.le_next;			\
 	QUEUEDEBUG_LIST_POSTREMOVE((elm), field)			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define LIST_REPLACE(elm, elm2, field) do {				\
 	if (((elm2)->field.le_next = (elm)->field.le_next) != NULL)	\
@@ -289,7 +289,7 @@ struct {								\
 	(elm2)->field.le_prev = (elm)->field.le_prev;			\
 	*(elm2)->field.le_prev = (elm2);				\
 	QUEUEDEBUG_LIST_POSTREMOVE((elm), field)			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 /*
  * Simple queue definitions.
@@ -333,36 +333,36 @@ struct {								\
 #define	SIMPLEQ_INIT(head) do {						\
 	(head)->sqh_first = NULL;					\
 	(head)->sqh_last = &(head)->sqh_first;				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\
 	if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)	\
 		(head)->sqh_last = &(elm)->field.sqe_next;		\
 	(head)->sqh_first = (elm);					\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\
 	(elm)->field.sqe_next = NULL;					\
 	*(head)->sqh_last = (elm);					\
 	(head)->sqh_last = &(elm)->field.sqe_next;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
 	if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
 		(head)->sqh_last = &(elm)->field.sqe_next;		\
 	(listelm)->field.sqe_next = (elm);				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_REMOVE_HEAD(head, field) do {				\
 	if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
 		(head)->sqh_last = &(head)->sqh_first;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\
 	if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \
 	    == NULL)							\
 		(head)->sqh_last = &(elm)->field.sqe_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\
 	if ((head)->sqh_first == (elm)) {				\
@@ -375,7 +375,7 @@ struct {								\
 			curelm->field.sqe_next->field.sqe_next) == NULL) \
 			    (head)->sqh_last = &(curelm)->field.sqe_next; \
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_CONCAT(head1, head2) do {				\
 	if (!SIMPLEQ_EMPTY((head2))) {					\
@@ -383,7 +383,7 @@ struct {								\
 		(head1)->sqh_last = (head2)->sqh_last;		\
 		SIMPLEQ_INIT((head2));					\
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	SIMPLEQ_LAST(head, type, field)					\
 	(SIMPLEQ_EMPTY((head)) ?						\
@@ -485,7 +485,7 @@ struct {								\
 #define	TAILQ_INIT(head) do {						\
 	(head)->tqh_first = TAILQ_END(head);				\
 	(head)->tqh_last = &(head)->tqh_first;				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\
 	QUEUEDEBUG_TAILQ_INSERT_HEAD((head), (elm), field)		\
@@ -496,7 +496,7 @@ struct {								\
 		(head)->tqh_last = &(elm)->field.tqe_next;		\
 	(head)->tqh_first = (elm);					\
 	(elm)->field.tqe_prev = &(head)->tqh_first;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\
 	QUEUEDEBUG_TAILQ_INSERT_TAIL((head), (elm), field)		\
@@ -504,7 +504,7 @@ struct {								\
 	(elm)->field.tqe_prev = (head)->tqh_last;			\
 	*(head)->tqh_last = (elm);					\
 	(head)->tqh_last = &(elm)->field.tqe_next;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
 	QUEUEDEBUG_TAILQ_OP((listelm), field)				\
@@ -516,7 +516,7 @@ struct {								\
 		(head)->tqh_last = &(elm)->field.tqe_next;		\
 	(listelm)->field.tqe_next = (elm);				\
 	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
 	QUEUEDEBUG_TAILQ_OP((listelm), field)				\
@@ -524,7 +524,7 @@ struct {								\
 	(elm)->field.tqe_next = (listelm);				\
 	*(listelm)->field.tqe_prev = (elm);				\
 	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_REMOVE(head, elm, field) do {				\
 	QUEUEDEBUG_TAILQ_PREREMOVE((head), (elm), field)		\
@@ -536,7 +536,7 @@ struct {								\
 		(head)->tqh_last = (elm)->field.tqe_prev;		\
 	*(elm)->field.tqe_prev = (elm)->field.tqe_next;			\
 	QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field);			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\
         if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != 	\
@@ -548,7 +548,7 @@ struct {								\
         (elm2)->field.tqe_prev = (elm)->field.tqe_prev;			\
         *(elm2)->field.tqe_prev = (elm2);				\
 	QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field);			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	TAILQ_CONCAT(head1, head2, field) do {				\
 	if (!TAILQ_EMPTY(head2)) {					\
@@ -557,7 +557,7 @@ struct {								\
 		(head1)->tqh_last = (head2)->tqh_last;			\
 		TAILQ_INIT((head2));					\
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 /*
  * Singly-linked Tail queue declarations.
@@ -590,30 +590,30 @@ struct {								\
 #define	STAILQ_INIT(head) do {						\
 	(head)->stqh_first = NULL;					\
 	(head)->stqh_last = &(head)->stqh_first;				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\
 	if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)	\
 		(head)->stqh_last = &(elm)->field.stqe_next;		\
 	(head)->stqh_first = (elm);					\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\
 	(elm)->field.stqe_next = NULL;					\
 	*(head)->stqh_last = (elm);					\
 	(head)->stqh_last = &(elm)->field.stqe_next;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
 	if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
 		(head)->stqh_last = &(elm)->field.stqe_next;		\
 	(listelm)->field.stqe_next = (elm);				\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_REMOVE_HEAD(head, field) do {				\
 	if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \
 		(head)->stqh_last = &(head)->stqh_first;			\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_REMOVE(head, elm, type, field) do {			\
 	if ((head)->stqh_first == (elm)) {				\
@@ -626,7 +626,7 @@ struct {								\
 			curelm->field.stqe_next->field.stqe_next) == NULL) \
 			    (head)->stqh_last = &(curelm)->field.stqe_next; \
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_FOREACH(var, head, field)				\
 	for ((var) = ((head)->stqh_first);				\
@@ -644,7 +644,7 @@ struct {								\
 		(head1)->stqh_last = (head2)->stqh_last;		\
 		STAILQ_INIT((head2));					\
 	}								\
-} while (/*CONSTCOND*/0)
+} while (0)
 
 #define	STAILQ_LAST(head, type, field)					\
 	(STAILQ_EMPTY((head)) ?						\

package/libc/include/generic-netbsd/sys/rbtree.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: rbtree.h,v 1.5.30.2 2024/10/14 04:47:55 martin Exp $	*/
+/*	$NetBSD: rbtree.h,v 1.12 2024/05/12 10:34:56 rillig Exp $	*/
 
 /*-
  * Copyright (c) 2001 The NetBSD Foundation, Inc.
@@ -93,7 +93,7 @@ typedef struct rb_node {
     uintptr_t xorinfo = ((a)->rb_info ^ (b)->rb_info) & RB_FLAG_MASK; \
     (a)->rb_info ^= xorinfo; \
     (b)->rb_info ^= xorinfo; \
-  } while (/*CONSTCOND*/ 0)
+  } while (0)
 #ifdef RBDEBUG
 	TAILQ_ENTRY(rb_node) rb_link;
 #endif
@@ -124,12 +124,17 @@ TAILQ_HEAD(rb_node_qh, rb_node);
 #define	RB_TAILQ_INSERT_HEAD(a, b, c)		TAILQ_INSERT_HEAD(a, b, c)
 #define	RB_TAILQ_INSERT_BEFORE(a, b, c)		TAILQ_INSERT_BEFORE(a, b, c)
 #define	RB_TAILQ_INSERT_AFTER(a, b, c, d)	TAILQ_INSERT_AFTER(a, b, c, d)
+
+#define	RBDEBUG_TREE_INITIALIZER(t)					      \
+	.rbt_nodes = TAILQ_HEAD_INITIALIZER((t).rbt_nodes),
 #else
-#define	RB_TAILQ_REMOVE(a, b, c)		do { } while (/*CONSTCOND*/0)
-#define	RB_TAILQ_INIT(a)			do { } while (/*CONSTCOND*/0)
-#define	RB_TAILQ_INSERT_HEAD(a, b, c)		do { } while (/*CONSTCOND*/0)
-#define	RB_TAILQ_INSERT_BEFORE(a, b, c)		do { } while (/*CONSTCOND*/0)
-#define	RB_TAILQ_INSERT_AFTER(a, b, c, d)	do { } while (/*CONSTCOND*/0)
+#define	RB_TAILQ_REMOVE(a, b, c)		do { } while (0)
+#define	RB_TAILQ_INIT(a)			do { } while (0)
+#define	RB_TAILQ_INSERT_HEAD(a, b, c)		do { } while (0)
+#define	RB_TAILQ_INSERT_BEFORE(a, b, c)		do { } while (0)
+#define	RB_TAILQ_INSERT_AFTER(a, b, c, d)	do { } while (0)
+
+#define	RBDEBUG_TREE_INITIALIZER(t)		/* nothing */
 #endif /* RBDEBUG */
 
 /*
@@ -176,10 +181,19 @@ typedef struct rb_tree {
 #define	RBSTAT_INC(v)	((void)((v)++))
 #define	RBSTAT_DEC(v)	((void)((v)--))
 #else
-#define	RBSTAT_INC(v)	do { } while (/*CONSTCOND*/0)
-#define	RBSTAT_DEC(v)	do { } while (/*CONSTCOND*/0)
+#define	RBSTAT_INC(v)	do { } while (0)
+#define	RBSTAT_DEC(v)	do { } while (0)
 #endif
 
+#define	RB_TREE_INIT_TYPECHECK(t)					      \
+	0*sizeof(&(t) - (struct rb_tree *)0)
+
+#define	RB_TREE_INITIALIZER(t, ops)					      \
+{									      \
+	.rbt_ops = (ops) + RB_TREE_INIT_TYPECHECK(t),			      \
+	RBDEBUG_TREE_INITIALIZER(t)					      \
+}
+
 void	rb_tree_init(rb_tree_t *, const rb_tree_ops_t *);
 void *	rb_tree_insert_node(rb_tree_t *, void *);
 void *	rb_tree_find_node(rb_tree_t *, const void *);

package/libc/include/generic-netbsd/sys/resourcevar.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: resourcevar.h,v 1.57.32.1 2024/10/11 17:12:28 martin Exp $	*/
+/*	$NetBSD: resourcevar.h,v 1.59 2024/05/12 10:34:56 rillig Exp $	*/
 
 /*
  * Copyright (c) 1991, 1993
@@ -95,7 +95,7 @@ struct plimit {
 		    _p->p_stats->p_prof.pr_addr,			\
 		    _p->p_stats->p_prof.pr_ticks);			\
 		_p->p_stats->p_prof.pr_ticks = 0;			\
-	} while (/* CONSTCOND */ 0)
+	} while (0)
 
 extern char defcorename[];
 

package/libc/include/generic-netbsd/sys/rmd160.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: rmd160.h,v 1.3 2016/07/01 16:43:16 christos Exp $	*/
+/*	$NetBSD: rmd160.h,v 1.4 2023/08/01 07:04:16 mrg Exp $	*/
 /*	$KAME: rmd160.h,v 1.2 2003/07/25 09:37:55 itojun Exp $	*/
 /*	$OpenBSD: rmd160.h,v 1.3 2002/03/14 01:26:51 millert Exp $	*/
 /*
@@ -47,10 +47,10 @@ void	 RMD160Transform(uint32_t [5], const u_char [64]);
 void	 RMD160Update(RMD160_CTX *, const u_char *, uint32_t);
 void	 RMD160Final(u_char [RMD160_DIGEST_LENGTH], RMD160_CTX *);
 #ifndef _KERNEL
-char	*RMD160End(RMD160_CTX *, char *);
+char	*RMD160End(RMD160_CTX *, char[RMD160_DIGEST_STRING_LENGTH]);
 char	*RMD160FileChunk(const char *, char *, off_t, off_t);
 char	*RMD160File(const char *, char *);
-char	*RMD160Data(const u_char *, size_t, char *);
+char	*RMD160Data(const u_char *, size_t, char[RMD160_DIGEST_STRING_LENGTH]);
 #endif /* _KERNEL */
 __END_DECLS
 

package/libc/include/generic-netbsd/sys/rndio.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: rndio.h,v 1.2.50.1 2023/08/11 14:35:25 martin Exp $	*/
+/*	$NetBSD: rndio.h,v 1.3 2023/07/16 10:36:21 riastradh Exp $	*/
 
 /*-
  * Copyright (c) 1997 The NetBSD Foundation, Inc.

package/libc/include/generic-netbsd/sys/rwlock.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: rwlock.h,v 1.17.2.1 2023/08/09 17:42:01 martin Exp $	*/
+/*	$NetBSD: rwlock.h,v 1.19 2023/09/07 20:05:41 ad Exp $	*/
 
 /*-
  * Copyright (c) 2002, 2006, 2007, 2008, 2019, 2020 The NetBSD Foundation, Inc.
@@ -84,7 +84,6 @@ typedef struct krwlock krwlock_t;
 void	rw_vector_enter(krwlock_t *, const krw_t);
 void	rw_vector_exit(krwlock_t *);
 int	rw_vector_tryenter(krwlock_t *, const krw_t);
-bool	rw_owner_running(const krwlock_t *);
 #endif	/* __RWLOCK_PRIVATE */
 
 struct krwlock {

package/libc/include/generic-netbsd/sys/sched.h

@@ -1,4 +1,4 @@
-/*	$NetBSD: sched.h,v 1.91.2.1 2023/08/09 17:42:01 martin Exp $	*/
+/*	$NetBSD: sched.h,v 1.94 2023/09/06 12:29:14 riastradh Exp $	*/
 
 /*-
  * Copyright (c) 1999, 2000, 2001, 2002, 2007, 2008, 2019, 2020