1 | /* $NetBSD: kcpuset.h,v 1.11 2014/05/19 20:39:23 rmind Exp $ */ |
2 | |
3 | /*- |
4 | * Copyright (c) 2008, 2011 The NetBSD Foundation, Inc. |
5 | * All rights reserved. |
6 | * |
7 | * This code is derived from software contributed to The NetBSD Foundation |
8 | * by Christos Zoulas and Mindaugas Rasiukevicius. |
9 | * |
10 | * Redistribution and use in source and binary forms, with or without |
11 | * modification, are permitted provided that the following conditions |
12 | * are met: |
13 | * 1. Redistributions of source code must retain the above copyright |
14 | * notice, this list of conditions and the following disclaimer. |
15 | * 2. Redistributions in binary form must reproduce the above copyright |
16 | * notice, this list of conditions and the following disclaimer in the |
17 | * documentation and/or other materials provided with the distribution. |
18 | * |
19 | * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS |
20 | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
21 | * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
22 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS |
23 | * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
24 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
25 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
26 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
27 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
29 | * POSSIBILITY OF SUCH DAMAGE. |
30 | */ |
31 | |
32 | #ifndef _SYS_KCPUSET_H_ |
33 | #define _SYS_KCPUSET_H_ |
34 | |
35 | struct kcpuset; |
36 | typedef struct kcpuset kcpuset_t; |
37 | |
38 | #ifdef _KERNEL |
39 | |
40 | #include <sys/sched.h> |
41 | |
42 | void kcpuset_sysinit(void); |
43 | |
44 | void kcpuset_create(kcpuset_t **, bool); |
45 | void kcpuset_clone(kcpuset_t **, const kcpuset_t *); |
46 | void kcpuset_destroy(kcpuset_t *); |
47 | void kcpuset_copy(kcpuset_t *, const kcpuset_t *); |
48 | |
49 | void kcpuset_use(kcpuset_t *); |
50 | void kcpuset_unuse(kcpuset_t *, kcpuset_t **); |
51 | |
52 | int kcpuset_copyin(const cpuset_t *, kcpuset_t *, size_t); |
53 | int kcpuset_copyout(kcpuset_t *, cpuset_t *, size_t); |
54 | |
55 | void kcpuset_zero(kcpuset_t *); |
56 | void kcpuset_fill(kcpuset_t *); |
57 | void kcpuset_set(kcpuset_t *, cpuid_t); |
58 | void kcpuset_clear(kcpuset_t *, cpuid_t); |
59 | |
60 | bool kcpuset_isset(const kcpuset_t *, cpuid_t); |
61 | bool kcpuset_isotherset(const kcpuset_t *, cpuid_t); |
62 | bool kcpuset_iszero(const kcpuset_t *); |
63 | bool kcpuset_intersecting_p(const kcpuset_t *, const kcpuset_t *); |
64 | bool kcpuset_match(const kcpuset_t *, const kcpuset_t *); |
65 | void kcpuset_intersect(kcpuset_t *, const kcpuset_t *); |
66 | void kcpuset_merge(kcpuset_t *, const kcpuset_t *); |
67 | void kcpuset_remove(kcpuset_t *, const kcpuset_t *); |
68 | int kcpuset_countset(const kcpuset_t *); |
69 | |
70 | cpuid_t kcpuset_ffs(const kcpuset_t *); |
71 | cpuid_t kcpuset_ffs_intersecting(const kcpuset_t *, const kcpuset_t *); |
72 | |
73 | void kcpuset_atomic_set(kcpuset_t *, cpuid_t); |
74 | void kcpuset_atomic_clear(kcpuset_t *, cpuid_t); |
75 | |
76 | void kcpuset_atomicly_zero(kcpuset_t *); |
77 | void kcpuset_atomicly_intersect(kcpuset_t *, const kcpuset_t *); |
78 | void kcpuset_atomicly_merge(kcpuset_t *, const kcpuset_t *); |
79 | void kcpuset_atomicly_remove(kcpuset_t *, const kcpuset_t *); |
80 | |
81 | void kcpuset_export_u32(const kcpuset_t *, uint32_t *, size_t); |
82 | |
83 | #endif |
84 | |
85 | #endif /* _SYS_KCPUSET_H_ */ |
86 | |