ACIL FM

Nama	Ukuran	Aksi
create.js	2.3 MB	View DL Edit
extract.js	2.74 MB	View DL Edit
get-write-flag.js	921 B	View DL Edit
header.js	8.77 MB	View DL Edit
high-level-opt.js	760 B	View DL Edit
large-numbers.js	2.13 MB	View DL Edit
list.js	3.09 MB	View DL Edit
mkdir.js	5.21 MB	View DL Edit
mode-fix.js	619 B	View DL Edit
normalize-unicode.js	405 B	View DL Edit
normalize-windows-path.js	410 B	View DL Edit
pack.js	9.22 MB	View DL Edit
parse.js	13.86 MB	View DL Edit
path-reservations.js	4.21 MB	View DL Edit
pax.js	3.92 MB	View DL Edit
read-entry.js	2.71 MB	View DL Edit
replace.js	5.35 MB	View DL Edit
strip-absolute-path.js	918 B	View DL Edit
strip-trailing-slashes.js	394 B	View DL Edit
types.js	1.07 MB	View DL Edit
unpack.js	24.46 MB	View DL Edit
update.js	842 B	View DL Edit
warn-mixin.js	697 B	View DL Edit
winchars.js	535 B	View DL Edit
write-entry.js	14.76 MB	View DL Edit

Edit file: /lib/node_modules/npm/node_modules/tar/lib/large-numbers.js

'use strict'
// Tar can encode large and negative numbers using a leading byte of
// 0xff for negative, and 0x80 for positive.

const encode = (num, buf) => {
  if (!Number.isSafeInteger(num))
    // The number is so large that javascript cannot represent it with integer
    // precision.
    throw Error('cannot encode number outside of javascript safe integer range')
  else if (num < 0)
    encodeNegative(num, buf)
  else
    encodePositive(num, buf)
  return buf
}

const encodePositive = (num, buf) => {
  buf[0] = 0x80

for (var i = buf.length; i > 1; i--) {
    buf[i - 1] = num & 0xff
    num = Math.floor(num / 0x100)
  }
}

const encodeNegative = (num, buf) => {
  buf[0] = 0xff
  var flipped = false
  num = num * -1
  for (var i = buf.length; i > 1; i--) {
    var byte = num & 0xff
    num = Math.floor(num / 0x100)
    if (flipped)
      buf[i - 1] = onesComp(byte)
    else if (byte === 0)
      buf[i - 1] = 0
    else {
      flipped = true
      buf[i - 1] = twosComp(byte)
    }
  }
}

const parse = (buf) => {
  const pre = buf[0]
  const value = pre === 0x80 ? pos(buf.slice(1, buf.length))
    : pre === 0xff ? twos(buf)
    : null
  if (value === null)
    throw Error('invalid base256 encoding')

if (!Number.isSafeInteger(value))
    // The number is so large that javascript cannot represent it with integer
    // precision.
    throw Error('parsed number outside of javascript safe integer range')

return value
}

const twos = (buf) => {
  var len = buf.length
  var sum = 0
  var flipped = false
  for (var i = len - 1; i > -1; i--) {
    var byte = buf[i]
    var f
    if (flipped)
      f = onesComp(byte)
    else if (byte === 0)
      f = byte
    else {
      flipped = true
      f = twosComp(byte)
    }
    if (f !== 0)
      sum -= f * Math.pow(256, len - i - 1)
  }
  return sum
}

const pos = (buf) => {
  var len = buf.length
  var sum = 0
  for (var i = len - 1; i > -1; i--) {
    var byte = buf[i]
    if (byte !== 0)
      sum += byte * Math.pow(256, len - i - 1)
  }
  return sum
}

const onesComp = byte => (0xff ^ byte) & 0xff

const twosComp = byte => ((0xff ^ byte) + 1) & 0xff

module.exports = {
  encode,
  parse,
}

Batal