summaryrefslogtreecommitdiffstats
path: root/README
diff options
context:
space:
mode:
authorAlexander Shishkin2018-10-05 14:42:51 +0200
committerGreg Kroah-Hartman2018-10-11 12:12:54 +0200
commitcb6102bd99efe35f016dc6d7282e681e6dbde154 (patch)
treec1be7b7a7b71486fe45b64699835b56d0fdbb978 /README
parentMerge 4.19-rc7 into char-misc-next (diff)
downloadkernel-qcow2-linux-cb6102bd99efe35f016dc6d7282e681e6dbde154.tar.gz
kernel-qcow2-linux-cb6102bd99efe35f016dc6d7282e681e6dbde154.tar.xz
kernel-qcow2-linux-cb6102bd99efe35f016dc6d7282e681e6dbde154.zip
stm class: Rework policy node fallback
Currently, if no matching policy node can be found for a trace source, we'll try to use "default" policy node, then, if that doesn't exist, we'll pick the first node, in order of creation. If that also fails, we'll allocate M/C range from the beginning of the device's M/C range. This makes it difficult to know which node (if any) was used in any particular case. In order to make things more deterministic, the new order is as follows: * if they supply ID string, use that and nothing else, * if they are a task, use their task name (comm), * use "default", if it exists, * return failure, to let them know there is no suitable rule. This should provide enough convenience with the "default" catch-all node, while not leaving *everything* to chance. As a side effect, this relaxes the requirement of using ioctl() for identification with the possibility of using task names as policy nodes. Signed-off-by: Alexander Shishkin <alexander.shishkin@linux.intel.com> Tested-by: Mathieu Poirier <mathieu.poirier@linaro.org> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Diffstat (limited to 'README')
0 files changed, 0 insertions, 0 deletions