Lines Matching refs:snap

32  * snapshots.  An individual realm's snap set contains snapshots
34 * parent's snap set _after_ the point at which the parent became it's
44 * with an open cap in the system. (The needed snap realm information is
49 * The realm hierarchy drives the generation of a 'snap context' for each
54 * Unfortunately error handling is a bit mixed here. If we get a snap
333 * build the snap context for a given realm.
375 /* alloc new snap context */
383 /* build (reverse sorted) snap vector */
431 * rebuild snap context for the given realm and all of its children.
719 * Queue cap_snaps for snap writeback for this realm and its children.
773 * Parse and apply a snapblob "snap trace" from the MDS. This specifies
774 * the snap realm parameters from a given realm and all of its ancestors,
830 /* update realm parameters, snap lists */
884 * queue cap snaps _after_ we've built the new snap contexts,
912 * When receiving a corrupted snap trace we don't know what
938 * s_mutex across multiple snap flushes to avoid locking overhead.
969 * @inode: inode to move to new snap realm
973 * the new snaprealm (if any). The old snap realm reference held by
1006 * Handle a snap notification from the MDS.
1008 * This can take two basic forms: the simplest is just a snap creation
1012 * The more difficult case is realm creation, due to snap creation at a
1087 .snap = CEPH_NOSNAP,
1152 * update using the provided snap trace. if we are deleting a
1153 * snap, we can avoid queueing cap_snaps.
1175 pr_err_client(cl, "corrupt snap message from mds%d\n", mds);
1189 u64 snap)
1201 if (snap > exist->snap) {
1203 } else if (snap < exist->snap) {
1214 doutc(cl, "found snapid map %llx -> %x\n", exist->snap,
1231 sm->snap = snap;
1240 if (snap > exist->snap)
1242 else if (snap < exist->snap)
1259 doutc(cl, "found snapid map %llx -> %x\n", exist->snap,
1264 doutc(cl, "create snapid map %llx -> %x\n", sm->snap, sm->dev);
1311 doutc(cl, "trim snapid map %llx -> %x\n", sm->snap, sm->dev);
1339 sm->snap, sm->dev);