// Copyright 2019-present Facebook Inc. All rights reserved. // This source code is licensed under the Apache 2.0 license found // in the LICENSE file in the root directory of this source tree. package schema import ( "context" "crypto/md5" "fmt" "math" "sort" "github.com/facebookincubator/ent/dialect" "github.com/facebookincubator/ent/dialect/sql" "github.com/facebookincubator/ent/schema/field" ) const ( // TypeTable defines the table name holding the type information. TypeTable = "ent_types" // MaxTypes defines the max number of types can be created when // defining universal ids. The left 16-bits are reserved. MaxTypes = math.MaxUint16 ) // MigrateOption allows for managing schema configuration using functional options. type MigrateOption func(m *Migrate) // WithGlobalUniqueID sets the universal ids options to the migration. // Defaults to false. func WithGlobalUniqueID(b bool) MigrateOption { return func(m *Migrate) { m.universalID = b } } // WithDropColumn sets the columns dropping option to the migration. // Defaults to false. func WithDropColumn(b bool) MigrateOption { return func(m *Migrate) { m.dropColumn = b } } // WithDropIndex sets the indexes dropping option to the migration. // Defaults to false. func WithDropIndex(b bool) MigrateOption { return func(m *Migrate) { m.dropIndex = b } } // Migrate runs the migrations logic for the SQL dialects. type Migrate struct { sqlDialect universalID bool // global unique ids. dropColumn bool // drop deleted columns. dropIndex bool // drop deleted indexes. typeRanges []string // types order by their range. } // NewMigrate create a migration structure for the given SQL driver. func NewMigrate(d dialect.Driver, opts ...MigrateOption) (*Migrate, error) { m := &Migrate{} switch d.Dialect() { case dialect.MySQL: m.sqlDialect = &MySQL{Driver: d} case dialect.SQLite: m.sqlDialect = &SQLite{Driver: d} default: return nil, fmt.Errorf("sql/schema: unsupported dialect %q", d.Dialect()) } for _, opt := range opts { opt(m) } return m, nil } // Create creates all schema resources in the database. It works in an "append-only" // mode, which means, it only create tables, append column to tables or modifying column type. // // Column can be modified by turning into a NULL from NOT NULL, or having a type conversion not // resulting data altering. From example, changing varchar(255) to varchar(120) is invalid, but // changing varchar(120) to varchar(255) is valid. For more info, see the convert function below. // // Note that SQLite dialect does not support (this moment) the "append-only" mode describe above, // since it's used only for testing. func (m *Migrate) Create(ctx context.Context, tables ...*Table) error { tx, err := m.Tx(ctx) if err != nil { return err } if err := m.init(ctx, tx); err != nil { return rollback(tx, err) } if m.universalID { if err := m.types(ctx, tx); err != nil { return rollback(tx, err) } } if err := m.create(ctx, tx, tables...); err != nil { return rollback(tx, err) } return tx.Commit() } func (m *Migrate) create(ctx context.Context, tx dialect.Tx, tables ...*Table) error { for _, t := range tables { t.setup() switch exist, err := m.tableExist(ctx, tx, t.Name); { case err != nil: return err case exist: curr, err := m.table(ctx, tx, t.Name) if err != nil { return err } change, err := m.changeSet(curr, t) if err != nil { return err } if err := m.apply(ctx, tx, t.Name, change); err != nil { return err } default: // !exist query, args := m.tBuilder(t).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("create table %q: %v", t.Name, err) } // if global unique identifier is enabled and it's not a relation table, // allocate a range for the table pk. if m.universalID && len(t.PrimaryKey) == 1 { if err := m.allocPKRange(ctx, tx, t); err != nil { return err } } // indexes. for _, idx := range t.Indexes { query, args := idx.Builder(t.Name).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("create index %q: %v", idx.Name, err) } } } } // create foreign keys after tables were created/altered, // because circular foreign-key constraints are possible. for _, t := range tables { if len(t.ForeignKeys) == 0 { continue } fks := make([]*ForeignKey, 0, len(t.ForeignKeys)) for _, fk := range t.ForeignKeys { fk.Symbol = symbol(fk.Symbol) exist, err := m.fkExist(ctx, tx, fk.Symbol) if err != nil { return err } if !exist { fks = append(fks, fk) } } if len(fks) == 0 { continue } b := sql.AlterTable(t.Name) for _, fk := range fks { b.AddForeignKey(fk.DSL()) } query, args := b.Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("create foreign keys for %q: %v", t.Name, err) } } return nil } // apply applies changes on the given table. func (m *Migrate) apply(ctx context.Context, tx dialect.Tx, table string, change *changes) error { // constraints should be dropped before dropping columns, because if a column // is a part of multi-column constraints (like, unique index), ALTER TABLE // might fail if the intermediate state violates the constraints. if m.dropIndex { for _, idx := range change.index.drop { query, args := idx.DropBuilder(table).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("drop index of table %q: %v", table, err) } } } b := sql.AlterTable(table) for _, c := range change.column.add { b.AddColumn(m.cBuilder(c)) } for _, c := range change.column.modify { b.ModifyColumn(m.cBuilder(c)) } if m.dropColumn { for _, c := range change.column.drop { b.DropColumn(sql.Column(c.Name)) } } // if there's actual action to execute on ALTER TABLE. if len(b.Queries) != 0 { query, args := b.Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("alter table %q: %v", table, err) } } for _, idx := range change.index.add { query, args := idx.Builder(table).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("create index %q: %v", table, err) } } return nil } // changes to apply on existing table. type changes struct { // column changes. column struct { add []*Column drop []*Column modify []*Column } // index changes. index struct { add Indexes drop Indexes } } // changeSet returns a changes object to be applied on existing table. // It fails if one of the changes is invalid. func (m *Migrate) changeSet(curr, new *Table) (*changes, error) { change := &changes{} // pks. if len(curr.PrimaryKey) != len(new.PrimaryKey) { return nil, fmt.Errorf("cannot change primary key for table: %q", curr.Name) } sort.Slice(new.PrimaryKey, func(i, j int) bool { return new.PrimaryKey[i].Name < new.PrimaryKey[j].Name }) sort.Slice(curr.PrimaryKey, func(i, j int) bool { return curr.PrimaryKey[i].Name < curr.PrimaryKey[j].Name }) for i := range curr.PrimaryKey { if curr.PrimaryKey[i].Name != new.PrimaryKey[i].Name { return nil, fmt.Errorf("cannot change primary key for table: %q", curr.Name) } } // add or modify columns. for _, c1 := range new.Columns { // ignore primary keys. if c1.PrimaryKey() { continue } switch c2, ok := curr.column(c1.Name); { case !ok: change.column.add = append(change.column.add, c1) // modify a non-unique column to unique. case c1.Unique && !c2.Unique: change.index.add.append(&Index{ Name: c1.Name, Unique: true, Columns: []*Column{c1}, columns: []string{c1.Name}, }) // modify a unique column to non-unique. case !c1.Unique && c2.Unique: idx, ok := curr.index(c2.Name) if !ok { return nil, fmt.Errorf("missing index to drop for column %q", c2.Name) } change.index.drop.append(idx) // extending column types. case m.cType(c1) != m.cType(c2): if !c2.ConvertibleTo(c1) { return nil, fmt.Errorf("changing column type for %q is invalid (%s != %s)", c1.Name, m.cType(c1), m.cType(c2)) } fallthrough // change nullability of a column. case c1.Nullable != c2.Nullable: change.column.modify = append(change.column.modify, c1) } } // drop columns. for _, c1 := range curr.Columns { // if a column was dropped, multi-columns indexes that are associated with this column will // no longer behave the same. Therefore, these indexes should be dropped too. There's no need // to do it explicitly (here), because entc will remove them from the schema specification, // and they will be dropped in the block below. if _, ok := new.column(c1.Name); !ok { change.column.drop = append(change.column.drop, c1) } } // add or modify indexes. for _, idx1 := range new.Indexes { switch idx2, ok := curr.index(idx1.Name); { case !ok: change.index.add.append(idx1) // changing index cardinality require drop and create. case idx1.Unique != idx2.Unique: change.index.drop.append(idx2) change.index.add.append(idx1) } } // drop indexes. for _, idx1 := range curr.Indexes { if _, ok := new.index(idx1.Name); !ok { change.index.drop.append(idx1) } } return change, nil } // types loads the type list from the database. // If the table does not create, it will create one. func (m *Migrate) types(ctx context.Context, tx dialect.Tx) error { exists, err := m.tableExist(ctx, tx, TypeTable) if err != nil { return err } if !exists { t := NewTable(TypeTable). AddPrimary(&Column{Name: "id", Type: field.TypeInt, Increment: true}). AddColumn(&Column{Name: "type", Type: field.TypeString, Unique: true}) query, args := m.tBuilder(t).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("create types table: %v", err) } return nil } rows := &sql.Rows{} query, args := sql.Select("type").From(sql.Table(TypeTable)).OrderBy(sql.Asc("id")).Query() if err := tx.Query(ctx, query, args, rows); err != nil { return fmt.Errorf("query types table: %v", err) } defer rows.Close() return sql.ScanSlice(rows, &m.typeRanges) } func (m *Migrate) allocPKRange(ctx context.Context, tx dialect.Tx, t *Table) error { id := -1 // if the table re-created, re-use its range from the past. for i, name := range m.typeRanges { if name == t.Name { id = i break } } // allocate a new id-range. if id == -1 { if len(m.typeRanges) > MaxTypes { return fmt.Errorf("max number of types exceeded: %d", MaxTypes) } query, args := sql.Insert(TypeTable).Columns("type").Values(t.Name).Query() if err := tx.Exec(ctx, query, args, new(sql.Result)); err != nil { return fmt.Errorf("insert into type: %v", err) } id = len(m.typeRanges) m.typeRanges = append(m.typeRanges, t.Name) } // set the id offset for table. return m.setRange(ctx, tx, t.Name, id<<32) } // symbol makes sure the symbol length is not longer than the maxlength in MySQL standard (64). func symbol(name string) string { if len(name) <= 64 { return name } return fmt.Sprintf("%s_%x", name[:31], md5.Sum([]byte(name))) } // rollback calls to tx.Rollback and wraps the given error with the rollback error if occurred. func rollback(tx dialect.Tx, err error) error { err = fmt.Errorf("sql/schema: %v", err) if rerr := tx.Rollback(); rerr != nil { err = fmt.Errorf("%s: %v", err.Error(), rerr) } return err } // exist checks if the given COUNT query returns a value >= 1. func exist(ctx context.Context, tx dialect.Tx, query string, args ...interface{}) (bool, error) { rows := &sql.Rows{} if err := tx.Query(ctx, query, args, rows); err != nil { return false, fmt.Errorf("reading schema information %v", err) } defer rows.Close() if !rows.Next() { return false, fmt.Errorf("no rows returned") } var n int if err := rows.Scan(&n); err != nil { return false, fmt.Errorf("scanning count") } return n > 0, nil } type sqlDialect interface { dialect.Driver init(context.Context, dialect.Tx) error table(context.Context, dialect.Tx, string) (*Table, error) tableExist(context.Context, dialect.Tx, string) (bool, error) fkExist(context.Context, dialect.Tx, string) (bool, error) setRange(context.Context, dialect.Tx, string, int) error // table, column and index builder per dialect. cType(*Column) string tBuilder(*Table) *sql.TableBuilder cBuilder(*Column) *sql.ColumnBuilder }