2014-07-13 01:32:48 +02:00
|
|
|
package command
|
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
|
|
|
"fmt"
|
|
|
|
"sort"
|
|
|
|
"strings"
|
|
|
|
|
|
|
|
"github.com/hashicorp/terraform/terraform"
|
|
|
|
"github.com/mitchellh/colorstring"
|
|
|
|
)
|
|
|
|
|
|
|
|
// FormatPlan takes a plan and returns a
|
|
|
|
func FormatPlan(p *terraform.Plan, c *colorstring.Colorize) string {
|
2014-07-13 04:47:31 +02:00
|
|
|
if p.Diff == nil || p.Diff.Empty() {
|
|
|
|
return "This plan does nothing."
|
|
|
|
}
|
|
|
|
|
2014-07-13 01:32:48 +02:00
|
|
|
if c == nil {
|
|
|
|
c = &colorstring.Colorize{
|
|
|
|
Colors: colorstring.DefaultColors,
|
|
|
|
Reset: false,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
buf := new(bytes.Buffer)
|
|
|
|
|
|
|
|
// We want to output the resources in sorted order to make things
|
|
|
|
// easier to scan through, so get all the resource names and sort them.
|
2014-09-24 23:37:24 +02:00
|
|
|
names := make([]string, 0, len(p.Diff.RootModule().Resources))
|
|
|
|
for name, _ := range p.Diff.RootModule().Resources {
|
2014-07-13 01:32:48 +02:00
|
|
|
names = append(names, name)
|
|
|
|
}
|
|
|
|
sort.Strings(names)
|
|
|
|
|
|
|
|
// Go through each sorted name and start building the output
|
|
|
|
for _, name := range names {
|
2014-09-24 23:37:24 +02:00
|
|
|
rdiff := p.Diff.RootModule().Resources[name]
|
2014-07-13 01:32:48 +02:00
|
|
|
|
|
|
|
// Determine the color for the text (green for adding, yellow
|
|
|
|
// for change, red for delete), and symbol, and output the
|
|
|
|
// resource header.
|
|
|
|
color := "yellow"
|
|
|
|
symbol := "~"
|
2014-07-27 04:54:09 +02:00
|
|
|
if rdiff.RequiresNew() && rdiff.Destroy {
|
|
|
|
color = "green"
|
|
|
|
symbol = "-/+"
|
|
|
|
} else if rdiff.RequiresNew() {
|
2014-07-13 01:32:48 +02:00
|
|
|
color = "green"
|
|
|
|
symbol = "+"
|
|
|
|
} else if rdiff.Destroy {
|
|
|
|
color = "red"
|
|
|
|
symbol = "-"
|
|
|
|
}
|
|
|
|
buf.WriteString(c.Color(fmt.Sprintf(
|
|
|
|
"[%s]%s %s\n",
|
|
|
|
color, symbol, name)))
|
|
|
|
|
|
|
|
// Get all the attributes that are changing, and sort them. Also
|
|
|
|
// determine the longest key so that we can align them all.
|
|
|
|
keyLen := 0
|
|
|
|
keys := make([]string, 0, len(rdiff.Attributes))
|
|
|
|
for key, _ := range rdiff.Attributes {
|
|
|
|
// Skip the ID since we do that specially
|
|
|
|
if key == "id" {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
keys = append(keys, key)
|
|
|
|
if len(key) > keyLen {
|
|
|
|
keyLen = len(key)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
sort.Strings(keys)
|
|
|
|
|
|
|
|
// Go through and output each attribute
|
|
|
|
for _, attrK := range keys {
|
|
|
|
attrDiff := rdiff.Attributes[attrK]
|
|
|
|
|
|
|
|
v := attrDiff.New
|
|
|
|
if attrDiff.NewComputed {
|
|
|
|
v = "<computed>"
|
|
|
|
}
|
|
|
|
|
|
|
|
newResource := ""
|
|
|
|
if attrDiff.RequiresNew && rdiff.Destroy {
|
|
|
|
newResource = " (forces new resource)"
|
|
|
|
}
|
|
|
|
|
|
|
|
buf.WriteString(fmt.Sprintf(
|
2014-07-13 02:03:55 +02:00
|
|
|
" %s:%s %#v => %#v%s\n",
|
2014-07-13 01:32:48 +02:00
|
|
|
attrK,
|
|
|
|
strings.Repeat(" ", keyLen-len(attrK)),
|
|
|
|
attrDiff.Old,
|
|
|
|
v,
|
|
|
|
newResource))
|
|
|
|
}
|
|
|
|
|
|
|
|
// Write the reset color so we don't overload the user's terminal
|
|
|
|
buf.WriteString(c.Color("[reset]\n"))
|
|
|
|
}
|
|
|
|
|
|
|
|
return strings.TrimSpace(buf.String())
|
|
|
|
}
|