19454b2d8SWarner Losh /*- 2ba228f6dSJohn Baldwin * Copyright (c) 2001 Wind River Systems, Inc. 3ba228f6dSJohn Baldwin * All rights reserved. 4ba228f6dSJohn Baldwin * Written by: John Baldwin <jhb@FreeBSD.org> 5ba228f6dSJohn Baldwin * 650c202c5SJeff Roberson * Copyright (c) 2009 Jeffrey Roberson <jeff@freebsd.org> 750c202c5SJeff Roberson * All rights reserved. 850c202c5SJeff Roberson * 9ba228f6dSJohn Baldwin * Redistribution and use in source and binary forms, with or without 10ba228f6dSJohn Baldwin * modification, are permitted provided that the following conditions 11ba228f6dSJohn Baldwin * are met: 12ba228f6dSJohn Baldwin * 1. Redistributions of source code must retain the above copyright 13ba228f6dSJohn Baldwin * notice, this list of conditions and the following disclaimer. 14ba228f6dSJohn Baldwin * 2. Redistributions in binary form must reproduce the above copyright 15ba228f6dSJohn Baldwin * notice, this list of conditions and the following disclaimer in the 16ba228f6dSJohn Baldwin * documentation and/or other materials provided with the distribution. 17ba228f6dSJohn Baldwin * 4. Neither the name of the author nor the names of any co-contributors 18ba228f6dSJohn Baldwin * may be used to endorse or promote products derived from this software 19ba228f6dSJohn Baldwin * without specific prior written permission. 20ba228f6dSJohn Baldwin * 21ba228f6dSJohn Baldwin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 22ba228f6dSJohn Baldwin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23ba228f6dSJohn Baldwin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24ba228f6dSJohn Baldwin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 25ba228f6dSJohn Baldwin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26ba228f6dSJohn Baldwin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27ba228f6dSJohn Baldwin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28ba228f6dSJohn Baldwin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29ba228f6dSJohn Baldwin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30ba228f6dSJohn Baldwin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31ba228f6dSJohn Baldwin * SUCH DAMAGE. 32ba228f6dSJohn Baldwin */ 33ba228f6dSJohn Baldwin 34ba228f6dSJohn Baldwin /* 35ba228f6dSJohn Baldwin * This module provides MI support for per-cpu data. 36882bcf58SJohn Baldwin * 37882bcf58SJohn Baldwin * Each architecture determines the mapping of logical CPU IDs to physical 38882bcf58SJohn Baldwin * CPUs. The requirements of this mapping are as follows: 39882bcf58SJohn Baldwin * - Logical CPU IDs must reside in the range 0 ... MAXCPU - 1. 40882bcf58SJohn Baldwin * - The mapping is not required to be dense. That is, there may be 41882bcf58SJohn Baldwin * gaps in the mappings. 42882bcf58SJohn Baldwin * - The platform sets the value of MAXCPU in <machine/param.h>. 43882bcf58SJohn Baldwin * - It is suggested, but not required, that in the non-SMP case, the 44882bcf58SJohn Baldwin * platform define MAXCPU to be 1 and define the logical ID of the 45882bcf58SJohn Baldwin * sole CPU as 0. 46ba228f6dSJohn Baldwin */ 47ba228f6dSJohn Baldwin 48677b542eSDavid E. O'Brien #include <sys/cdefs.h> 49677b542eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 50677b542eSDavid E. O'Brien 510bbc8826SJohn Baldwin #include "opt_ddb.h" 520bbc8826SJohn Baldwin 53ba228f6dSJohn Baldwin #include <sys/param.h> 54ba228f6dSJohn Baldwin #include <sys/systm.h> 5550c202c5SJeff Roberson #include <sys/sysctl.h> 560bbc8826SJohn Baldwin #include <sys/lock.h> 5750c202c5SJeff Roberson #include <sys/malloc.h> 58ba228f6dSJohn Baldwin #include <sys/pcpu.h> 590bbc8826SJohn Baldwin #include <sys/proc.h> 609b791585SRobert Watson #include <sys/smp.h> 6150c202c5SJeff Roberson #include <sys/sx.h> 620bbc8826SJohn Baldwin #include <ddb/ddb.h> 63ba228f6dSJohn Baldwin 6450c202c5SJeff Roberson MALLOC_DEFINE(M_PCPU, "Per-cpu", "Per-cpu resource accouting."); 6550c202c5SJeff Roberson 6650c202c5SJeff Roberson struct dpcpu_free { 6750c202c5SJeff Roberson uintptr_t df_start; 6850c202c5SJeff Roberson int df_len; 6950c202c5SJeff Roberson TAILQ_ENTRY(dpcpu_free) df_link; 7050c202c5SJeff Roberson }; 7150c202c5SJeff Roberson 723e288e62SDimitry Andric static DPCPU_DEFINE(char, modspace[DPCPU_MODMIN]); 7350c202c5SJeff Roberson static TAILQ_HEAD(, dpcpu_free) dpcpu_head = TAILQ_HEAD_INITIALIZER(dpcpu_head); 7450c202c5SJeff Roberson static struct sx dpcpu_lock; 7550c202c5SJeff Roberson uintptr_t dpcpu_off[MAXCPU]; 76f53d15feSStephan Uphoff struct pcpu *cpuid_to_pcpu[MAXCPU]; 77*d098f930SNathan Whitehorn struct cpuhead cpuhead = STAILQ_HEAD_INITIALIZER(cpuhead); 78ba228f6dSJohn Baldwin 79ba228f6dSJohn Baldwin /* 800bbc8826SJohn Baldwin * Initialize the MI portions of a struct pcpu. 81ba228f6dSJohn Baldwin */ 82ba228f6dSJohn Baldwin void 830bbc8826SJohn Baldwin pcpu_init(struct pcpu *pcpu, int cpuid, size_t size) 84ba228f6dSJohn Baldwin { 85ba228f6dSJohn Baldwin 860bbc8826SJohn Baldwin bzero(pcpu, size); 870bbc8826SJohn Baldwin KASSERT(cpuid >= 0 && cpuid < MAXCPU, 880bbc8826SJohn Baldwin ("pcpu_init: invalid cpuid %d", cpuid)); 890bbc8826SJohn Baldwin pcpu->pc_cpuid = cpuid; 90ab8061d8SPeter Wemm pcpu->pc_cpumask = 1 << cpuid; 910bbc8826SJohn Baldwin cpuid_to_pcpu[cpuid] = pcpu; 92*d098f930SNathan Whitehorn STAILQ_INSERT_TAIL(&cpuhead, pcpu, pc_allcpu); 930bbc8826SJohn Baldwin cpu_pcpu_init(pcpu, cpuid, size); 94f53d15feSStephan Uphoff pcpu->pc_rm_queue.rmq_next = &pcpu->pc_rm_queue; 95f53d15feSStephan Uphoff pcpu->pc_rm_queue.rmq_prev = &pcpu->pc_rm_queue; 968f51ad55SJeff Roberson #ifdef KTR 978f51ad55SJeff Roberson snprintf(pcpu->pc_name, sizeof(pcpu->pc_name), "CPU %d", cpuid); 988f51ad55SJeff Roberson #endif 9950c202c5SJeff Roberson } 100f53d15feSStephan Uphoff 10150c202c5SJeff Roberson void 10250c202c5SJeff Roberson dpcpu_init(void *dpcpu, int cpuid) 10350c202c5SJeff Roberson { 10450c202c5SJeff Roberson struct pcpu *pcpu; 10550c202c5SJeff Roberson 10650c202c5SJeff Roberson pcpu = pcpu_find(cpuid); 10750c202c5SJeff Roberson pcpu->pc_dynamic = (uintptr_t)dpcpu - DPCPU_START; 10850c202c5SJeff Roberson 10950c202c5SJeff Roberson /* 11050c202c5SJeff Roberson * Initialize defaults from our linker section. 11150c202c5SJeff Roberson */ 11250c202c5SJeff Roberson memcpy(dpcpu, (void *)DPCPU_START, DPCPU_BYTES); 11350c202c5SJeff Roberson 11450c202c5SJeff Roberson /* 11550c202c5SJeff Roberson * Place it in the global pcpu offset array. 11650c202c5SJeff Roberson */ 11750c202c5SJeff Roberson dpcpu_off[cpuid] = pcpu->pc_dynamic; 11850c202c5SJeff Roberson } 11950c202c5SJeff Roberson 12050c202c5SJeff Roberson static void 12150c202c5SJeff Roberson dpcpu_startup(void *dummy __unused) 12250c202c5SJeff Roberson { 12350c202c5SJeff Roberson struct dpcpu_free *df; 12450c202c5SJeff Roberson 12550c202c5SJeff Roberson df = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO); 12650c202c5SJeff Roberson df->df_start = (uintptr_t)&DPCPU_NAME(modspace); 127793f71bfSBjoern A. Zeeb df->df_len = DPCPU_MODMIN; 12850c202c5SJeff Roberson TAILQ_INSERT_HEAD(&dpcpu_head, df, df_link); 12950c202c5SJeff Roberson sx_init(&dpcpu_lock, "dpcpu alloc lock"); 13050c202c5SJeff Roberson } 13150c202c5SJeff Roberson SYSINIT(dpcpu, SI_SUB_KLD, SI_ORDER_FIRST, dpcpu_startup, 0); 13250c202c5SJeff Roberson 13350c202c5SJeff Roberson /* 13450c202c5SJeff Roberson * First-fit extent based allocator for allocating space in the per-cpu 13550c202c5SJeff Roberson * region reserved for modules. This is only intended for use by the 13650c202c5SJeff Roberson * kernel linkers to place module linker sets. 13750c202c5SJeff Roberson */ 13850c202c5SJeff Roberson void * 13950c202c5SJeff Roberson dpcpu_alloc(int size) 14050c202c5SJeff Roberson { 14150c202c5SJeff Roberson struct dpcpu_free *df; 14250c202c5SJeff Roberson void *s; 14350c202c5SJeff Roberson 14450c202c5SJeff Roberson s = NULL; 14550c202c5SJeff Roberson size = roundup2(size, sizeof(void *)); 14650c202c5SJeff Roberson sx_xlock(&dpcpu_lock); 14750c202c5SJeff Roberson TAILQ_FOREACH(df, &dpcpu_head, df_link) { 14850c202c5SJeff Roberson if (df->df_len < size) 14950c202c5SJeff Roberson continue; 15050c202c5SJeff Roberson if (df->df_len == size) { 15150c202c5SJeff Roberson s = (void *)df->df_start; 15250c202c5SJeff Roberson TAILQ_REMOVE(&dpcpu_head, df, df_link); 15350c202c5SJeff Roberson free(df, M_PCPU); 15450c202c5SJeff Roberson break; 15550c202c5SJeff Roberson } 15650c202c5SJeff Roberson s = (void *)df->df_start; 15750c202c5SJeff Roberson df->df_len -= size; 15850c202c5SJeff Roberson df->df_start = df->df_start + size; 15950c202c5SJeff Roberson break; 16050c202c5SJeff Roberson } 16150c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 16250c202c5SJeff Roberson 16350c202c5SJeff Roberson return (s); 16450c202c5SJeff Roberson } 16550c202c5SJeff Roberson 16650c202c5SJeff Roberson /* 16750c202c5SJeff Roberson * Free dynamic per-cpu space at module unload time. 16850c202c5SJeff Roberson */ 16950c202c5SJeff Roberson void 17050c202c5SJeff Roberson dpcpu_free(void *s, int size) 17150c202c5SJeff Roberson { 17250c202c5SJeff Roberson struct dpcpu_free *df; 17350c202c5SJeff Roberson struct dpcpu_free *dn; 17450c202c5SJeff Roberson uintptr_t start; 17550c202c5SJeff Roberson uintptr_t end; 17650c202c5SJeff Roberson 17750c202c5SJeff Roberson size = roundup2(size, sizeof(void *)); 17850c202c5SJeff Roberson start = (uintptr_t)s; 17950c202c5SJeff Roberson end = start + size; 18050c202c5SJeff Roberson /* 18150c202c5SJeff Roberson * Free a region of space and merge it with as many neighbors as 18250c202c5SJeff Roberson * possible. Keeping the list sorted simplifies this operation. 18350c202c5SJeff Roberson */ 18450c202c5SJeff Roberson sx_xlock(&dpcpu_lock); 18550c202c5SJeff Roberson TAILQ_FOREACH(df, &dpcpu_head, df_link) { 18650c202c5SJeff Roberson if (df->df_start > end) 18750c202c5SJeff Roberson break; 18850c202c5SJeff Roberson /* 18950c202c5SJeff Roberson * If we expand at the end of an entry we may have to 19050c202c5SJeff Roberson * merge it with the one following it as well. 19150c202c5SJeff Roberson */ 19250c202c5SJeff Roberson if (df->df_start + df->df_len == start) { 19350c202c5SJeff Roberson df->df_len += size; 19450c202c5SJeff Roberson dn = TAILQ_NEXT(df, df_link); 19550c202c5SJeff Roberson if (df->df_start + df->df_len == dn->df_start) { 19650c202c5SJeff Roberson df->df_len += dn->df_len; 19750c202c5SJeff Roberson TAILQ_REMOVE(&dpcpu_head, dn, df_link); 19850c202c5SJeff Roberson free(dn, M_PCPU); 19950c202c5SJeff Roberson } 20050c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 20150c202c5SJeff Roberson return; 20250c202c5SJeff Roberson } 20350c202c5SJeff Roberson if (df->df_start == end) { 20450c202c5SJeff Roberson df->df_start = start; 20550c202c5SJeff Roberson df->df_len += size; 20650c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 20750c202c5SJeff Roberson return; 20850c202c5SJeff Roberson } 20950c202c5SJeff Roberson } 21050c202c5SJeff Roberson dn = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO); 21150c202c5SJeff Roberson dn->df_start = start; 21250c202c5SJeff Roberson dn->df_len = size; 21350c202c5SJeff Roberson if (df) 21450c202c5SJeff Roberson TAILQ_INSERT_BEFORE(df, dn, df_link); 21550c202c5SJeff Roberson else 21650c202c5SJeff Roberson TAILQ_INSERT_TAIL(&dpcpu_head, dn, df_link); 21750c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 21850c202c5SJeff Roberson } 21950c202c5SJeff Roberson 22050c202c5SJeff Roberson /* 22150c202c5SJeff Roberson * Initialize the per-cpu storage from an updated linker-set region. 22250c202c5SJeff Roberson */ 22350c202c5SJeff Roberson void 22450c202c5SJeff Roberson dpcpu_copy(void *s, int size) 22550c202c5SJeff Roberson { 22650c202c5SJeff Roberson #ifdef SMP 22750c202c5SJeff Roberson uintptr_t dpcpu; 22850c202c5SJeff Roberson int i; 22950c202c5SJeff Roberson 23050c202c5SJeff Roberson for (i = 0; i < mp_ncpus; ++i) { 23150c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 23250c202c5SJeff Roberson if (dpcpu == 0) 23350c202c5SJeff Roberson continue; 23450c202c5SJeff Roberson memcpy((void *)(dpcpu + (uintptr_t)s), s, size); 23550c202c5SJeff Roberson } 23650c202c5SJeff Roberson #else 23750c202c5SJeff Roberson memcpy((void *)(dpcpu_off[0] + (uintptr_t)s), s, size); 23850c202c5SJeff Roberson #endif 239ba228f6dSJohn Baldwin } 240ba228f6dSJohn Baldwin 241ba228f6dSJohn Baldwin /* 2420bbc8826SJohn Baldwin * Destroy a struct pcpu. 243ba228f6dSJohn Baldwin */ 2440bbc8826SJohn Baldwin void 2450bbc8826SJohn Baldwin pcpu_destroy(struct pcpu *pcpu) 246ba228f6dSJohn Baldwin { 247ba228f6dSJohn Baldwin 248*d098f930SNathan Whitehorn STAILQ_REMOVE(&cpuhead, pcpu, pcpu, pc_allcpu); 2490bbc8826SJohn Baldwin cpuid_to_pcpu[pcpu->pc_cpuid] = NULL; 25050c202c5SJeff Roberson dpcpu_off[pcpu->pc_cpuid] = 0; 251ba228f6dSJohn Baldwin } 2520bbc8826SJohn Baldwin 2530bbc8826SJohn Baldwin /* 2540bbc8826SJohn Baldwin * Locate a struct pcpu by cpu id. 2550bbc8826SJohn Baldwin */ 2560bbc8826SJohn Baldwin struct pcpu * 2570bbc8826SJohn Baldwin pcpu_find(u_int cpuid) 2580bbc8826SJohn Baldwin { 2590bbc8826SJohn Baldwin 2600bbc8826SJohn Baldwin return (cpuid_to_pcpu[cpuid]); 2610bbc8826SJohn Baldwin } 2620bbc8826SJohn Baldwin 26350c202c5SJeff Roberson int 26450c202c5SJeff Roberson sysctl_dpcpu_quad(SYSCTL_HANDLER_ARGS) 26550c202c5SJeff Roberson { 26650c202c5SJeff Roberson uintptr_t dpcpu; 267e6e06a8bSJeff Roberson int64_t count; 26850c202c5SJeff Roberson int i; 26950c202c5SJeff Roberson 27050c202c5SJeff Roberson count = 0; 27150c202c5SJeff Roberson for (i = 0; i < mp_ncpus; ++i) { 27250c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 27350c202c5SJeff Roberson if (dpcpu == 0) 27450c202c5SJeff Roberson continue; 27550c202c5SJeff Roberson count += *(int64_t *)(dpcpu + (uintptr_t)arg1); 27650c202c5SJeff Roberson } 277e6e06a8bSJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 278e6e06a8bSJeff Roberson } 279e6e06a8bSJeff Roberson 280e6e06a8bSJeff Roberson int 281e6e06a8bSJeff Roberson sysctl_dpcpu_long(SYSCTL_HANDLER_ARGS) 282e6e06a8bSJeff Roberson { 283e6e06a8bSJeff Roberson uintptr_t dpcpu; 284e6e06a8bSJeff Roberson long count; 285e6e06a8bSJeff Roberson int i; 286e6e06a8bSJeff Roberson 287e6e06a8bSJeff Roberson count = 0; 288e6e06a8bSJeff Roberson for (i = 0; i < mp_ncpus; ++i) { 289e6e06a8bSJeff Roberson dpcpu = dpcpu_off[i]; 290e6e06a8bSJeff Roberson if (dpcpu == 0) 291e6e06a8bSJeff Roberson continue; 292e6e06a8bSJeff Roberson count += *(long *)(dpcpu + (uintptr_t)arg1); 293e6e06a8bSJeff Roberson } 29450c202c5SJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 29550c202c5SJeff Roberson } 29650c202c5SJeff Roberson 29750c202c5SJeff Roberson int 29850c202c5SJeff Roberson sysctl_dpcpu_int(SYSCTL_HANDLER_ARGS) 29950c202c5SJeff Roberson { 30050c202c5SJeff Roberson uintptr_t dpcpu; 301e6e06a8bSJeff Roberson int count; 30250c202c5SJeff Roberson int i; 30350c202c5SJeff Roberson 30450c202c5SJeff Roberson count = 0; 30550c202c5SJeff Roberson for (i = 0; i < mp_ncpus; ++i) { 30650c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 30750c202c5SJeff Roberson if (dpcpu == 0) 30850c202c5SJeff Roberson continue; 30950c202c5SJeff Roberson count += *(int *)(dpcpu + (uintptr_t)arg1); 31050c202c5SJeff Roberson } 31150c202c5SJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 31250c202c5SJeff Roberson } 31350c202c5SJeff Roberson 3140bbc8826SJohn Baldwin #ifdef DDB 315f2140faeSBjoern A. Zeeb DB_SHOW_COMMAND(dpcpu_off, db_show_dpcpu_off) 316f2140faeSBjoern A. Zeeb { 317f2140faeSBjoern A. Zeeb int id; 318f2140faeSBjoern A. Zeeb 3193aa6d94eSJohn Baldwin CPU_FOREACH(id) { 320f2140faeSBjoern A. Zeeb db_printf("dpcpu_off[%2d] = 0x%jx (+ DPCPU_START = %p)\n", 321f2140faeSBjoern A. Zeeb id, (uintmax_t)dpcpu_off[id], 322f2140faeSBjoern A. Zeeb (void *)(uintptr_t)(dpcpu_off[id] + DPCPU_START)); 323f2140faeSBjoern A. Zeeb } 324f2140faeSBjoern A. Zeeb } 3250bbc8826SJohn Baldwin 3269b791585SRobert Watson static void 3279b791585SRobert Watson show_pcpu(struct pcpu *pc) 3289b791585SRobert Watson { 3299b791585SRobert Watson struct thread *td; 3309b791585SRobert Watson 3310bbc8826SJohn Baldwin db_printf("cpuid = %d\n", pc->pc_cpuid); 33250c202c5SJeff Roberson db_printf("dynamic pcpu = %p\n", (void *)pc->pc_dynamic); 3330bbc8826SJohn Baldwin db_printf("curthread = "); 3340bbc8826SJohn Baldwin td = pc->pc_curthread; 3350bbc8826SJohn Baldwin if (td != NULL) 3360bbc8826SJohn Baldwin db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid, 337431f8906SJulian Elischer td->td_name); 3380bbc8826SJohn Baldwin else 3390bbc8826SJohn Baldwin db_printf("none\n"); 3400bbc8826SJohn Baldwin db_printf("curpcb = %p\n", pc->pc_curpcb); 3410bbc8826SJohn Baldwin db_printf("fpcurthread = "); 3420bbc8826SJohn Baldwin td = pc->pc_fpcurthread; 3430bbc8826SJohn Baldwin if (td != NULL) 3440bbc8826SJohn Baldwin db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid, 345431f8906SJulian Elischer td->td_name); 3460bbc8826SJohn Baldwin else 3470bbc8826SJohn Baldwin db_printf("none\n"); 3480bbc8826SJohn Baldwin db_printf("idlethread = "); 3490bbc8826SJohn Baldwin td = pc->pc_idlethread; 3500bbc8826SJohn Baldwin if (td != NULL) 351e826ef1eSJohn Baldwin db_printf("%p: tid %d \"%s\"\n", td, td->td_tid, td->td_name); 3520bbc8826SJohn Baldwin else 3530bbc8826SJohn Baldwin db_printf("none\n"); 3540bbc8826SJohn Baldwin db_show_mdpcpu(pc); 3550bbc8826SJohn Baldwin 35621ca7b57SMarko Zec #ifdef VIMAGE 35721ca7b57SMarko Zec db_printf("curvnet = %p\n", pc->pc_curthread->td_vnet); 35821ca7b57SMarko Zec #endif 35921ca7b57SMarko Zec 3600bbc8826SJohn Baldwin #ifdef WITNESS 3610bbc8826SJohn Baldwin db_printf("spin locks held:\n"); 36298332c8cSAttilio Rao witness_list_locks(&pc->pc_spinlocks, db_printf); 3630bbc8826SJohn Baldwin #endif 3640bbc8826SJohn Baldwin } 3659b791585SRobert Watson 3669b791585SRobert Watson DB_SHOW_COMMAND(pcpu, db_show_pcpu) 3679b791585SRobert Watson { 3689b791585SRobert Watson struct pcpu *pc; 3699b791585SRobert Watson int id; 3709b791585SRobert Watson 3719b791585SRobert Watson if (have_addr) 3729b791585SRobert Watson id = ((addr >> 4) % 16) * 10 + (addr % 16); 3739b791585SRobert Watson else 3749b791585SRobert Watson id = PCPU_GET(cpuid); 3759b791585SRobert Watson pc = pcpu_find(id); 3769b791585SRobert Watson if (pc == NULL) { 3779b791585SRobert Watson db_printf("CPU %d not found\n", id); 3789b791585SRobert Watson return; 3799b791585SRobert Watson } 3809b791585SRobert Watson show_pcpu(pc); 3819b791585SRobert Watson } 3829b791585SRobert Watson 38339297ba4SSam Leffler DB_SHOW_ALL_COMMAND(pcpu, db_show_cpu_all) 3849b791585SRobert Watson { 3859b791585SRobert Watson struct pcpu *pc; 3869b791585SRobert Watson int id; 3879b791585SRobert Watson 3889b791585SRobert Watson db_printf("Current CPU: %d\n\n", PCPU_GET(cpuid)); 38955de4dcaSJohn Baldwin for (id = 0; id <= mp_maxid; id++) { 3909b791585SRobert Watson pc = pcpu_find(id); 3919b791585SRobert Watson if (pc != NULL) { 3929b791585SRobert Watson show_pcpu(pc); 3939b791585SRobert Watson db_printf("\n"); 3949b791585SRobert Watson } 3959b791585SRobert Watson } 3969b791585SRobert Watson } 39739297ba4SSam Leffler DB_SHOW_ALIAS(allpcpu, db_show_cpu_all); 3980bbc8826SJohn Baldwin #endif 399