Searched refs:previous (Results 1 - 25 of 165) sorted by path

1234567

/haiku-fatelf/headers/cpp/
H A Dstl_slist.h449 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 Dpthread.h54 struct __pthread_cleanup_handler *previous; member in struct:__pthread_cleanup_handler
/haiku-fatelf/headers/private/fs_shell/
H A DDoublyLinkedList.h22 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 DDoublyLinkedList.h30 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 DDoublyLinkedQueue.h183 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 DMultiHashTable.h138 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 DOpenHashTable.h194 ValueType* previous = NULL; local
201 if (previous)
202 _Link(previous) = next;
208 previous = slot;
H A DSinglyLinkedList.h146 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 DSplayTree.h503 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 Dr5_compatibility.h59 struct stack_frame* previous;
/haiku-fatelf/src/add-ons/input_server/methods/canna/lib/
H A Dhenkan.c1931 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 DConnectionInterface.cpp90 || conn->GetDoublyLinkedListLink()->previous != NULL
117 || conn->GetDoublyLinkedListLink()->previous != NULL
/haiku-fatelf/src/add-ons/kernel/bluetooth/hci/
H A Dbluetooth.cpp285 || device->GetDoublyLinkedListLink()->previous != NULL
/haiku-fatelf/src/add-ons/kernel/bus_managers/usb/
H A DBeOSCompatibility.h191 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 DDeviceList.cpp82 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 Ddevlist.c56 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 DBPlusTree.cpp2409 // 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 DHTree.cpp193 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 DSLList.h173 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 DAttributeDirectory.cpp267 Attribute* previous = NULL; local
276 previous = attribute;
286 fAttributes.InsertAfter(previous, attribute);
/haiku-fatelf/src/add-ons/kernel/file_systems/nfs/
H A Dnfs_add_on.c783 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 Dacls.c800 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 Dcache.c107 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 Dcache.h29 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 Dsecurity.h85 struct CACHED_PERMISSIONS_LEGACY *previous; member in struct:CACHED_PERMISSIONS_LEGACY
100 struct CACHED_SECURID *previous; member in struct:CACHED_SECURID

Completed in 400 milliseconds

1234567