Searched refs:fData (Results 1 - 25 of 195) sorted by relevance

12345678

/haiku/src/tests/system/kernel/file_corruption/
H A DCheckSum.h17 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/src/add-ons/kernel/file_systems/netfs/shared/
H A DBlocker.cpp35 : 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/src/add-ons/kernel/file_systems/packagefs/util/
H A DString.cpp17 fData->ReleaseReference();
18 fData = data;
29 fData->ReleaseReference();
30 fData = other.fData;
31 fData->AcquireReference();
H A DString.h36 StringData* fData; member in class:String
43 fData(StringData::GetEmpty())
51 fData(other.fData)
53 fData->AcquireReference();
60 fData->ReleaseReference();
81 return fData->String();
88 return fData->Hash();
95 return fData == StringData::Empty();
102 return fData
[all...]
/haiku/headers/os/support/
H A DStackOrHeapArray.h17 fData = new(std::nothrow) Type[count];
19 fData = fStackData;
24 if (fData != fStackData)
25 delete[] fData;
30 return fData != NULL;
35 return fData;
40 Type* fData; member in class:BStackOrHeapArray
/haiku/src/kits/interface/
H A DGradientLinear.cpp17 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 DGradientConic.cpp17 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 DGradientRadial.cpp17 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 DGradientRadialFocus.cpp17 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 DGradientDiamond.cpp17 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 DGradient.cpp132 if (archive->FindFloat("linear_x1", (float*)&fData.linear.x1) < B_OK)
133 fData.linear.x1 = 0.0f;
134 if (archive->FindFloat("linear_y1", (float*)&fData.linear.y1) < B_OK)
135 fData.linear.y1 = 0.0f;
136 if (archive->FindFloat("linear_x2", (float*)&fData.linear.x2) < B_OK)
137 fData.linear.x2 = 0.0f;
138 if (archive->FindFloat("linear_y2", (float*)&fData.linear.y2) < B_OK)
139 fData.linear.y2 = 0.0f;
142 if (archive->FindFloat("radial_cx", (float*)&fData.radial.cx) < B_OK)
143 fData
[all...]
H A DRegion.cpp30 fData(NULL)
41 fData(NULL)
52 fData(&fBounds)
68 fData(&fBounds)
75 if (fData != &fBounds)
76 free(fData);
88 memcpy(fData, other.fData, other.fCount * sizeof(clipping_rect));
107 return memcmp(fData, other.fData, fCoun
[all...]
/haiku/src/kits/translation/
H A DFuncTranslator.cpp31 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/src/kits/shared/
H A DRegExp.cpp197 fData(NULL)
205 fData(NULL)
213 fData(other.fData)
215 if (fData != NULL)
216 fData->AcquireReference();
222 if (fData != NULL)
223 fData->ReleaseReference();
231 if (fData != NULL) {
232 fData
[all...]
/haiku/src/kits/storage/disk_device/
H A DMutablePartition.cpp46 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/src/kits/network/libnetservices2/
H A DHttpRequest.cpp197 fData(std::make_unique<Data>())
204 fData(std::make_unique<Data>())
222 return (!fData || !fData->url.IsValid());
229 if (fData && fData->authentication)
230 return std::addressof(*fData->authentication);
238 if (!fData)
240 return fData->optionalFields;
247 if (!fData)
[all...]
H A DHttpResult.cpp151 fData(data)
161 if (fData)
162 fData->SetCancel();
172 if (!fData)
176 auto dataStatus = fData->GetStatusAtomic();
178 std::rethrow_exception(*(fData->error));
181 return fData->status.value();
183 status = acquire_sem(fData->data_wait);
192 if (!fData)
196 auto dataStatus = fData
[all...]
/haiku/src/kits/app/
H A DLooperList.cpp64 = find_if(fData.begin(), fData.end(), EmptySlotPred);
65 if (i == fData.end()) {
66 fData.push_back(LooperData(looper));
82 return find_if(fData.begin(), fData.end(),
83 FindLooperPred(looper)) != fData.end();
93 LooperDataIterator i = find_if(fData.begin(), fData.end(),
95 if (i != fData
[all...]
/haiku/src/add-ons/kernel/file_systems/udf/
H A DMemoryChunk.h25 , 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/src/system/runtime_loader/
H A Dutility.h37 T& back() { return fData[fSize - 1]; }
39 T& operator[](size_t idx) { return fData[idx]; }
40 const T& operator[](size_t idx) const { return fData[idx]; }
50 T* fData; member in class:utility::vector
59 fData(NULL)
70 fData[fSize++] = value;
81 memcpy(newBuffer, fData, fSize * sizeof(T));
82 delete[] fData;
84 fData = newBuffer;
/haiku/src/add-ons/kernel/drivers/input/hid_shared/
H A DHIDReportItem.cpp32 fData(0),
66 memcpy(&fData, report + fByteOffset, fByteCount);
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/src/tools/restest/
H A DResourceItem.cpp17 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/headers/os/interface/
H A DFont.h119 uint64 fData[2]; member in class:unicode_block
346 fData[0] = fData[1] = 0LL;
352 fData[0] = block1;
353 fData[1] = block2;
360 return (fData[0] & block.fData[0]) == block.fData[0]
361 && (fData[1] & block.fData[
[all...]
/haiku/src/add-ons/kernel/file_systems/xfs/
H A DLeafAttribute.cpp393 fData.info.forw = B_BENDIAN_TO_HOST_INT32(fData.info.forw);
394 fData.info.back = B_BENDIAN_TO_HOST_INT32(fData.info.back);
395 fData.info.magic = B_BENDIAN_TO_HOST_INT16(fData.info.magic);
396 fData.info.pad = B_BENDIAN_TO_HOST_INT16(fData.info.pad);
397 fData.count = B_BENDIAN_TO_HOST_INT16(fData
[all...]
/haiku/headers/private/net/
H A DNetBufferUtilities.h30 (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...]

Completed in 275 milliseconds

12345678