1LIBPFM(3)                  Linux Programmer's Manual                 LIBPFM(3)
2
3
4

NAME

6       libpfm_intel_snbep_unc_cbo  -  support  for Intel Sandy Bridge-EP C-Box
7       uncore PMU
8

SYNOPSIS

10       #include <perfmon/pfmlib.h>
11
12       PMU name: snbep_unc_cbo[0-7]
13       PMU desc: Intel Sandy Bridge-EP C-Box uncore PMU
14
15

DESCRIPTION

17       The library supports the Intel Sandy Bridge  C-Box  (coherency  engine)
18       uncore PMU.  This PMU model only exists on Sandy Bridge model 45. There
19       is one C-box PMU per physical core. Therefore there are eight identical
20       C-Box  PMU  instances numbered frmo 0 to 7. On dual-socket systems, the
21       number refers to the C-Box PMU on the socket where  the  program  runs.
22       For  instance, if running on CPU8, then snbep_unc_cbo0 refers to the C-
23       Box for physical core 0 on socket 1. Conversely, if  running  on  CPU0,
24       then  the  same  snbep_unc_cbo0 refers to the C-Box for physical core 0
25       but on socket 0.
26
27       Each C-Box PMU implements 4 generic counters and a filter register used
28       only with certain events and umasks.
29
30

MODIFIERS

32       The  following  modifiers  are  supported  on  Intel Sandy Bridge C-Box
33       uncore PMU:
34
35       i      Invert the meaning of the event. The counter will now  count  C-
36              Box  cycles in which the event is not occurring. This is a bool‐
37              ean modifier
38
39       e      Enable edge detection, i.e., count only when there  is  a  state
40              transition  from  no  occurrence  of  the  event to at least one
41              occurrence. This modifier must be combined with a threshold mod‐
42              ifier (t) with a value greater or equal to one.  This is a bool‐
43              ean modifier.
44
45       t      Set the threshold value. When  set  to  a  non-zero  value,  the
46              counter counts the number of C-Box cycles in which the number of
47              occurrences of the event is greater or equal to  the  threshold.
48              This is an integer modifier with values in the range [0:255].
49
50       nf     Node   filter.   Certain   events,   such  as  UNC_C_LLC_LOOKUP,
51              UNC_C_LLC_VICTIMS, provide a NID umask.  Sometimes  the  NID  is
52              combined  with  other  filtering  capabilities, such as opcodes.
53              The node filter is an 8-bit max bitmask. A node corresponds to a
54              processor  socket.  The  legal  values  therefore  depend on the
55              underlying hardware configuration. For dual-socket systems,  the
56              bitmask has two valid bits [0:1].
57
58       cf     Core  Filter.  This  is  a  3-bit filter which is used to filter
59              based on physical core origin of  the  C-Box  request.  Possible
60              values  are 0-7. If the filter is not specified, then no filter‐
61              ing takes place.
62
63       tf     Thread Filter. This is a 1-bit filter which is used to filter C-
64              Box requests based on logical processor (hyper-thread) identifi‐
65              cation. Possibles values are 0-1. If the filter  is  not  speci‐
66              fied, then no filtering takes place.
67
68

Opcode filtering

70       Certain  events,  such as UNC_C_TOR_INSERTS supports opcode matching on
71       the C-BOX transaction type. To use this feature, first an opcode match‐
72       ing  umask  must be selected, e.g., MISS_OPCODE.  Second, the opcode to
73       match on must be selected via a second umask among  the  OPC_*  umasks.
74       For  instance,  UNC_C_TOR_INSERTS:OPCODE:OPC_RFO,  counts the number of
75       TOR insertions for RFO transactions.
76
77       Opcode matching may  be  combined  with  node  filtering  with  certain
78       umasks.  In  general  the  filtering  support is encoded into the umask
79       name, e.g., NID_OPCODE supports both node  and  opcode  filtering.  For
80       instance, UNC_C_TOR_INSERTS:NID_OPCODE:OPC_RFO:nf=1.
81
82

AUTHORS

84       Stephane Eranian <eranian@gmail.com>
85
86
87
88                                 August, 2012                        LIBPFM(3)
Impressum