i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Assorted whitespace cleanup and typo fixes.

Browse Source
This commit is contained in:
Michael Lotz
2015-08-20 21:54:41 +02:00
parent 44b69ccbdb
commit 5d4501aa01
6 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
headers/private/kernel/thread.h
+1 -1
View File
@@ -302,7 +302,7 @@ thread_is_blocked(Thread* thread)
especially with a client lock that uses the thread blocking API. After a especially with a client lock that uses the thread blocking API. After a
blocked thread has been interrupted or the the time out occurred it cannot blocked thread has been interrupted or the the time out occurred it cannot
acquire the client lock (or any other lock using the thread blocking API) acquire the client lock (or any other lock using the thread blocking API)
without first making sure that the thread doesn't still appears to be without first making sure that the thread doesn't still appear to be
waiting to other client code. Otherwise another thread could try to unblock waiting to other client code. Otherwise another thread could try to unblock
it which could erroneously unblock the thread while already waiting on the it which could erroneously unblock the thread while already waiting on the
client lock. So usually when interruptions or timeouts are possible a client lock. So usually when interruptions or timeouts are possible a
src/system/kernel/fs/vfs.cpp
+4 -4
View File
@@ -1145,8 +1145,8 @@ restart:
rw_lock_read_unlock(&sVnodeLock); rw_lock_read_unlock(&sVnodeLock);
if (!canWait || --tries < 0) { if (!canWait || --tries < 0) {
// vnode doesn't seem to become unbusy // vnode doesn't seem to become unbusy
dprintf("vnode %" B_PRIdDEV ":%" B_PRIdINO " is not becoming unbusy!\n", dprintf("vnode %" B_PRIdDEV ":%" B_PRIdINO
mountID, vnodeID); " is not becoming unbusy!\n", mountID, vnodeID);
return B_BUSY; return B_BUSY;
} }
snooze(5000); // 5 ms snooze(5000); // 5 ms
@@ -1300,7 +1300,7 @@ free_unused_vnodes(int32 level)
AutoLocker<Vnode> nodeLocker(vnode); AutoLocker<Vnode> nodeLocker(vnode);
// Check whether the node is still unused -- since we only append to the // Check whether the node is still unused -- since we only append to the
// the tail of the unused queue, the vnode should still be at its head. // tail of the unused queue, the vnode should still be at its head.
// Alternatively we could check its ref count for 0 and its busy flag, // Alternatively we could check its ref count for 0 and its busy flag,
// but if the node is no longer at the head of the queue, it means it // but if the node is no longer at the head of the queue, it means it
// has been touched in the meantime, i.e. it is no longer the least // has been touched in the meantime, i.e. it is no longer the least
@@ -2100,7 +2100,7 @@ lookup_dir_entry(struct vnode* dir, const char* name, struct vnode** _vnode)
if (status != B_OK) if (status != B_OK)
return status; return status;
// The lookup() hook call get_vnode() or publish_vnode(), so we do already // The lookup() hook calls get_vnode() or publish_vnode(), so we do already
// have a reference and just need to look the node up. // have a reference and just need to look the node up.
rw_lock_read_lock(&sVnodeLock); rw_lock_read_lock(&sVnodeLock);
*_vnode = lookup_vnode(dir->device, id); *_vnode = lookup_vnode(dir->device, id);