Lines Matching refs:locks
57 * set all locked nodes in the path to blocking locks. This should
64 if (p->nodes[i] && p->locks[i])
70 * reset all the locked nodes in the patch to spinning locks.
84 * in the right order. If any of the locks in the path are not
95 if (p->nodes[i] && p->locks[i])
114 * and it drops any locks held by this path
116 * It is safe to call this on paths that no locks or extent buffers held.
126 if (p->locks[i]) {
128 p->locks[i] = 0;
143 * at any time because there are no locks held.
1019 WARN_ON(!path->locks[level]);
1057 path->locks[level] = 0;
1502 if (!path->locks[i])
1521 if (i >= lowest_unlock && i > skip_level && path->locks[i]) {
1523 path->locks[i] = 0;
1529 * This releases any locks held in the path starting at level and
1547 if (!path->locks[i])
1550 path->locks[i] = 0;
1591 * of the btree by dropping locks before
1740 p->locks[level] = 1;
1769 p->locks[level] = 1;
2130 path->locks[level] = 1;
3640 * to drop our current locks to figure it out
3908 * aren't holding any locks when we call it
4049 * This may release the path, and so you may lose any locks held at the
4121 path->locks[level] = 1;
4212 path->locks[level - 1] = 1;
4259 if (path->locks[level + 1]) {
4363 * by releasing the path above we dropped all our locks. A balance
4425 if (path->locks[level])
4432 path->locks[level] = 1;