mirror of
https://github.com/juanfont/headscale.git
synced 2024-11-29 18:33:05 +00:00
ensure provider id is found out of order
Signed-off-by: Kristoffer Dalby <kristoffer@tailscale.com>
This commit is contained in:
parent
697ec7f46c
commit
c905f0499b
2 changed files with 30 additions and 3 deletions
|
@ -991,7 +991,10 @@ func filterNodesByUser(nodes types.Nodes, users []types.User, userToken string)
|
|||
var potentialUsers []types.User
|
||||
for _, user := range users {
|
||||
if user.ProviderIdentifier == userToken {
|
||||
potentialUsers = append(potentialUsers, user)
|
||||
// If a user is matching with a known unique field,
|
||||
// disgard all other users and only keep the current
|
||||
// user.
|
||||
potentialUsers = []types.User{user}
|
||||
|
||||
break
|
||||
}
|
||||
|
|
|
@ -884,7 +884,7 @@ func Test_expandPorts(t *testing.T) {
|
|||
}
|
||||
}
|
||||
|
||||
func Test_listNodesInUser(t *testing.T) {
|
||||
func Test_filterNodesByUser(t *testing.T) {
|
||||
users := []types.User{
|
||||
{Model: gorm.Model{ID: 1}, Name: "marc"},
|
||||
{Model: gorm.Model{ID: 2}, Name: "joe", Email: "joe@headscale.net"},
|
||||
|
@ -896,6 +896,11 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
},
|
||||
{Model: gorm.Model{ID: 4}, Name: "mikael2", Email: "mikael@headscale.net"},
|
||||
{Model: gorm.Model{ID: 5}, Name: "mikael", Email: "mikael2@headscale.net"},
|
||||
{Model: gorm.Model{ID: 6}, Name: "http://oidc.org/1234", Email: "mikael@headscale.net"},
|
||||
{Model: gorm.Model{ID: 7}, Name: "1"},
|
||||
{Model: gorm.Model{ID: 8}, Name: "alex", Email: "alex@headscale.net"},
|
||||
{Model: gorm.Model{ID: 9}, Name: "alex@headscale.net"},
|
||||
{Model: gorm.Model{ID: 10}, Email: "http://oidc.org/1234"},
|
||||
}
|
||||
|
||||
type args struct {
|
||||
|
@ -967,6 +972,7 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
nodes: types.Nodes{
|
||||
&types.Node{ID: 1, User: users[1]},
|
||||
&types.Node{ID: 2, User: users[2]},
|
||||
&types.Node{ID: 8, User: users[7]},
|
||||
},
|
||||
user: "joe@headscale.net",
|
||||
},
|
||||
|
@ -1077,6 +1083,7 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
&types.Node{ID: 3, User: users[2]},
|
||||
&types.Node{ID: 4, User: users[3]},
|
||||
&types.Node{ID: 5, User: users[4]},
|
||||
&types.Node{ID: 8, User: users[7]},
|
||||
},
|
||||
user: "joe@headscale.net",
|
||||
},
|
||||
|
@ -1084,6 +1091,17 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
&types.Node{ID: 2, User: users[1]},
|
||||
},
|
||||
},
|
||||
{
|
||||
name: "email-as-username-duplicate",
|
||||
args: args{
|
||||
nodes: types.Nodes{
|
||||
&types.Node{ID: 1, User: users[7]},
|
||||
&types.Node{ID: 2, User: users[8]},
|
||||
},
|
||||
user: "alex@headscale.net",
|
||||
},
|
||||
want: nil,
|
||||
},
|
||||
{
|
||||
name: "all-users-no-email-random-order",
|
||||
args: args{
|
||||
|
@ -1107,6 +1125,7 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
&types.Node{ID: 3, User: users[2]},
|
||||
&types.Node{ID: 4, User: users[3]},
|
||||
&types.Node{ID: 5, User: users[4]},
|
||||
&types.Node{ID: 6, User: users[5]},
|
||||
},
|
||||
user: "http://oidc.org/1234",
|
||||
},
|
||||
|
@ -1123,6 +1142,7 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
&types.Node{ID: 3, User: users[2]},
|
||||
&types.Node{ID: 4, User: users[3]},
|
||||
&types.Node{ID: 5, User: users[4]},
|
||||
&types.Node{ID: 6, User: users[5]},
|
||||
},
|
||||
user: "http://oidc.org/4321",
|
||||
},
|
||||
|
@ -1136,7 +1156,11 @@ func Test_listNodesInUser(t *testing.T) {
|
|||
rand.Shuffle(len(ns), func(i, j int) {
|
||||
ns[i], ns[j] = ns[j], ns[i]
|
||||
})
|
||||
got := filterNodesByUser(ns, users, test.args.user)
|
||||
us := users
|
||||
rand.Shuffle(len(us), func(i, j int) {
|
||||
us[i], us[j] = us[j], us[i]
|
||||
})
|
||||
got := filterNodesByUser(ns, us, test.args.user)
|
||||
sort.Slice(got, func(i, j int) bool {
|
||||
return got[i].ID < got[j].ID
|
||||
})
|
||||
|
|
Loading…
Reference in a new issue