1 # Copyright 2014 The Chromium Authors. All rights reserved.
2 # Use of this source code is governed by a BSD-style license that can be
3 # found in the LICENSE file.
5 # This is a generic rule-tree for classifying memory maps on Android. It is a
6 # simple hierarchical python data structure (list of dictionaries). Some rules:
7 # - Order matters: what is caught by a node is not caught by its siblings.
8 # - Hierarchy matters: what is caught by a node is propagated to its children
9 # (if any). Only one of its children, though, will get the data.
10 # - Non leaf nodes have an extra implicit node called {node-name}-other: if
11 # something is caught by a non leaf node, but none of its children, it is
12 # appended to implicit {node-name}-other catch-all children.
14 # See memory_inspector/classification/mmap_classifier.py for more docs.
19 'mmap_file': r
'(^$)|(^\[)',
23 'mmap_file': r
'\[stack',
26 'name': 'libc malloc',
27 'mmap_file': 'libc_malloc',
37 'mmap_file': r
'^/dev/ashmem',
41 'mmap_file': r
'^/dev/ashmem/dalvik',
45 'mmap_file': r
'dalvik-heap',
57 'mmap_file': r
'(\.so)|(\.apk)|(\.jar)',
65 'mmap_file': r
'\.apk',
69 'mmap_file': r
'\.jar',
75 'mmap_file': r
'^/dev/',
79 'mmap_file': r
'(nv)|(mali)|(kgsl)',