2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
6 * Copyright (C) 1992 - 1997, 2000-2003 Silicon Graphics, Inc. All rights reserved.
8 #ifndef _ASM_IA64_SN_NODEPDA_H
9 #define _ASM_IA64_SN_NODEPDA_H
12 #include <asm/semaphore.h>
14 #include <asm/sn/intr.h>
15 #include <asm/sn/router.h>
16 #include <asm/sn/pda.h>
17 #include <asm/sn/module.h>
18 #include <asm/sn/bte.h>
19 #include <asm/sn/sn2/arch.h>
22 * NUMA Node-Specific Data structures are defined in this file.
23 * In particular, this is the location of the node PDA.
24 * A pointer to the right node PDA is saved in each CPU PDA.
28 * Node-specific data structure.
30 * One of these structures is allocated on each node of a NUMA system.
32 * This structure provides a convenient way of keeping together
33 * all per-node data structures.
39 vertex_hdl_t xbow_vhdl
;
40 nasid_t xbow_peer
; /* NASID of our peer hub on xbow */
41 struct semaphore xbow_sema
; /* Sema for xbow synchronization */
44 module_t
*module
; /* Pointer to containing module */
45 xwidgetnum_t basew_id
;
46 vertex_hdl_t basew_xc
;
48 int num_routers
; /* XXX not setup! Total routers in the system */
51 char *hwg_node_name
; /* hwgraph node name */
52 vertex_hdl_t node_vertex
; /* Hwgraph vertex for this node */
54 void *pdinfo
; /* Platform-dependent per-node info */
57 nodepda_router_info_t
*npda_rip_first
;
58 nodepda_router_info_t
**npda_rip_last
;
64 * The BTEs on this node are shared by the local cpus
66 struct bteinfo_s bte_if
[BTES_PER_NODE
]; /* Virtual Interface */
67 struct timer_list bte_recovery_timer
;
68 spinlock_t bte_recovery_lock
;
71 * Array of pointers to the nodepdas for each node.
73 struct nodepda_s
*pernode_pdaindr
[MAX_COMPACT_NODES
];
77 typedef struct nodepda_s nodepda_t
;
81 char irq_flags
[NR_IRQS
];
82 struct pci_dev
*device_dev
[NR_IRQS
];
83 char share_count
[NR_IRQS
];
87 typedef struct irqpda_s irqpda_t
;
91 * Access Functions for node PDA.
92 * Since there is one nodepda for each node, we need a convenient mechanism
93 * to access these nodepdas without cluttering code with #ifdefs.
94 * The next set of definitions provides this.
95 * Routines are expected to use
97 * nodepda -> to access node PDA for the node on which code is running
98 * subnodepda -> to access subnode PDA for the subnode on which code is running
100 * NODEPDA(cnode) -> to access node PDA for cnodeid
101 * SUBNODEPDA(cnode,sn) -> to access subnode PDA for cnodeid/subnode
104 #define nodepda pda->p_nodepda /* Ptr to this node's PDA */
105 #define NODEPDA(cnode) (nodepda->pernode_pdaindr[cnode])
109 * Macros to access data structures inside nodepda
111 #define NODE_MODULEID(cnode) geo_module((NODEPDA(cnode)->geoid))
112 #define NODE_SLOTID(cnode) (NODEPDA(cnode)->slotdesc)
116 * Quickly convert a compact node ID into a hwgraph vertex
118 #define cnodeid_to_vertex(cnodeid) (NODEPDA(cnodeid)->node_vertex)
122 * Check if given a compact node id the corresponding node has all the
125 #define is_headless_node(cnode) (nr_cpus_node(cnode) == 0)
128 * Check if given a node vertex handle the corresponding node has all the
131 #define is_headless_node_vertex(_nodevhdl) \
132 is_headless_node(nodevertex_to_cnodeid(_nodevhdl))
135 #endif /* _ASM_IA64_SN_NODEPDA_H */