Gecko [ lorencats.com ]

Name	Size	Permission
buffer.js	283 B	-rw-r--r--
create.js	2.32 KB	-rw-r--r--
extract.js	2.76 KB	-rw-r--r--
header.js	8.83 KB	-rw-r--r--
high-level-opt.js	772 B	-rw-r--r--
large-numbers.js	1.93 KB	-rw-r--r--
list.js	3.08 KB	-rw-r--r--
mkdir.js	5.26 KB	-rw-r--r--
mode-fix.js	277 B	-rw-r--r--
normalize-windows-path.js	405 B	-rw-r--r--
pack.js	9.47 KB	-rw-r--r--
parse.js	11.73 KB	-rw-r--r--
pax.js	3.97 KB	-rw-r--r--
read-entry.js	2.41 KB	-rw-r--r--
replace.js	5.36 KB	-rw-r--r--
strip-absolute-path.js	918 B	-rw-r--r--
types.js	1.07 KB	-rw-r--r--
unpack.js	17.9 KB	-rw-r--r--
update.js	852 B	-rw-r--r--
warn-mixin.js	309 B	-rw-r--r--
winchars.js	533 B	-rw-r--r--
write-entry.js	11.46 KB	-rw-r--r--

Code Editor : large-numbers.js

'use strict'
// Tar can encode large and negative numbers using a leading byte of
// 0xff for negative, and 0x80 for positive.  The trailing byte in the
// section will always be 0x20, or in some implementations 0x00.
// this module encodes and decodes these things.

const encode = exports.encode = (num, buf) => {
  buf[buf.length - 1] = 0x20
  if (num < 0)
    encodeNegative(num, buf)
  else
    encodePositive(num, buf)
  return buf
}

const encodePositive = (num, buf) => {
  buf[0] = 0x80
  for (var i = buf.length - 2; i > 0; i--) {
    if (num === 0)
      buf[i] = 0
    else {
      buf[i] = num % 0x100
      num = Math.floor(num / 0x100)
    }
  }
}

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

const parse = exports.parse = (buf) => {
  var post = buf[buf.length - 1]
  var pre = buf[0]
  return pre === 0x80 ? pos(buf.slice(1, buf.length - 1))
   : twos(buf.slice(1, buf.length - 1))
}

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 * -1
}

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

${this.title}

Code Editor : large-numbers.js