This change converts Profile.tests from a dict to a Tree, which is a new
class that descends from dict, but automatically adds new branches
whenever one is requested that doesn't exist.

This solves a couple of problems, first, there is a lot of code in
all.py to add new dictionaries to the tests tree, and that is annoying
(In fact this ends up removing about 200 lines of code total). The
second problem it solves is that some of the search-and-add functions in
all.py add nodes to the tree, which are then relied on by functions in
all.py. This is sloppy and annoying, and while it could be remedied by
adding all of the missing branches to the tree that would result in a
lot of LOC additions for no reason.

This class will be removed by the end the series.

Signed-off-by: Dylan Baker <dylanx.c.baker@intel.com>