• 使用Chrome开发者工具研究JavaScript函数的原生实现原理


    As the size of my blog Chrome Development Tool tips used in my daily work turns to be larger I create a separate post to record down this small tip.
    Are you curious about the “native code” here? At least I am

    Today I find that the Profiles tab in Chrome development tool can help us to unveil the mysteries to some degree.
    In Chrome development, just select this checkbox:

    And then execute the simple JavaScript code below:

    var arr = [];
    for (var i=0; i<1000; i++){
        arr.push(i)
    }
    console.profile("Array toString");
    
    for( var i = 0; i < 1000; i++){
    	var a = arr.toString();
    }
    console.profileEnd("Array toString");
    

    Once done, you can see a profile record with the name specified in JavaScript code above, “Array toString”. Hover the mouse to the first row, “anonymous function”, we find the hint “array.js”.

    Switch display style from Chart to Tree:

    From here the callstack of native implementation of toString is displayed:

    The next step is to look into in array.js.
    Launch url: https://cs.chromium.org/
    Click this hyperlink:

    now you can find the array.js file via path: src/v8/src/js/array.js

    The callstack analyzed through the source code exactly matches the one we get in Chrome development tool Profile tab:
    ArrayToString will delegate to Join if current caller is an Array:

    Join will call DoJoin:

    DoJoin will first call UseSparseVariant to evaluate the possibility to perform Join via SparseVariant. If not possible, call ConvertToString as fall back. ( The line number of source code may vary with the one you see in Chrome Development Tool profile tab due to the different version of Chrome being used. )

    If you could not tolerate the poor performance of this online source code repository, you could download the whole source code of V8 to your local laptop by cloning this github repository:

    https://chromium.googlesource.com/v8/v8.git/

    要获取更多Jerry的原创文章,请关注公众号"汪子熙":

  • 相关阅读:
    [匈牙利算法] 洛谷 P1640 连续攻击
    [dfs] Jzoj P5916 flow
    [bfs] Jzoj P3522 迷宫花园
    [二分][状压dp] Jzoj P3521 道路覆盖
    [模拟] Jzoj P3520 原根
    [并查集] Jzoj P5914 盟主的忧虑
    [树上差分][子树求和][树形dp] Jzoj P5911 Travel
    [思维][暴力] Jzoj P5912 VanUSee
    [dfs][离散化] Jzoj P5910 DuLiu
    [cdq分治][树的重心] 洛谷 P3806 点分治1
  • 原文地址:https://www.cnblogs.com/sap-jerry/p/13549124.html
Copyright © 2020-2023  润新知