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
330 * build the snap context for a given realm.
370 /* alloc new snap context */
378 /* build (reverse sorted) snap vector */
426 * rebuild snap context for the given realm and all of its children.
708 * Queue cap_snaps for snap writeback for this realm and its children.
759 * Parse and apply a snapblob "snap trace" from the MDS. This specifies
760 * the snap realm parameters from a given realm and all of its ancestors,
815 /* update realm parameters, snap lists */
869 * queue cap snaps _after_ we've built the new snap contexts,
897 * When receiving a corrupted snap trace we don't know what
922 * s_mutex across multiple snap flushes to avoid locking overhead.
952 * @inode: inode to move to new snap realm
956 * the new snaprealm (if any). The old snap realm reference held by
989 * Handle a snap notification from the MDS.
991 * This can take two basic forms: the simplest is just a snap creation
995 * The more difficult case is realm creation, due to snap creation at a
1069 .snap = CEPH_NOSNAP,
1134 * update using the provided snap trace. if we are deleting a
1135 * snap, we can avoid queueing cap_snaps.
1157 pr_err("%s corrupt snap message from mds%d\n", __func__, mds);
1171 u64 snap)
1182 if (snap > exist->snap) {
1184 } else if (snap < exist->snap) {
1196 exist->snap, exist->dev);
1212 sm->snap = snap;
1221 if (snap > exist->snap)
1223 else if (snap < exist->snap)
1241 exist->snap, exist->dev);
1246 sm->snap, sm->dev);
1292 dout("trim snapid map %llx -> %x\n", sm->snap, sm->dev);
1319 sm->snap, sm->dev);