I’ve been writing myself a web-based photo album for over a decade now. It’s gone through many different technologies over the years as I used it to learn new ways of doing stuff.
I’m finally shedding the years of java from it to do something that’s not only more lightweight, but also distributed. The purpose of this post isn’t to describe the photo album, but a little bit of background will help to understand the point of what’s going on.
Most recently, my photo album is implemented as a couchapp which has been huge fun.
The current version has a basic CouchDB backend that lets me set up replication as shown in this image to the left here. Photos can be added or edited on any server (with the exception of the public instance, which is a replication target only) and these adds and edits will eventually make their way to all of the other servers.
Previously, pictures were added to the photo album by the means of a standalone OS X app that batches them into my local DB which I then replicate out to others.
However, I haven’t written such a thing for Android, so getting photos I take on my phone while I’m out stored safely has been a bit more difficult. This is where Dropbox comes in.
The Android app for Dropbox is really well done. Apps that can share files get a share button that will place the content directly into Dropbox folders.
Dropbox itself delivers the files into their locations
atomically – that is, if a file doesn’t sync up to
dropbox in its entirety, it won’t be delivered, and a file will not
show up on any client machine until it’s properly fully down and can
be moved in atomically (via rename(2)
).
This seems like something worth taking advantage of, and the most obvious way for me was to create a spool within Dropbox.
I wrote a simple uploader that grabs as much info as it can from the photos that appear via dropbox, uses PIL to do some scaling and stuff and then sticks it in the local DB.
The recipe for safely and reliably processing items from a spool is relatively simple and well-known. It is the way print and mail processing systems have worked for decades. The wikipedia overview does a better job of explaining the concept, but I’ll go over the code I wrote for mine since I find it easier to understand concepts with code than with English.
The actual queue processor based on the uploader is easy to understand (almost the entire thing is shown below), but does have to take care of failure modes, new things coming in while it’s processing, etc… For this, I end up with three directories:
The processor atomically moves an item from the incoming directory (inside Dropbox) to the work directory. It works on the item from that location, then atomically moves it to the done directory once it’s done.
Here’s what my spool processor looks like in python:
I’m catching all exceptions at the toplevel loop and just logging them. If anything goes wrong at any stage, the file will stay wherever it was when it broke (usually the work directory).
Note that it could delete it when it’s done instead of just moving
it to a done
directory, but I don’t want to automatically delete
stuff.
My script runs on Mac OS X, so I wrote a quick launchd plist to read a sync dir and operate like a mail spool. Basically, if nothing’s coming in, nothing happens.
My monitor plist looks something like the following:
Place that in ~/Library/LaunchAgents
and have load it with
launchctl load ~/Library/LaunchAgents/net.spy.photoupload.plist
and
we’re up and monitoring (note that it’ll automatically load on boot).
If you wanted to run something similar on a system other than Mac OS X, you could easily write a queue manager that monitors the directory using kqueue or inotify or even just a cron job poking around looking for new stuff.