aboutsummaryrefslogtreecommitdiffstats
path: root/java/com/tigervnc/rdr/MemOutStream.java
blob: 3df4635b90a0cb33309ce6bd0b11e44da5cd3cc8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/* Copyright (C) 2002-2005 RealVNC Ltd.  All Rights Reserved.
 * Copyright (C) 2011-2019 Brian P. Hinz
 *
 * This is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This software is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this software; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
 * USA.
 */

//
// A MemOutStream grows as needed when data is written to it.
//

package com.tigervnc.rdr;

public class MemOutStream extends OutStream {

  public MemOutStream(int len) {
    b = new byte[len];
    ptr = 0;
    end = len;
  }
  public MemOutStream() { this(1024); }

  public int length() { return ptr; }
  public void clear() { ptr = 0; };
  public void reposition(int pos) { ptr = pos; }

  // data() returns a pointer to the buffer.

  public final byte[] data() { return b; }

  // overrun() either doubles the buffer or adds enough space for nItems of
  // size itemSize bytes.

  protected int overrun(int itemSize, int nItems) {
    int len = ptr + itemSize * nItems;
    if (len < end * 2)
      len = end * 2;

    if (len < end)
      throw new Exception("Overflow in MemOutStream::overrun()");

    byte[] newBuf = new byte[len];
    System.arraycopy(b, 0, newBuf, 0, ptr);
    b = newBuf;
    end = len;

    return nItems;
  }
}