/haiku-fatelf/headers/cpp/ |
H A D | stl_slist.h | 449 iterator previous(const_iterator __pos) { function in class:slist 452 const_iterator previous(const_iterator __pos) const { function in class:slist
|
/haiku-fatelf/headers/posix/ |
H A D | pthread.h | 54 struct __pthread_cleanup_handler *previous; member in struct:__pthread_cleanup_handler
|
/haiku-fatelf/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 22 DoublyLinkedListLink() : next(NULL), previous(NULL) {} 26 Element *previous; member in class:FSShell::DoublyLinkedListLink 383 elLink->previous = fLast; 393 elLink->previous = NULL; 396 sGetLink(fFirst)->previous = element; 420 link->previous = beforeLink->previous; 421 if (link->previous != NULL) 422 sGetLink(link->previous)->next = element; 423 beforeLink->previous [all...] |
/haiku-fatelf/headers/private/kernel/util/ |
H A D | DoublyLinkedList.h | 30 Element* previous; member in class:DoublyLinkedListLink 400 elLink->previous = fLast; 410 elLink->previous = NULL; 413 sGetLink(fFirst)->previous = element; 442 link->previous = beforeLink->previous; 443 beforeLink->previous = element; 445 if (link->previous != NULL) 446 sGetLink(link->previous)->next = element; 467 elLink->previous [all...] |
H A D | DoublyLinkedQueue.h | 183 elLink->previous = NULL; 186 sGetLink(fFirst)->previous = element; 207 link->previous = beforeLink->previous; 208 if (link->previous != NULL) 209 sGetLink(link->previous)->next = element; 210 beforeLink->previous = element; 231 if (elLink->previous) 232 sGetLink(elLink->previous)->next = elLink->next; 236 sGetLink(elLink->next)->previous [all...] |
H A D | MultiHashTable.h | 138 ValueType *previous; local 141 for (previous = table[index]; previous 142 && !HashTable::fDefinition.CompareValues(previous, value); 143 previous = HashTable::_Link(previous)); 145 if (previous) { 146 HashTable::_Link(value) = HashTable::_Link(previous); 147 HashTable::_Link(previous) = value;
|
H A D | OpenHashTable.h | 194 ValueType* previous = NULL; local 201 if (previous) 202 _Link(previous) = next; 208 previous = slot;
|
H A D | SinglyLinkedList.h | 146 inline void Remove(Element* previous, Element* element); 223 SINGLY_LINKED_LIST_CLASS_NAME::Remove(Element* previous, Element* element) argument 225 // ASSERT(previous == NULL 226 // ? fFirst == element : sGetLink(previous)->next == element); 229 if (previous == NULL) 232 sGetLink(previous)->next = elementLink->next;
|
H A D | SplayTree.h | 503 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node))) 504 previousNext = Definition::GetListLink(previous); 521 if (Node* previous = fTree.PreviousDontSplay(key)) 522 previousNext = Definition::GetListLink(previous); 537 if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node))) 538 previousNext = Definition::GetListLink(previous);
|
/haiku-fatelf/headers/private/net/ |
H A D | r5_compatibility.h | 59 struct stack_frame* previous;
|
/haiku-fatelf/src/add-ons/input_server/methods/canna/lib/ |
H A D | henkan.c | 1931 int current, previous, mighter; 1934 previous = 1 - current; 1937 if ( !nword[previous] ) { 1938 nword[previous] = RkwGetLex(hc->context, lex[previous], RENGOBUFSIZE); 1942 if (nword[previous] == 1) { 1945 if (((lex[previous][0].ylen <= 3 && lex[previous][0].klen == 1) || 1949 if ( !yomi[previous][0] ) { 1951 RkwGetYomi(hc->context, yomi[previous], RENGOBUFSIZ [all...] |
/haiku-fatelf/src/add-ons/kernel/bluetooth/btCoreData/ |
H A D | ConnectionInterface.cpp | 90 || conn->GetDoublyLinkedListLink()->previous != NULL 117 || conn->GetDoublyLinkedListLink()->previous != NULL
|
/haiku-fatelf/src/add-ons/kernel/bluetooth/hci/ |
H A D | bluetooth.cpp | 285 || device->GetDoublyLinkedListLink()->previous != NULL
|
/haiku-fatelf/src/add-ons/kernel/bus_managers/usb/ |
H A D | BeOSCompatibility.h | 191 int32 previous = atomic_add(value, setValue); local 192 if (previous != 0) 193 result = previous;
|
/haiku-fatelf/src/add-ons/kernel/drivers/input/usb_hid/ |
H A D | DeviceList.cpp | 82 device_list_entry *previous = NULL; 87 if (previous == NULL) 90 previous->next = current->next; 98 previous = current;
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/pegasus/ |
H A D | devlist.c | 56 pegasus_dev *previous; local 57 for (previous = sDeviceList; previous != NULL; previous = previous->next) { 58 if (previous->next == device) { 59 previous->next = device->next; 65 ASSERT(previous != NULL);
|
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 2409 // Test right link of the previous node 2410 const bplustree_node* previous = cached.SetTo(lastOffset, true); local 2411 if (previous == NULL) 2414 if (previous->RightLink() != childOffset) { 2417 "!\n", fStream->ID(), lastOffset, previous->RightLink(),
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTree.cpp | 193 uint32 previous = 0x37abe8f9; local 196 uint32 next = previous + (hash ^ (*name * 7152373)); 201 previous = hash;
|
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 173 inline void InsertAfter(Element *previous, Element *element); 198 inline void _Remove(Element *previous, Element *element); 226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element) argument 230 if (previous) { 231 // insert after previous element 232 Link *prevLink = fGetLink(previous); 236 // no previous element given: prepend 242 if (fLast == previous) 307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element) argument 310 if (previous) [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | AttributeDirectory.cpp | 267 Attribute* previous = NULL; local 276 previous = attribute; 286 fAttributes.InsertAfter(previous, attribute);
|
/haiku-fatelf/src/add-ons/kernel/file_systems/nfs/ |
H A D | nfs_add_on.c | 783 fs_node *previous; local 788 previous = NULL; 791 previous = current; 796 if (previous) 797 previous->next = current->next;
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | acls.c | 800 u16 previous; member in struct:__anon2319 815 checks[i].previous = 0; 843 if ((tag < pchk->previous) 844 || ((tag == pchk->previous) 847 pchk->previous = tag; 966 u16 previous; local 977 previous = pacl->ace[0].tag; 983 if ((tag < previous) 984 || ((tag == previous) && (id < previousid))) { 990 previous [all...] |
H A D | cache.c | 107 struct HASH_ENTRY *previous; local 113 previous = (struct HASH_ENTRY*)NULL; 115 previous = link; 119 if (previous) 120 previous->next = link->next; 151 struct CACHED_GENERIC *previous; local 181 previous = current->previous; 183 if (previous) { 188 previous 338 struct CACHED_GENERIC *previous; local [all...] |
H A D | cache.h | 29 struct CACHED_GENERIC *previous; member in struct:CACHED_GENERIC 37 struct CACHED_INODE *previous; member in struct:CACHED_INODE 47 struct CACHED_NIDATA *previous; member in struct:CACHED_NIDATA 58 struct CACHED_LOOKUP *previous; member in struct:CACHED_LOOKUP
|
H A D | security.h | 85 struct CACHED_PERMISSIONS_LEGACY *previous; member in struct:CACHED_PERMISSIONS_LEGACY 100 struct CACHED_SECURID *previous; member in struct:CACHED_SECURID
|