aboutsummaryrefslogtreecommitdiff
path: root/nxcomp/SequenceQueue.h
blob: 7a88717f70f61c14e71c5299e0447023ccf0ac19 (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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
/**************************************************************************/
/*                                                                        */
/* Copyright (c) 2001, 2010 NoMachine, http://www.nomachine.com/.         */
/*                                                                        */
/* NXCOMP, NX protocol compression and NX extensions to this software     */
/* are copyright of NoMachine. Redistribution and use of the present      */
/* software is allowed according to terms specified in the file LICENSE   */
/* which comes in the source distribution.                                */
/*                                                                        */
/* Check http://www.nomachine.com/licensing.html for applicability.       */
/*                                                                        */
/* NX and NoMachine are trademarks of Medialogic S.p.A.                   */
/*                                                                        */
/* All rights reserved.                                                   */
/*                                                                        */
/**************************************************************************/

#ifndef SequenceQueue_H
#define SequenceQueue_H

inline int SequenceNumber_x_gt_y(unsigned int x, unsigned int y)
{
  // For two sequence numbers x and y, determine whether (x > y).
  // Sequence numbers are the trailing 16 bits of a bigger number:
  // need to handle wraparound, e.g. 0 is 65536, just after 65535.
  if (x != (x & 0x00ffff)) return 0;
  if (y != (y & 0x00ffff)) return 0;
  // Closeness when comparison makes sense: arbitrarily set at 16*1024
  if ((x > y) && ((x-y) < 16*1024)) return 1;
  // Wrapped value
  unsigned int w = x + 64*1024;
  // We know that w>y but test left for symmetry
  if ((w > y) && ((w-y) < 16*1024)) return 1;
  return 0;
}

//
// List of outstanding request messages which
// are waiting for a reply. This class is used
// in X client and server channels to correlate
// the replies sequence numbers to the original
// request type.
//

class SequenceQueue
{
  public:

  SequenceQueue();

  virtual ~SequenceQueue();

  void push(unsigned short int sequence, unsigned char opcode,
                unsigned int data1 = 0, unsigned int data2 = 0,
                    unsigned int data3 = 0);

  int peek(unsigned short int &sequence, unsigned char &opcode);

  int peek(unsigned short int &sequence, unsigned char &opcode,
               unsigned int &data1, unsigned int &data2,
                   unsigned int &data3);

  int pop(unsigned short int &sequence, unsigned char &opcode, 
              unsigned int &data1, unsigned int &data2,
                  unsigned int &data3);

  int pop(unsigned short int &sequence, unsigned char &opcode)
  {
    unsigned int data1, data2, data3;

    return pop(sequence, opcode, data1, data2, data3);
  }

  int length()
  {
    return length_;
  }

  private:

  struct RequestSequence
  {
    unsigned short int sequence;
    unsigned char      opcode;
    unsigned int       data1;
    unsigned int       data2;
    unsigned int       data3;
  };

  RequestSequence *queue_;

  unsigned int size_;
  unsigned int length_;

  unsigned int start_;
  unsigned int end_;
};

#endif /* SequenceQueue_H */