- plock = adf->adf_lock;
- /* Does we have a lock? */
- lock.l_whence = SEEK_SET;
- lock.l_len = 1;
- for (i = 0; i < adf->adf_lockcount; i++) {
- if (OVERLAP(lock.l_start, 1, plock[i].lock.l_start, plock[i].lock.l_len))
- return 1; /* */
+/* -------------------------
+ return if a file is open by another process.
+ Optimized for the common case:
+ - there's no locks held by another process (clients)
+ - or we already know the answer and don't need to test.
+*/
+u_int16_t ad_openforks(struct adouble *ad, u_int16_t attrbits)
+{
+ u_int16_t ret = 0;
+ struct ad_fd *adf;
+ off_t off;
+
+ if (!(attrbits & (ATTRBIT_DOPEN | ATTRBIT_ROPEN))) {
+ off_t len;
+ /* XXX know the locks layout:
+ AD_FILELOCK_OPEN_WR is first
+ and use it for merging requests
+ */
+ if (ad_meta_fileno(ad) != -1) {
+ /* there's a resource fork test the four bytes for
+ * data RW/RD and fork RW/RD locks in one request
+ */
+ adf = ad->ad_md;
+ off = LOCK_DATA_WR;
+ len = 4;
+ }
+ else {
+ /* no resource fork, only data RD/RW may exist */
+ adf = &ad->ad_data_fork;
+ off = AD_FILELOCK_OPEN_WR;
+ len = 2;
+ }
+ if (!testlock(adf, off, len))
+ return ret;