原理一.png

原理二.png

一、Message分析

1.創(chuàng)建對(duì)象

通過(guò)調(diào)用Message的靜態(tài)方法obtain()，從內(nèi)部提供的消息池中獲取一個(gè)消息。

                 final Message obtain = Message.obtain();

2.Message參數(shù)

           long when：記錄消息何時(shí)被處理
           Handler target:記錄的消息被處理的handler對(duì)象
           Message sPool:反應(yīng)了消息池的概念
           Runnable callback:優(yōu)先級(jí)最高的消息處理的方式。
           Message next:形成消息的鏈表

二、Handler分析源碼

發(fā)送消息 sendMessage

  public final boolean sendMessage(Message msg)
  {
    return sendMessageDelayed(msg, 0);
  }

調(diào)用sendMessageDelayed

 public final boolean sendMessageDelayed(Message msg, long delayMillis)
  {
    if (delayMillis < 0) {
        delayMillis = 0;
     }
    return sendMessageAtTime(msg, SystemClock.uptimeMillis() + delayMillis);
  }

delayMillis 延遲時(shí)間
SystemClock.uptimeMillis() + delayMillis 執(zhí)行時(shí)間
最終調(diào)用sendMessageAtTime

public boolean sendMessageAtTime(Message msg, long uptimeMillis) {
    MessageQueue queue = mQueue;
    if (queue == null) {
        RuntimeException e = new RuntimeException(
                this + " sendMessageAtTime() called with no mQueue");
        Log.w("Looper", e.getMessage(), e);
        return false;
    }
    return enqueueMessage(queue, msg, uptimeMillis);
}

MessageQueue 存儲(chǔ)消息，鏈表結(jié)構(gòu)（插入快，數(shù)組查詢快），以被處理的時(shí)間順序存儲(chǔ)

public Handler(Looper looper, Callback callback, boolean async) {
    mLooper = looper;
    mQueue = looper.mQueue;
    mCallback = callback;
    mAsynchronous = async;
}

mQueue = looper.mQueue;Looper中使用的同一個(gè)MessageQueue 對(duì)象

private boolean enqueueMessage(MessageQueue queue, Message msg, long uptimeMillis) {
    msg.target = this;
    if (mAsynchronous) {
        msg.setAsynchronous(true);
    }
    return queue.enqueueMessage(msg, uptimeMillis);
}

msg.target = this; 數(shù)明處理和發(fā)送的是同一個(gè)handle對(duì)象

三、MessageQueue分析源碼

主要enqueueMessage方法 按照when時(shí)間（被處理時(shí)間）排序

    boolean enqueueMessage(Message msg, long when) {
    if (msg.target == null) {
        throw new IllegalArgumentException("Message must have a target.");
    }
    if (msg.isInUse()) {
        throw new IllegalStateException(msg + " This message is already in use.");
    }

    synchronized (this) {
        if (mQuitting) {
            IllegalStateException e = new IllegalStateException(
                    msg.target + " sending message to a Handler on a dead thread");
            Log.w(TAG, e.getMessage(), e);
            msg.recycle();
            return false;
        }

        msg.markInUse();
        msg.when = when;
        Message p = mMessages;
        boolean needWake;
        if (p == null || when == 0 || when < p.when) {
            // New head, wake up the event queue if blocked.
            msg.next = p;
            mMessages = msg;
            needWake = mBlocked;
        } else {
            // Inserted within the middle of the queue.  Usually we don't have to wake
            // up the event queue unless there is a barrier at the head of the queue
            // and the message is the earliest asynchronous message in the queue.
            needWake = mBlocked && p.target == null && msg.isAsynchronous();
            Message prev;
            for (;;) {
                prev = p;
                p = p.next;
                if (p == null || when < p.when) {
                    break;
                }
                if (needWake && p.isAsynchronous()) {
                    needWake = false;
                }
            }
            msg.next = p; // invariant: p == prev.next
            prev.next = msg;
        }

        // We can assume mPtr != 0 because mQuitting is false.
        if (needWake) {
            nativeWake(mPtr);
        }
    }
    return true;
}

通過(guò)死循環(huán)進(jìn)行排序

四、MessageQueue分析源碼

loop方法：

    public static void loop() {
    final Looper me = myLooper();
    if (me == null) {
        throw new RuntimeException("No Looper; Looper.prepare() wasn't called on this thread.");
    }
    final MessageQueue queue = me.mQueue;

    // Make sure the identity of this thread is that of the local process,
    // and keep track of what that identity token actually is.
    Binder.clearCallingIdentity();
    final long ident = Binder.clearCallingIdentity();

    for (;;) {
        Message msg = queue.next(); // might block
        if (msg == null) {
            // No message indicates that the message queue is quitting.
            return;
        }

        // This must be in a local variable, in case a UI event sets the logger
        Printer logging = me.mLogging;
        if (logging != null) {
            logging.println(">>>>> Dispatching to " + msg.target + " " +
                    msg.callback + ": " + msg.what);
        }

        msg.target.dispatchMessage(msg);

        if (logging != null) {
            logging.println("<<<<< Finished to " + msg.target + " " + msg.callback);
        }

        // Make sure that during the course of dispatching the
        // identity of the thread wasn't corrupted.
        final long newIdent = Binder.clearCallingIdentity();
        if (ident != newIdent) {
            Log.wtf(TAG, "Thread identity changed from 0x"
                    + Long.toHexString(ident) + " to 0x"
                    + Long.toHexString(newIdent) + " while dispatching to "
                    + msg.target.getClass().getName() + " "
                    + msg.callback + " what=" + msg.what);
        }

        msg.recycleUnchecked();
    }
}

循環(huán)取msg,取出之后調(diào)用

       msg.target.dispatchMessage(msg);

分發(fā)消息
handle中的

 public void dispatchMessage(Message msg) {
    if (msg.callback != null) {
        handleCallback(msg);
    } else {
        if (mCallback != null) {
            if (mCallback.handleMessage(msg)) {
                return;
            }
        }
        handleMessage(msg);
    }
    }

Paste_Image.png

可以看出只有當(dāng)msg.callback=null,mCallback=null或者msg.callback=null,mCallback.handleMessage(msg)=false時(shí)，才會(huì)執(zhí)行回調(diào)handleMessage(msg);