I have created a python tool which can do this. I did this because I tried @Thomas Luzat's approach in both my own and @Johannes Ernst's implementation, and the used space doubled from 20GB to 40GB in the cloning procedure. I thought something more efficient was needed.
Consider this common file system history:
current ---------------------------------\
| | | |
snap4 snap3 snap2 snap1
With Thomas' algorithm, "current" would be cloned first, and all snapshots (being snapshots of former states of "current") would use "current" as clone source / parent. Obviously, it would be better to base snap3 on snap4, snap2 on snap3, etc.
And this is just the tip of the iceberg; finding the "best" clone sources (in terms of space savings) in a btrfs file system with a complex history is a non-trivial problem. I've come up with 3 other strategies to solve this problem, which seem to use space much more efficiently. One has actually resulted in clones size slightly below that of the source.
You can read the details on the github page if you're interested.
1
For completeness, this was added as a option to btrfs-progs during 2015: https://github.com/kdave/btrfs-progs/commit/99ad3805beed9f527830c2d07118718872224e9f
– goncalopp – 2018-01-25T23:11:31.263