1/*	$OpenBSD: resourcevar.h,v 1.31 2023/10/17 00:04:02 cheloha Exp $	*/
2/*	$NetBSD: resourcevar.h,v 1.12 1995/11/22 23:01:53 cgd Exp $	*/
3
4/*
5 * Copyright (c) 1991, 1993
6 *	The Regents of the University of California.  All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 *    may be used to endorse or promote products derived from this software
18 *    without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 *	@(#)resourcevar.h	8.3 (Berkeley) 2/22/94
33 */
34
35#ifndef	_SYS_RESOURCEVAR_H_
36#define	_SYS_RESOURCEVAR_H_
37
38#include <sys/refcnt.h>
39#include <sys/timeout.h>
40
41/*
42 * Kernel shareable process resource limits.  Because this structure
43 * is moderately large but changes infrequently, it is shared
44 * copy-on-write after forks.
45 */
46struct plimit {
47	struct	rlimit pl_rlimit[RLIM_NLIMITS];
48	struct	refcnt pl_refcnt;
49};
50
51/* add user profiling from AST */
52#define	ADDUPROF(p)							\
53do {									\
54	atomic_clearbits_int(&(p)->p_flag, P_OWEUPC);			\
55	addupc_task((p), (p)->p_prof_addr, (p)->p_prof_ticks);		\
56	(p)->p_prof_ticks = 0;						\
57} while (0)
58
59#ifdef _KERNEL
60
61#include <lib/libkern/libkern.h>	/* for KASSERT() */
62
63extern uint64_t profclock_period;
64
65void	 addupc_intr(struct proc *, u_long, u_long);
66void	 addupc_task(struct proc *, u_long, u_int);
67struct clockrequest;
68void	 profclock(struct clockrequest *, void *, void *);
69void	 tuagg_locked(struct process *, struct proc *, const struct timespec *);
70void	 tuagg(struct process *, struct proc *);
71struct tusage;
72void	 calctsru(struct tusage *, struct timespec *, struct timespec *,
73	    struct timespec *);
74void	 calcru(struct tusage *, struct timeval *, struct timeval *,
75	    struct timeval *);
76void	 lim_startup(struct plimit *);
77void	 lim_free(struct plimit *);
78void	 lim_fork(struct process *, struct process *);
79struct plimit *lim_read_enter(void);
80
81/*
82 * Finish read access to resource limits.
83 */
84static inline void
85lim_read_leave(struct plimit *limit)
86{
87	/* nothing */
88}
89
90/*
91 * Get the value of the resource limit in current process.
92 */
93static inline rlim_t
94lim_cur(int which)
95{
96	struct plimit *limit;
97	rlim_t val;
98
99	KASSERT(which >= 0 && which < RLIM_NLIMITS);
100
101	limit = lim_read_enter();
102	val = limit->pl_rlimit[which].rlim_cur;
103	lim_read_leave(limit);
104	return (val);
105}
106
107rlim_t	 lim_cur_proc(struct proc *, int);
108
109void	 ruadd(struct rusage *, struct rusage *);
110void	 rucheck(void *);
111#endif
112#endif	/* !_SYS_RESOURCEVAR_H_ */
113