Changeset 716

Timestamp:

05/06/15 14:01:30 (10 years ago)

Author:

Kris Deugau

Message:

/trunk

Add internal utility sub _deleteCascade(), necessary for coming
mergeBlocks() and probably useful for some new cases of deleteBlock().

File:

• trunk/cgi-bin/IPDB.pm (modified) (1 diff)

trunk/cgi-bin/IPDB.pm

@@ -208 +208 @@
 
 } # end _compactFree()
+
+
+## IPDB::_deleteCascade()
+# Internal sub.  Deletes an allocation and all subcomponents
+sub _deleteCascade {
+  my $dbh = shift;
+  my $id = shift;
+
+  my $binfo = getBlockData($dbh, $id);
+
+##fixme:  special-case master blocks up here and quickly delete based on master_id,
+# instead of wasting time tracing parent relations
+
+  # grab all allocations in the master within the CIDR of the block to be deleted
+  my %parents;
+  my %cidrlist;
+##fixme: limit by VRF?
+  my $sth = $dbh->prepare("SELECT cidr,id,parent_id FROM allocations WHERE cidr <<= ? AND master_id = ?");
+  $sth->execute($binfo->{block}, $binfo->{master_id});
+  while (my ($cidr, $cid, $pid) = $sth->fetchrow_array) {
+    $parents{$cid} = $pid;
+    $cidrlist{$cid} = $cidr;
+  }
+
+  # Trace the parent relations up the tree until we either hit parent ID 0 (we've found a master block
+  # but not the parent we're looking for - arguably this is already an error) or the parent ID matches
+  # the passed ID.  If the latter, push the whole set into a second flag hash, so we can terminate
+  # further tree-tracing early.
+  my %found;
+  foreach my $cid (keys %parents) {
+    my @tmp;
+    if ($cid == $id) {
+      # "child" is the ID we've been asked to cascade-delete.
+      $found{$cid}++;
+    } elsif ($found{$cid}) {
+      # ID already seen and the chain terminates in our parent.
+    } elsif ($parents{$cid} == $id) {
+      # Immediate parent is the target parent
+      $found{$cid}++;
+    } else {
+      # Immediate parent isn't the one we're looking for.  Walk the chain up until we hit our parent,
+      # the nonexistent parent id 0, or undefined (ID is not a child of the target ID at all)
+      # There are probably better ways to structure this loop.
+      while (1) {
+        # cache the ID
+        push @tmp, $cid;
+        # some very particularly defined loop ending conditions
+        if (!defined($parents{$cid}) || $parents{$cid} == $id || $parents{$cid} == 0) {
+          last;
+        } else {
+          # if we haven't found either the desired parent or another limiting condition,
+          # reset the ID to the parent next up the tree
+          $cid = $parents{$cid};
+        }
+      }
+      # if the current chain of relations ended with our target parent, shuffle the cached IDs into a flag hash
+      if (defined($parents{$cid}) && $parents{$cid} == $id) {
+        foreach (@tmp) { $found{$_}++; }
+      }
+    } # else
+  } # foreach my $cid
+
+  # Use the keys in the flag hash to determine which allocations to actually delete.
+  # Delete matching freeblocks and pool IPs;  their parents are going away so we want
+  # to make sure we don't leave orphaned records lying around loose.
+  my @dellist = keys %found;
+  push @dellist, $id;  # Just In Case the target ID didn't make the list earlier.
+  my $b = '?'. (',?' x $#dellist);
+  $dbh->do("DELETE FROM allocations WHERE id IN ($b)", undef, (@dellist) );
+  $dbh->do("DELETE FROM freeblocks WHERE parent_id IN ($b)", undef, (@dellist) );
+  $dbh->do("DELETE FROM poolips WHERE parent_id IN ($b)", undef, (@dellist) );
+
+  # Insert a new free block in the target's parent, unless we just deleted a whole master block.
+  if ($binfo->{type} ne 'mm') {
+    my $pinfo = getBlockData($dbh, $binfo->{parent_id});
+    my $pt = (split //, $pinfo->{type})[1];
+    $dbh->do("INSERT INTO freeblocks (cidr,city,routed,parent_id,vrf,master_id) VALUES (?,?,?,?,?,?)", undef,
+        $binfo->{block}, $pinfo->{city}, $pt, $binfo->{parent_id}, $pinfo->{vrf}, $binfo->{master_id});
+  }
+
+##todo: and hey!  bonus!  we can return @dellist, or something (%cidrlist{@dellist})
+} # end _deleteCascade()