This file is indexed.

/usr/include/wibble/sys/buffer.h is in libwibble-dev 1.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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
#ifndef WIBBLE_SYS_BUFFER_H
#define WIBBLE_SYS_BUFFER_H

/*
 * Variable-size, reference-counted memory buffer
 *
 * Copyright (C) 2003--2013  Enrico Zini <enrico@debian.org>
 *
 * 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, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
 */

#include <stddef.h> // for size_t
#include <ostream>

namespace wibble {
namespace sys {

/**
 * Variable-size, reference-counted memory buffer.
 */
class Buffer
{
public:
	class Data
	{
	protected:
		mutable int _ref;
		size_t _size;
		void* _data;

	public:
		Data() throw () : _ref(0), _size(0), _data(0) {}
		Data(size_t size);
		// if own == true, take possession of the memory buffer, else copy it
		Data(void* buf, size_t size, bool own = true);
		Data(const void* buf, size_t size);
		~Data();

		/// Increment the reference count for this object
		void ref() const throw () { ++_ref; }

		/// Decrement the reference count for this object, returning true when it
		/// reaches 0
		bool unref() const throw () { return --_ref == 0; }

		/// Resize (enlarging or shrinking it) the buffer to `size' bytes
		void resize(size_t size);

		/// Compare the contents of two buffers
		bool operator==(const Data& d) const throw();

		/// Compare the contents of two buffers
		bool operator<(const Data& d) const throw();

		friend class Buffer;
	};

	Data* item;
	
public:
	/// Create a 0-lenght buffer
	Buffer() throw () : item(0) {}

	/// Create a buffer with the specified size
	Buffer(size_t size) : item(0)
	{
		if (size)
		{
			item = new Data(size);
			item->ref();
		}
	}

	/**
	 * Create a buffer from existing data
	 *
	 * @param buf
	 *   The data to put in this buffer
	 * @param size
	 *   The dimension of buf
	 * @param own
	 *   If true, take ownership of buf, else make a copy of it.
     *   If we take ownership, then buf must have been allocated with malloc,
     *   since we will call free() to deallocate it.
	 */
	Buffer(void* buf, size_t size, bool own = true) : item(0)
	{
		if (size)
		{
			item = new Data(buf, size, own);
			item->ref();
		}
	}

	/**
	 * Create a buffer with a copy of the given data
	 *
	 * It will always make a copy of the contents of buf.
	 */
	Buffer(const void* buf, size_t size) : item(0)
	{
		if (size)
		{
			item = new Data(buf, size);
			item->ref();
		}
	}

	Buffer(const Buffer& buf) throw ()
	{
		if (buf.item)
			buf.item->ref();
		item = buf.item;
	}
	~Buffer()
	{
		if (item && item->unref())
			delete item;
	}
	Buffer& operator=(const Buffer& buf)
	{
		if (buf.item)
			buf.item->ref();  // Do it early to correctly handle the case of x = x;
		if (item && item->unref())
			delete item;
		item = buf.item;
		return *this;
	}

	/// Return a pointer to the buffer
	void* data() throw () { return item ? item->_data : 0; }

	/// Return a pointer to the buffer
	const void* data() const throw () { return item ? item->_data : 0; }

	/// Return the buffer size
	size_t size() const throw () { return item ? item->_size : 0; }

	/// Resize the buffer to hold exactly the specified amount of bytes
	void resize(size_t newSize)
	{
		if (size() == newSize)
			return;
		if (!newSize)
		{
			if (item && item->unref())
				delete item;
			item = 0;
		} else if (item) {
			item->resize(newSize);
		} else {
			item = new Data(newSize);
			item->ref();
		}
	}

	/// Compare the contents of two buffers
	bool operator==(const Buffer& buf) const throw ()
	{
		if (item == 0 && buf.item == 0)
			return true;
		if (item == 0 || buf.item == 0)
			return false;
		return *item == *buf.item;
	}

	bool operator!=(const Buffer& buf) const throw ()
	{
		return !operator==(buf);
	}

	/// Compare the contents of two buffers
	bool operator<(const Buffer& buf) const throw ()
	{
		if (item == 0 && buf.item == 0)
			return false;
		if (item == 0)
			return true;
		if (buf.item == 0)
			return false;
		return *item < *buf.item;
	}

    /**
     * Render a c-string escaped print preview of maximum \a size buffer bytes.
     *
     * If the buffer is longer than \a size, "[...]" will be appended to the
     * result.
     */
    std::string print_preview(unsigned size) const;
};

std::ostream& operator<<(std::ostream& o, const Buffer& b);

}
}

// vim:set ts=4 sw=4:
#endif