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>
56 #include <sys/linker_set.h>
58 #include <sys/malloc.h>
65 MALLOC_DEFINE(M_PCPU, "Per-cpu", "Per-cpu resource accouting.");
70 TAILQ_ENTRY(dpcpu_free) df_link;
73 static DPCPU_DEFINE(char, modspace[DPCPU_MODMIN]);
74 static TAILQ_HEAD(, dpcpu_free) dpcpu_head = TAILQ_HEAD_INITIALIZER(dpcpu_head);
75 static struct sx dpcpu_lock;
76 uintptr_t dpcpu_off[MAXCPU];
77 struct pcpu *cpuid_to_pcpu[MAXCPU];
78 struct cpuhead cpuhead = SLIST_HEAD_INITIALIZER(cpuhead);
81 * Initialize the MI portions of a struct pcpu.
84 pcpu_init(struct pcpu *pcpu, int cpuid, size_t size)
88 KASSERT(cpuid >= 0 && cpuid < MAXCPU,
89 ("pcpu_init: invalid cpuid %d", cpuid));
90 pcpu->pc_cpuid = cpuid;
91 pcpu->pc_cpumask = 1 << cpuid;
92 cpuid_to_pcpu[cpuid] = pcpu;
93 SLIST_INSERT_HEAD(&cpuhead, pcpu, pc_allcpu);
94 cpu_pcpu_init(pcpu, cpuid, size);
95 pcpu->pc_rm_queue.rmq_next = &pcpu->pc_rm_queue;
96 pcpu->pc_rm_queue.rmq_prev = &pcpu->pc_rm_queue;
98 snprintf(pcpu->pc_name, sizeof(pcpu->pc_name), "CPU %d", cpuid);
103 dpcpu_init(void *dpcpu, int cpuid)
107 pcpu = pcpu_find(cpuid);
108 pcpu->pc_dynamic = (uintptr_t)dpcpu - DPCPU_START;
111 * Initialize defaults from our linker section.
113 memcpy(dpcpu, (void *)DPCPU_START, DPCPU_BYTES);
116 * Place it in the global pcpu offset array.
118 dpcpu_off[cpuid] = pcpu->pc_dynamic;
122 dpcpu_startup(void *dummy __unused)
124 struct dpcpu_free *df;
126 df = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO);
127 df->df_start = (uintptr_t)&DPCPU_NAME(modspace);
128 df->df_len = DPCPU_MODMIN;
129 TAILQ_INSERT_HEAD(&dpcpu_head, df, df_link);
130 sx_init(&dpcpu_lock, "dpcpu alloc lock");
132 SYSINIT(dpcpu, SI_SUB_KLD, SI_ORDER_FIRST, dpcpu_startup, 0);
135 * First-fit extent based allocator for allocating space in the per-cpu
136 * region reserved for modules. This is only intended for use by the
137 * kernel linkers to place module linker sets.
140 dpcpu_alloc(int size)
142 struct dpcpu_free *df;
146 size = roundup2(size, sizeof(void *));
147 sx_xlock(&dpcpu_lock);
148 TAILQ_FOREACH(df, &dpcpu_head, df_link) {
149 if (df->df_len < size)
151 if (df->df_len == size) {
152 s = (void *)df->df_start;
153 TAILQ_REMOVE(&dpcpu_head, df, df_link);
157 s = (void *)df->df_start;
159 df->df_start = df->df_start + size;
162 sx_xunlock(&dpcpu_lock);
168 * Free dynamic per-cpu space at module unload time.
171 dpcpu_free(void *s, int size)
173 struct dpcpu_free *df;
174 struct dpcpu_free *dn;
178 size = roundup2(size, sizeof(void *));
179 start = (uintptr_t)s;
182 * Free a region of space and merge it with as many neighbors as
183 * possible. Keeping the list sorted simplifies this operation.
185 sx_xlock(&dpcpu_lock);
186 TAILQ_FOREACH(df, &dpcpu_head, df_link) {
187 if (df->df_start > end)
190 * If we expand at the end of an entry we may have to
191 * merge it with the one following it as well.
193 if (df->df_start + df->df_len == start) {
195 dn = TAILQ_NEXT(df, df_link);
196 if (df->df_start + df->df_len == dn->df_start) {
197 df->df_len += dn->df_len;
198 TAILQ_REMOVE(&dpcpu_head, dn, df_link);
201 sx_xunlock(&dpcpu_lock);
204 if (df->df_start == end) {
205 df->df_start = start;
207 sx_xunlock(&dpcpu_lock);
211 dn = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO);
212 dn->df_start = start;
215 TAILQ_INSERT_BEFORE(df, dn, df_link);
217 TAILQ_INSERT_TAIL(&dpcpu_head, dn, df_link);
218 sx_xunlock(&dpcpu_lock);
222 * Initialize the per-cpu storage from an updated linker-set region.
225 dpcpu_copy(void *s, int size)
231 for (i = 0; i < mp_ncpus; ++i) {
232 dpcpu = dpcpu_off[i];
235 memcpy((void *)(dpcpu + (uintptr_t)s), s, size);
238 memcpy((void *)(dpcpu_off[0] + (uintptr_t)s), s, size);
243 * Destroy a struct pcpu.
246 pcpu_destroy(struct pcpu *pcpu)
249 SLIST_REMOVE(&cpuhead, pcpu, pcpu, pc_allcpu);
250 cpuid_to_pcpu[pcpu->pc_cpuid] = NULL;
251 dpcpu_off[pcpu->pc_cpuid] = 0;
255 * Locate a struct pcpu by cpu id.
258 pcpu_find(u_int cpuid)
261 return (cpuid_to_pcpu[cpuid]);
265 sysctl_dpcpu_quad(SYSCTL_HANDLER_ARGS)
272 for (i = 0; i < mp_ncpus; ++i) {
273 dpcpu = dpcpu_off[i];
276 count += *(int64_t *)(dpcpu + (uintptr_t)arg1);
278 return (SYSCTL_OUT(req, &count, sizeof(count)));
282 sysctl_dpcpu_long(SYSCTL_HANDLER_ARGS)
289 for (i = 0; i < mp_ncpus; ++i) {
290 dpcpu = dpcpu_off[i];
293 count += *(long *)(dpcpu + (uintptr_t)arg1);
295 return (SYSCTL_OUT(req, &count, sizeof(count)));
299 sysctl_dpcpu_int(SYSCTL_HANDLER_ARGS)
306 for (i = 0; i < mp_ncpus; ++i) {
307 dpcpu = dpcpu_off[i];
310 count += *(int *)(dpcpu + (uintptr_t)arg1);
312 return (SYSCTL_OUT(req, &count, sizeof(count)));
316 DB_SHOW_COMMAND(dpcpu_off, db_show_dpcpu_off)
320 for (id = 0; id <= mp_maxid; id++) {
323 db_printf("dpcpu_off[%2d] = 0x%jx (+ DPCPU_START = %p)\n",
324 id, (uintmax_t)dpcpu_off[id],
325 (void *)(uintptr_t)(dpcpu_off[id] + DPCPU_START));
330 show_pcpu(struct pcpu *pc)
334 db_printf("cpuid = %d\n", pc->pc_cpuid);
335 db_printf("dynamic pcpu = %p\n", (void *)pc->pc_dynamic);
336 db_printf("curthread = ");
337 td = pc->pc_curthread;
339 db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid,
343 db_printf("curpcb = %p\n", pc->pc_curpcb);
344 db_printf("fpcurthread = ");
345 td = pc->pc_fpcurthread;
347 db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid,
351 db_printf("idlethread = ");
352 td = pc->pc_idlethread;
354 db_printf("%p: tid %d \"%s\"\n", td, td->td_tid, td->td_name);
360 db_printf("curvnet = %p\n", pc->pc_curthread->td_vnet);
364 db_printf("spin locks held:\n");
365 witness_list_locks(&pc->pc_spinlocks, db_printf);
369 DB_SHOW_COMMAND(pcpu, db_show_pcpu)
375 id = ((addr >> 4) % 16) * 10 + (addr % 16);
377 id = PCPU_GET(cpuid);
380 db_printf("CPU %d not found\n", id);
386 DB_SHOW_ALL_COMMAND(pcpu, db_show_cpu_all)
391 db_printf("Current CPU: %d\n\n", PCPU_GET(cpuid));
392 for (id = 0; id <= mp_maxid; id++) {
400 DB_SHOW_ALIAS(allpcpu, db_show_cpu_all);