2 * Copyright (c) 2001 Wind River Systems, Inc.
4 * Written by: John Baldwin <jhb@FreeBSD.org>
6 * Copyright (c) 2009 Jeffrey Roberson <jeff@freebsd.org>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 4. Neither the name of the author nor the names of any co-contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * This module provides MI support for per-cpu data.
37 * Each architecture determines the mapping of logical CPU IDs to physical
38 * CPUs. The requirements of this mapping are as follows:
39 * - Logical CPU IDs must reside in the range 0 ... MAXCPU - 1.
40 * - The mapping is not required to be dense. That is, there may be
41 * gaps in the mappings.
42 * - The platform sets the value of MAXCPU in <machine/param.h>.
43 * - It is suggested, but not required, that in the non-SMP case, the
44 * platform define MAXCPU to be 1 and define the logical ID of the
48 #include <sys/cdefs.h>
49 __FBSDID("$FreeBSD$");
53 #include <sys/param.h>
54 #include <sys/systm.h>
55 #include <sys/sysctl.h>
57 #include <sys/malloc.h>
64 static MALLOC_DEFINE(M_PCPU, "Per-cpu", "Per-cpu resource accouting.");
69 TAILQ_ENTRY(dpcpu_free) df_link;
72 static DPCPU_DEFINE(char, modspace[DPCPU_MODMIN]);
73 static TAILQ_HEAD(, dpcpu_free) dpcpu_head = TAILQ_HEAD_INITIALIZER(dpcpu_head);
74 static struct sx dpcpu_lock;
75 uintptr_t dpcpu_off[MAXCPU];
76 struct pcpu *cpuid_to_pcpu[MAXCPU];
77 struct cpuhead cpuhead = STAILQ_HEAD_INITIALIZER(cpuhead);
80 * Initialize the MI portions of a struct pcpu.
83 pcpu_init(struct pcpu *pcpu, int cpuid, size_t size)
87 KASSERT(cpuid >= 0 && cpuid < MAXCPU,
88 ("pcpu_init: invalid cpuid %d", cpuid));
89 pcpu->pc_cpuid = cpuid;
90 cpuid_to_pcpu[cpuid] = pcpu;
91 STAILQ_INSERT_TAIL(&cpuhead, pcpu, pc_allcpu);
92 cpu_pcpu_init(pcpu, cpuid, size);
93 pcpu->pc_rm_queue.rmq_next = &pcpu->pc_rm_queue;
94 pcpu->pc_rm_queue.rmq_prev = &pcpu->pc_rm_queue;
98 dpcpu_init(void *dpcpu, int cpuid)
102 pcpu = pcpu_find(cpuid);
103 pcpu->pc_dynamic = (uintptr_t)dpcpu - DPCPU_START;
106 * Initialize defaults from our linker section.
108 memcpy(dpcpu, (void *)DPCPU_START, DPCPU_BYTES);
111 * Place it in the global pcpu offset array.
113 dpcpu_off[cpuid] = pcpu->pc_dynamic;
117 dpcpu_startup(void *dummy __unused)
119 struct dpcpu_free *df;
121 df = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO);
122 df->df_start = (uintptr_t)&DPCPU_NAME(modspace);
123 df->df_len = DPCPU_MODMIN;
124 TAILQ_INSERT_HEAD(&dpcpu_head, df, df_link);
125 sx_init(&dpcpu_lock, "dpcpu alloc lock");
127 SYSINIT(dpcpu, SI_SUB_KLD, SI_ORDER_FIRST, dpcpu_startup, 0);
130 * First-fit extent based allocator for allocating space in the per-cpu
131 * region reserved for modules. This is only intended for use by the
132 * kernel linkers to place module linker sets.
135 dpcpu_alloc(int size)
137 struct dpcpu_free *df;
141 size = roundup2(size, sizeof(void *));
142 sx_xlock(&dpcpu_lock);
143 TAILQ_FOREACH(df, &dpcpu_head, df_link) {
144 if (df->df_len < size)
146 if (df->df_len == size) {
147 s = (void *)df->df_start;
148 TAILQ_REMOVE(&dpcpu_head, df, df_link);
152 s = (void *)df->df_start;
154 df->df_start = df->df_start + size;
157 sx_xunlock(&dpcpu_lock);
163 * Free dynamic per-cpu space at module unload time.
166 dpcpu_free(void *s, int size)
168 struct dpcpu_free *df;
169 struct dpcpu_free *dn;
173 size = roundup2(size, sizeof(void *));
174 start = (uintptr_t)s;
177 * Free a region of space and merge it with as many neighbors as
178 * possible. Keeping the list sorted simplifies this operation.
180 sx_xlock(&dpcpu_lock);
181 TAILQ_FOREACH(df, &dpcpu_head, df_link) {
182 if (df->df_start > end)
185 * If we expand at the end of an entry we may have to
186 * merge it with the one following it as well.
188 if (df->df_start + df->df_len == start) {
190 dn = TAILQ_NEXT(df, df_link);
191 if (df->df_start + df->df_len == dn->df_start) {
192 df->df_len += dn->df_len;
193 TAILQ_REMOVE(&dpcpu_head, dn, df_link);
196 sx_xunlock(&dpcpu_lock);
199 if (df->df_start == end) {
200 df->df_start = start;
202 sx_xunlock(&dpcpu_lock);
206 dn = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO);
207 dn->df_start = start;
210 TAILQ_INSERT_BEFORE(df, dn, df_link);
212 TAILQ_INSERT_TAIL(&dpcpu_head, dn, df_link);
213 sx_xunlock(&dpcpu_lock);
217 * Initialize the per-cpu storage from an updated linker-set region.
220 dpcpu_copy(void *s, int size)
226 for (i = 0; i < mp_ncpus; ++i) {
227 dpcpu = dpcpu_off[i];
230 memcpy((void *)(dpcpu + (uintptr_t)s), s, size);
233 memcpy((void *)(dpcpu_off[0] + (uintptr_t)s), s, size);
238 * Destroy a struct pcpu.
241 pcpu_destroy(struct pcpu *pcpu)
244 STAILQ_REMOVE(&cpuhead, pcpu, pcpu, pc_allcpu);
245 cpuid_to_pcpu[pcpu->pc_cpuid] = NULL;
246 dpcpu_off[pcpu->pc_cpuid] = 0;
250 * Locate a struct pcpu by cpu id.
253 pcpu_find(u_int cpuid)
256 return (cpuid_to_pcpu[cpuid]);
260 sysctl_dpcpu_quad(SYSCTL_HANDLER_ARGS)
267 for (i = 0; i < mp_ncpus; ++i) {
268 dpcpu = dpcpu_off[i];
271 count += *(int64_t *)(dpcpu + (uintptr_t)arg1);
273 return (SYSCTL_OUT(req, &count, sizeof(count)));
277 sysctl_dpcpu_long(SYSCTL_HANDLER_ARGS)
284 for (i = 0; i < mp_ncpus; ++i) {
285 dpcpu = dpcpu_off[i];
288 count += *(long *)(dpcpu + (uintptr_t)arg1);
290 return (SYSCTL_OUT(req, &count, sizeof(count)));
294 sysctl_dpcpu_int(SYSCTL_HANDLER_ARGS)
301 for (i = 0; i < mp_ncpus; ++i) {
302 dpcpu = dpcpu_off[i];
305 count += *(int *)(dpcpu + (uintptr_t)arg1);
307 return (SYSCTL_OUT(req, &count, sizeof(count)));
311 DB_SHOW_COMMAND(dpcpu_off, db_show_dpcpu_off)
316 db_printf("dpcpu_off[%2d] = 0x%jx (+ DPCPU_START = %p)\n",
317 id, (uintmax_t)dpcpu_off[id],
318 (void *)(uintptr_t)(dpcpu_off[id] + DPCPU_START));
323 show_pcpu(struct pcpu *pc)
327 db_printf("cpuid = %d\n", pc->pc_cpuid);
328 db_printf("dynamic pcpu = %p\n", (void *)pc->pc_dynamic);
329 db_printf("curthread = ");
330 td = pc->pc_curthread;
332 db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid,
336 db_printf("curpcb = %p\n", pc->pc_curpcb);
337 db_printf("fpcurthread = ");
338 td = pc->pc_fpcurthread;
340 db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid,
344 db_printf("idlethread = ");
345 td = pc->pc_idlethread;
347 db_printf("%p: tid %d \"%s\"\n", td, td->td_tid, td->td_name);
353 db_printf("curvnet = %p\n", pc->pc_curthread->td_vnet);
357 db_printf("spin locks held:\n");
358 witness_list_locks(&pc->pc_spinlocks, db_printf);
362 DB_SHOW_COMMAND(pcpu, db_show_pcpu)
368 id = ((addr >> 4) % 16) * 10 + (addr % 16);
370 id = PCPU_GET(cpuid);
373 db_printf("CPU %d not found\n", id);
379 DB_SHOW_ALL_COMMAND(pcpu, db_show_cpu_all)
384 db_printf("Current CPU: %d\n\n", PCPU_GET(cpuid));
385 for (id = 0; id <= mp_maxid; id++) {
393 DB_SHOW_ALIAS(allpcpu, db_show_cpu_all);