/haiku/3rdparty/proj2make/ |
H A D | proj2make.cpp | 166 Parse(hdr* current, hdr* parent) argument 170 uint32 u = current->Id(); 173 (uint8*)current - gProjData, l.str(), 174 c[3], c[2], c[1], c[0], current->Size()); 178 switch(current->Id()) { 194 gSPthString += ¤t->Data()[5]; 198 gPPthString += ¤t->Data()[5]; 203 gFil1String += ¤t->Data()[4]; 206 gLinkString += ¤t->Data()[4]; 209 gPLnkString += ¤t [all...] |
/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 600 the usual memory page size of current x86 architectures and therefore the
|
/haiku/docs/interface_guidelines/docbook-css/ |
H A D | opera.css | 19 -o-link-source: current;
|
/haiku/headers/cpp/ |
H A D | editbuf.h | 96 buf_char* current() { return is_reading() ? gptr() : pptr(); } function in struct:edit_streambuf
|
H A D | stl_iterator.h | 480 _BidirectionalIterator current; member in class:reverse_bidirectional_iterator 490 : current(__x) {} 491 _BidirectionalIterator base() const { return current; } 493 _BidirectionalIterator __tmp = current; 500 --current; 505 --current; 509 ++current; 514 ++current; 573 _Iterator current; member in class:reverse_iterator 591 explicit reverse_iterator(iterator_type __x) : current(__ 687 _RandomAccessIterator current; member in class:reverse_iterator [all...] |
/haiku/headers/private/kernel/util/ |
H A D | Heap.h | 317 int current; local 320 current = link->fIndex; 325 current = child; 331 sGetLink(fElements[current])->fKey)) { 332 current = child; 335 if (link->fIndex == current) 338 sGetLink(fElements[current])->fIndex = link->fIndex; 341 fElements[link->fIndex] = fElements[current]; 342 fElements[current] = element; 344 link->fIndex = current; [all...] |
H A D | MinMaxHeap.h | 377 int current; 382 current = link->fIndex; 388 current = child; 394 sGetLink(tree[current])->fKey); 396 current = child; 399 if (link->fIndex == current) 402 ASSERT(sGetLink(tree[current])->fIndex == current); 403 sGetLink(tree[current])->fIndex = link->fIndex; 406 tree[link->fIndex] = tree[current]; [all...] |
/haiku/headers/private/locale/ |
H A D | HashMapCatalog.h | 122 CatMap::Entry current; member in class:BPrivate::HashMapCatalog::CatWalker 146 current = fPos.Next(); 164 return current.key; 172 return current.value.String(); 180 current = fPos.Next();
|
/haiku/src/add-ons/accelerants/nvidia/engine/ |
H A D | nv_acc_dma.c | 930 /* setup sync parameters for NV12_IMAGE_BLIT command for the current mode: 1025 * available. Assuming the current setup only has 8 channels because the 'rest' 1058 /* the current first free adress in the DMA buffer is at offset 0 */ 1059 si->engine.dma.current = 0; 1070 /* note the current free space we have left in the DMA buffer */ 1071 si->engine.dma.free = si->engine.dma.max - si->engine.dma.current; 1129 ((uint32*)(si->dma_buffer))[si->engine.dma.current++] = surf_depth; /* Format */ 1131 ((uint32*)(si->dma_buffer))[si->engine.dma.current++] = 1134 ((uint32*)(si->dma_buffer))[si->engine.dma.current++] = 1136 ((uint32*)(si->dma_buffer))[si->engine.dma.current [all...] |
/haiku/src/add-ons/input_server/filters/switch_workspace/ |
H A D | SwitchWorkspaceInputFilter.cpp | 88 int32 current = current_workspace(); local 90 int32 nextColumn = current % columns + deltaX; 96 int32 nextRow = current / columns + deltaY; 103 if (next != current) {
|
/haiku/src/add-ons/kernel/debugger/demangle/ |
H A D | gcc2.cpp | 405 uint32 current = *_cookie; 406 if (current > 32) 409 for (uint32 i = 0; i < current; i++) { 415 if (current <= i + count) { 434 TRACE("\n\targ %ld: %s\n", current, arg.String());
|
/haiku/src/add-ons/kernel/debugger/usb_keyboard/ |
H A D | usb_keyboard.cpp | 235 uint8 *current = sUSBTransferData; local 238 if (current[i] == 0x00 || current[i] == 0x01) 243 if (compare[j] == current[i]) { 252 if (current[i] >= sKeyTableSize) 256 uint8 key = sKeyTable[current[i]];
|
/haiku/src/add-ons/kernel/drivers/graphics/common/ |
H A D | memory_manager.c | 190 mem_block *current, *newEntry; local 203 for (current = mem->first; current; current = current->next) { 204 if (!current->allocated && current->size >= size) 208 if (current == NULL) { 213 if (size != current->size) { 223 newEntry->next = current 300 mem_block *current; local [all...] |
/haiku/src/add-ons/kernel/drivers/graphics/et6x00/ |
H A D | bits.c | 41 char current; local 57 : "=r"(current) 61 current = (current & mask) | (val & ~mask); 67 : "r"(current), "r"(port) 75 char current; local 80 : "=r"(current) 84 return current;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Attribute.cpp | 184 uint16 current = 0; local 185 while (current < length) { 186 current += entry->Length();
|
H A D | AttributeIterator.cpp | 60 uint16 current = 0; local 61 while (current < entries_length) { 62 current += entry->Length();
|
H A D | DirectoryIterator.cpp | 81 uint16 current = 0; local 82 while (current < entries_length) { 83 current += entry->Length(); 139 uint16 current = 0; local 140 while (current < length) { 141 current += entry->Length();
|
/haiku/src/add-ons/kernel/file_systems/nfs/ |
H A D | RPCPendingCalls.c | 74 struct PendingCall *current; local 78 current=calls->fFirst; // mmu_man 80 while (current) 82 if (current->xid==xid) 84 if (((current->addr.sin_addr.s_addr==addr->sin_addr.s_addr)&& 85 (current->addr.sin_port==addr->sin_port)) || conf_no_check_ip_xid) 88 last->next=current->next; 90 calls->fFirst=current->next; 92 current->next=NULL; 95 return current; [all...] |
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | DirectoryCache.cpp | 71 NameCacheEntry* current = fEntries.RemoveHead(); local 72 delete current; 112 NameCacheEntry* current = fNameCache.RemoveHead(); local 114 current->fName); 115 delete current; 169 NameCacheEntry* current = iterator.Next(); local 170 while (current != NULL) { 171 if (strcmp(current->fName, name) == 0) { 172 fNameCache.Remove(previous, current); 173 delete current; [all...] |
H A D | FileInfo.cpp | 53 InodeName* current = fNames.Head(); local 54 while (current != NULL) { 55 if (current->fParent == parent && !strcmp(current->fName, name)) 57 current = fNames.GetNext(current); 74 InodeName* current = fNames.Head(); local 75 while (current != NULL) { 76 if (current->fParent == parent && !strcmp(current [all...] |
H A D | InodeRegular.cpp | 216 char* current = strpbrk(name, "/:"); local 217 while (current != NULL) { 218 switch (*current) { 220 *current = '#'; 223 *current = '$'; 226 current = strpbrk(name, "/:");
|
H A D | OpenState.cpp | 49 LockOwner* current = fLockOwners; local 50 while (current != NULL) { 51 if (current->fOwner == owner) 52 return current; 54 current = current->fNext; 57 current = new LockOwner(owner); 58 if (current == NULL) 61 current->fNext = fLockOwners; 63 fLockOwners->fPrev = current; [all...] |
H A D | RPCServer.cpp | 447 ServerNode* current = fRoot; local 448 while (current != NULL) { 449 if (current->fID == node->fID) { 454 if (current->fID < node->fID) { 455 previous = current; 456 current = current->fRight; 458 previous = current; 459 current = current 509 ServerNode* current = fRoot; local [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | cache.c | 64 struct CACHED_GENERIC *current) 71 h = cache->dohash(current); 82 link->entry = current; 104 const struct CACHED_GENERIC *current, int hash) 114 while (link && (link->entry != current)) { 150 struct CACHED_GENERIC *current; local 155 current = (struct CACHED_GENERIC*)NULL; 167 current = link->entry; 174 current = cache->most_recent_entry; 175 while (current 63 inserthashindex(struct CACHE_HEADER *cache, struct CACHED_GENERIC *current) argument 103 drophashindex(struct CACHE_HEADER *cache, const struct CACHED_GENERIC *current, int hash) argument 216 struct CACHED_GENERIC *current; local 335 do_invalidate(struct CACHE_HEADER *cache, struct CACHED_GENERIC *current, int flags) argument 378 struct CACHED_GENERIC *current; local [all...] |
/haiku/src/add-ons/kernel/network/ppp/pppoe/ |
H A D | pppoe.cpp | 311 net_device *current = NULL; // get_interfaces(); local 312 for (; current; current = NULL) { 313 if (current->type == IFT_ETHER && current->name) { 314 if (position + strlen(current->name) + 1 > length) 317 strcpy(names + position, current->name); 318 position += strlen(current->name);
|