/haiku-fatelf/src/tests/system/kernel/file_corruption/ |
H A D | CheckSum.h | 17 return fData; 22 for (size_t i = 0; i < sizeof(fData); i++) { 23 if (fData[i] != 0) 32 memcpy(fData, other.fData, sizeof(fData)); 38 memcpy(fData, buffer, sizeof(fData)); 44 return memcmp(fData, buffer, sizeof(fData)) 53 uint8 fData[SHA_DIGEST_LENGTH]; member in struct:CheckSum [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | Blocker.cpp | 35 : fData(new(std::nothrow) Data) 41 : fData(new(std::nothrow) Data(semaphore)) 43 if (!fData) 49 : fData(NULL) 64 if (!fData) 66 return (fData->semaphore < 0 ? fData->semaphore : B_OK); 74 if (!fData || fData->semaphore < 0) 78 status_t error = get_sem_count(fData [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/shared/ |
H A D | Blocker.cpp | 35 : fData(new(nothrow) Data) 41 : fData(new(nothrow) Data(semaphore)) 43 if (!fData) 49 : fData(NULL) 64 if (!fData) 66 return (fData->semaphore < 0 ? fData->semaphore : B_OK); 74 if (!fData || fData->semaphore < 0) 78 status_t error = get_sem_count(fData [all...] |
/haiku-fatelf/src/kits/interface/ |
H A D | GradientLinear.cpp | 17 fData.linear.x1 = 0.0f; 18 fData.linear.y1 = 0.0f; 19 fData.linear.x2 = 0.0f; 20 fData.linear.y2 = 0.0f; 28 fData.linear.x1 = start.x; 29 fData.linear.y1 = start.y; 30 fData.linear.x2 = end.x; 31 fData.linear.y2 = end.y; 39 fData.linear.x1 = x1; 40 fData [all...] |
H A D | GradientConic.cpp | 17 fData.conic.cx = 0.0f; 18 fData.conic.cy = 0.0f; 19 fData.conic.angle = 0.0f; 27 fData.conic.cx = center.x; 28 fData.conic.cy = center.y; 29 fData.conic.angle = angle; 37 fData.conic.cx = cx; 38 fData.conic.cy = cy; 39 fData.conic.angle = angle; 48 return BPoint(fData [all...] |
H A D | GradientRadial.cpp | 17 fData.radial.cx = 0.0f; 18 fData.radial.cy = 0.0f; 19 fData.radial.radius = 0.0f; 27 fData.radial.cx = center.x; 28 fData.radial.cy = center.y; 29 fData.radial.radius = radius; 37 fData.radial.cx = cx; 38 fData.radial.cy = cy; 39 fData.radial.radius = radius; 48 return BPoint(fData [all...] |
H A D | GradientRadialFocus.cpp | 17 fData.radial_focus.cx = 0.0f; 18 fData.radial_focus.cy = 0.0f; 19 fData.radial_focus.fx = 0.0f; 20 fData.radial_focus.fy = 0.0f; 21 fData.radial_focus.radius = 0.0f; 30 fData.radial_focus.cx = center.x; 31 fData.radial_focus.cy = center.y; 32 fData.radial_focus.fx = focal.x; 33 fData.radial_focus.fy = focal.y; 34 fData [all...] |
H A D | GradientDiamond.cpp | 17 fData.diamond.cx = 0.0f; 18 fData.diamond.cy = 0.0f; 26 fData.diamond.cx = center.x; 27 fData.diamond.cy = center.y; 35 fData.diamond.cx = cx; 36 fData.diamond.cy = cy; 45 return BPoint(fData.diamond.cx, fData.diamond.cy); 53 fData.diamond.cx = center.x; 54 fData [all...] |
H A D | Gradient.cpp | 120 if (archive->FindFloat("linear_x1", (float*)&fData.linear.x1) < B_OK) 121 fData.linear.x1 = 0.0f; 122 if (archive->FindFloat("linear_y1", (float*)&fData.linear.y1) < B_OK) 123 fData.linear.y1 = 0.0f; 124 if (archive->FindFloat("linear_x2", (float*)&fData.linear.x2) < B_OK) 125 fData.linear.x2 = 0.0f; 126 if (archive->FindFloat("linear_y2", (float*)&fData.linear.y2) < B_OK) 127 fData.linear.y2 = 0.0f; 130 if (archive->FindFloat("radial_cx", (float*)&fData.radial.cx) < B_OK) 131 fData [all...] |
H A D | Region.cpp | 33 fData(NULL) 47 fData(NULL) 61 fData(&fBounds) 79 , fData(&fBounds) 88 if (fData != &fBounds) 89 free(fData); 109 memcpy(fData, region.fData, region.fCount * sizeof(clipping_rect)); 132 return memcmp(fData, other.fData, fCoun [all...] |
/haiku-fatelf/src/kits/translation/ |
H A D | FuncTranslator.cpp | 31 fData = data; 43 return fData.name; 50 return fData.info; 57 return fData.version; 64 if (_count == NULL || fData.input_formats == NULL) 68 while (fData.input_formats[count].type) { 73 return fData.input_formats; 80 if (_count == NULL || fData.output_formats == NULL) 84 while (fData.output_formats[count].type) { 89 return fData [all...] |
/haiku-fatelf/src/kits/storage/disk_device/ |
H A D | MutablePartition.cpp | 46 return fData->offset; 54 if (fData->offset != offset) { 55 fData->offset = offset; 65 return fData->size; 73 if (fData->size != size) { 74 fData->size = size; 84 return fData->content_size; 92 if (fData->content_size != size) { 93 fData->content_size = size; 103 return fData [all...] |
/haiku-fatelf/src/kits/app/ |
H A D | LooperList.cpp | 66 = find_if(fData.begin(), fData.end(), EmptySlotPred); 67 if (i == fData.end()) { 68 fData.push_back(LooperData(looper)); 84 return find_if(fData.begin(), fData.end(), 85 FindLooperPred(looper)) != fData.end(); 95 LooperDataIterator i = find_if(fData.begin(), fData.end(), 97 if (i != fData [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/udf/ |
H A D | MemoryChunk.h | 25 , fData(malloc(blockSize)) 32 , fData(blockData) 44 void* Data() { return fData; } 53 void *fData; member in class:MemoryChunk 61 void* Data() { return reinterpret_cast<void*>(fData); } 65 uint8 fData[size]; member in class:StaticMemoryChunk
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/ |
H A D | MemoryChunk.h | 27 , fData(malloc(blockSize)) 34 , fData(blockData) 46 void* Data() { return fData; } 55 void *fData; member in class:Udf::MemoryChunk 63 void* Data() { return reinterpret_cast<void*>(fData); } 67 uint8 fData[size]; member in class:Udf::StaticMemoryChunk
|
/haiku-fatelf/src/add-ons/kernel/drivers/input/usb_hid/ |
H A D | HIDReportItem.cpp | 32 fData(0), 66 memcpy(&fData, report + fByteOffset, sizeof(uint32)); 67 fData >>= fShift; 68 fData &= fMask; 72 if ((fData & ~(fMask >> 1)) != 0) 73 fData |= ~fMask; 75 fValid = (int32)fData >= (int32)fMinimum 76 && (int32)fData <= (int32)fMaximum; 78 fValid = fData >= fMinimum && fData < [all...] |
/haiku-fatelf/src/tools/restest/ |
H A D | ResourceItem.cpp | 17 fData(NULL) 127 memcpy(fData, data, fSize); 136 if (fData) { 137 delete[] (char*)fData; 138 fData = NULL; 148 if (!fData && fSize > 0) 149 fData = new char*[fSize]; 150 return fData; 157 return fData; 168 if (fData [all...] |
/haiku-fatelf/headers/os/interface/ |
H A D | Font.h | 118 uint64 fData[2]; member in class:unicode_block 327 fData[0] = fData[1] = 0LL; 333 fData[0] = block1; 334 fData[1] = block2; 341 return (fData[0] & block.fData[0]) == block.fData[0] 342 && (fData[1] & block.fData[ [all...] |
/haiku-fatelf/headers/private/net/ |
H A D | NetBufferUtilities.h | 30 (void**)&fData); 34 fData = &fDataBuffer; 45 return *fData; 50 return fData; 55 return *fData; 63 if (fData == &fDataBuffer) 64 Module::Get()->write(fBuffer, Offset, fData, sizeof(Type)); 76 Type* fData; member in class:NetBufferFieldReader 150 (void**)&this->fData); 151 if (this->fStatus == B_OK && this->fData [all...] |
/haiku-fatelf/src/apps/resedit/ |
H A D | ResourceData.cpp | 18 fData(NULL), 31 fData(data), 49 free(fData); 62 SetData(data.fData, data.fLength); 106 fData = (char *)malloc(fLength); 107 if (fData) { 108 ssize_t size = node.ReadAttr(name, info.type, 0, (void*)fData, fLength); 155 free(fData); 160 fData = (char *)malloc(size); 161 memcpy(fData, dat [all...] |
/haiku-fatelf/headers/os/package/hpkg/ |
H A D | PackageEntryAttribute.h | 24 BPackageData& Data() { return fData; } 31 BPackageData fData; member in class:BPackageKit::BHPKG::BPackageEntryAttribute
|
/haiku-fatelf/src/system/boot/loader/net/ |
H A D | ChainBuffer.cpp | 63 if (fData && fSize > 0) { 64 memcpy(buffer, fData, fSize); 80 fData = data; 91 if ((fFlags & CHAIN_BUFFER_FREE_DATA) && fData) { 92 free(fData); 93 fData = NULL;
|
/haiku-fatelf/src/add-ons/accelerants/radeon_hd/ |
H A D | ringqueue.cpp | 64 fData = (unsigned char*)malloc(fSize); 66 memset(fData, 0, fSize); 73 free(fData); 82 memset(fData, 0, fSize); 108 memcpy(dataPtr, fData + fReadPtr, len); 109 memcpy(dataPtr + len, fData, bytes - len); 111 memcpy(dataPtr, fData + fReadPtr, bytes); 135 memcpy(fData + fWritePtr, dataPtr, len); 136 memcpy(fData, dataPtr + len, bytes - len); 138 memcpy(fData [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
H A D | PackageFile.cpp | 51 fData(data), 70 if (fData->IsEncodedInline()) { 72 fData->InlineData(), fData->CompressedSize()); 81 fDataReader, *fData, fReader); 87 fData->UncompressedSize()); 96 if (offset < 0 || (uint64)offset > fData->UncompressedSize()) 100 fData->UncompressedSize() - offset); 110 if (offset < 0 || (uint64)offset > fData->UncompressedSize()) 114 fData 129 BPackageData* fData; member in struct:PackageFile::DataAccessor [all...] |
/haiku-fatelf/src/apps/debugger/dwarf/ |
H A D | DataReader.h | 18 fData(NULL), 33 fData = (const uint8*)data; 46 return DataReader(fData, maxLength, fAddressSize); 51 return DataReader(fData + relativeOffset, maxLength, fAddressSize); 76 return fData; 96 fData += offset - Offset(); 110 memcpy(&data, fData, sizeof(Type)); 112 fData += sizeof(Type); 162 const char* string = (const char*)fData; 164 fData 202 const uint8* fData; member in class:DataReader [all...] |