[haiku-commits] r33881 - haiku/trunk/src/add-ons/kernel/file_systems/bfs

  • From: axeld@xxxxxxxxxxxxxxxx
  • To: haiku-commits@xxxxxxxxxxxxx
  • Date: Wed, 4 Nov 2009 16:55:11 +0100 (CET)

Author: axeld
Date: 2009-11-04 16:55:11 +0100 (Wed, 04 Nov 2009)
New Revision: 33881
Changeset: http://dev.haiku-os.org/changeset/33881/haiku

Modified:
   haiku/trunk/src/add-ons/kernel/file_systems/bfs/Inode.cpp
Log:
* Since we know the address of the lock in question, there is no need to waste
  memory by naming it individually.


Modified: haiku/trunk/src/add-ons/kernel/file_systems/bfs/Inode.cpp
===================================================================
--- haiku/trunk/src/add-ons/kernel/file_systems/bfs/Inode.cpp   2009-11-04 
15:17:05 UTC (rev 33880)
+++ haiku/trunk/src/add-ons/kernel/file_systems/bfs/Inode.cpp   2009-11-04 
15:55:11 UTC (rev 33881)
@@ -335,11 +335,7 @@
 
        UpdateNodeFromDisk();
 
-       char lockName[B_OS_NAME_LENGTH];
-       snprintf(lockName, sizeof(lockName), "bfs inode %d.%d",
-               (int)BlockRun().AllocationGroup(), BlockRun().Start());
-       rw_lock_init_etc(&fLock, lockName, RW_LOCK_FLAG_CLONE_NAME);
-
+       rw_lock_init(&fLock, "bfs inode");
        recursive_lock_init(&fSmallDataLock, "bfs inode small data");
 
        // these two will help to maintain the indices
@@ -368,11 +364,7 @@
        PRINT(("Inode::Inode(volume = %p, transaction = %p, id = %Ld) @ %p\n",
                volume, &transaction, id, this));
 
-       char lockName[B_OS_NAME_LENGTH];
-       snprintf(lockName, sizeof(lockName), "bfs inode+%d.%d",
-               (int)run.AllocationGroup(), run.Start());
-       rw_lock_init_etc(&fLock, lockName, RW_LOCK_FLAG_CLONE_NAME);
-
+       rw_lock_init(&fLock, "bfs inode");
        recursive_lock_init(&fSmallDataLock, "bfs inode small data");
 
        NodeGetter node(volume, transaction, this, true);


Other related posts:

  • » [haiku-commits] r33881 - haiku/trunk/src/add-ons/kernel/file_systems/bfs - axeld