mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-21 11:13:30 +00:00
eddfbb763d
(DPCPU), as suggested by Peter Wemm, and implement a new per-virtual network stack memory allocator. Modify vnet to use the allocator instead of monolithic global container structures (vinet, ...). This change solves many binary compatibility problems associated with VIMAGE, and restores ELF symbols for virtualized global variables. Each virtualized global variable exists as a "reference copy", and also once per virtual network stack. Virtualized global variables are tagged at compile-time, placing the in a special linker set, which is loaded into a contiguous region of kernel memory. Virtualized global variables in the base kernel are linked as normal, but those in modules are copied and relocated to a reserved portion of the kernel's vnet region with the help of a the kernel linker. Virtualized global variables exist in per-vnet memory set up when the network stack instance is created, and are initialized statically from the reference copy. Run-time access occurs via an accessor macro, which converts from the current vnet and requested symbol to a per-vnet address. When "options VIMAGE" is not compiled into the kernel, normal global ELF symbols will be used instead and indirection is avoided. This change restores static initialization for network stack global variables, restores support for non-global symbols and types, eliminates the need for many subsystem constructors, eliminates large per-subsystem structures that caused many binary compatibility issues both for monitoring applications (netstat) and kernel modules, removes the per-function INIT_VNET_*() macros throughout the stack, eliminates the need for vnet_symmap ksym(2) munging, and eliminates duplicate definitions of virtualized globals under VIMAGE_GLOBALS. Bump __FreeBSD_version and update UPDATING. Portions submitted by: bz Reviewed by: bz, zec Discussed with: gnn, jamie, jeff, jhb, julian, sam Suggested by: peter Approved by: re (kensmith)
229 lines
4.7 KiB
C
229 lines
4.7 KiB
C
/*-
|
|
* Mach Operating System
|
|
* Copyright (c) 1991,1990 Carnegie Mellon University
|
|
* All Rights Reserved.
|
|
*
|
|
* Permission to use, copy, modify and distribute this software and its
|
|
* documentation is hereby granted, provided that both the copyright
|
|
* notice and this permission notice appear in all copies of the
|
|
* software, derivative works or modified versions, and any portions
|
|
* thereof, and that both notices appear in supporting documentation.
|
|
*
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
|
|
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
|
*
|
|
* Carnegie Mellon requests users of this software to return to
|
|
*
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
* School of Computer Science
|
|
* Carnegie Mellon University
|
|
* Pittsburgh PA 15213-3890
|
|
*
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
* rights to redistribute these changes.
|
|
*/
|
|
/*
|
|
* Author: David B. Golub, Carnegie Mellon University
|
|
* Date: 7/90
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <ddb/ddb.h>
|
|
#include <ddb/db_lex.h>
|
|
#include <ddb/db_access.h>
|
|
#include <ddb/db_command.h>
|
|
|
|
static boolean_t db_add_expr(db_expr_t *valuep);
|
|
static boolean_t db_mult_expr(db_expr_t *valuep);
|
|
static boolean_t db_shift_expr(db_expr_t *valuep);
|
|
static boolean_t db_term(db_expr_t *valuep);
|
|
static boolean_t db_unary(db_expr_t *valuep);
|
|
|
|
static boolean_t
|
|
db_term(db_expr_t *valuep)
|
|
{
|
|
int t;
|
|
|
|
t = db_read_token();
|
|
if (t == tIDENT) {
|
|
if (!db_value_of_name(db_tok_string, valuep) &&
|
|
!db_value_of_name_pcpu(db_tok_string, valuep) &&
|
|
!db_value_of_name_vnet(db_tok_string, valuep)) {
|
|
db_error("Symbol not found\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
return (TRUE);
|
|
}
|
|
if (t == tNUMBER) {
|
|
*valuep = (db_expr_t)db_tok_number;
|
|
return (TRUE);
|
|
}
|
|
if (t == tDOT) {
|
|
*valuep = (db_expr_t)db_dot;
|
|
return (TRUE);
|
|
}
|
|
if (t == tDOTDOT) {
|
|
*valuep = (db_expr_t)db_prev;
|
|
return (TRUE);
|
|
}
|
|
if (t == tPLUS) {
|
|
*valuep = (db_expr_t) db_next;
|
|
return (TRUE);
|
|
}
|
|
if (t == tDITTO) {
|
|
*valuep = (db_expr_t)db_last_addr;
|
|
return (TRUE);
|
|
}
|
|
if (t == tDOLLAR) {
|
|
if (!db_get_variable(valuep))
|
|
return (FALSE);
|
|
return (TRUE);
|
|
}
|
|
if (t == tLPAREN) {
|
|
if (!db_expression(valuep)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
t = db_read_token();
|
|
if (t != tRPAREN) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
return (TRUE);
|
|
}
|
|
db_unread_token(t);
|
|
return (FALSE);
|
|
}
|
|
|
|
static boolean_t
|
|
db_unary(db_expr_t *valuep)
|
|
{
|
|
int t;
|
|
|
|
t = db_read_token();
|
|
if (t == tMINUS) {
|
|
if (!db_unary(valuep)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
*valuep = -*valuep;
|
|
return (TRUE);
|
|
}
|
|
if (t == tSTAR) {
|
|
/* indirection */
|
|
if (!db_unary(valuep)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
*valuep = db_get_value((db_addr_t)*valuep, sizeof(void *), FALSE);
|
|
return (TRUE);
|
|
}
|
|
db_unread_token(t);
|
|
return (db_term(valuep));
|
|
}
|
|
|
|
static boolean_t
|
|
db_mult_expr(db_expr_t *valuep)
|
|
{
|
|
db_expr_t lhs, rhs;
|
|
int t;
|
|
|
|
if (!db_unary(&lhs))
|
|
return (FALSE);
|
|
|
|
t = db_read_token();
|
|
while (t == tSTAR || t == tSLASH || t == tPCT || t == tHASH) {
|
|
if (!db_term(&rhs)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
if (t == tSTAR)
|
|
lhs *= rhs;
|
|
else {
|
|
if (rhs == 0) {
|
|
db_error("Divide by 0\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
if (t == tSLASH)
|
|
lhs /= rhs;
|
|
else if (t == tPCT)
|
|
lhs %= rhs;
|
|
else
|
|
lhs = ((lhs+rhs-1)/rhs)*rhs;
|
|
}
|
|
t = db_read_token();
|
|
}
|
|
db_unread_token(t);
|
|
*valuep = lhs;
|
|
return (TRUE);
|
|
}
|
|
|
|
static boolean_t
|
|
db_add_expr(db_expr_t *valuep)
|
|
{
|
|
db_expr_t lhs, rhs;
|
|
int t;
|
|
|
|
if (!db_mult_expr(&lhs))
|
|
return (FALSE);
|
|
|
|
t = db_read_token();
|
|
while (t == tPLUS || t == tMINUS) {
|
|
if (!db_mult_expr(&rhs)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
if (t == tPLUS)
|
|
lhs += rhs;
|
|
else
|
|
lhs -= rhs;
|
|
t = db_read_token();
|
|
}
|
|
db_unread_token(t);
|
|
*valuep = lhs;
|
|
return (TRUE);
|
|
}
|
|
|
|
static boolean_t
|
|
db_shift_expr(db_expr_t *valuep)
|
|
{
|
|
db_expr_t lhs, rhs;
|
|
int t;
|
|
|
|
if (!db_add_expr(&lhs))
|
|
return (FALSE);
|
|
|
|
t = db_read_token();
|
|
while (t == tSHIFT_L || t == tSHIFT_R) {
|
|
if (!db_add_expr(&rhs)) {
|
|
db_error("Syntax error\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
if (rhs < 0) {
|
|
db_error("Negative shift amount\n");
|
|
/*NOTREACHED*/
|
|
}
|
|
if (t == tSHIFT_L)
|
|
lhs <<= rhs;
|
|
else {
|
|
/* Shift right is unsigned */
|
|
lhs = (unsigned) lhs >> rhs;
|
|
}
|
|
t = db_read_token();
|
|
}
|
|
db_unread_token(t);
|
|
*valuep = lhs;
|
|
return (TRUE);
|
|
}
|
|
|
|
int
|
|
db_expression(db_expr_t *valuep)
|
|
{
|
|
return (db_shift_expr(valuep));
|
|
}
|