/*
	Copyright NetFoundry, Inc.

	Licensed under the Apache License, Version 2.0 (the "License");
	you may not use this file except in compliance with the License.
	You may obtain a copy of the License at

	https://www.apache.org/licenses/LICENSE-2.0

	Unless required by applicable law or agreed to in writing, software
	distributed under the License is distributed on an "AS IS" BASIS,
	WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
	See the License for the specific language governing permissions and
	limitations under the License.
*/

package network

import (
	"github.com/openziti/fabric/controller/idgen"
	"github.com/openziti/foundation/util/info"
	"github.com/orcaman/concurrent-map"
	"math"
	"time"
)

type linkController struct {
	linkTable   *linkTable
	idGenerator idgen.Generator
}

func newLinkController() *linkController {
	return &linkController{
		linkTable:   newLinkTable(),
		idGenerator: idgen.NewGenerator(),
	}
}

func (linkController *linkController) add(link *Link) {
	linkController.linkTable.add(link)
	link.Src.routerLinks.Add(link, link.Dst)
	link.Dst.routerLinks.Add(link, link.Src)
}

func (linkController *linkController) has(link *Link) bool {
	return linkController.linkTable.has(link)
}

func (linkController *linkController) get(linkId string) (*Link, bool) {
	link, found := linkController.linkTable.get(linkId)
	return link, found
}

func (linkController *linkController) all() []*Link {
	return linkController.linkTable.all()
}

func (linkController *linkController) remove(link *Link) {
	linkController.linkTable.remove(link)
	link.Src.routerLinks.Remove(link, link.Dst)
	link.Dst.routerLinks.Remove(link, link.Src)
}

func (linkController *linkController) connectedNeighborsOfRouter(router *Router) []*Router {
	neighborMap := make(map[string]*Router)

	links := router.routerLinks.GetLinks()
	for _, link := range links {
		if link.IsUsable() {
			if link.Src != router {
				neighborMap[link.Src.Id] = link.Src
			}
			if link.Dst != router {
				neighborMap[link.Dst.Id] = link.Dst
			}
		}
	}

	neighbors := make([]*Router, 0)
	for _, r := range neighborMap {
		neighbors = append(neighbors, r)
	}
	return neighbors
}

func (linkController *linkController) leastExpensiveLink(a, b *Router) (*Link, bool) {
	var selected *Link
	var cost int64 = math.MaxInt64

	linksByRouter := a.routerLinks.GetLinksByRouter()
	links := linksByRouter[b.Id]
	for _, link := range links {
		if link.IsUsable() {
			linkCost := link.GetCost()
			if link.Dst == b {
				if linkCost < cost {
					selected = link
					cost = linkCost
				}
			} else if link.Src == b {
				if linkCost < cost {
					selected = link
					cost = linkCost
				}
			}
		}
	}

	if selected != nil {
		return selected, true
	}

	return nil, false
}

func (linkController *linkController) missingLinks(routers []*Router, pendingTimeout time.Duration) ([]*Link, error) {
	// When there's a flood of router connects at startup we can see the same link
	// as missing multiple times as the new link will be marked as PENDING until it's
	// connected. Give ourselves a little window to make the connection before we
	// send another dial
	pendingLimit := info.NowInMilliseconds() - pendingTimeout.Milliseconds()

	missingLinks := make([]*Link, 0)
	for _, srcR := range routers {
		for _, dstR := range routers {
			if srcR != dstR && dstR.AdvertisedListener != "" {
				if !linkController.hasLink(srcR, dstR, pendingLimit) {
					id, err := linkController.idGenerator.NextAlphaNumericPrefixedId()
					if err != nil {
						return nil, err
					}
					link := newLink(id)
					link.Src = srcR
					link.Dst = dstR
					missingLinks = append(missingLinks, link)
				}
			}
		}
	}

	return missingLinks, nil
}

func (linkController *linkController) hasLink(a, b *Router, pendingLimit int64) bool {
	return linkController.hasDirectedLink(a, b, pendingLimit) || linkController.hasDirectedLink(b, a, pendingLimit)
}

func (linkController *linkController) hasDirectedLink(a, b *Router, pendingLimit int64) bool {
	links := a.routerLinks.GetLinks()
	for _, link := range links {
		state := link.CurrentState()
		if link.Src == a && link.Dst == b && state != nil {
			if state.Mode == Connected || (state.Mode == Pending && state.Timestamp > pendingLimit) {
				return true
			}
		}
	}
	return false
}

func (linkController *linkController) linksInMode(mode LinkMode) []*Link {
	return linkController.linkTable.allInMode(mode)
}

/*
 * linkTable
 */

type linkTable struct {
	links cmap.ConcurrentMap // map[Link.Id.Token]*Link
}

func newLinkTable() *linkTable {
	return &linkTable{links: cmap.New()}
}

func (lt *linkTable) add(link *Link) {
	lt.links.Set(link.Id, link)
}

func (lt *linkTable) get(linkId string) (*Link, bool) {
	link, found := lt.links.Get(linkId)
	if link != nil {
		return link.(*Link), found
	}
	return nil, found
}

func (lt *linkTable) has(link *Link) bool {
	if i, found := lt.links.Get(link.Id); found {
		if i.(*Link) == link {
			return true
		}
	}
	return false
}

func (lt *linkTable) all() []*Link {
	links := make([]*Link, 0, lt.links.Count())
	for i := range lt.links.IterBuffered() {
		links = append(links, i.Val.(*Link))
	}
	return links
}

func (lt *linkTable) allInMode(mode LinkMode) []*Link {
	links := make([]*Link, 0)
	for i := range lt.links.IterBuffered() {
		link := i.Val.(*Link)
		if link.CurrentState().Mode == mode {
			links = append(links, link)
		}
	}
	return links
}

func (lt *linkTable) remove(link *Link) {
	lt.links.Remove(link.Id)
}

/*
 * adjacencyTable
 */

type adjacencyTable struct {
	adjacency cmap.ConcurrentMap // map[Router.Id.Token]*routerLinksTable
}

func newAdjacencyTable() *adjacencyTable {
	return &adjacencyTable{adjacency: cmap.New()}
}

func (at *adjacencyTable) add(link *Link) {
	// src->dst
	var rlt *routerLinksTable
	if i, found := at.adjacency.Get(link.Src.Id); found {
		rlt = i.(*routerLinksTable)
	} else {
		rlt = newRouterLinksTable()
	}
	rlt.addLinkForRouter(link.Dst.Id, link)
	at.adjacency.Set(link.Src.Id, rlt)

	// dst->src
	if i, found := at.adjacency.Get(link.Dst.Id); found {
		rlt = i.(*routerLinksTable)
	} else {
		rlt = newRouterLinksTable()
	}
	rlt.addLinkForRouter(link.Src.Id, link)
	at.adjacency.Set(link.Dst.Id, rlt)
}

func (at *adjacencyTable) get(routerId string) (*routerLinksTable, bool) {
	i, found := at.adjacency.Get(routerId)
	if i != nil {
		return i.(*routerLinksTable), found
	}
	return nil, found
}

func (at *adjacencyTable) remove(link *Link) {
	// src->dst
	if i, found := at.adjacency.Get(link.Src.Id); found {
		rlt := i.(*routerLinksTable)
		rlt.removeLinkFromRouter(link.Dst.Id, link)
		if rlt.size() > 0 {
			at.adjacency.Set(link.Src.Id, rlt)
		} else {
			at.adjacency.Remove(link.Src.Id)
		}
	}

	// dst->src
	if i, found := at.adjacency.Get(link.Dst.Id); found {
		rlt := i.(*routerLinksTable)
		rlt.removeLinkFromRouter(link.Src.Id, link)
		if rlt.size() > 0 {
			at.adjacency.Set(link.Dst.Id, rlt)
		} else {
			at.adjacency.Remove(link.Dst.Id)
		}
	}
}

/*
 * routerLinksTable
 */

type routerLinksTable struct {
	routerLinks cmap.ConcurrentMap // map[Router.Id.Token][]*Link
}

func newRouterLinksTable() *routerLinksTable {
	return &routerLinksTable{routerLinks: cmap.New()}
}

func (rlt *routerLinksTable) addLinkForRouter(routerId string, link *Link) {
	var links []*Link
	if i, found := rlt.routerLinks.Get(routerId); found {
		links = i.([]*Link)
	} else {
		links = make([]*Link, 0)
	}

	links = append(links, link)
	rlt.routerLinks.Set(routerId, links)
}

func (rlt *routerLinksTable) allLinksForRouter(routerId string) ([]*Link, bool) {
	if i, found := rlt.routerLinks.Get(routerId); found {
		return i.([]*Link), true
	}
	return nil, false
}

func (rlt *routerLinksTable) allLinksForAllRouters() []*Link {
	allLinks := make([]*Link, 0, rlt.routerLinks.Count())
	for i := range rlt.routerLinks.IterBuffered() {
		links := i.Val.([]*Link)
		for _, link := range links {
			allLinks = append(allLinks, link)
		}
	}
	return allLinks
}

func (rlt *routerLinksTable) size() int {
	return rlt.routerLinks.Count()
}

func (rlt *routerLinksTable) removeLinkFromRouter(routerId string, link *Link) {
	var links []*Link
	if i, found := rlt.routerLinks.Get(routerId); found {
		links = i.([]*Link)
		if len(links) == 1 && links[0] == link {
			rlt.routerLinks.Remove(routerId)

		} else {
			i := -1
			for j, jLink := range links {
				if jLink == link {
					i = j
					break
				}
			}
			if i != -1 {
				links = append(links[:i], links[i+1:]...)
			}
			rlt.routerLinks.Set(routerId, links)
		}
	}
}