19454b2d8SWarner Losh /*- 251369649SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause 351369649SPedro F. Giffuni * 4ba228f6dSJohn Baldwin * Copyright (c) 2001 Wind River Systems, Inc. 5ba228f6dSJohn Baldwin * All rights reserved. 6ba228f6dSJohn Baldwin * Written by: John Baldwin <jhb@FreeBSD.org> 7ba228f6dSJohn Baldwin * 850c202c5SJeff Roberson * Copyright (c) 2009 Jeffrey Roberson <jeff@freebsd.org> 950c202c5SJeff Roberson * All rights reserved. 1050c202c5SJeff Roberson * 11ba228f6dSJohn Baldwin * Redistribution and use in source and binary forms, with or without 12ba228f6dSJohn Baldwin * modification, are permitted provided that the following conditions 13ba228f6dSJohn Baldwin * are met: 14ba228f6dSJohn Baldwin * 1. Redistributions of source code must retain the above copyright 15ba228f6dSJohn Baldwin * notice, this list of conditions and the following disclaimer. 16ba228f6dSJohn Baldwin * 2. Redistributions in binary form must reproduce the above copyright 17ba228f6dSJohn Baldwin * notice, this list of conditions and the following disclaimer in the 18ba228f6dSJohn Baldwin * documentation and/or other materials provided with the distribution. 1969a28758SEd Maste * 3. Neither the name of the author nor the names of any co-contributors 20ba228f6dSJohn Baldwin * may be used to endorse or promote products derived from this software 21ba228f6dSJohn Baldwin * without specific prior written permission. 22ba228f6dSJohn Baldwin * 23ba228f6dSJohn Baldwin * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 24ba228f6dSJohn Baldwin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25ba228f6dSJohn Baldwin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26ba228f6dSJohn Baldwin * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 27ba228f6dSJohn Baldwin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28ba228f6dSJohn Baldwin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29ba228f6dSJohn Baldwin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30ba228f6dSJohn Baldwin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31ba228f6dSJohn Baldwin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32ba228f6dSJohn Baldwin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33ba228f6dSJohn Baldwin * SUCH DAMAGE. 34ba228f6dSJohn Baldwin */ 35ba228f6dSJohn Baldwin 36ba228f6dSJohn Baldwin /* 37ba228f6dSJohn Baldwin * This module provides MI support for per-cpu data. 38882bcf58SJohn Baldwin * 39882bcf58SJohn Baldwin * Each architecture determines the mapping of logical CPU IDs to physical 40882bcf58SJohn Baldwin * CPUs. The requirements of this mapping are as follows: 41882bcf58SJohn Baldwin * - Logical CPU IDs must reside in the range 0 ... MAXCPU - 1. 42882bcf58SJohn Baldwin * - The mapping is not required to be dense. That is, there may be 43882bcf58SJohn Baldwin * gaps in the mappings. 44882bcf58SJohn Baldwin * - The platform sets the value of MAXCPU in <machine/param.h>. 45882bcf58SJohn Baldwin * - It is suggested, but not required, that in the non-SMP case, the 46882bcf58SJohn Baldwin * platform define MAXCPU to be 1 and define the logical ID of the 47882bcf58SJohn Baldwin * sole CPU as 0. 48ba228f6dSJohn Baldwin */ 49ba228f6dSJohn Baldwin 50677b542eSDavid E. O'Brien #include <sys/cdefs.h> 51677b542eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 52677b542eSDavid E. O'Brien 530bbc8826SJohn Baldwin #include "opt_ddb.h" 540bbc8826SJohn Baldwin 55ba228f6dSJohn Baldwin #include <sys/param.h> 56ba228f6dSJohn Baldwin #include <sys/systm.h> 5750c202c5SJeff Roberson #include <sys/sysctl.h> 580bbc8826SJohn Baldwin #include <sys/lock.h> 5950c202c5SJeff Roberson #include <sys/malloc.h> 60ba228f6dSJohn Baldwin #include <sys/pcpu.h> 610bbc8826SJohn Baldwin #include <sys/proc.h> 629b791585SRobert Watson #include <sys/smp.h> 6350c202c5SJeff Roberson #include <sys/sx.h> 6449fef6a2SGleb Smirnoff #include <vm/uma.h> 650bbc8826SJohn Baldwin #include <ddb/ddb.h> 66ba228f6dSJohn Baldwin 67d745c852SEd Schouten static MALLOC_DEFINE(M_PCPU, "Per-cpu", "Per-cpu resource accouting."); 6850c202c5SJeff Roberson 6950c202c5SJeff Roberson struct dpcpu_free { 7050c202c5SJeff Roberson uintptr_t df_start; 7150c202c5SJeff Roberson int df_len; 7250c202c5SJeff Roberson TAILQ_ENTRY(dpcpu_free) df_link; 7350c202c5SJeff Roberson }; 7450c202c5SJeff Roberson 75cd2106eaSAndrew Turner DPCPU_DEFINE_STATIC(char, modspace[DPCPU_MODMIN] __aligned(__alignof(void *))); 7650c202c5SJeff Roberson static TAILQ_HEAD(, dpcpu_free) dpcpu_head = TAILQ_HEAD_INITIALIZER(dpcpu_head); 7750c202c5SJeff Roberson static struct sx dpcpu_lock; 7850c202c5SJeff Roberson uintptr_t dpcpu_off[MAXCPU]; 79f53d15feSStephan Uphoff struct pcpu *cpuid_to_pcpu[MAXCPU]; 80d098f930SNathan Whitehorn struct cpuhead cpuhead = STAILQ_HEAD_INITIALIZER(cpuhead); 81ba228f6dSJohn Baldwin 82ba228f6dSJohn Baldwin /* 830bbc8826SJohn Baldwin * Initialize the MI portions of a struct pcpu. 84ba228f6dSJohn Baldwin */ 85ba228f6dSJohn Baldwin void 860bbc8826SJohn Baldwin pcpu_init(struct pcpu *pcpu, int cpuid, size_t size) 87ba228f6dSJohn Baldwin { 88ba228f6dSJohn Baldwin 890bbc8826SJohn Baldwin bzero(pcpu, size); 900bbc8826SJohn Baldwin KASSERT(cpuid >= 0 && cpuid < MAXCPU, 910bbc8826SJohn Baldwin ("pcpu_init: invalid cpuid %d", cpuid)); 920bbc8826SJohn Baldwin pcpu->pc_cpuid = cpuid; 930bbc8826SJohn Baldwin cpuid_to_pcpu[cpuid] = pcpu; 94d098f930SNathan Whitehorn STAILQ_INSERT_TAIL(&cpuhead, pcpu, pc_allcpu); 950bbc8826SJohn Baldwin cpu_pcpu_init(pcpu, cpuid, size); 96f53d15feSStephan Uphoff pcpu->pc_rm_queue.rmq_next = &pcpu->pc_rm_queue; 97f53d15feSStephan Uphoff pcpu->pc_rm_queue.rmq_prev = &pcpu->pc_rm_queue; 983acb6572SMateusz Guzik pcpu->pc_zpcpu_offset = zpcpu_offset_cpu(cpuid); 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 } 131891cf3edSEd Maste SYSINIT(dpcpu, SI_SUB_KLD, SI_ORDER_FIRST, dpcpu_startup, NULL); 13250c202c5SJeff Roberson 13350c202c5SJeff Roberson /* 13449fef6a2SGleb Smirnoff * UMA_PCPU_ZONE zones, that are available for all kernel 135a8c8e44bSMateusz Guzik * consumers. Right now 64 bit zone is used for counter(9) 136a8c8e44bSMateusz Guzik * and int zone is used for mount point counters. 13749fef6a2SGleb Smirnoff */ 13849fef6a2SGleb Smirnoff 139a8c8e44bSMateusz Guzik uma_zone_t pcpu_zone_int; 14049fef6a2SGleb Smirnoff uma_zone_t pcpu_zone_64; 14149fef6a2SGleb Smirnoff 14249fef6a2SGleb Smirnoff static void 14349fef6a2SGleb Smirnoff pcpu_zones_startup(void) 14449fef6a2SGleb Smirnoff { 14549fef6a2SGleb Smirnoff 146a8c8e44bSMateusz Guzik pcpu_zone_int = uma_zcreate("int pcpu", sizeof(int), 147a8c8e44bSMateusz Guzik NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_PCPU); 14849fef6a2SGleb Smirnoff pcpu_zone_64 = uma_zcreate("64 pcpu", sizeof(uint64_t), 14949fef6a2SGleb Smirnoff NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_PCPU); 15049fef6a2SGleb Smirnoff } 151*fffcb56fSMark Johnston SYSINIT(pcpu_zones, SI_SUB_COUNTER, SI_ORDER_FIRST, pcpu_zones_startup, NULL); 15249fef6a2SGleb Smirnoff 15349fef6a2SGleb Smirnoff /* 15450c202c5SJeff Roberson * First-fit extent based allocator for allocating space in the per-cpu 15550c202c5SJeff Roberson * region reserved for modules. This is only intended for use by the 15650c202c5SJeff Roberson * kernel linkers to place module linker sets. 15750c202c5SJeff Roberson */ 15850c202c5SJeff Roberson void * 15950c202c5SJeff Roberson dpcpu_alloc(int size) 16050c202c5SJeff Roberson { 16150c202c5SJeff Roberson struct dpcpu_free *df; 16250c202c5SJeff Roberson void *s; 16350c202c5SJeff Roberson 16450c202c5SJeff Roberson s = NULL; 16550c202c5SJeff Roberson size = roundup2(size, sizeof(void *)); 16650c202c5SJeff Roberson sx_xlock(&dpcpu_lock); 16750c202c5SJeff Roberson TAILQ_FOREACH(df, &dpcpu_head, df_link) { 16850c202c5SJeff Roberson if (df->df_len < size) 16950c202c5SJeff Roberson continue; 17050c202c5SJeff Roberson if (df->df_len == size) { 17150c202c5SJeff Roberson s = (void *)df->df_start; 17250c202c5SJeff Roberson TAILQ_REMOVE(&dpcpu_head, df, df_link); 17350c202c5SJeff Roberson free(df, M_PCPU); 17450c202c5SJeff Roberson break; 17550c202c5SJeff Roberson } 17650c202c5SJeff Roberson s = (void *)df->df_start; 17750c202c5SJeff Roberson df->df_len -= size; 17850c202c5SJeff Roberson df->df_start = df->df_start + size; 17950c202c5SJeff Roberson break; 18050c202c5SJeff Roberson } 18150c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 18250c202c5SJeff Roberson 18350c202c5SJeff Roberson return (s); 18450c202c5SJeff Roberson } 18550c202c5SJeff Roberson 18650c202c5SJeff Roberson /* 18750c202c5SJeff Roberson * Free dynamic per-cpu space at module unload time. 18850c202c5SJeff Roberson */ 18950c202c5SJeff Roberson void 19050c202c5SJeff Roberson dpcpu_free(void *s, int size) 19150c202c5SJeff Roberson { 19250c202c5SJeff Roberson struct dpcpu_free *df; 19350c202c5SJeff Roberson struct dpcpu_free *dn; 19450c202c5SJeff Roberson uintptr_t start; 19550c202c5SJeff Roberson uintptr_t end; 19650c202c5SJeff Roberson 19750c202c5SJeff Roberson size = roundup2(size, sizeof(void *)); 19850c202c5SJeff Roberson start = (uintptr_t)s; 19950c202c5SJeff Roberson end = start + size; 20050c202c5SJeff Roberson /* 20150c202c5SJeff Roberson * Free a region of space and merge it with as many neighbors as 20250c202c5SJeff Roberson * possible. Keeping the list sorted simplifies this operation. 20350c202c5SJeff Roberson */ 20450c202c5SJeff Roberson sx_xlock(&dpcpu_lock); 20550c202c5SJeff Roberson TAILQ_FOREACH(df, &dpcpu_head, df_link) { 20650c202c5SJeff Roberson if (df->df_start > end) 20750c202c5SJeff Roberson break; 20850c202c5SJeff Roberson /* 20950c202c5SJeff Roberson * If we expand at the end of an entry we may have to 21050c202c5SJeff Roberson * merge it with the one following it as well. 21150c202c5SJeff Roberson */ 21250c202c5SJeff Roberson if (df->df_start + df->df_len == start) { 21350c202c5SJeff Roberson df->df_len += size; 21450c202c5SJeff Roberson dn = TAILQ_NEXT(df, df_link); 21550c202c5SJeff Roberson if (df->df_start + df->df_len == dn->df_start) { 21650c202c5SJeff Roberson df->df_len += dn->df_len; 21750c202c5SJeff Roberson TAILQ_REMOVE(&dpcpu_head, dn, df_link); 21850c202c5SJeff Roberson free(dn, M_PCPU); 21950c202c5SJeff Roberson } 22050c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 22150c202c5SJeff Roberson return; 22250c202c5SJeff Roberson } 22350c202c5SJeff Roberson if (df->df_start == end) { 22450c202c5SJeff Roberson df->df_start = start; 22550c202c5SJeff Roberson df->df_len += size; 22650c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 22750c202c5SJeff Roberson return; 22850c202c5SJeff Roberson } 22950c202c5SJeff Roberson } 23050c202c5SJeff Roberson dn = malloc(sizeof(*df), M_PCPU, M_WAITOK | M_ZERO); 23150c202c5SJeff Roberson dn->df_start = start; 23250c202c5SJeff Roberson dn->df_len = size; 23350c202c5SJeff Roberson if (df) 23450c202c5SJeff Roberson TAILQ_INSERT_BEFORE(df, dn, df_link); 23550c202c5SJeff Roberson else 23650c202c5SJeff Roberson TAILQ_INSERT_TAIL(&dpcpu_head, dn, df_link); 23750c202c5SJeff Roberson sx_xunlock(&dpcpu_lock); 23850c202c5SJeff Roberson } 23950c202c5SJeff Roberson 24050c202c5SJeff Roberson /* 24150c202c5SJeff Roberson * Initialize the per-cpu storage from an updated linker-set region. 24250c202c5SJeff Roberson */ 24350c202c5SJeff Roberson void 24450c202c5SJeff Roberson dpcpu_copy(void *s, int size) 24550c202c5SJeff Roberson { 24650c202c5SJeff Roberson #ifdef SMP 24750c202c5SJeff Roberson uintptr_t dpcpu; 24850c202c5SJeff Roberson int i; 24950c202c5SJeff Roberson 25096c85efbSNathan Whitehorn CPU_FOREACH(i) { 25150c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 25250c202c5SJeff Roberson if (dpcpu == 0) 25350c202c5SJeff Roberson continue; 25450c202c5SJeff Roberson memcpy((void *)(dpcpu + (uintptr_t)s), s, size); 25550c202c5SJeff Roberson } 25650c202c5SJeff Roberson #else 25750c202c5SJeff Roberson memcpy((void *)(dpcpu_off[0] + (uintptr_t)s), s, size); 25850c202c5SJeff Roberson #endif 259ba228f6dSJohn Baldwin } 260ba228f6dSJohn Baldwin 261ba228f6dSJohn Baldwin /* 2620bbc8826SJohn Baldwin * Destroy a struct pcpu. 263ba228f6dSJohn Baldwin */ 2640bbc8826SJohn Baldwin void 2650bbc8826SJohn Baldwin pcpu_destroy(struct pcpu *pcpu) 266ba228f6dSJohn Baldwin { 267ba228f6dSJohn Baldwin 268d098f930SNathan Whitehorn STAILQ_REMOVE(&cpuhead, pcpu, pcpu, pc_allcpu); 2690bbc8826SJohn Baldwin cpuid_to_pcpu[pcpu->pc_cpuid] = NULL; 27050c202c5SJeff Roberson dpcpu_off[pcpu->pc_cpuid] = 0; 271ba228f6dSJohn Baldwin } 2720bbc8826SJohn Baldwin 2730bbc8826SJohn Baldwin /* 2740bbc8826SJohn Baldwin * Locate a struct pcpu by cpu id. 2750bbc8826SJohn Baldwin */ 2760bbc8826SJohn Baldwin struct pcpu * 2770bbc8826SJohn Baldwin pcpu_find(u_int cpuid) 2780bbc8826SJohn Baldwin { 2790bbc8826SJohn Baldwin 2800bbc8826SJohn Baldwin return (cpuid_to_pcpu[cpuid]); 2810bbc8826SJohn Baldwin } 2820bbc8826SJohn Baldwin 28350c202c5SJeff Roberson int 28450c202c5SJeff Roberson sysctl_dpcpu_quad(SYSCTL_HANDLER_ARGS) 28550c202c5SJeff Roberson { 28650c202c5SJeff Roberson uintptr_t dpcpu; 287e6e06a8bSJeff Roberson int64_t count; 28850c202c5SJeff Roberson int i; 28950c202c5SJeff Roberson 29050c202c5SJeff Roberson count = 0; 29196c85efbSNathan Whitehorn CPU_FOREACH(i) { 29250c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 29350c202c5SJeff Roberson if (dpcpu == 0) 29450c202c5SJeff Roberson continue; 29550c202c5SJeff Roberson count += *(int64_t *)(dpcpu + (uintptr_t)arg1); 29650c202c5SJeff Roberson } 297e6e06a8bSJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 298e6e06a8bSJeff Roberson } 299e6e06a8bSJeff Roberson 300e6e06a8bSJeff Roberson int 301e6e06a8bSJeff Roberson sysctl_dpcpu_long(SYSCTL_HANDLER_ARGS) 302e6e06a8bSJeff Roberson { 303e6e06a8bSJeff Roberson uintptr_t dpcpu; 304e6e06a8bSJeff Roberson long count; 305e6e06a8bSJeff Roberson int i; 306e6e06a8bSJeff Roberson 307e6e06a8bSJeff Roberson count = 0; 30896c85efbSNathan Whitehorn CPU_FOREACH(i) { 309e6e06a8bSJeff Roberson dpcpu = dpcpu_off[i]; 310e6e06a8bSJeff Roberson if (dpcpu == 0) 311e6e06a8bSJeff Roberson continue; 312e6e06a8bSJeff Roberson count += *(long *)(dpcpu + (uintptr_t)arg1); 313e6e06a8bSJeff Roberson } 31450c202c5SJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 31550c202c5SJeff Roberson } 31650c202c5SJeff Roberson 31750c202c5SJeff Roberson int 31850c202c5SJeff Roberson sysctl_dpcpu_int(SYSCTL_HANDLER_ARGS) 31950c202c5SJeff Roberson { 32050c202c5SJeff Roberson uintptr_t dpcpu; 321e6e06a8bSJeff Roberson int count; 32250c202c5SJeff Roberson int i; 32350c202c5SJeff Roberson 32450c202c5SJeff Roberson count = 0; 32596c85efbSNathan Whitehorn CPU_FOREACH(i) { 32650c202c5SJeff Roberson dpcpu = dpcpu_off[i]; 32750c202c5SJeff Roberson if (dpcpu == 0) 32850c202c5SJeff Roberson continue; 32950c202c5SJeff Roberson count += *(int *)(dpcpu + (uintptr_t)arg1); 33050c202c5SJeff Roberson } 33150c202c5SJeff Roberson return (SYSCTL_OUT(req, &count, sizeof(count))); 33250c202c5SJeff Roberson } 33350c202c5SJeff Roberson 3340bbc8826SJohn Baldwin #ifdef DDB 335f2140faeSBjoern A. Zeeb DB_SHOW_COMMAND(dpcpu_off, db_show_dpcpu_off) 336f2140faeSBjoern A. Zeeb { 337f2140faeSBjoern A. Zeeb int id; 338f2140faeSBjoern A. Zeeb 3393aa6d94eSJohn Baldwin CPU_FOREACH(id) { 340f2140faeSBjoern A. Zeeb db_printf("dpcpu_off[%2d] = 0x%jx (+ DPCPU_START = %p)\n", 341f2140faeSBjoern A. Zeeb id, (uintmax_t)dpcpu_off[id], 342f2140faeSBjoern A. Zeeb (void *)(uintptr_t)(dpcpu_off[id] + DPCPU_START)); 343f2140faeSBjoern A. Zeeb } 344f2140faeSBjoern A. Zeeb } 3450bbc8826SJohn Baldwin 3469b791585SRobert Watson static void 3479b791585SRobert Watson show_pcpu(struct pcpu *pc) 3489b791585SRobert Watson { 3499b791585SRobert Watson struct thread *td; 3509b791585SRobert Watson 3510bbc8826SJohn Baldwin db_printf("cpuid = %d\n", pc->pc_cpuid); 35250c202c5SJeff Roberson db_printf("dynamic pcpu = %p\n", (void *)pc->pc_dynamic); 3530bbc8826SJohn Baldwin db_printf("curthread = "); 3540bbc8826SJohn Baldwin td = pc->pc_curthread; 3550bbc8826SJohn Baldwin if (td != NULL) 35661a74c5cSJeff Roberson db_printf("%p: pid %d tid %d critnest %d \"%s\"\n", td, 35761a74c5cSJeff Roberson td->td_proc->p_pid, td->td_tid, td->td_critnest, 35861a74c5cSJeff Roberson td->td_name); 3590bbc8826SJohn Baldwin else 3600bbc8826SJohn Baldwin db_printf("none\n"); 3610bbc8826SJohn Baldwin db_printf("curpcb = %p\n", pc->pc_curpcb); 3620bbc8826SJohn Baldwin db_printf("fpcurthread = "); 3630bbc8826SJohn Baldwin td = pc->pc_fpcurthread; 3640bbc8826SJohn Baldwin if (td != NULL) 3650bbc8826SJohn Baldwin db_printf("%p: pid %d \"%s\"\n", td, td->td_proc->p_pid, 366431f8906SJulian Elischer td->td_name); 3670bbc8826SJohn Baldwin else 3680bbc8826SJohn Baldwin db_printf("none\n"); 3690bbc8826SJohn Baldwin db_printf("idlethread = "); 3700bbc8826SJohn Baldwin td = pc->pc_idlethread; 3710bbc8826SJohn Baldwin if (td != NULL) 372e826ef1eSJohn Baldwin db_printf("%p: tid %d \"%s\"\n", td, td->td_tid, td->td_name); 3730bbc8826SJohn Baldwin else 3740bbc8826SJohn Baldwin db_printf("none\n"); 3750bbc8826SJohn Baldwin db_show_mdpcpu(pc); 3760bbc8826SJohn Baldwin 37721ca7b57SMarko Zec #ifdef VIMAGE 37821ca7b57SMarko Zec db_printf("curvnet = %p\n", pc->pc_curthread->td_vnet); 37921ca7b57SMarko Zec #endif 38021ca7b57SMarko Zec 3810bbc8826SJohn Baldwin #ifdef WITNESS 3820bbc8826SJohn Baldwin db_printf("spin locks held:\n"); 38398332c8cSAttilio Rao witness_list_locks(&pc->pc_spinlocks, db_printf); 3840bbc8826SJohn Baldwin #endif 3850bbc8826SJohn Baldwin } 3869b791585SRobert Watson 3879b791585SRobert Watson DB_SHOW_COMMAND(pcpu, db_show_pcpu) 3889b791585SRobert Watson { 3899b791585SRobert Watson struct pcpu *pc; 3909b791585SRobert Watson int id; 3919b791585SRobert Watson 3929b791585SRobert Watson if (have_addr) 3939b791585SRobert Watson id = ((addr >> 4) % 16) * 10 + (addr % 16); 3949b791585SRobert Watson else 3959b791585SRobert Watson id = PCPU_GET(cpuid); 3969b791585SRobert Watson pc = pcpu_find(id); 3979b791585SRobert Watson if (pc == NULL) { 3989b791585SRobert Watson db_printf("CPU %d not found\n", id); 3999b791585SRobert Watson return; 4009b791585SRobert Watson } 4019b791585SRobert Watson show_pcpu(pc); 4029b791585SRobert Watson } 4039b791585SRobert Watson 40439297ba4SSam Leffler DB_SHOW_ALL_COMMAND(pcpu, db_show_cpu_all) 4059b791585SRobert Watson { 4069b791585SRobert Watson struct pcpu *pc; 4079b791585SRobert Watson int id; 4089b791585SRobert Watson 4099b791585SRobert Watson db_printf("Current CPU: %d\n\n", PCPU_GET(cpuid)); 410efe67753SNathan Whitehorn CPU_FOREACH(id) { 4119b791585SRobert Watson pc = pcpu_find(id); 4129b791585SRobert Watson if (pc != NULL) { 4139b791585SRobert Watson show_pcpu(pc); 4149b791585SRobert Watson db_printf("\n"); 4159b791585SRobert Watson } 4169b791585SRobert Watson } 4179b791585SRobert Watson } 41839297ba4SSam Leffler DB_SHOW_ALIAS(allpcpu, db_show_cpu_all); 4190bbc8826SJohn Baldwin #endif 420