file_systems/ext2/BitmapBlock.cpp

31 	TRACE("BitmapBlock::BitmapBlock(): num bits: %lu\n", fNumBits);
80 			uint32 bits = B_LENDIAN_TO_HOST_INT32(data[startIndex]);
85 			return (bits & mask) == (marked ? mask : 0);
95 		uint32 bits = B_LENDIAN_TO_HOST_INT32(data[index]);
97 		if ((bits & mask) != (marked ? mask : 0)) {
98 			TRACE("BitmapBlock::_Check(): start %lx mask %lx\n", bits, mask);
108 			TRACE("BitmapBlock::_Check(): iterations %lu bits: %lX\n", iterations,
117 		uint32 bits = B_LENDIAN_TO_HOST_INT32(data[index]);
118 		if ((bits & mask) != (marked ? mask : 0)) {
120 				remainingBits, bits, mask);
143 		"bits: %lu)\n", startIndex, startBit, remainingBits);
148 			uint32 bits = B_LENDIAN_TO_HOST_INT32(fData[startIndex]);
149 			TRACE("BitmapBlock::_Update(): bits: %lx\n", bits);
156 			if ((bits & mask) != (mark ? 0 : mask)) {
157 				ERROR("BitmapBlock::_Update() Marking failed bits %lx "
158 					"startBit %ld\n", bits, startBit);
163 			    bits |= mask;
165 			    bits &= ~mask;
167 			TRACE("BitmapBlock::_Update(): updated bits: %lx\n", bits);
168 			fData[startIndex] = B_HOST_TO_LENDIAN_INT32(bits);
181 		uint32 bits = B_LENDIAN_TO_HOST_INT32(fData[index]);
183 		TRACE("BitmapBlock::_Update(): mask: %lx, bits: %lx\n", mask, bits);
185 		if (!force && (bits & mask) != (mark ? 0 : mask))
189 			bits |= mask;
191 			bits &= ~mask;
192 		fData[index] = B_HOST_TO_LENDIAN_INT32(bits);
194 		TRACE("BitmapBlock::_Update(): updated bits: %lx\n", bits);
212 		uint32 bits = B_LENDIAN_TO_HOST_INT32(fData[index]);
214 		TRACE("BitmapBlock::_Update(): mask: %lx, bits: %lx\n", mask, bits);
216 		if (!force && (bits & mask) != (mark ? 0 : mask)) {
222 			bits |= mask;
224 			bits &= ~mask;
225 		fData[index] = B_HOST_TO_LENDIAN_INT32(bits);
227 		TRACE("BitmapBlock::_Update(): updated bits: %lx\n", bits);
253 	uint32 bits = B_LENDIAN_TO_HOST_INT32(data[index]);
256 		"bits: %lX\n", index, bit, mask, bits);
258 	bits &= mask;
259 	if (bits == (marked ? 0 : mask) && index < fMaxIndex) {
260 		// Find a 32 bits block that has a marked bit
274 				"num bits: %lu\n", fNumBits);
278 		bits = B_LENDIAN_TO_HOST_INT32(data[fMaxIndex]);
280 		if ((bits & mask) == (marked ? 0 : mask)) {
282 				"num bits: %lu\n", fNumBits);
288 		bits = B_LENDIAN_TO_HOST_INT32(data[index]);
292 		if ((bits >> bit & 1) != (marked ? 0U : 1U)) {
299 	panic("Couldn't find bit inside an uint32 (%lx)\n", bits);
321 	uint32 bits = B_LENDIAN_TO_HOST_INT32(data[index]);
322 	bits = bits & mask;
324 	TRACE("BitmapBlock::FindPreviousMarked(): index: %lu bit: %lu bits: %lx\n",
325 		index, bit, bits);
327 	if (bits == 0) {
328 		// Find an block of 32 bits that has a marked bit
333 		bits = B_LENDIAN_TO_HOST_INT32(data[index]);
334 		if (bits == 0) {
343 	TRACE("BitmapBlock::FindPreviousMarked(): index: %lu bit: %lu bits: %lx\n",
344 		index, bit, bits);
348 		if ((bits >> bit & 1) != 0) {
369 	uint32 bits = B_LENDIAN_TO_HOST_INT32(data[0]);
372 		"index: %lu, start index: %lu, index: %lu, bits: %lX, start: %lu, "
373 		"length: %lu\n", wordSpan, fMaxIndex, startIndex, index, bits, start,
409 		bits = B_LENDIAN_TO_HOST_INT32(data[index]);
413 		bits = B_LENDIAN_TO_HOST_INT32(data[index]);
415 		if (bits != 0) {
416 			// Contains marked bits
433 					if ((bits >> bit & 1) != 0)
468 			TRACE("BitmapBlock::FindLargestUnmarkedRange(): start bits: %lu\n",
484 			if ((bits >> bit & 1) == 0)