diff options
author | Christoph Lameter <clameter@sgi.com> | 2008-02-07 20:47:41 -0500 |
---|---|---|
committer | Christoph Lameter <christoph@stapp.engr.sgi.com> | 2008-02-07 20:47:41 -0500 |
commit | 8ff12cfc009a2a38d87fa7058226fe197bb2696f (patch) | |
tree | 1358ed247d3c897d8790342a978dd5078354a207 /mm | |
parent | 1f84260c8ce3b1ce26d4c1d6dedc2f33a3a29c0c (diff) |
SLUB: Support for performance statistics
The statistics provided here allow the monitoring of allocator behavior but
at the cost of some (minimal) loss of performance. Counters are placed in
SLUB's per cpu data structure. The per cpu structure may be extended by the
statistics to grow larger than one cacheline which will increase the cache
footprint of SLUB.
There is a compile option to enable/disable the inclusion of the runtime
statistics and its off by default.
The slabinfo tool is enhanced to support these statistics via two options:
-D Switches the line of information displayed for a slab from size
mode to activity mode.
-A Sorts the slabs displayed by activity. This allows the display of
the slabs most important to the performance of a certain load.
-r Report option will report detailed statistics on
Example (tbench load):
slabinfo -AD ->Shows the most active slabs
Name Objects Alloc Free %Fast
skbuff_fclone_cache 33 111953835 111953835 99 99
:0000192 2666 5283688 5281047 99 99
:0001024 849 5247230 5246389 83 83
vm_area_struct 1349 119642 118355 91 22
:0004096 15 66753 66751 98 98
:0000064 2067 25297 23383 98 78
dentry 10259 28635 18464 91 45
:0000080 11004 18950 8089 98 98
:0000096 1703 12358 10784 99 98
:0000128 762 10582 9875 94 18
:0000512 184 9807 9647 95 81
:0002048 479 9669 9195 83 65
anon_vma 777 9461 9002 99 71
kmalloc-8 6492 9981 5624 99 97
:0000768 258 7174 6931 58 15
So the skbuff_fclone_cache is of highest importance for the tbench load.
Pretty high load on the 192 sized slab. Look for the aliases
slabinfo -a | grep 000192
:0000192 <- xfs_btree_cur filp kmalloc-192 uid_cache tw_sock_TCP
request_sock_TCPv6 tw_sock_TCPv6 skbuff_head_cache xfs_ili
Likely skbuff_head_cache.
Looking into the statistics of the skbuff_fclone_cache is possible through
slabinfo skbuff_fclone_cache ->-r option implied if cache name is mentioned
.... Usual output ...
Slab Perf Counter Alloc Free %Al %Fr
--------------------------------------------------
Fastpath 111953360 111946981 99 99
Slowpath 1044 7423 0 0
Page Alloc 272 264 0 0
Add partial 25 325 0 0
Remove partial 86 264 0 0
RemoteObj/SlabFrozen 350 4832 0 0
Total 111954404 111954404
Flushes 49 Refill 0
Deactivate Full=325(92%) Empty=0(0%) ToHead=24(6%) ToTail=1(0%)
Looks good because the fastpath is overwhelmingly taken.
skbuff_head_cache:
Slab Perf Counter Alloc Free %Al %Fr
--------------------------------------------------
Fastpath 5297262 5259882 99 99
Slowpath 4477 39586 0 0
Page Alloc 937 824 0 0
Add partial 0 2515 0 0
Remove partial 1691 824 0 0
RemoteObj/SlabFrozen 2621 9684 0 0
Total 5301739 5299468
Deactivate Full=2620(100%) Empty=0(0%) ToHead=0(0%) ToTail=0(0%)
Descriptions of the output:
Total: The total number of allocation and frees that occurred for a
slab
Fastpath: The number of allocations/frees that used the fastpath.
Slowpath: Other allocations
Page Alloc: Number of calls to the page allocator as a result of slowpath
processing
Add Partial: Number of slabs added to the partial list through free or
alloc (occurs during cpuslab flushes)
Remove Partial: Number of slabs removed from the partial list as a result of
allocations retrieving a partial slab or by a free freeing
the last object of a slab.
RemoteObj/Froz: How many times were remotely freed object encountered when a
slab was about to be deactivated. Frozen: How many times was
free able to skip list processing because the slab was in use
as the cpuslab of another processor.
Flushes: Number of times the cpuslab was flushed on request
(kmem_cache_shrink, may result from races in __slab_alloc)
Refill: Number of times we were able to refill the cpuslab from
remotely freed objects for the same slab.
Deactivate: Statistics how slabs were deactivated. Shows how they were
put onto the partial list.
In general fastpath is very good. Slowpath without partial list processing is
also desirable. Any touching of partial list uses node specific locks which
may potentially cause list lock contention.
Signed-off-by: Christoph Lameter <clameter@sgi.com>
Diffstat (limited to 'mm')
-rw-r--r-- | mm/slub.c | 127 |
1 files changed, 119 insertions, 8 deletions
@@ -250,6 +250,7 @@ enum track_item { TRACK_ALLOC, TRACK_FREE }; | |||
250 | static int sysfs_slab_add(struct kmem_cache *); | 250 | static int sysfs_slab_add(struct kmem_cache *); |
251 | static int sysfs_slab_alias(struct kmem_cache *, const char *); | 251 | static int sysfs_slab_alias(struct kmem_cache *, const char *); |
252 | static void sysfs_slab_remove(struct kmem_cache *); | 252 | static void sysfs_slab_remove(struct kmem_cache *); |
253 | |||
253 | #else | 254 | #else |
254 | static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; } | 255 | static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; } |
255 | static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p) | 256 | static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p) |
@@ -258,8 +259,16 @@ static inline void sysfs_slab_remove(struct kmem_cache *s) | |||
258 | { | 259 | { |
259 | kfree(s); | 260 | kfree(s); |
260 | } | 261 | } |
262 | |||
261 | #endif | 263 | #endif |
262 | 264 | ||
265 | static inline void stat(struct kmem_cache_cpu *c, enum stat_item si) | ||
266 | { | ||
267 | #ifdef CONFIG_SLUB_STATS | ||
268 | c->stat[si]++; | ||
269 | #endif | ||
270 | } | ||
271 | |||
263 | /******************************************************************** | 272 | /******************************************************************** |
264 | * Core slab cache functions | 273 | * Core slab cache functions |
265 | *******************************************************************/ | 274 | *******************************************************************/ |
@@ -1364,17 +1373,22 @@ static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node) | |||
1364 | static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail) | 1373 | static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail) |
1365 | { | 1374 | { |
1366 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); | 1375 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); |
1376 | struct kmem_cache_cpu *c = get_cpu_slab(s, smp_processor_id()); | ||
1367 | 1377 | ||
1368 | ClearSlabFrozen(page); | 1378 | ClearSlabFrozen(page); |
1369 | if (page->inuse) { | 1379 | if (page->inuse) { |
1370 | 1380 | ||
1371 | if (page->freelist != page->end) | 1381 | if (page->freelist != page->end) { |
1372 | add_partial(n, page, tail); | 1382 | add_partial(n, page, tail); |
1373 | else if (SlabDebug(page) && (s->flags & SLAB_STORE_USER)) | 1383 | stat(c, tail ? DEACTIVATE_TO_TAIL : DEACTIVATE_TO_HEAD); |
1374 | add_full(n, page); | 1384 | } else { |
1385 | stat(c, DEACTIVATE_FULL); | ||
1386 | if (SlabDebug(page) && (s->flags & SLAB_STORE_USER)) | ||
1387 | add_full(n, page); | ||
1388 | } | ||
1375 | slab_unlock(page); | 1389 | slab_unlock(page); |
1376 | |||
1377 | } else { | 1390 | } else { |
1391 | stat(c, DEACTIVATE_EMPTY); | ||
1378 | if (n->nr_partial < MIN_PARTIAL) { | 1392 | if (n->nr_partial < MIN_PARTIAL) { |
1379 | /* | 1393 | /* |
1380 | * Adding an empty slab to the partial slabs in order | 1394 | * Adding an empty slab to the partial slabs in order |
@@ -1388,6 +1402,7 @@ static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail) | |||
1388 | slab_unlock(page); | 1402 | slab_unlock(page); |
1389 | } else { | 1403 | } else { |
1390 | slab_unlock(page); | 1404 | slab_unlock(page); |
1405 | stat(get_cpu_slab(s, raw_smp_processor_id()), FREE_SLAB); | ||
1391 | discard_slab(s, page); | 1406 | discard_slab(s, page); |
1392 | } | 1407 | } |
1393 | } | 1408 | } |
@@ -1400,6 +1415,9 @@ static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) | |||
1400 | { | 1415 | { |
1401 | struct page *page = c->page; | 1416 | struct page *page = c->page; |
1402 | int tail = 1; | 1417 | int tail = 1; |
1418 | |||
1419 | if (c->freelist) | ||
1420 | stat(c, DEACTIVATE_REMOTE_FREES); | ||
1403 | /* | 1421 | /* |
1404 | * Merge cpu freelist into freelist. Typically we get here | 1422 | * Merge cpu freelist into freelist. Typically we get here |
1405 | * because both freelists are empty. So this is unlikely | 1423 | * because both freelists are empty. So this is unlikely |
@@ -1429,6 +1447,7 @@ static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) | |||
1429 | 1447 | ||
1430 | static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) | 1448 | static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) |
1431 | { | 1449 | { |
1450 | stat(c, CPUSLAB_FLUSH); | ||
1432 | slab_lock(c->page); | 1451 | slab_lock(c->page); |
1433 | deactivate_slab(s, c); | 1452 | deactivate_slab(s, c); |
1434 | } | 1453 | } |
@@ -1511,6 +1530,7 @@ static void *__slab_alloc(struct kmem_cache *s, | |||
1511 | slab_lock(c->page); | 1530 | slab_lock(c->page); |
1512 | if (unlikely(!node_match(c, node))) | 1531 | if (unlikely(!node_match(c, node))) |
1513 | goto another_slab; | 1532 | goto another_slab; |
1533 | stat(c, ALLOC_REFILL); | ||
1514 | load_freelist: | 1534 | load_freelist: |
1515 | object = c->page->freelist; | 1535 | object = c->page->freelist; |
1516 | if (unlikely(object == c->page->end)) | 1536 | if (unlikely(object == c->page->end)) |
@@ -1525,6 +1545,7 @@ load_freelist: | |||
1525 | c->node = page_to_nid(c->page); | 1545 | c->node = page_to_nid(c->page); |
1526 | unlock_out: | 1546 | unlock_out: |
1527 | slab_unlock(c->page); | 1547 | slab_unlock(c->page); |
1548 | stat(c, ALLOC_SLOWPATH); | ||
1528 | out: | 1549 | out: |
1529 | #ifdef SLUB_FASTPATH | 1550 | #ifdef SLUB_FASTPATH |
1530 | local_irq_restore(flags); | 1551 | local_irq_restore(flags); |
@@ -1538,6 +1559,7 @@ new_slab: | |||
1538 | new = get_partial(s, gfpflags, node); | 1559 | new = get_partial(s, gfpflags, node); |
1539 | if (new) { | 1560 | if (new) { |
1540 | c->page = new; | 1561 | c->page = new; |
1562 | stat(c, ALLOC_FROM_PARTIAL); | ||
1541 | goto load_freelist; | 1563 | goto load_freelist; |
1542 | } | 1564 | } |
1543 | 1565 | ||
@@ -1551,6 +1573,7 @@ new_slab: | |||
1551 | 1573 | ||
1552 | if (new) { | 1574 | if (new) { |
1553 | c = get_cpu_slab(s, smp_processor_id()); | 1575 | c = get_cpu_slab(s, smp_processor_id()); |
1576 | stat(c, ALLOC_SLAB); | ||
1554 | if (c->page) | 1577 | if (c->page) |
1555 | flush_slab(s, c); | 1578 | flush_slab(s, c); |
1556 | slab_lock(new); | 1579 | slab_lock(new); |
@@ -1610,6 +1633,7 @@ static __always_inline void *slab_alloc(struct kmem_cache *s, | |||
1610 | object = __slab_alloc(s, gfpflags, node, addr, c); | 1633 | object = __slab_alloc(s, gfpflags, node, addr, c); |
1611 | break; | 1634 | break; |
1612 | } | 1635 | } |
1636 | stat(c, ALLOC_FASTPATH); | ||
1613 | } while (cmpxchg_local(&c->freelist, object, object[c->offset]) | 1637 | } while (cmpxchg_local(&c->freelist, object, object[c->offset]) |
1614 | != object); | 1638 | != object); |
1615 | #else | 1639 | #else |
@@ -1624,6 +1648,7 @@ static __always_inline void *slab_alloc(struct kmem_cache *s, | |||
1624 | else { | 1648 | else { |
1625 | object = c->freelist; | 1649 | object = c->freelist; |
1626 | c->freelist = object[c->offset]; | 1650 | c->freelist = object[c->offset]; |
1651 | stat(c, ALLOC_FASTPATH); | ||
1627 | } | 1652 | } |
1628 | local_irq_restore(flags); | 1653 | local_irq_restore(flags); |
1629 | #endif | 1654 | #endif |
@@ -1661,12 +1686,15 @@ static void __slab_free(struct kmem_cache *s, struct page *page, | |||
1661 | { | 1686 | { |
1662 | void *prior; | 1687 | void *prior; |
1663 | void **object = (void *)x; | 1688 | void **object = (void *)x; |
1689 | struct kmem_cache_cpu *c; | ||
1664 | 1690 | ||
1665 | #ifdef SLUB_FASTPATH | 1691 | #ifdef SLUB_FASTPATH |
1666 | unsigned long flags; | 1692 | unsigned long flags; |
1667 | 1693 | ||
1668 | local_irq_save(flags); | 1694 | local_irq_save(flags); |
1669 | #endif | 1695 | #endif |
1696 | c = get_cpu_slab(s, raw_smp_processor_id()); | ||
1697 | stat(c, FREE_SLOWPATH); | ||
1670 | slab_lock(page); | 1698 | slab_lock(page); |
1671 | 1699 | ||
1672 | if (unlikely(SlabDebug(page))) | 1700 | if (unlikely(SlabDebug(page))) |
@@ -1676,8 +1704,10 @@ checks_ok: | |||
1676 | page->freelist = object; | 1704 | page->freelist = object; |
1677 | page->inuse--; | 1705 | page->inuse--; |
1678 | 1706 | ||
1679 | if (unlikely(SlabFrozen(page))) | 1707 | if (unlikely(SlabFrozen(page))) { |
1708 | stat(c, FREE_FROZEN); | ||
1680 | goto out_unlock; | 1709 | goto out_unlock; |
1710 | } | ||
1681 | 1711 | ||
1682 | if (unlikely(!page->inuse)) | 1712 | if (unlikely(!page->inuse)) |
1683 | goto slab_empty; | 1713 | goto slab_empty; |
@@ -1687,8 +1717,10 @@ checks_ok: | |||
1687 | * was not on the partial list before | 1717 | * was not on the partial list before |
1688 | * then add it. | 1718 | * then add it. |
1689 | */ | 1719 | */ |
1690 | if (unlikely(prior == page->end)) | 1720 | if (unlikely(prior == page->end)) { |
1691 | add_partial(get_node(s, page_to_nid(page)), page, 1); | 1721 | add_partial(get_node(s, page_to_nid(page)), page, 1); |
1722 | stat(c, FREE_ADD_PARTIAL); | ||
1723 | } | ||
1692 | 1724 | ||
1693 | out_unlock: | 1725 | out_unlock: |
1694 | slab_unlock(page); | 1726 | slab_unlock(page); |
@@ -1698,13 +1730,15 @@ out_unlock: | |||
1698 | return; | 1730 | return; |
1699 | 1731 | ||
1700 | slab_empty: | 1732 | slab_empty: |
1701 | if (prior != page->end) | 1733 | if (prior != page->end) { |
1702 | /* | 1734 | /* |
1703 | * Slab still on the partial list. | 1735 | * Slab still on the partial list. |
1704 | */ | 1736 | */ |
1705 | remove_partial(s, page); | 1737 | remove_partial(s, page); |
1706 | 1738 | stat(c, FREE_REMOVE_PARTIAL); | |
1739 | } | ||
1707 | slab_unlock(page); | 1740 | slab_unlock(page); |
1741 | stat(c, FREE_SLAB); | ||
1708 | #ifdef SLUB_FASTPATH | 1742 | #ifdef SLUB_FASTPATH |
1709 | local_irq_restore(flags); | 1743 | local_irq_restore(flags); |
1710 | #endif | 1744 | #endif |
@@ -1758,6 +1792,7 @@ static __always_inline void slab_free(struct kmem_cache *s, | |||
1758 | break; | 1792 | break; |
1759 | } | 1793 | } |
1760 | object[c->offset] = freelist; | 1794 | object[c->offset] = freelist; |
1795 | stat(c, FREE_FASTPATH); | ||
1761 | } while (cmpxchg_local(&c->freelist, freelist, object) != freelist); | 1796 | } while (cmpxchg_local(&c->freelist, freelist, object) != freelist); |
1762 | #else | 1797 | #else |
1763 | unsigned long flags; | 1798 | unsigned long flags; |
@@ -1768,6 +1803,7 @@ static __always_inline void slab_free(struct kmem_cache *s, | |||
1768 | if (likely(page == c->page && c->node >= 0)) { | 1803 | if (likely(page == c->page && c->node >= 0)) { |
1769 | object[c->offset] = c->freelist; | 1804 | object[c->offset] = c->freelist; |
1770 | c->freelist = object; | 1805 | c->freelist = object; |
1806 | stat(c, FREE_FASTPATH); | ||
1771 | } else | 1807 | } else |
1772 | __slab_free(s, page, x, addr, c->offset); | 1808 | __slab_free(s, page, x, addr, c->offset); |
1773 | 1809 | ||
@@ -3980,6 +4016,62 @@ static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s, | |||
3980 | SLAB_ATTR(remote_node_defrag_ratio); | 4016 | SLAB_ATTR(remote_node_defrag_ratio); |
3981 | #endif | 4017 | #endif |
3982 | 4018 | ||
4019 | #ifdef CONFIG_SLUB_STATS | ||
4020 | |||
4021 | static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si) | ||
4022 | { | ||
4023 | unsigned long sum = 0; | ||
4024 | int cpu; | ||
4025 | int len; | ||
4026 | int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL); | ||
4027 | |||
4028 | if (!data) | ||
4029 | return -ENOMEM; | ||
4030 | |||
4031 | for_each_online_cpu(cpu) { | ||
4032 | unsigned x = get_cpu_slab(s, cpu)->stat[si]; | ||
4033 | |||
4034 | data[cpu] = x; | ||
4035 | sum += x; | ||
4036 | } | ||
4037 | |||
4038 | len = sprintf(buf, "%lu", sum); | ||
4039 | |||
4040 | for_each_online_cpu(cpu) { | ||
4041 | if (data[cpu] && len < PAGE_SIZE - 20) | ||
4042 | len += sprintf(buf + len, " c%d=%u", cpu, data[cpu]); | ||
4043 | } | ||
4044 | kfree(data); | ||
4045 | return len + sprintf(buf + len, "\n"); | ||
4046 | } | ||
4047 | |||
4048 | #define STAT_ATTR(si, text) \ | ||
4049 | static ssize_t text##_show(struct kmem_cache *s, char *buf) \ | ||
4050 | { \ | ||
4051 | return show_stat(s, buf, si); \ | ||
4052 | } \ | ||
4053 | SLAB_ATTR_RO(text); \ | ||
4054 | |||
4055 | STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath); | ||
4056 | STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath); | ||
4057 | STAT_ATTR(FREE_FASTPATH, free_fastpath); | ||
4058 | STAT_ATTR(FREE_SLOWPATH, free_slowpath); | ||
4059 | STAT_ATTR(FREE_FROZEN, free_frozen); | ||
4060 | STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial); | ||
4061 | STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial); | ||
4062 | STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial); | ||
4063 | STAT_ATTR(ALLOC_SLAB, alloc_slab); | ||
4064 | STAT_ATTR(ALLOC_REFILL, alloc_refill); | ||
4065 | STAT_ATTR(FREE_SLAB, free_slab); | ||
4066 | STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush); | ||
4067 | STAT_ATTR(DEACTIVATE_FULL, deactivate_full); | ||
4068 | STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty); | ||
4069 | STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head); | ||
4070 | STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail); | ||
4071 | STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees); | ||
4072 | |||
4073 | #endif | ||
4074 | |||
3983 | static struct attribute *slab_attrs[] = { | 4075 | static struct attribute *slab_attrs[] = { |
3984 | &slab_size_attr.attr, | 4076 | &slab_size_attr.attr, |
3985 | &object_size_attr.attr, | 4077 | &object_size_attr.attr, |
@@ -4010,6 +4102,25 @@ static struct attribute *slab_attrs[] = { | |||
4010 | #ifdef CONFIG_NUMA | 4102 | #ifdef CONFIG_NUMA |
4011 | &remote_node_defrag_ratio_attr.attr, | 4103 | &remote_node_defrag_ratio_attr.attr, |
4012 | #endif | 4104 | #endif |
4105 | #ifdef CONFIG_SLUB_STATS | ||
4106 | &alloc_fastpath_attr.attr, | ||
4107 | &alloc_slowpath_attr.attr, | ||
4108 | &free_fastpath_attr.attr, | ||
4109 | &free_slowpath_attr.attr, | ||
4110 | &free_frozen_attr.attr, | ||
4111 | &free_add_partial_attr.attr, | ||
4112 | &free_remove_partial_attr.attr, | ||
4113 | &alloc_from_partial_attr.attr, | ||
4114 | &alloc_slab_attr.attr, | ||
4115 | &alloc_refill_attr.attr, | ||
4116 | &free_slab_attr.attr, | ||
4117 | &cpuslab_flush_attr.attr, | ||
4118 | &deactivate_full_attr.attr, | ||
4119 | &deactivate_empty_attr.attr, | ||
4120 | &deactivate_to_head_attr.attr, | ||
4121 | &deactivate_to_tail_attr.attr, | ||
4122 | &deactivate_remote_frees_attr.attr, | ||
4123 | #endif | ||
4013 | NULL | 4124 | NULL |
4014 | }; | 4125 | }; |
4015 | 4126 | ||