跳至主要内容

Java memory analyzer

Origin

When I optimize a mysql pagination interface , I want ot use Redis cache to store some result to speed it up. In order to estimate how much memory I will spend, I have to do some memory estimation.

Solution

This solution comes from this stackoverflow question.

Steps

Write the following source:

package memory;

import java.lang.instrument.Instrumentation;

public class ObjectSizeFetcher {
    private static Instrumentation instrumentation;

    public static void premain(String args, Instrumentation inst) {
        instrumentation = inst;
    }

    public static long getObjectSize(Object o) {
        return instrumentation.getObjectSize(o);
    }
}

Add the following line to your MANIFEST.MF:

Premain-Class: memory.ObjectSizeFetcher

Use getObjectSize:

package memory;

public class C {
    private int x;
    private int y;

    public static void main(String [] args) {
        System.out.println(
        ObjectSizeFetcher.getObjectSize(new C()));
    }
}

Build your jar as you have done before or use:

jar cvfm ObjectSizeFetcherAgent.jar MANIFEST.MF input_file`

Invoke with:

java -javaagent:ObjectSizeFetcherAgent.jar memory.C

Runnable source can be found here

Other solution

Limitation

As comments of above stackoverflow question pointed out, above solution has some limits: it just count reference size for Object not the size in heap.
For example, for the following class, program all give 16:

private static class JustString {
    private String a = "test";
}

private static class ByteArray {
    private byte[] a = new byte[128];
}

private static class JustObject {
    private Object o = new Object();
}

private static class JustList {
    private List<A> l = new ArrayList<>();
}

So we move to more productive solution

Solution from netty

When skim the source of netty, I find a thread pool executor named MemoryAwareThreadPoolExecutor. Interested in this class, I find out the source and read the following doc:

When a task (i.e. Runnable) is submitted, MemoryAwareThreadPoolExecutor calls ObjectSizeEstimator.estimateSize(Object) to get the estimated size of the task in bytes to calculate the amount of memory occupied by the unprocessed tasks.
If the total size of the unprocessed tasks exceeds either per-Channel or per-Executor threshold, any further execute(Runnable) call will block until the tasks in the queue are processed so that the total size goes under the threshold.

This executor block job submission when exceed memory limit and memory analyzer is a crutial part. We can find a implementation for ObjectSizeEstimator in source
DefaultObjectSizeEstimator, and we will analyze how it implemented.
First, it store the size of primitives:

public DefaultObjectSizeEstimator() {
    class2size.put(boolean.class, 4); // Probably an integer.
    class2size.put(byte.class, 1);
    class2size.put(char.class, 2);
    class2size.put(int.class, 4);
    class2size.put(short.class, 2);
    class2size.put(long.class, 8);
    class2size.put(float.class, 4);
    class2size.put(double.class, 8);
    class2size.put(void.class, 0);
}

Then, it analyze this class recursively for every field:

visitedClasses.add(clazz);

int answer = 8; // Basic overhead.
for (Class<?> c = clazz; c != null; c = c.getSuperclass()) {
    Field[] fields = c.getDeclaredFields();
    for (Field f : fields) {
        if ((f.getModifiers() & Modifier.STATIC) != 0) {
            // Ignore static fields.
            continue;
        }

        answer += estimateSize(f.getType(), visitedClasses);
    }
}

visitedClasses.remove(clazz);

And then align to 8 byte:

// Some alignment.
answer = align(answer);

Finally some special handler for some class:

...
} else if (o instanceof byte[]) {
    answer += ((byte[]) o).length;
} else if (o instanceof ByteBuffer) {
    answer += ((ByteBuffer) o).remaining();
} else if (o instanceof CharSequence) {
    answer += ((CharSequence) o).length() << 1;
} else if (o instanceof Iterable<?>) {
    for (Object m : (Iterable<?>) o) {
        answer += estimateSize(m);
    }
}

What should be noticed is this class is designed for netty using which omit many special cases( For example, it omit the handle process for a int array.) and not suitable for common usage.

But most of the code can be used to customize your version of memory analyzer.

Online source code of DefaultObjectSizeEstimator

Ref

Written with StackEdit.

评论

此博客中的热门博文

Spring Boot: Customize Environment

Spring Boot: Customize Environment Environment variable is a very commonly used feature in daily programming: used in init script used in startup configuration used by logging etc In Spring Boot, all environment variables are a part of properties in Spring context and managed by Environment abstraction. Because Spring Boot can handle the parse of configuration files, when we want to implement a project which uses yml file as a separate config file, we choose the Spring Boot. The following is the problems we met when we implementing the parse of yml file and it is recorded for future reader. Bind to Class Property values can be injected directly into your beans using the @Value annotation, accessed via Spring’s Environment abstraction or bound to structured objects via @ConfigurationProperties. As the document says, there exists three ways to access properties in *.properties or *.yml : @Value : access single value Environment : can access multi

Elasticsearch: Join and SubQuery

Elasticsearch: Join and SubQuery Tony was bothered by the recent change of search engine requirement: they want the functionality of SQL-like join in Elasticsearch! “They are crazy! How can they think like that. Didn’t they understand that Elasticsearch is kind-of NoSQL 1 in which every index should be independent and self-contained? In this way, every index can work independently and scale as they like without considering other indexes, so the performance can boost. Following this design principle, Elasticsearch has little related supports.” Tony thought, after listening their requirements. Leader notice tony’s unwillingness and said, “Maybe it is hard to do, but the requirement is reasonable. We need to search person by his friends, didn’t we? What’s more, the harder to implement, the more you can learn from it, right?” Tony thought leader’s word does make sense so he set out to do the related implementations Application-Side Join “The first implementation

Implement isdigit

It is seems very easy to implement c library function isdigit , but for a library code, performance is very important. So we will try to implement it and make it faster. Function So, first we make it right. int isdigit ( char c) { return c >= '0' && c <= '9' ; } Improvements One – Macro When it comes to performance for c code, macro can always be tried. #define isdigit (c) c >= '0' && c <= '9' Two – Table Upper version use two comparison and one logical operation, but we can do better with more space: # define isdigit(c) table[c] This works and faster, but somewhat wasteful. We need only one bit to represent true or false, but we use a int. So what to do? There are many similar functions like isalpha(), isupper ... in c header file, so we can combine them into one int and get result by table[c]&SOME_BIT , which is what source do. Source code of ctype.h : # define _ISbit(bit) (1 << (