/*
* Adjust the cluster's chains to allow modification.
*/
void
hammer2_cluster_modify(hammer2_trans_t *trans, hammer2_cluster_t *cluster,
int flags)
{
int i;
cluster->focus = NULL;
for (i = 0; i < cluster->nchains; ++i) {
if (cluster->array[i]) {
hammer2_chain_modify(trans, &cluster->array[i], flags);
if (cluster->focus == NULL)
cluster->focus = cluster->array[i];
}
}
}
/*
* Given an exclusively locked inode and chain we consolidate its chain
* for hardlink creation, adding (nlinks) to the file's link count and
* potentially relocating the inode to a directory common to ip->pip and tdip.
*
* Replaces (*chainp) if consolidation occurred, unlocking the old chain
* and returning a new locked chain.
*
* NOTE! This function will also replace ip->chain.
*/
int
hammer2_hardlink_consolidate(hammer2_trans_t *trans,
hammer2_inode_t *ip, hammer2_chain_t **chainp,
hammer2_inode_t *cdip, hammer2_chain_t **cdchainp,
int nlinks)
{
hammer2_inode_data_t *ipdata;
hammer2_chain_t *chain;
hammer2_chain_t *nchain;
int error;
chain = *chainp;
if (nlinks == 0 && /* no hardlink needed */
(chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE)) {
return (0);
}
if (hammer2_hardlink_enable < 0) { /* fake hardlinks */
return (0);
}
if (hammer2_hardlink_enable == 0) { /* disallow hardlinks */
hammer2_chain_unlock(chain);
*chainp = NULL;
return (ENOTSUP);
}
/*
* If no change in the hardlink's target directory is required and
* this is already a hardlink target, all we need to do is adjust
* the link count.
*/
if (cdip == ip->pip &&
(chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE) == 0) {
if (nlinks) {
hammer2_chain_modify(trans, &chain, 0);
chain->data->ipdata.nlinks += nlinks;
}
error = 0;
goto done;
}
/*
* chain is the real inode. If it's visible we have to convert it
* to a hardlink pointer. If it is not visible then it is already
* a hardlink target and only needs to be deleted.
*/
KKASSERT((chain->flags & HAMMER2_CHAIN_DELETED) == 0);
KKASSERT(chain->data->ipdata.type != HAMMER2_OBJTYPE_HARDLINK);
if (chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE) {
/*
* We are going to duplicate chain later, causing its
* media block to be shifted to the duplicate. Even though
* we are delete-duplicating nchain here it might decide not
* to reallocate the block. Set FORCECOW to force it to.
*/
nchain = chain;
hammer2_chain_lock(nchain, HAMMER2_RESOLVE_ALWAYS);
atomic_set_int(&nchain->flags, HAMMER2_CHAIN_FORCECOW);
hammer2_chain_delete_duplicate(trans, &nchain,
HAMMER2_DELDUP_RECORE);
KKASSERT((chain->flags & HAMMER2_CHAIN_DUPLICATED) == 0);
ipdata = &nchain->data->ipdata;
ipdata->target_type = ipdata->type;
ipdata->type = HAMMER2_OBJTYPE_HARDLINK;
ipdata->uflags = 0;
ipdata->rmajor = 0;
ipdata->rminor = 0;
ipdata->ctime = 0;
ipdata->mtime = 0;
ipdata->atime = 0;
ipdata->btime = 0;
bzero(&ipdata->uid, sizeof(ipdata->uid));
bzero(&ipdata->gid, sizeof(ipdata->gid));
ipdata->op_flags = HAMMER2_OPFLAG_DIRECTDATA;
ipdata->cap_flags = 0;
ipdata->mode = 0;
ipdata->size = 0;
ipdata->nlinks = 1;
ipdata->iparent = 0; /* XXX */
ipdata->pfs_type = 0;
ipdata->pfs_inum = 0;
bzero(&ipdata->pfs_clid, sizeof(ipdata->pfs_clid));
bzero(&ipdata->pfs_fsid, sizeof(ipdata->pfs_fsid));
ipdata->data_quota = 0;
ipdata->data_count = 0;
ipdata->inode_quota = 0;
ipdata->inode_count = 0;
ipdata->attr_tid = 0;
ipdata->dirent_tid = 0;
bzero(&ipdata->u, sizeof(ipdata->u));
/* XXX transaction ids */
} else {
hammer2_chain_delete(trans, chain, 0);
nchain = NULL;
}
/*
* chain represents the hardlink target and is now flagged deleted.
* duplicate it to the parent directory and adjust nlinks.
*
* WARNING! The shiftup() call can cause nchain to be moved into
* an indirect block, and our nchain will wind up pointing
* to the older/original version.
*/
KKASSERT(chain->flags & HAMMER2_CHAIN_DELETED);
hammer2_hardlink_shiftup(trans, &chain, cdip, cdchainp, nlinks, &error);
if (error == 0)
hammer2_inode_repoint(ip, cdip, chain);
/*
* Unlock the original chain last as the lock blocked races against
* the creation of the new hardlink target.
*/
if (nchain)
hammer2_chain_unlock(nchain);
done:
/*
* Cleanup, chain/nchain already dealt with.
*/
*chainp = chain;
hammer2_inode_drop(cdip);
return (error);
}
/*
* This is called from the mount code to initialize pmp->ihidden
*/
void
hammer2_inode_install_hidden(hammer2_pfsmount_t *pmp)
{
hammer2_trans_t trans;
hammer2_chain_t *parent;
hammer2_chain_t *chain;
hammer2_chain_t *scan;
hammer2_inode_data_t *ipdata;
hammer2_key_t key_dummy;
hammer2_key_t key_next;
int cache_index;
int error;
int count;
if (pmp->ihidden)
return;
/*
* Find the hidden directory
*/
bzero(&key_dummy, sizeof(key_dummy));
hammer2_trans_init(&trans, pmp, NULL, 0);
parent = hammer2_inode_lock_ex(pmp->iroot);
chain = hammer2_chain_lookup(&parent, &key_dummy,
HAMMER2_INODE_HIDDENDIR,
HAMMER2_INODE_HIDDENDIR,
&cache_index, 0);
if (chain) {
pmp->ihidden = hammer2_inode_get(pmp, pmp->iroot, chain);
hammer2_inode_ref(pmp->ihidden);
/*
* Remove any unlinked files which were left open as-of
* any system crash.
*/
count = 0;
scan = hammer2_chain_lookup(&chain, &key_next,
0, HAMMER2_MAX_TID,
&cache_index,
HAMMER2_LOOKUP_NODATA);
while (scan) {
if (scan->bref.type == HAMMER2_BREF_TYPE_INODE) {
hammer2_chain_delete(&trans, scan, 0);
++count;
}
scan = hammer2_chain_next(&chain, scan, &key_next,
0, HAMMER2_MAX_TID,
&cache_index,
HAMMER2_LOOKUP_NODATA);
}
hammer2_inode_unlock_ex(pmp->ihidden, chain);
hammer2_inode_unlock_ex(pmp->iroot, parent);
hammer2_trans_done(&trans);
kprintf("hammer2: PFS loaded hidden dir, "
"removed %d dead entries\n", count);
return;
}
/*
* Create the hidden directory
*/
error = hammer2_chain_create(&trans, &parent, &chain,
HAMMER2_INODE_HIDDENDIR, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
hammer2_inode_unlock_ex(pmp->iroot, parent);
hammer2_chain_modify(&trans, &chain, 0);
ipdata = &chain->data->ipdata;
ipdata->type = HAMMER2_OBJTYPE_DIRECTORY;
ipdata->inum = HAMMER2_INODE_HIDDENDIR;
ipdata->nlinks = 1;
kprintf("hammer2: PFS root missing hidden directory, creating\n");
pmp->ihidden = hammer2_inode_get(pmp, pmp->iroot, chain);
hammer2_inode_ref(pmp->ihidden);
hammer2_inode_unlock_ex(pmp->ihidden, chain);
hammer2_trans_done(&trans);
}
/*
* Unlink the file from the specified directory inode. The directory inode
* does not need to be locked.
*
* isdir determines whether a directory/non-directory check should be made.
* No check is made if isdir is set to -1.
*
* isopen specifies whether special unlink-with-open-descriptor handling
* must be performed. If set to -1 the caller is deleting a PFS and we
* check whether the chain is mounted or not (chain->pmp != NULL). 1 is
* implied if it is mounted.
*
* If isopen is 1 and nlinks drops to 0 this function must move the chain
* to a special hidden directory until last-close occurs on the file.
*
* NOTE! The underlying file can still be active with open descriptors
* or if the chain is being manually held (e.g. for rename).
*
* The caller is responsible for fixing up ip->chain if e.g. a
* rename occurs (see chain_duplicate()).
*/
int
hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
const uint8_t *name, size_t name_len,
int isdir, int *hlinkp, struct nchandle *nch)
{
hammer2_inode_data_t *ipdata;
hammer2_chain_t *parent;
hammer2_chain_t *ochain;
hammer2_chain_t *chain;
hammer2_chain_t *dparent;
hammer2_chain_t *dchain;
hammer2_key_t key_dummy;
hammer2_key_t key_next;
hammer2_key_t lhc;
int error;
int cache_index = -1;
uint8_t type;
error = 0;
ochain = NULL;
lhc = hammer2_dirhash(name, name_len);
/*
* Search for the filename in the directory
*/
if (hlinkp)
*hlinkp = 0;
parent = hammer2_inode_lock_ex(dip);
chain = hammer2_chain_lookup(&parent, &key_next,
lhc, lhc + HAMMER2_DIRHASH_LOMASK,
&cache_index, 0);
while (chain) {
if (chain->bref.type == HAMMER2_BREF_TYPE_INODE &&
name_len == chain->data->ipdata.name_len &&
bcmp(name, chain->data->ipdata.filename, name_len) == 0) {
break;
}
chain = hammer2_chain_next(&parent, chain, &key_next,
key_next,
lhc + HAMMER2_DIRHASH_LOMASK,
&cache_index, 0);
}
hammer2_inode_unlock_ex(dip, NULL); /* retain parent */
/*
* Not found or wrong type (isdir < 0 disables the type check).
* If a hardlink pointer, type checks use the hardlink target.
*/
if (chain == NULL) {
error = ENOENT;
goto done;
}
if ((type = chain->data->ipdata.type) == HAMMER2_OBJTYPE_HARDLINK) {
if (hlinkp)
*hlinkp = 1;
type = chain->data->ipdata.target_type;
}
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir == 0) {
error = ENOTDIR;
goto done;
}
if (type != HAMMER2_OBJTYPE_DIRECTORY && isdir >= 1) {
error = EISDIR;
goto done;
}
/*
* Hardlink must be resolved. We can't hold the parent locked
* while we do this or we could deadlock.
*
* On success chain will be adjusted to point at the hardlink target
* and ochain will point to the hardlink pointer in the original
* directory. Otherwise chain remains pointing to the original.
*/
if (chain->data->ipdata.type == HAMMER2_OBJTYPE_HARDLINK) {
hammer2_chain_unlock(parent);
parent = NULL;
error = hammer2_hardlink_find(dip, &chain, &ochain);
}
/*
* If this is a directory the directory must be empty. However, if
* isdir < 0 we are doing a rename and the directory does not have
* to be empty, and if isdir > 1 we are deleting a PFS/snapshot
* and the directory does not have to be empty.
*
* NOTE: We check the full key range here which covers both visible
* and invisible entries. Theoretically there should be no
* invisible (hardlink target) entries if there are no visible
* entries.
*/
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir == 1) {
dparent = hammer2_chain_lookup_init(chain, 0);
dchain = hammer2_chain_lookup(&dparent, &key_dummy,
0, (hammer2_key_t)-1,
&cache_index,
HAMMER2_LOOKUP_NODATA);
if (dchain) {
hammer2_chain_unlock(dchain);
hammer2_chain_lookup_done(dparent);
error = ENOTEMPTY;
goto done;
}
hammer2_chain_lookup_done(dparent);
dparent = NULL;
/* dchain NULL */
}
/*
* Ok, we can now unlink the chain. We always decrement nlinks even
* if the entry can be deleted in case someone has the file open and
* does an fstat().
*
* The chain itself will no longer be in the on-media topology but
* can still be flushed to the media (e.g. if an open descriptor
* remains). When the last vnode/ip ref goes away the chain will
* be marked unmodified, avoiding any further (now unnecesary) I/O.
*
* A non-NULL ochain indicates a hardlink.
*/
if (ochain) {
/*
* Delete the original hardlink pointer unconditionally.
* (any open descriptors will migrate to the hardlink
* target and have no affect on this operation).
*
* NOTE: parent from above is NULL when ochain != NULL
* so we can reuse it.
*/
hammer2_chain_lock(ochain, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_delete(trans, ochain, 0);
hammer2_chain_unlock(ochain);
}
/*
* Decrement nlinks on the hardlink target (or original file if
* there it was not hardlinked). Delete the target when nlinks
* reaches 0 with special handling if (isopen) is set.
*
* NOTE! In DragonFly the vnops function calls cache_unlink() after
* calling us here to clean out the namecache association,
* (which does not represent a ref for the open-test), and to
* force finalization of the vnode if/when the last ref gets
* dropped.
*
* NOTE! Files are unlinked by rename and then relinked. nch will be
* passed as NULL in this situation. hammer2_inode_connect()
* will bump nlinks.
*/
KKASSERT(chain != NULL);
hammer2_chain_modify(trans, &chain, 0);
ipdata = &chain->data->ipdata;
--ipdata->nlinks;
if ((int64_t)ipdata->nlinks < 0) /* XXX debugging */
ipdata->nlinks = 0;
if (ipdata->nlinks == 0) {
if ((chain->flags & HAMMER2_CHAIN_PFSROOT) && chain->pmp) {
error = EINVAL;
kprintf("hammer2: PFS \"%s\" cannot be deleted "
"while still mounted\n",
ipdata->filename);
goto done;
}
if (nch && cache_isopen(nch)) {
kprintf("WARNING: unlinking open file\n");
atomic_set_int(&chain->flags, HAMMER2_CHAIN_UNLINKED);
hammer2_inode_move_to_hidden(trans, &chain,
ipdata->inum);
} else {
hammer2_chain_delete(trans, chain, 0);
}
}
error = 0;
done:
if (chain)
hammer2_chain_unlock(chain);
if (parent)
hammer2_chain_lookup_done(parent);
if (ochain)
hammer2_chain_drop(ochain);
return error;
}
/*
* Create a new PFS under the super-root
*/
static int
hammer2_ioctl_pfs_create(hammer2_inode_t *ip, void *data)
{
hammer2_inode_data_t *nipdata;
hammer2_chain_t *nchain;
hammer2_dev_t *hmp;
hammer2_ioc_pfs_t *pfs;
hammer2_inode_t *nip;
hammer2_tid_t mtid;
int error;
hmp = ip->pmp->pfs_hmps[0];
if (hmp == NULL)
return (EINVAL);
pfs = data;
nip = NULL;
if (pfs->name[0] == 0)
return(EINVAL);
pfs->name[sizeof(pfs->name) - 1] = 0; /* ensure 0-termination */
if (hammer2_ioctl_pfs_lookup(ip, pfs) == 0)
return(EEXIST);
hammer2_trans_init(hmp->spmp, 0);
mtid = hammer2_trans_sub(hmp->spmp);
nip = hammer2_inode_create(hmp->spmp->iroot, NULL, NULL,
pfs->name, strlen(pfs->name), 0,
1, HAMMER2_OBJTYPE_DIRECTORY, 0,
HAMMER2_INSERT_PFSROOT, &error);
if (error == 0) {
hammer2_inode_modify(nip);
nchain = hammer2_inode_chain(nip, 0, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_modify(nchain, mtid, 0);
nipdata = &nchain->data->ipdata;
nip->meta.pfs_type = pfs->pfs_type;
nip->meta.pfs_subtype = pfs->pfs_subtype;
nip->meta.pfs_clid = pfs->pfs_clid;
nip->meta.pfs_fsid = pfs->pfs_fsid;
nip->meta.op_flags |= HAMMER2_OPFLAG_PFSROOT;
/*
* Set default compression and check algorithm. This
* can be changed later.
*
* Do not allow compression on PFS's with the special name
* "boot", the boot loader can't decompress (yet).
*/
nip->meta.comp_algo =
HAMMER2_ENC_ALGO(HAMMER2_COMP_NEWFS_DEFAULT);
nip->meta.check_algo =
HAMMER2_ENC_ALGO( HAMMER2_CHECK_ISCSI32);
if (strcasecmp(pfs->name, "boot") == 0) {
nip->meta.comp_algo =
HAMMER2_ENC_ALGO(HAMMER2_COMP_AUTOZERO);
}
#if 0
hammer2_blockref_t bref;
/* XXX new PFS needs to be rescanned / added */
bref = nchain->bref;
kprintf("ADD LOCAL PFS (IOCTL): %s\n", nipdata->filename);
hammer2_pfsalloc(nchain, nipdata, bref.modify_tid);
#endif
/* XXX rescan */
hammer2_chain_unlock(nchain);
hammer2_chain_drop(nchain);
/*
* Super-root isn't mounted, fsync it
*/
hammer2_inode_ref(nip);
hammer2_inode_unlock(nip);
hammer2_inode_fsync(nip);
hammer2_inode_drop(nip);
}
hammer2_trans_done(hmp->spmp);
return (error);
}
/*
* cparent is locked exclusively, with an extra ref, cluster is not locked.
* Replace element [i] in the cluster.
*/
static
int
hammer2_sync_replace(hammer2_thread_t *thr,
hammer2_chain_t *parent, hammer2_chain_t *chain,
hammer2_tid_t mtid, int idx,
hammer2_chain_t *focus)
{
int nradix;
uint8_t otype;
#if HAMMER2_THREAD_DEBUG
if (hammer2_debug & 1)
kprintf("replace rec %p slave %d %d.%016jx mod=%016jx\n",
chain,
idx,
focus->bref.type, focus->bref.key, mtid);
#endif
hammer2_chain_unlock(chain);
hammer2_chain_lock(chain, HAMMER2_RESOLVE_ALWAYS);
if (chain->bytes != focus->bytes) {
/* XXX what if compressed? */
nradix = hammer2_getradix(chain->bytes);
hammer2_chain_resize(NULL, parent, chain,
mtid, nradix, 0);
}
hammer2_chain_modify(chain, mtid, 0);
otype = chain->bref.type;
chain->bref.type = focus->bref.type;
chain->bref.methods = focus->bref.methods;
chain->bref.keybits = focus->bref.keybits;
chain->bref.vradix = focus->bref.vradix;
/* mirror_tid updated by flush */
KKASSERT(chain->bref.modify_tid == mtid);
chain->bref.flags = focus->bref.flags;
/* key already present */
/* check code will be recalculated */
chain->error = 0;
/*
* Copy data body.
*/
switch(chain->bref.type) {
case HAMMER2_BREF_TYPE_INODE:
if ((focus->data->ipdata.meta.op_flags &
HAMMER2_OPFLAG_DIRECTDATA) == 0) {
/*
* If DIRECTDATA is transitioning to 0 or the old
* chain is not an inode we have to initialize
* the block table.
*/
if (otype != HAMMER2_BREF_TYPE_INODE ||
(chain->data->ipdata.meta.op_flags &
HAMMER2_OPFLAG_DIRECTDATA)) {
kprintf("chain inode trans away from dd\n");
bzero(&chain->data->ipdata.u,
sizeof(chain->data->ipdata.u));
}
bcopy(focus->data, chain->data,
offsetof(hammer2_inode_data_t, u));
/* XXX setcheck on inode should not be needed */
hammer2_chain_setcheck(chain, chain->data);
break;
}
/* fall through */
case HAMMER2_BREF_TYPE_DATA:
bcopy(focus->data, chain->data, chain->bytes);
hammer2_chain_setcheck(chain, chain->data);
break;
default:
KKASSERT(0);
break;
}
hammer2_chain_unlock(chain);
hammer2_chain_lock(chain, HAMMER2_RESOLVE_SHARED |
HAMMER2_RESOLVE_MAYBE);
return 0;
}
/*
* Create a missing chain by copying the focus from another device.
*
* On entry *parentp and focus are both locked shared. The chain will be
* created and returned in *chainp also locked shared.
*/
static
int
hammer2_sync_insert(hammer2_thread_t *thr,
hammer2_chain_t **parentp, hammer2_chain_t **chainp,
hammer2_tid_t mtid, int idx, hammer2_chain_t *focus)
{
hammer2_chain_t *chain;
#if HAMMER2_THREAD_DEBUG
if (hammer2_debug & 1)
kprintf("insert rec par=%p/%d.%016jx slave %d %d.%016jx mod=%016jx\n",
*parentp,
(*parentp)->bref.type,
(*parentp)->bref.key,
idx,
focus->bref.type, focus->bref.key, mtid);
#endif
/*
* Create the missing chain. Exclusive locks are needed.
*
* Have to be careful to avoid deadlocks.
*/
if (*chainp)
hammer2_chain_unlock(*chainp);
hammer2_chain_unlock(*parentp);
hammer2_chain_lock(*parentp, HAMMER2_RESOLVE_ALWAYS);
/* reissue lookup? */
chain = NULL;
hammer2_chain_create(parentp, &chain, thr->pmp,
focus->bref.key, focus->bref.keybits,
focus->bref.type, focus->bytes,
mtid, 0);
hammer2_chain_modify(chain, mtid, 0);
/*
* Copy focus to new chain
*/
/* type already set */
chain->bref.methods = focus->bref.methods;
/* keybits already set */
chain->bref.vradix = focus->bref.vradix;
/* mirror_tid set by flush */
KKASSERT(chain->bref.modify_tid == mtid);
chain->bref.flags = focus->bref.flags;
/* key already present */
/* check code will be recalculated */
/*
* Copy data body.
*/
switch(chain->bref.type) {
case HAMMER2_BREF_TYPE_INODE:
if ((focus->data->ipdata.meta.op_flags &
HAMMER2_OPFLAG_DIRECTDATA) == 0) {
bcopy(focus->data, chain->data,
offsetof(hammer2_inode_data_t, u));
break;
}
/* fall through */
case HAMMER2_BREF_TYPE_DATA:
bcopy(focus->data, chain->data, chain->bytes);
hammer2_chain_setcheck(chain, chain->data);
break;
default:
KKASSERT(0);
break;
}
hammer2_chain_unlock(chain); /* unlock, leave ref */
if (*chainp)
hammer2_chain_drop(*chainp);
*chainp = chain; /* will be returned locked */
/*
* Avoid ordering deadlock when relocking.
*/
hammer2_chain_unlock(*parentp);
hammer2_chain_lock(*parentp, HAMMER2_RESOLVE_SHARED |
HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_lock(chain, HAMMER2_RESOLVE_SHARED |
HAMMER2_RESOLVE_ALWAYS);
return 0;
}
/*
* Connect inode (oip) to the specified directory using the specified name.
* (oip) must be locked.
*
* If (oip) is not currently connected we simply connect it up.
*
* If (oip) is already connected we create a OBJTYPE_HARDLINK entry which
* points to (oip)'s inode number. (oip) is expected to be the terminus of
* the hardlink sitting as a hidden file in a common parent directory
* in this situation (thus the lock order is correct).
*/
int
hammer2_inode_connect(hammer2_inode_t *dip, hammer2_inode_t *oip,
const uint8_t *name, size_t name_len)
{
hammer2_mount_t *hmp = dip->hmp;
hammer2_chain_t *chain;
hammer2_chain_t *parent;
hammer2_inode_t *nip;
hammer2_key_t lhc;
int error;
int hlink;
lhc = hammer2_dirhash(name, name_len);
hlink = (oip->chain.parent != NULL);
/*
* In fake mode flush oip so we can just snapshot it downbelow.
*/
if (hlink && hammer2_hardlink_enable < 0)
hammer2_chain_flush(hmp, &oip->chain, 0);
/*
* Locate the inode or indirect block to create the new
* entry in. At the same time check for key collisions
* and iterate until we don't get one.
*/
parent = &dip->chain;
hammer2_chain_lock(hmp, parent, HAMMER2_RESOLVE_ALWAYS);
error = 0;
while (error == 0) {
chain = hammer2_chain_lookup(hmp, &parent, lhc, lhc, 0);
if (chain == NULL)
break;
if ((lhc & HAMMER2_DIRHASH_LOMASK) == HAMMER2_DIRHASH_LOMASK)
error = ENOSPC;
hammer2_chain_unlock(hmp, chain);
chain = NULL;
++lhc;
}
/*
* Passing a non-NULL chain to hammer2_chain_create() reconnects the
* existing chain instead of creating a new one. The chain's bref
* will be properly updated.
*/
if (error == 0) {
if (hlink) {
chain = hammer2_chain_create(hmp, parent,
NULL, lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
} else {
chain = hammer2_chain_create(hmp, parent,
&oip->chain, lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
if (chain)
KKASSERT(chain == &oip->chain);
}
if (chain == NULL)
error = EIO;
}
hammer2_chain_unlock(hmp, parent);
/*
* Handle the error case
*/
if (error) {
KKASSERT(chain == NULL);
return (error);
}
/*
* Directory entries are inodes so if the name has changed we have
* to update the inode.
*
* When creating an OBJTYPE_HARDLINK entry remember to unlock the
* chain, the caller will access the hardlink via the actual hardlink
* target file and not the hardlink pointer entry.
*/
if (hlink && hammer2_hardlink_enable >= 0) {
/*
* Create the HARDLINK pointer. oip represents the hardlink
* target in this situation.
*/
nip = chain->u.ip;
hammer2_chain_modify(hmp, chain, 0);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, nip->ip_data.filename, name_len);
nip->ip_data.name_key = lhc;
nip->ip_data.name_len = name_len;
nip->ip_data.target_type = oip->ip_data.type;
nip->ip_data.type = HAMMER2_OBJTYPE_HARDLINK;
nip->ip_data.inum = oip->ip_data.inum;
nip->ip_data.nlinks = 1;
kprintf("created hardlink %*.*s\n",
(int)name_len, (int)name_len, name);
hammer2_chain_unlock(hmp, chain);
} else if (hlink && hammer2_hardlink_enable < 0) {
/*
* Create a snapshot (hardlink fake mode for debugging).
*/
nip = chain->u.ip;
nip->ip_data = oip->ip_data;
hammer2_chain_modify(hmp, chain, 0);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, nip->ip_data.filename, name_len);
nip->ip_data.name_key = lhc;
nip->ip_data.name_len = name_len;
kprintf("created fake hardlink %*.*s\n",
(int)name_len, (int)name_len, name);
hammer2_chain_unlock(hmp, chain);
} else {
/*
* Normally disconnected inode (e.g. during a rename) that
* was reconnected. We must fixup the name stored in
* oip.
*
* We are using oip as chain, already locked by caller,
* do not unlock it.
*/
hammer2_chain_modify(hmp, chain, 0);
if (oip->ip_data.name_len != name_len ||
bcmp(oip->ip_data.filename, name, name_len) != 0) {
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, oip->ip_data.filename, name_len);
oip->ip_data.name_key = lhc;
oip->ip_data.name_len = name_len;
}
oip->ip_data.nlinks = 1;
}
return (0);
}
/*
* ochain represents the target file inode. We need to move it to the
* specified common parent directory (dip) and rename it to a special
* invisible "0xINODENUMBER" filename.
*
* We use chain_duplicate and duplicate ochain at the new location,
* renaming it appropriately. We create a temporary chain and
* then delete it to placemark where the duplicate will go. Both of
* these use the inode number for (lhc) (the key), generating the
* invisible filename.
*/
static
hammer2_chain_t *
hammer2_hardlink_shiftup(hammer2_trans_t *trans, hammer2_chain_t **ochainp,
hammer2_inode_t *dip, int *errorp)
{
hammer2_inode_data_t *nipdata;
hammer2_chain_t *parent;
hammer2_chain_t *ochain;
hammer2_chain_t *nchain;
hammer2_chain_t *tmp;
hammer2_key_t lhc;
hammer2_blockref_t bref;
ochain = *ochainp;
*errorp = 0;
lhc = ochain->data->ipdata.inum;
KKASSERT((lhc & HAMMER2_DIRHASH_VISIBLE) == 0);
/*
* Locate the inode or indirect block to create the new
* entry in. lhc represents the inode number so there is
* no collision iteration.
*
* There should be no key collisions with invisible inode keys.
*/
retry:
parent = hammer2_chain_lookup_init(dip->chain, 0);
nchain = hammer2_chain_lookup(&parent, lhc, lhc, 0);
if (nchain) {
kprintf("X3 chain %p parent %p dip %p dip->chain %p\n",
nchain, parent, dip, dip->chain);
hammer2_chain_unlock(nchain);
nchain = NULL;
*errorp = ENOSPC;
#if 1
Debugger("X3");
#endif
}
/*
* Create entry in common parent directory using the seek position
* calculated above.
*/
if (*errorp == 0) {
KKASSERT(nchain == NULL);
*errorp = hammer2_chain_create(trans, &parent, &nchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,/* n/a */
HAMMER2_INODE_BYTES); /* n/a */
hammer2_chain_refactor(&ochain);
*ochainp = ochain;
}
/*
* Cleanup and handle retries.
*/
if (*errorp == EAGAIN) {
hammer2_chain_ref(parent);
hammer2_chain_lookup_done(parent);
hammer2_chain_wait(parent);
hammer2_chain_drop(parent);
goto retry;
}
/*
* Handle the error case
*/
if (*errorp) {
KKASSERT(nchain == NULL);
hammer2_chain_lookup_done(parent);
return (NULL);
}
/*
* Use chain as a placeholder for (lhc), delete it and replace
* it with our duplication.
*
* Gain a second lock on ochain for the duplication function to
* unlock, maintain the caller's original lock across the call.
*
* This is a bit messy.
*/
hammer2_chain_delete(trans, nchain);
hammer2_chain_lock(ochain, HAMMER2_RESOLVE_ALWAYS);
tmp = ochain;
bref = tmp->bref;
bref.key = lhc; /* invisible dir entry key */
bref.keybits = 0;
hammer2_chain_duplicate(trans, parent, nchain->index, &tmp, &bref);
hammer2_chain_lookup_done(parent);
hammer2_chain_unlock(nchain); /* no longer needed */
/*
* Now set chain to our duplicate and modify it appropriately.
*
* Directory entries are inodes but this is a hidden hardlink
* target. The name isn't used but to ease debugging give it
* a name after its inode number.
*/
nchain = tmp;
tmp = NULL; /* safety */
hammer2_chain_modify(trans, &nchain, HAMMER2_MODIFY_ASSERTNOCOPY);
nipdata = &nchain->data->ipdata;
ksnprintf(nipdata->filename, sizeof(nipdata->filename),
"0x%016jx", (intmax_t)nipdata->inum);
nipdata->name_len = strlen(nipdata->filename);
nipdata->name_key = lhc;
return (nchain);
}
/*
* Given an exclusively locked inode we consolidate its chain for hardlink
* creation, adding (nlinks) to the file's link count and potentially
* relocating the inode to a directory common to ip->pip and tdip.
*
* Replaces (*chainp) if consolidation occurred, unlocking the old chain
* and returning a new locked chain.
*
* NOTE! This function will also replace ip->chain.
*/
int
hammer2_hardlink_consolidate(hammer2_trans_t *trans, hammer2_inode_t *ip,
hammer2_chain_t **chainp,
hammer2_inode_t *tdip, int nlinks)
{
hammer2_inode_data_t *ipdata;
hammer2_inode_t *fdip;
hammer2_inode_t *cdip;
hammer2_chain_t *chain;
hammer2_chain_t *nchain;
int error;
chain = *chainp;
if (nlinks == 0 && /* no hardlink needed */
(chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE)) {
return (0);
}
if (hammer2_hardlink_enable < 0) { /* fake hardlinks */
return (0);
}
if (hammer2_hardlink_enable == 0) { /* disallow hardlinks */
hammer2_chain_unlock(chain);
*chainp = NULL;
return (ENOTSUP);
}
/*
* cdip will be returned with a ref, but not locked.
*/
fdip = ip->pip;
cdip = hammer2_inode_common_parent(fdip, tdip);
/*
* If no change in the hardlink's target directory is required and
* this is already a hardlink target, all we need to do is adjust
* the link count.
*
* XXX The common parent is a big wiggly due to duplication from
* renames. Compare the core (RBTREE) pointer instead of the
* ip's.
*/
if (cdip == fdip &&
(chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE) == 0) {
if (nlinks) {
hammer2_chain_modify(trans, &chain, 0);
chain->data->ipdata.nlinks += nlinks;
}
error = 0;
goto done;
}
/*
* We either have to move an existing hardlink target or we have
* to create a fresh hardlink target.
*
* Hardlink targets are hidden inodes in a parent directory common
* to all directory entries referencing the hardlink.
*/
nchain = hammer2_hardlink_shiftup(trans, &chain, cdip, &error);
if (error == 0) {
/*
* Bump nlinks on duplicated hidden inode, repoint
* ip->chain.
*/
hammer2_chain_modify(trans, &nchain, 0);
nchain->data->ipdata.nlinks += nlinks;
hammer2_inode_repoint(ip, cdip, nchain);
/*
* If the old chain is not a hardlink target then replace
* it with a OBJTYPE_HARDLINK pointer.
*
* If the old chain IS a hardlink target then delete it.
*/
if (chain->data->ipdata.name_key & HAMMER2_DIRHASH_VISIBLE) {
/*
* Replace original non-hardlink that's been dup'd
* with a special hardlink directory entry. We must
* set the DIRECTDATA flag to prevent sub-chains
* from trying to synchronize to the inode if the
* file is extended afterwords.
*/
hammer2_chain_modify(trans, &chain, 0);
hammer2_chain_delete_duplicate(trans, &chain,
HAMMER2_DELDUP_RECORE);
ipdata = &chain->data->ipdata;
ipdata->target_type = ipdata->type;
ipdata->type = HAMMER2_OBJTYPE_HARDLINK;
ipdata->uflags = 0;
ipdata->rmajor = 0;
ipdata->rminor = 0;
ipdata->ctime = 0;
ipdata->mtime = 0;
ipdata->atime = 0;
ipdata->btime = 0;
bzero(&ipdata->uid, sizeof(ipdata->uid));
bzero(&ipdata->gid, sizeof(ipdata->gid));
ipdata->op_flags = HAMMER2_OPFLAG_DIRECTDATA;
ipdata->cap_flags = 0;
ipdata->mode = 0;
ipdata->size = 0;
ipdata->nlinks = 1;
ipdata->iparent = 0; /* XXX */
ipdata->pfs_type = 0;
ipdata->pfs_inum = 0;
bzero(&ipdata->pfs_clid, sizeof(ipdata->pfs_clid));
bzero(&ipdata->pfs_fsid, sizeof(ipdata->pfs_fsid));
ipdata->data_quota = 0;
ipdata->data_count = 0;
ipdata->inode_quota = 0;
ipdata->inode_count = 0;
ipdata->attr_tid = 0;
ipdata->dirent_tid = 0;
bzero(&ipdata->u, sizeof(ipdata->u));
/* XXX transaction ids */
} else {
hammer2_chain_delete(trans, chain);
}
/*
* Return the new chain.
*/
hammer2_chain_unlock(chain);
chain = nchain;
} else {
/*
* Return an error
*/
hammer2_chain_unlock(chain);
chain = NULL;
}
/*
* Cleanup, chain/nchain already dealt with.
*/
done:
*chainp = chain;
hammer2_inode_drop(cdip);
return (error);
}
/*
* Unlink the file from the specified directory inode. The directory inode
* does not need to be locked.
*
* isdir determines whether a directory/non-directory check should be made.
* No check is made if isdir is set to -1.
*
* NOTE! This function does not prevent the underlying file from still
* being used if it has other refs (such as from an inode, or if it's
* chain is manually held). However, the caller is responsible for
* fixing up ip->chain if e.g. a rename occurs (see chain_duplicate()).
*/
int
hammer2_unlink_file(hammer2_trans_t *trans, hammer2_inode_t *dip,
const uint8_t *name, size_t name_len,
int isdir, int *hlinkp)
{
hammer2_inode_data_t *ipdata;
hammer2_chain_t *parent;
hammer2_chain_t *ochain;
hammer2_chain_t *chain;
hammer2_chain_t *dparent;
hammer2_chain_t *dchain;
hammer2_key_t lhc;
int error;
uint8_t type;
error = 0;
ochain = NULL;
lhc = hammer2_dirhash(name, name_len);
/*
* Search for the filename in the directory
*/
if (hlinkp)
*hlinkp = 0;
parent = hammer2_inode_lock_ex(dip);
chain = hammer2_chain_lookup(&parent,
lhc, lhc + HAMMER2_DIRHASH_LOMASK,
0);
while (chain) {
if (chain->bref.type == HAMMER2_BREF_TYPE_INODE &&
name_len == chain->data->ipdata.name_len &&
bcmp(name, chain->data->ipdata.filename, name_len) == 0) {
break;
}
chain = hammer2_chain_next(&parent, chain,
lhc, lhc + HAMMER2_DIRHASH_LOMASK,
0);
}
hammer2_inode_unlock_ex(dip, NULL); /* retain parent */
/*
* Not found or wrong type (isdir < 0 disables the type check).
* If a hardlink pointer, type checks use the hardlink target.
*/
if (chain == NULL) {
error = ENOENT;
goto done;
}
if ((type = chain->data->ipdata.type) == HAMMER2_OBJTYPE_HARDLINK) {
if (hlinkp)
*hlinkp = 1;
type = chain->data->ipdata.target_type;
}
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir == 0) {
error = ENOTDIR;
goto done;
}
if (type != HAMMER2_OBJTYPE_DIRECTORY && isdir >= 1) {
error = EISDIR;
goto done;
}
/*
* Hardlink must be resolved. We can't hold parent locked while we
* do this or we could deadlock.
*
* On success chain will be adjusted to point at the hardlink target
* and ochain will point to the hardlink pointer in the original
* directory. Otherwise chain remains pointing to the original.
*/
if (chain->data->ipdata.type == HAMMER2_OBJTYPE_HARDLINK) {
hammer2_chain_unlock(parent);
parent = NULL;
error = hammer2_hardlink_find(dip, &chain, &ochain);
}
/*
* If this is a directory the directory must be empty. However, if
* isdir < 0 we are doing a rename and the directory does not have
* to be empty, and if isdir > 1 we are deleting a PFS/snapshot
* and the directory does not have to be empty.
*
* NOTE: We check the full key range here which covers both visible
* and invisible entries. Theoretically there should be no
* invisible (hardlink target) entries if there are no visible
* entries.
*/
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir == 1) {
dparent = hammer2_chain_lookup_init(chain, 0);
dchain = hammer2_chain_lookup(&dparent,
0, (hammer2_key_t)-1,
HAMMER2_LOOKUP_NODATA);
if (dchain) {
hammer2_chain_unlock(dchain);
hammer2_chain_lookup_done(dparent);
error = ENOTEMPTY;
goto done;
}
hammer2_chain_lookup_done(dparent);
dparent = NULL;
/* dchain NULL */
}
/*
* Ok, we can now unlink the chain. We always decrement nlinks even
* if the entry can be deleted in case someone has the file open and
* does an fstat().
*
* The chain itself will no longer be in the on-media topology but
* can still be flushed to the media (e.g. if an open descriptor
* remains). When the last vnode/ip ref goes away the chain will
* be marked unmodified, avoiding any further (now unnecesary) I/O.
*
* A non-NULL ochain indicates a hardlink.
*/
if (ochain) {
/*
* Delete the original hardlink pointer.
*
* NOTE: parent from above is NULL when ochain != NULL
* so we can reuse it.
*/
hammer2_chain_lock(ochain, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_delete(trans, ochain);
hammer2_chain_unlock(ochain);
/*
* Then decrement nlinks on hardlink target, deleting
* the target when nlinks drops to 0.
*/
hammer2_chain_modify(trans, &chain, 0);
--chain->data->ipdata.nlinks;
if (chain->data->ipdata.nlinks == 0)
hammer2_chain_delete(trans, chain);
} else {
/*
* Otherwise this was not a hardlink and we can just
* remove the entry and decrement nlinks.
*
* NOTE: *_get() integrates chain's lock into the inode lock.
*/
hammer2_chain_modify(trans, &chain, 0);
ipdata = &chain->data->ipdata;
--ipdata->nlinks;
hammer2_chain_delete(trans, chain);
}
error = 0;
done:
if (chain)
hammer2_chain_unlock(chain);
if (parent)
hammer2_chain_lookup_done(parent);
if (ochain)
hammer2_chain_drop(ochain);
return error;
}
/*
* Consolidate for hard link creation. This moves the specified terminal
* hardlink inode to a directory common to its current directory and tdip
* if necessary, replacing *ipp with the new inode chain element and
* modifying the original inode chain element to OBJTYPE_HARDLINK.
*
* If the original inode chain element was a prior incarnation of a hidden
* inode it can simply be deleted instead of converted.
*
* (*ipp)'s nlinks field is locked on entry and the new (*ipp)'s nlinks
* field will be locked on return (with the original's unlocked).
*
* The link count is bumped if requested.
*/
int
hammer2_hardlink_consolidate(hammer2_inode_t **ipp, hammer2_inode_t *tdip)
{
hammer2_mount_t *hmp;
hammer2_inode_t *oip = *ipp;
hammer2_inode_t *nip = NULL;
hammer2_inode_t *fdip;
hammer2_chain_t *parent;
int error;
hmp = tdip->hmp;
if (hammer2_hardlink_enable < 0)
return (0);
if (hammer2_hardlink_enable == 0)
/*XXX return (ENOTSUP);
*/
/*
* Find the common parent directory
*/
fdip = oip->pip;
while (fdip->depth > tdip->depth) {
fdip = fdip->pip;
KKASSERT(fdip != NULL);
}
while (tdip->depth > fdip->depth) {
tdip = tdip->pip;
KKASSERT(tdip != NULL);
}
while (fdip != tdip) {
fdip = fdip->pip;
tdip = tdip->pip;
KKASSERT(fdip != NULL);
KKASSERT(tdip != NULL);
}
/*
* Nothing to do (except bump the link count) if the hardlink has
* already been consolidated in the correct place.
*/
if (oip->pip == fdip &&
(oip->ip_data.name_key & HAMMER2_DIRHASH_VISIBLE) == 0) {
kprintf("hardlink already consolidated correctly\n");
nip = oip;
hammer2_inode_lock_ex(nip);
hammer2_chain_modify(hmp, &nip->chain, 0);
++nip->ip_data.nlinks;
hammer2_inode_unlock_ex(nip);
return (0);
}
/*
* Create a hidden inode directory entry in the parent, copying
* (*oip)'s state. Then replace oip with OBJTYPE_HARDLINK.
*
* The duplication function will either flush or move any chains
* under oip to the new hardlink target inode, retiring all chains
* related to oip before returning. XXX vp->ip races.
*/
error = hammer2_inode_duplicate(fdip, oip, &nip, NULL, 0);
if (error == 0) {
/*
* Bump nlinks on duplicated hidden inode.
*/
kprintf("hardlink consolidation success in parent dir %s\n",
fdip->ip_data.filename);
hammer2_inode_lock_nlinks(nip);
hammer2_inode_unlock_nlinks(oip);
hammer2_chain_modify(hmp, &nip->chain, 0);
++nip->ip_data.nlinks;
hammer2_inode_unlock_ex(nip);
if (oip->ip_data.name_key & HAMMER2_DIRHASH_VISIBLE) {
/*
* Replace the old inode with an OBJTYPE_HARDLINK
* pointer.
*/
hammer2_inode_lock_ex(oip);
hammer2_chain_modify(hmp, &oip->chain, 0);
oip->ip_data.target_type = oip->ip_data.type;
oip->ip_data.type = HAMMER2_OBJTYPE_HARDLINK;
oip->ip_data.uflags = 0;
oip->ip_data.rmajor = 0;
oip->ip_data.rminor = 0;
oip->ip_data.ctime = 0;
oip->ip_data.mtime = 0;
oip->ip_data.atime = 0;
oip->ip_data.btime = 0;
bzero(&oip->ip_data.uid, sizeof(oip->ip_data.uid));
bzero(&oip->ip_data.gid, sizeof(oip->ip_data.gid));
oip->ip_data.op_flags = HAMMER2_OPFLAG_DIRECTDATA;
oip->ip_data.cap_flags = 0;
oip->ip_data.mode = 0;
oip->ip_data.size = 0;
oip->ip_data.nlinks = 1;
oip->ip_data.iparent = 0; /* XXX */
oip->ip_data.pfs_type = 0;
oip->ip_data.pfs_inum = 0;
bzero(&oip->ip_data.pfs_clid,
sizeof(oip->ip_data.pfs_clid));
bzero(&oip->ip_data.pfs_fsid,
sizeof(oip->ip_data.pfs_fsid));
oip->ip_data.data_quota = 0;
oip->ip_data.data_count = 0;
oip->ip_data.inode_quota = 0;
oip->ip_data.inode_count = 0;
oip->ip_data.attr_tid = 0;
oip->ip_data.dirent_tid = 0;
bzero(&oip->ip_data.u, sizeof(oip->ip_data.u));
/* XXX transaction ids */
hammer2_inode_unlock_ex(oip);
} else {
/*
* The old inode was a hardlink target, which we
* have now moved. We must delete it so the new
* hardlink target at a higher directory level
* becomes the only hardlink target for this inode.
*/
kprintf("DELETE INVISIBLE\n");
parent = oip->chain.parent;
hammer2_chain_lock(hmp, parent,
HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_lock(hmp, &oip->chain,
HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_delete(hmp, parent, &oip->chain, 0);
hammer2_chain_unlock(hmp, &oip->chain);
hammer2_chain_unlock(hmp, parent);
}
*ipp = nip;
} else {
KKASSERT(nip == NULL);
}
return (error);
}
/*
* Unlink the file from the specified directory inode. The directory inode
* does not need to be locked.
*
* isdir determines whether a directory/non-directory check should be made.
* No check is made if isdir is set to -1.
*/
int
hammer2_unlink_file(hammer2_inode_t *dip,
const uint8_t *name, size_t name_len,
int isdir, hammer2_inode_t *retain_ip)
{
hammer2_mount_t *hmp;
hammer2_chain_t *parent;
hammer2_chain_t *chain;
hammer2_chain_t *dparent;
hammer2_chain_t *dchain;
hammer2_key_t lhc;
hammer2_inode_t *ip;
hammer2_inode_t *oip;
int error;
uint8_t type;
error = 0;
oip = NULL;
hmp = dip->hmp;
lhc = hammer2_dirhash(name, name_len);
/*
* Search for the filename in the directory
*/
parent = &dip->chain;
hammer2_chain_lock(hmp, parent, HAMMER2_RESOLVE_ALWAYS);
chain = hammer2_chain_lookup(hmp, &parent,
lhc, lhc + HAMMER2_DIRHASH_LOMASK,
0);
while (chain) {
if (chain->bref.type == HAMMER2_BREF_TYPE_INODE &&
chain->u.ip &&
name_len == chain->data->ipdata.name_len &&
bcmp(name, chain->data->ipdata.filename, name_len) == 0) {
break;
}
chain = hammer2_chain_next(hmp, &parent, chain,
lhc, lhc + HAMMER2_DIRHASH_LOMASK,
0);
}
/*
* Not found or wrong type (isdir < 0 disables the type check).
*/
if (chain == NULL) {
hammer2_chain_unlock(hmp, parent);
return ENOENT;
}
if ((type = chain->data->ipdata.type) == HAMMER2_OBJTYPE_HARDLINK)
type = chain->data->ipdata.target_type;
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir == 0) {
error = ENOTDIR;
goto done;
}
if (type != HAMMER2_OBJTYPE_DIRECTORY && isdir == 1) {
error = EISDIR;
goto done;
}
/*
* Hardlink must be resolved. We can't hold parent locked while we
* do this or we could deadlock.
*/
if (chain->data->ipdata.type == HAMMER2_OBJTYPE_HARDLINK) {
hammer2_chain_unlock(hmp, parent);
parent = NULL;
error = hammer2_hardlink_find(dip, &chain, &oip);
}
/*
* If this is a directory the directory must be empty. However, if
* isdir < 0 we are doing a rename and the directory does not have
* to be empty.
*
* NOTE: We check the full key range here which covers both visible
* and invisible entries. Theoretically there should be no
* invisible (hardlink target) entries if there are no visible
* entries.
*/
if (type == HAMMER2_OBJTYPE_DIRECTORY && isdir >= 0) {
dparent = chain;
hammer2_chain_lock(hmp, dparent, HAMMER2_RESOLVE_ALWAYS);
dchain = hammer2_chain_lookup(hmp, &dparent,
0, (hammer2_key_t)-1,
HAMMER2_LOOKUP_NODATA);
if (dchain) {
hammer2_chain_unlock(hmp, dchain);
hammer2_chain_unlock(hmp, dparent);
error = ENOTEMPTY;
goto done;
}
hammer2_chain_unlock(hmp, dparent);
dparent = NULL;
/* dchain NULL */
}
/*
* Ok, we can now unlink the chain. We always decrement nlinks even
* if the entry can be deleted in case someone has the file open and
* does an fstat().
*
* The chain itself will no longer be in the on-media topology but
* can still be flushed to the media (e.g. if an open descriptor
* remains). When the last vnode/ip ref goes away the chain will
* be marked unmodified, avoiding any further (now unnecesary) I/O.
*/
if (oip) {
/*
* If this was a hardlink we first delete the hardlink
* pointer entry.
*/
parent = oip->chain.parent;
hammer2_chain_lock(hmp, parent, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_lock(hmp, &oip->chain, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_delete(hmp, parent, &oip->chain,
(retain_ip == oip));
hammer2_chain_unlock(hmp, &oip->chain);
hammer2_chain_unlock(hmp, parent);
parent = NULL;
/*
* Then decrement nlinks on hardlink target.
*/
ip = chain->u.ip;
if (ip->ip_data.nlinks == 1) {
dparent = chain->parent;
hammer2_chain_ref(hmp, chain);
hammer2_chain_unlock(hmp, chain);
hammer2_chain_lock(hmp, dparent,
HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_lock(hmp, chain, HAMMER2_RESOLVE_ALWAYS);
hammer2_chain_drop(hmp, chain);
hammer2_chain_modify(hmp, chain, 0);
--ip->ip_data.nlinks;
hammer2_chain_delete(hmp, dparent, chain, 0);
hammer2_chain_unlock(hmp, dparent);
} else {
hammer2_chain_modify(hmp, chain, 0);
--ip->ip_data.nlinks;
}
} else {
/*
* Otherwise this was not a hardlink and we can just
* remove the entry and decrement nlinks.
*/
ip = chain->u.ip;
hammer2_chain_modify(hmp, chain, 0);
--ip->ip_data.nlinks;
hammer2_chain_delete(hmp, parent, chain,
(retain_ip == ip));
}
error = 0;
done:
if (chain)
hammer2_chain_unlock(hmp, chain);
if (parent)
hammer2_chain_unlock(hmp, parent);
if (oip)
hammer2_chain_drop(oip->hmp, &oip->chain);
return error;
}
/*
* Shift *chainp up to the specified directory, change the filename
* to "0xINODENUMBER", and adjust the key. The chain becomes the
* invisible hardlink target.
*
* The original *chainp has already been marked deleted.
*/
static
void
hammer2_hardlink_shiftup(hammer2_trans_t *trans, hammer2_chain_t **chainp,
hammer2_inode_t *dip, hammer2_chain_t **dchainp,
int nlinks, int *errorp)
{
hammer2_inode_data_t *nipdata;
hammer2_chain_t *chain;
hammer2_chain_t *xchain;
hammer2_key_t key_dummy;
hammer2_key_t lhc;
hammer2_blockref_t bref;
int cache_index = -1;
chain = *chainp;
lhc = chain->data->ipdata.inum;
KKASSERT((lhc & HAMMER2_DIRHASH_VISIBLE) == 0);
/*
* Locate the inode or indirect block to create the new
* entry in. lhc represents the inode number so there is
* no collision iteration.
*
* There should be no key collisions with invisible inode keys.
*
* WARNING! Must use inode_lock_ex() on dip to handle a stale
* dip->chain cache.
*/
retry:
*errorp = 0;
xchain = hammer2_chain_lookup(dchainp, &key_dummy,
lhc, lhc, &cache_index, 0);
if (xchain) {
kprintf("X3 chain %p dip %p dchain %p dip->chain %p\n",
xchain, dip, *dchainp, dip->chain);
hammer2_chain_unlock(xchain);
xchain = NULL;
*errorp = ENOSPC;
#if 0
Debugger("X3");
#endif
}
/*
* Create entry in common parent directory using the seek position
* calculated above.
*
* We must refactor chain because it might have been shifted into
* an indirect chain by the create.
*/
if (*errorp == 0) {
KKASSERT(xchain == NULL);
#if 0
*errorp = hammer2_chain_create(trans, dchainp, &xchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,/* n/a */
HAMMER2_INODE_BYTES); /* n/a */
#endif
/*XXX this somehow isn't working on chain XXX*/
/*KKASSERT(xxx)*/
}
/*
* Cleanup and handle retries.
*/
if (*errorp == EAGAIN) {
kprintf("R");
hammer2_chain_wait(*dchainp);
hammer2_chain_drop(*dchainp);
goto retry;
}
/*
* Handle the error case
*/
if (*errorp) {
panic("error2");
KKASSERT(xchain == NULL);
return;
}
/*
* Use xchain as a placeholder for (lhc). Duplicate chain to the
* same target bref as xchain and then delete xchain. The duplication
* occurs after xchain in flush order even though xchain is deleted
* after the duplication. XXX
*
* WARNING! Duplications (to a different parent) can cause indirect
* blocks to be inserted, refactor xchain.
*/
bref = chain->bref;
bref.key = lhc; /* invisible dir entry key */
bref.keybits = 0;
hammer2_chain_duplicate(trans, dchainp, &chain, &bref, 0, 2);
/*
* chain is now 'live' again.. adjust the filename.
*
* Directory entries are inodes but this is a hidden hardlink
* target. The name isn't used but to ease debugging give it
* a name after its inode number.
*/
hammer2_chain_modify(trans, &chain, 0);
nipdata = &chain->data->ipdata;
ksnprintf(nipdata->filename, sizeof(nipdata->filename),
"0x%016jx", (intmax_t)nipdata->inum);
nipdata->name_len = strlen(nipdata->filename);
nipdata->name_key = lhc;
nipdata->nlinks += nlinks;
*chainp = chain;
}
/*
* Connect the target inode represented by (*chainp) to the media topology
* at (dip, name, len).
*
* If hlink is TRUE this function creates an OBJTYPE_HARDLINK directory
* entry instead of connecting (*chainp).
*
* If hlink is FALSE this function uses chain_duplicate() to make a copy
* if (*chainp) in the directory entry. (*chainp) is likely to be deleted
* by the caller in this case (e.g. rename).
*/
int
hammer2_inode_connect(hammer2_trans_t *trans, int hlink,
hammer2_inode_t *dip, hammer2_chain_t **chainp,
const uint8_t *name, size_t name_len)
{
hammer2_inode_data_t *ipdata;
hammer2_chain_t *nchain;
hammer2_chain_t *parent;
hammer2_chain_t *ochain;
hammer2_key_t lhc;
int error;
ochain = *chainp;
/*
* Since ochain is either disconnected from the topology or represents
* a hardlink terminus which is always a parent of or equal to dip,
* we should be able to safely lock dip->chain for our setup.
*/
parent = hammer2_chain_lookup_init(dip->chain, 0);
lhc = hammer2_dirhash(name, name_len);
/*
* Locate the inode or indirect block to create the new
* entry in. At the same time check for key collisions
* and iterate until we don't get one.
*/
error = 0;
while (error == 0) {
nchain = hammer2_chain_lookup(&parent, lhc, lhc, 0);
if (nchain == NULL)
break;
if ((lhc & HAMMER2_DIRHASH_LOMASK) == HAMMER2_DIRHASH_LOMASK)
error = ENOSPC;
hammer2_chain_unlock(nchain);
nchain = NULL;
++lhc;
}
if (error == 0) {
if (hlink) {
/*
* Hardlink pointer needed, create totally fresh
* directory entry.
*/
KKASSERT(nchain == NULL);
error = hammer2_chain_create(trans, &parent, &nchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
hammer2_chain_refactor(&ochain);
} else {
/*
* Reconnect the original chain and rename. Use
* chain_duplicate(). The caller will likely delete
* or has already deleted the original chain in
* this case.
*
* NOTE: chain_duplicate() generates a new chain
* with CHAIN_DELETED cleared (ochain typically
* has it set from the file unlink).
*/
nchain = ochain;
ochain = NULL;
hammer2_chain_duplicate(trans, NULL, -1, &nchain, NULL);
error = hammer2_chain_create(trans, &parent, &nchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
}
}
/*
* Unlock stuff.
*/
KKASSERT(error != EAGAIN);
hammer2_chain_lookup_done(parent);
parent = NULL;
/*
* nchain should be NULL on error, leave ochain (== *chainp) alone.
*/
if (error) {
KKASSERT(nchain == NULL);
return (error);
}
/*
* Directory entries are inodes so if the name has changed we have
* to update the inode.
*
* When creating an OBJTYPE_HARDLINK entry remember to unlock the
* chain, the caller will access the hardlink via the actual hardlink
* target file and not the hardlink pointer entry, so we must still
* return ochain.
*/
if (hlink && hammer2_hardlink_enable >= 0) {
/*
* Create the HARDLINK pointer. oip represents the hardlink
* target in this situation.
*
* We will return ochain (the hardlink target).
*/
hammer2_chain_modify(trans, &nchain,
HAMMER2_MODIFY_ASSERTNOCOPY);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
ipdata = &nchain->data->ipdata;
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
ipdata->target_type = ochain->data->ipdata.type;
ipdata->type = HAMMER2_OBJTYPE_HARDLINK;
ipdata->inum = ochain->data->ipdata.inum;
ipdata->nlinks = 1;
hammer2_chain_unlock(nchain);
nchain = ochain;
ochain = NULL;
} else if (hlink && hammer2_hardlink_enable < 0) {
/*
* Create a snapshot (hardlink fake mode for debugging).
* (ochain already flushed above so we can just copy the
* bref XXX).
*
* Since this is a snapshot we return nchain in the fake
* hardlink case.
*/
hammer2_chain_modify(trans, &nchain,
HAMMER2_MODIFY_ASSERTNOCOPY);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
ipdata = &nchain->data->ipdata;
*ipdata = ochain->data->ipdata;
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
kprintf("created fake hardlink %*.*s\n",
(int)name_len, (int)name_len, name);
} else {
/*
* nchain is a duplicate of ochain at the new location.
* We must fixup the name stored in oip. The bref key
* has already been set up.
*/
hammer2_chain_modify(trans, &nchain,
HAMMER2_MODIFY_ASSERTNOCOPY);
ipdata = &nchain->data->ipdata;
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
ipdata->nlinks = 1;
}
/*
* We are replacing ochain with nchain, unlock ochain. In the
* case where ochain is left unchanged the code above sets
* nchain to ochain and ochain to NULL, resulting in a NOP here.
*/
if (ochain)
hammer2_chain_unlock(ochain);
*chainp = nchain;
return (0);
}
/*
* Connect the target inode represented by (*chainp) to the media topology
* at (dip, name, len). The caller can pass a rough *chainp, this function
* will issue lookup()s to position the parent chain properly for the
* chain insertion.
*
* If hlink is TRUE this function creates an OBJTYPE_HARDLINK directory
* entry instead of connecting (*chainp).
*
* If hlink is FALSE this function uses chain_duplicate() to make a copy
* if (*chainp) in the directory entry. (*chainp) is likely to be deleted
* by the caller in this case (e.g. rename).
*/
int
hammer2_inode_connect(hammer2_trans_t *trans,
hammer2_chain_t **chainp, int hlink,
hammer2_inode_t *dip, hammer2_chain_t **dchainp,
const uint8_t *name, size_t name_len,
hammer2_key_t lhc)
{
hammer2_inode_data_t *ipdata;
hammer2_chain_t *nchain;
hammer2_chain_t *ochain;
hammer2_key_t key_dummy;
int cache_index = -1;
int error;
/*
* Since ochain is either disconnected from the topology or represents
* a hardlink terminus which is always a parent of or equal to dip,
* we should be able to safely lock dip->chain for our setup.
*
* WARNING! Must use inode_lock_ex() on dip to handle a stale
* dip->chain cache.
*/
ochain = *chainp;
/*
* If name is non-NULL we calculate lhc, else we use the passed-in
* lhc.
*/
if (name) {
lhc = hammer2_dirhash(name, name_len);
/*
* Locate the inode or indirect block to create the new
* entry in. At the same time check for key collisions
* and iterate until we don't get one.
*/
error = 0;
while (error == 0) {
nchain = hammer2_chain_lookup(dchainp, &key_dummy,
lhc, lhc,
&cache_index, 0);
if (nchain == NULL)
break;
if ((lhc & HAMMER2_DIRHASH_LOMASK) ==
HAMMER2_DIRHASH_LOMASK) {
error = ENOSPC;
}
hammer2_chain_unlock(nchain);
nchain = NULL;
++lhc;
}
} else {
/*
* Reconnect to specific key (used when moving
* unlinked-but-open files into the hidden directory).
*/
nchain = hammer2_chain_lookup(dchainp, &key_dummy,
lhc, lhc, &cache_index, 0);
KKASSERT(nchain == NULL);
}
if (error == 0) {
if (hlink) {
/*
* Hardlink pointer needed, create totally fresh
* directory entry.
*
* We must refactor ochain because it might have
* been shifted into an indirect chain by the
* create.
*/
KKASSERT(nchain == NULL);
error = hammer2_chain_create(trans, dchainp, &nchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
hammer2_chain_refactor(&ochain);
} else {
/*
* Reconnect the original chain and rename. Use
* chain_duplicate(). The caller will likely delete
* or has already deleted the original chain in
* this case.
*
* NOTE: chain_duplicate() generates a new chain
* with CHAIN_DELETED cleared (ochain typically
* has it set from the file unlink).
*
* WARNING! Can cause held-over chains to require a
* refactor. Fortunately we have none (our
* locked chains are passed into and
* modified by the call).
*/
nchain = ochain;
ochain = NULL;
hammer2_chain_duplicate(trans, NULL, &nchain, NULL,
0, 3);
error = hammer2_chain_create(trans, dchainp, &nchain,
lhc, 0,
HAMMER2_BREF_TYPE_INODE,
HAMMER2_INODE_BYTES);
}
}
/*
* Unlock stuff.
*/
KKASSERT(error != EAGAIN);
/*
* nchain should be NULL on error, leave ochain (== *chainp) alone.
*/
if (error) {
KKASSERT(nchain == NULL);
return (error);
}
/*
* Directory entries are inodes so if the name has changed we have
* to update the inode.
*
* When creating an OBJTYPE_HARDLINK entry remember to unlock the
* chain, the caller will access the hardlink via the actual hardlink
* target file and not the hardlink pointer entry, so we must still
* return ochain.
*/
if (hlink && hammer2_hardlink_enable >= 0) {
/*
* Create the HARDLINK pointer. oip represents the hardlink
* target in this situation.
*
* We will return ochain (the hardlink target).
*/
hammer2_chain_modify(trans, &nchain, 0);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
ipdata = &nchain->data->ipdata;
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
ipdata->target_type = ochain->data->ipdata.type;
ipdata->type = HAMMER2_OBJTYPE_HARDLINK;
ipdata->inum = ochain->data->ipdata.inum;
ipdata->nlinks = 1;
hammer2_chain_unlock(nchain);
nchain = ochain;
ochain = NULL;
} else if (hlink && hammer2_hardlink_enable < 0) {
/*
* Create a snapshot (hardlink fake mode for debugging).
* (ochain already flushed above so we can just copy the
* bref XXX).
*
* Since this is a snapshot we return nchain in the fake
* hardlink case.
*/
hammer2_chain_modify(trans, &nchain, 0);
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
ipdata = &nchain->data->ipdata;
*ipdata = ochain->data->ipdata;
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
atomic_clear_int(&nchain->core->flags,
HAMMER2_CORE_COUNTEDBREFS);
kprintf("created fake hardlink %*.*s\n",
(int)name_len, (int)name_len, name);
} else {
/*
* nchain is a duplicate of ochain at the new location.
* We must fixup the name stored in oip. The bref key
* has already been set up.
*/
hammer2_chain_modify(trans, &nchain, 0);
ipdata = &nchain->data->ipdata;
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, ipdata->filename, name_len);
ipdata->name_key = lhc;
ipdata->name_len = name_len;
ipdata->nlinks = 1;
}
/*
* We are replacing ochain with nchain, unlock ochain. In the
* case where ochain is left unchanged the code above sets
* nchain to ochain and ochain to NULL, resulting in a NOP here.
*/
if (ochain)
hammer2_chain_unlock(ochain);
*chainp = nchain;
return (0);
}
/*
* Duplicate the specified existing inode in the specified target directory.
* If name is NULL the inode is duplicated as a hidden directory entry.
*
* Returns the new inode. The old inode is left alone.
*
* XXX name needs to be NULL for now.
*/
int
hammer2_inode_duplicate(hammer2_inode_t *dip, hammer2_inode_t *oip,
hammer2_inode_t **nipp,
const uint8_t *name, size_t name_len)
{
hammer2_mount_t *hmp = dip->hmp;
hammer2_inode_t *nip;
hammer2_chain_t *parent;
hammer2_chain_t *chain;
hammer2_key_t lhc;
int error;
if (name) {
lhc = hammer2_dirhash(name, name_len);
} else {
lhc = oip->ip_data.inum;
KKASSERT((lhc & HAMMER2_DIRHASH_VISIBLE) == 0);
}
/*
* Locate the inode or indirect block to create the new
* entry in. At the same time check for key collisions
* and iterate until we don't get one.
*/
nip = NULL;
parent = &dip->chain;
hammer2_chain_lock(hmp, parent, HAMMER2_RESOLVE_ALWAYS);
error = 0;
while (error == 0) {
chain = hammer2_chain_lookup(hmp, &parent, lhc, lhc, 0);
if (chain == NULL)
break;
/* XXX bcmp name if not NULL */
if ((lhc & HAMMER2_DIRHASH_LOMASK) == HAMMER2_DIRHASH_LOMASK)
error = ENOSPC;
if ((lhc & HAMMER2_DIRHASH_VISIBLE) == 0) /* shouldn't happen */
error = ENOSPC;
hammer2_chain_unlock(hmp, chain);
chain = NULL;
++lhc;
}
/*
* Create entry in common parent directory.
*/
if (error == 0) {
chain = hammer2_chain_create(hmp, parent, NULL, lhc, 0,
HAMMER2_BREF_TYPE_INODE /* n/a */,
HAMMER2_INODE_BYTES); /* n/a */
if (chain == NULL)
error = EIO;
}
hammer2_chain_unlock(hmp, parent);
/*
* Handle the error case
*/
if (error) {
KKASSERT(chain == NULL);
return (error);
}
/*
* XXX This is currently a horrible hack. Well, if we wanted to
* duplicate a file, i.e. as in a snapshot, we definitely
* would have to flush it first.
*
* For hardlink target generation we can theoretically move any
* active chain structures without flushing, but that gets really
* iffy for code which follows chain->parent and ip->pip links.
*
* XXX only works with files. Duplicating a directory hierarchy
* requires a flush but doesn't deal with races post-flush.
* Well, it would work I guess, but you might catch some files
* mid-operation.
*
* We cannot leave oip with any in-memory chains because (for a
* hardlink), oip will become a OBJTYPE_HARDLINK which is just a
* pointer to the real hardlink's inum and can't have any sub-chains.
* XXX might be 0-ref chains left.
*/
hammer2_inode_lock_ex(oip);
hammer2_chain_flush(hmp, &oip->chain, 0);
hammer2_inode_unlock_ex(oip);
/*KKASSERT(RB_EMPTY(&oip->chain.rbhead));*/
nip = chain->u.ip;
hammer2_chain_modify(hmp, chain, 0);
nip->ip_data = oip->ip_data; /* sync media data after flush */
if (name) {
/*
* Directory entries are inodes so if the name has changed
* we have to update the inode.
*/
KKASSERT(name_len < HAMMER2_INODE_MAXNAME);
bcopy(name, nip->ip_data.filename, name_len);
nip->ip_data.name_key = lhc;
nip->ip_data.name_len = name_len;
} else {
/*
* Directory entries are inodes but this is a hidden hardlink
* target. The name isn't used but to ease debugging give it
* a name after its inode number.
*/
ksnprintf(nip->ip_data.filename, sizeof(nip->ip_data.filename),
"0x%016jx", (intmax_t)nip->ip_data.inum);
nip->ip_data.name_len = strlen(nip->ip_data.filename);
nip->ip_data.name_key = lhc;
}
*nipp = nip;
return (0);
}
