/haiku/src/apps/icon-o-matic/shape/commands/ |
H A D | InsertPointCommand.cpp | 32 fIndex(index), 36 if (fPath && (!fPath->GetPointsAt(fIndex, fPoint, fPointIn, fPointOut) 37 || !fPath->GetPointOutAt(fIndex - 1, fPreviousOut) 38 || !fPath->GetPointInAt(fIndex + 1, fNextIn))) { 63 fPath->GetPointInAt(fIndex, fPointIn); 64 fPath->GetPointOutAt(fIndex, fPointOut); 80 if (fPath->RemovePoint(fIndex)) { 83 fPath->GetPointOutAt(fIndex - 1, fPreviousOut); 84 fPath->SetPointOut(fIndex - 1, previousOut); 87 fPath->GetPointInAt(fIndex, fNextI [all...] |
H A D | FlipPointsCommand.cpp | 32 fIndex(NULL), 36 fIndex = new (nothrow) int32[count]; 43 memcpy(fIndex, indices, count * sizeof(int32)); 49 delete[] fIndex; 59 if (!fIndex) 79 if (fPath->GetPointsAt(fIndex[i], point, pointIn, pointOut, &connected)) { 83 fPath->SetPoint(fIndex[i], 105 _Select(fIndex, fCount);
|
H A D | AddPointCommand.cpp | 29 fIndex(index), 55 if (!fPath->GetPointsAt(fIndex, fPoint, fPointIn, fPointOut)) 70 if (fPath->RemovePoint(fIndex)) { 91 if (fPath->AddPoint(fPoint, fIndex)) { 92 fPath->SetPoint(fIndex, fPoint, fPointIn, fPointOut, true); 94 _Select(&fIndex, 1);
|
H A D | SplitPointsCommand.cpp | 34 fIndex(NULL), 42 fIndex = new (nothrow) int32[count]; 53 memcpy(fIndex, indices, count * sizeof(int32)); 55 if (!fPath->GetPointsAt(fIndex[i], 69 delete[] fIndex; 83 if (!fIndex || !fPoint || !fPointIn || !fPointOut || !fConnected) 99 int32 index = fIndex[i] + 1 + i; 133 int32 index = fIndex[i] + 1; 148 _Select(fIndex, fCount);
|
H A D | ChangePointCommand.cpp | 32 fIndex(index), 36 if (fPath && !fPath->GetPointsAt(fIndex, fPoint, fPointIn, fPointOut, &fConnected)) 66 if (!fPath->GetPointsAt(fIndex, point, pointIn, pointOut, &connected)) 98 if (fPath->GetPointsAt(fIndex, point, pointIn, pointOut, &connected) 99 && fPath->SetPoint(fIndex, fPoint, fPointIn, fPointOut, fConnected)) { 120 _Select(&fIndex, 1);
|
H A D | RemovePointsCommand.cpp | 34 fIndex(NULL), 53 fIndex(NULL), 68 delete[] fIndex; 83 if (!fIndex || !fPoint || !fPointIn || !fPointOut || !fConnected) 108 if (fPath->AddPoint(fPoint[i], fIndex[i])) { 109 fPath->SetPoint(fIndex[i], 124 _Select(fIndex, fCount); 145 if (!fPath->RemovePoint(fIndex[i] - i)) { 176 fIndex = new (nothrow) int32[count]; 187 memcpy(fIndex, indice [all...] |
/haiku/src/servers/app/ |
H A D | WindowList.cpp | 31 fIndex(index), 46 fIndex = index; 57 window_anchor& windowAnchor = window->Anchor(fIndex); 60 window_anchor& beforeAnchor = before->Anchor(fIndex); 66 windowAnchor.previous->Anchor(fIndex).next = window; 74 fLastWindow->Anchor(fIndex).next = window; 85 if (fIndex < kMaxWorkspaces) 86 window->SetWorkspaces(window->Workspaces() | (1UL << fIndex)); 93 window_anchor& windowAnchor = window->Anchor(fIndex); 100 windowAnchor.previous->Anchor(fIndex) [all...] |
H A D | WindowList.h | 25 int32 Index() const { return fIndex; } 40 int32 fIndex; member in class:WindowList
|
/haiku/src/servers/registrar/ |
H A D | AppInfoList.h | 85 fIndex(it.fIndex), 94 return (fIndex >= 0 && fIndex < fCount); 99 RosterAppInfo *info = fList->RemoveInfo(fIndex); 108 fIndex = it.fIndex; 115 fIndex++; 121 return Iterator(fList, fIndex + 1); 126 fIndex 163 int32 fIndex; member in class:AppInfoList::Iterator [all...] |
/haiku/headers/private/kernel/util/ |
H A D | MinMaxHeap.h | 22 int fIndex; member in struct:MinMaxHeapLink 114 fIndex(-1) 261 ASSERT(link->fIndex != -1); 262 link->fIndex = -1; 282 ASSERT(link->fIndex != -1); 283 link->fIndex = -1; 305 ASSERT(link->fIndex == -1); 313 link->fIndex = lastElement++; 353 if (link->fIndex <= 0) 356 int parent = (link->fIndex [all...] |
H A D | Heap.h | 21 int fIndex; member in struct:HeapLink 109 fIndex(-1) 213 ASSERT(link->fIndex >= 0 && link->fIndex < fLastElement); 233 ASSERT(link->fIndex != -1); 234 link->fIndex = -1; 241 sGetLink(lastElement)->fIndex = 0; 261 ASSERT(link->fIndex == -1); 264 link->fIndex = fLastElement++; 296 int parent = (link->fIndex [all...] |
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | Block.cpp | 22 fIndex = other.fIndex; 80 status_t error = transaction.RegisterBlock(fIndex); 84 error = block_cache_make_writable(fVolume->BlockCache(), fIndex, 87 transaction.PutBlock(fIndex, NULL); 101 fTransaction->PutBlock(fIndex, fData); 103 block_cache_put(fVolume->BlockCache(), fIndex); 119 fIndex = blockIndex;
|
H A D | BlockAllocator.h | 81 fIndex(0) 87 if (fIndex > 0) 88 fAllocator->Free(fIndex, 1, fTransaction); 93 return fIndex; 99 status_t error = fAllocator->Allocate(0, 1, fTransaction, fIndex, 102 fIndex = 0; 108 uint64 index = fIndex; 109 fIndex = 0; 116 uint64 fIndex; member in class:AllocatedBlock
|
H A D | Block.h | 34 uint64 Index() const { return fIndex; } 43 uint64 fIndex; member in class:Block
|
/haiku/src/add-ons/kernel/busses/scsi/ahci/ |
H A D | ahci_tracing.h | 19 , fIndex(index) 28 out.Print(", index: %d", fIndex); 32 int fIndex; member in class:AHCIPortTracing::AHCIPortTraceEntry
|
/haiku/src/tests/add-ons/print/ppd/parser/ |
H A D | PPDFile.cpp | 16 if (fIndex >= fSize) { 18 fIndex = 0; 23 return (int)fBuffer[fIndex ++];
|
H A D | PPDFile.h | 29 int fIndex; member in class:FileBuffer 33 FileBuffer(BFile* file) : fFile(file), fIndex(0), fSize(0) {}
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | SizeIndex.cpp | 99 SizeIndex *fIndex; member in class:SizeIndex::Iterator 242 fIndex(NULL) 278 error = fIndex->GetVolume()->AddNodeListener(this, fNode, 281 error = fIndex->GetVolume()->AddEntryListener(this, fEntry, 284 fIndex->GetVolume()->RemoveNodeListener(this, fNode); 300 error = fIndex->GetVolume()->RemoveEntryListener(this, fEntry); 303 error = fIndex->GetVolume()->RemoveNodeListener(this, fNode); 305 fIndex->GetVolume()->RemoveNodeListener(this, fNode); 318 fIndex = index; 319 if (fIndex) [all...] |
H A D | LastModifiedIndex.cpp | 101 LastModifiedIndex *fIndex; member in class:LastModifiedIndex::Iterator 243 fIndex(NULL) 279 error = fIndex->GetVolume()->AddNodeListener(this, fNode, 282 error = fIndex->GetVolume()->AddEntryListener(this, fEntry, 285 fIndex->GetVolume()->RemoveNodeListener(this, fNode); 301 error = fIndex->GetVolume()->RemoveEntryListener(this, fEntry); 304 error = fIndex->GetVolume()->RemoveNodeListener(this, fNode); 306 fIndex->GetVolume()->RemoveNodeListener(this, fNode); 320 fIndex = index; 321 if (fIndex) [all...] |
H A D | Attribute.cpp | 20 fIndex(NULL), 43 if (fIndex) 44 fIndex->Removed(this); 83 if (offset < (off_t)kMaxIndexKeyLength && size > 0 && fIndex) 84 fIndex->Changed(this, oldKey, oldLength); 104 fIndex = index;
|
/haiku/src/add-ons/print/drivers/pcl6/ |
H A D | Rasterizer.cpp | 9 fIndex(-1) 54 fIndex = fBounds.top; 62 return fIndex <= fBounds.bottom; 76 fIndex ++;
|
/haiku/src/apps/mail/ |
H A D | KUndoBuffer.cpp | 51 fIndex = 0; 91 if (fIndex >= CountItems()) 92 fIndex--; 131 AddItem(NewUndoItem, fIndex); 132 fIndex++; 146 if (fNewItem || fIndex < CountItems() || CountItems() == 0) { 151 CurrentUndoItem = ItemAt(fIndex - 1); 184 if (fIndex >= CountItems()) { 199 if (fIndex > 0) { 200 undoItem = ItemAt(fIndex [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | IndexImpl.h | 56 Index* fIndex; member in class:GenericIndexIterator 66 fIndex(NULL), 100 fNextTreeNode = Policy::GetNodeTree(fIndex)->Next(fNextTreeNode); 114 fIndex->GetVolume()->AddNodeListener(this, 131 fIndex->GetVolume()->RemoveNodeListener(this); 145 fIndex = index; 149 if (fIndex == NULL) 153 fNextTreeNode = TreePolicy::GetFirstTreeNode(fIndex); 155 fNextTreeNode = TreePolicy::FindClosestTreeNode(fIndex, value); 170 fNextTreeNode = Policy::GetNodeTree(fIndex) [all...] |
/haiku/src/kits/tracker/ |
H A D | EntryIterator.cpp | 148 fIndex(0), 175 ASSERT(fIndex == 0 && fNumEntries == 0); 178 if (fIndex >= fNumEntries) { 188 fIndex = 0; 191 *result = fEntryBuffer[fIndex++]; 192 if (fIndex > fNumEntries) { 210 ASSERT(fIndex == 0 && fNumEntries == 0); 213 if (fIndex >= fNumEntries) { 222 fIndex = 0; 225 *ref = fEntryRefBuffer[fIndex [all...] |
/haiku/headers/private/debugger/arch/ |
H A D | Register.h | 36 int32 Index() const { return fIndex; } 46 int32 fIndex; member in class:Register
|