| 1914 | mc, |
| 1915 | Uc = {}; |
| 1916 | function Vc(a, b, c) { |
| 1917 | try { |
| 1918 | var d = a(b); |
| 1919 | } catch (f) { |
| 1920 | if (f && f.node && z(b) !== z(Ub(f.node))) return -54; |
| 1921 | throw f; |
| 1922 | } |
| 1923 | N[c >> 2] = d.dev; |
| 1924 | N[(c + 4) >> 2] = 0; |
| 1925 | N[(c + 8) >> 2] = d.ino; |
| 1926 | N[(c + 12) >> 2] = d.mode; |
| 1927 | N[(c + 16) >> 2] = d.nlink; |
| 1928 | N[(c + 20) >> 2] = d.uid; |
| 1929 | N[(c + 24) >> 2] = d.gid; |
| 1930 | N[(c + 28) >> 2] = d.rdev; |
| 1931 | N[(c + 32) >> 2] = 0; |
| 1932 | O = [ |
| 1933 | d.size >>> 0, |
| 1934 | ((P = d.size), |
| 1935 | 1 <= +Math.abs(P) |
| 1936 | ? 0 < P |
| 1937 | ? (Math.min(+Math.floor(P / 4294967296), 4294967295) | 0) >>> 0 |
| 1938 | : ~~+Math.ceil((P - +(~~P >>> 0)) / 4294967296) >>> 0 |
| 1939 | : 0), |
| 1940 | ]; |
| 1941 | N[(c + 40) >> 2] = O[0]; |
| 1942 | N[(c + 44) >> 2] = O[1]; |
| 1943 | N[(c + 48) >> 2] = 4096; |
| 1944 | N[(c + 52) >> 2] = d.blocks; |
| 1945 | N[(c + 56) >> 2] = (d.atime.getTime() / 1e3) | 0; |
| 1946 | N[(c + 60) >> 2] = 0; |
| 1947 | N[(c + 64) >> 2] = (d.mtime.getTime() / 1e3) | 0; |
| 1948 | N[(c + 68) >> 2] = 0; |
| 1949 | N[(c + 72) >> 2] = (d.ctime.getTime() / 1e3) | 0; |
| 1950 | N[(c + 76) >> 2] = 0; |
| 1951 | O = [ |
| 1952 | d.ino >>> 0, |
| 1953 | ((P = d.ino), |
| 1954 | 1 <= +Math.abs(P) |
| 1955 | ? 0 < P |
| 1956 | ? (Math.min(+Math.floor(P / 4294967296), 4294967295) | 0) >>> 0 |
| 1957 | : ~~+Math.ceil((P - +(~~P >>> 0)) / 4294967296) >>> 0 |
| 1958 | : 0), |
| 1959 | ]; |
| 1960 | N[(c + 80) >> 2] = O[0]; |
| 1961 | N[(c + 84) >> 2] = O[1]; |
| 1962 | return 0; |
| 1963 | } |
| 1964 | var Wc = void 0; |
| 1965 | function Xc() { |
| 1966 | Wc += 4; |