1. 23 Jan, 2012 1 commit
  2. 30 Nov, 2011 1 commit
  3. 29 Nov, 2011 1 commit
  4. 28 Nov, 2011 3 commits
  5. 14 Nov, 2011 1 commit
  6. 02 Nov, 2011 1 commit
  7. 07 Oct, 2011 1 commit
    • Leigh Stoller's avatar
      We now save the switch path that assign computes, into the DB. We then · f61a6288
      Leigh Stoller authored
      use this path when setting up the vlan, instead of recomputing the set
      of trunks that are need. Assign does a much better job of this, so
      throwing the info away is bad.
      
      But, if there is no switch path, we still have to be careful cause the
      switch infrastructure might have loops, and the existing algorithm did
      not take that into account. And in fact, Utah has loops and this was
      causing grief. I added a simple spanning tree function (Prim's Greedy)
      to calculate a loop free set of trunks.
      
      An added complication is if the vlans are modified on the command
      line, and the there is a switch path in the DB. In this case we have
      to throw that away, and revert to dumb loop free calculation.
      
      Note that we also have to store the switch path in the vlans table,
      since for swapmod/synctables, we need to know how to undo stale vlans
      (which are no longer in the lans table).
      f61a6288
  8. 22 Jul, 2011 1 commit
  9. 19 Jul, 2011 1 commit
  10. 18 Jul, 2011 2 commits
  11. 05 Jul, 2011 1 commit
  12. 20 May, 2011 1 commit
  13. 19 May, 2011 1 commit
  14. 12 May, 2011 3 commits
  15. 11 May, 2011 5 commits
  16. 10 May, 2011 1 commit