This file is indexed.

/usr/include/gpsim/bit.h is in gpsim-dev 0.26.1-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
/*
   Copyright (C) 1998-2003 T. Scott Dattalo

This file is part of the libgpsim library of gpsim

This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.

This library 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
Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public
License along with this library; if not, see 
<http://www.gnu.org/licenses/lgpl-2.1.html>.
*/

#if !defined(__BIT_H__)
#define __BIT_H__

// Function to test the Bit Class:
extern void test_bits();

// Bit
//
// The Bit object is like a bool except that it supports 3-state
// logic.

class RegisterValue;
class Bit
{
public:

  Bit(RegisterValue &rv, unsigned int bit_mask);
    Bit(bool nd=false, bool ni=false)
    : d(nd), i(ni)
  {
  }
  
  inline void operator = (const Bit &bv)
  {
    d = bv.d;
    i = bv.i;
  }
  inline bool operator == (const Bit &bv) const
  {
    return d==bv.d && i==bv.i;
  }
  inline void operator |= (const Bit &bv)
  {
    i = (i&bv.i) || (i&d) ||
      (bv.d&bv.i);
    d |= bv.d;
  }

  inline void operator &= (const Bit &bv)
  {
    i = i&bv.i || (i&!bv.d) || (!d&bv.i);
    d &= bv.d;
  }

  inline void operator ^= (const Bit &bv) 
  {
    d ^= bv.d;
    i &= bv.i;
  }

  inline Bit operator & (const Bit &r)
  {
    Bit bLv = *this;

    bLv.i = bLv.i&r.i || (r.i&!r.d) || (!bLv.d&bLv.i);
    bLv.d &= r.d;

    return bLv;
  }

  inline Bit operator | (const Bit &bv)
  {
    Bit bLv = *this;
    bLv |= bv;
    return bLv;
  }
  inline Bit operator ^ (const Bit &bv)
  {
    Bit bLv = *this;
    bLv ^= bv;
    return bLv;
  }
  inline bool isZero()
  {
    return d==false && i==true;
  }
  inline bool isOne()
  {
    return d==true && i==true;
  }
  inline bool isKnown()
  {
    return i==true;
  }
  inline bool isUnKnown()
  {
    return i==false;
  }
  inline void set(bool nd, bool ni)
  {
    d = nd;
    i = ni;
  }

  inline void clear()
  {
    d=false;
    i=true;
  }
  inline void set() 
  {
    d = true;
    i = true;
  }
  inline void setUnknown()
  {
    i = false;
  }

  inline char val()
  {
    return !isKnown() ? '?' : (isOne() ? '1' : '0');
  }

  friend Bit operator ! (Bit b);
  
private:
  bool d;  // The data
  bool i;  // i=true if d is valid
};

inline Bit operator ! (Bit b)
{
  Bit bLv = b;
  bLv.d = !bLv.d;
  return bLv;
}
#endif