You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

client_lookup_set.go 7.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  1. // Copyright (c) 2012-2014 Jeremy Latt
  2. // Copyright (c) 2016-2017 Daniel Oaks <daniel@danieloaks.net>
  3. // released under the MIT license
  4. package irc
  5. import (
  6. "errors"
  7. "fmt"
  8. "log"
  9. "regexp"
  10. "strings"
  11. "sync"
  12. "github.com/DanielOaks/girc-go/ircmatch"
  13. )
  14. var (
  15. ErrNickMissing = errors.New("nick missing")
  16. ErrNicknameInUse = errors.New("nickname in use")
  17. ErrNicknameMismatch = errors.New("nickname mismatch")
  18. )
  19. // ExpandUserHost takes a userhost, and returns an expanded version.
  20. func ExpandUserHost(userhost string) (expanded string) {
  21. expanded = userhost
  22. // fill in missing wildcards for nicks
  23. //TODO(dan): this would fail with dan@lol, fix that.
  24. if !strings.Contains(expanded, "!") {
  25. expanded += "!*"
  26. }
  27. if !strings.Contains(expanded, "@") {
  28. expanded += "@*"
  29. }
  30. return
  31. }
  32. // ClientLookupSet represents a way to store, search and lookup clients.
  33. type ClientLookupSet struct {
  34. ByNickMutex sync.RWMutex
  35. ByNick map[string]*Client
  36. }
  37. // NewClientLookupSet returns a new lookup set.
  38. func NewClientLookupSet() *ClientLookupSet {
  39. return &ClientLookupSet{
  40. ByNick: make(map[string]*Client),
  41. }
  42. }
  43. // Count returns how many clients are in the lookup set.
  44. func (clients *ClientLookupSet) Count() int {
  45. clients.ByNickMutex.RLock()
  46. defer clients.ByNickMutex.RUnlock()
  47. count := len(clients.ByNick)
  48. return count
  49. }
  50. // Has returns whether or not the given client exists.
  51. //TODO(dan): This seems like ripe ground for a race, if code does Has then Get, and assumes the Get will return a client.
  52. func (clients *ClientLookupSet) Has(nick string) bool {
  53. casefoldedName, err := CasefoldName(nick)
  54. if err == nil {
  55. return false
  56. }
  57. clients.ByNickMutex.RLock()
  58. defer clients.ByNickMutex.RUnlock()
  59. _, exists := clients.ByNick[casefoldedName]
  60. return exists
  61. }
  62. // getNoMutex is used internally, for getting clients when no mutex is required (i.e. is already set).
  63. func (clients *ClientLookupSet) getNoMutex(nick string) *Client {
  64. casefoldedName, err := CasefoldName(nick)
  65. if err == nil {
  66. cli := clients.ByNick[casefoldedName]
  67. return cli
  68. }
  69. return nil
  70. }
  71. // Get retrieves a client from the set, if they exist.
  72. func (clients *ClientLookupSet) Get(nick string) *Client {
  73. casefoldedName, err := CasefoldName(nick)
  74. if err == nil {
  75. clients.ByNickMutex.RLock()
  76. defer clients.ByNickMutex.RUnlock()
  77. cli := clients.ByNick[casefoldedName]
  78. return cli
  79. }
  80. return nil
  81. }
  82. // Add adds a client to the lookup set.
  83. func (clients *ClientLookupSet) Add(client *Client, nick string) error {
  84. nick, err := CasefoldName(nick)
  85. if err != nil {
  86. return err
  87. }
  88. clients.ByNickMutex.Lock()
  89. defer clients.ByNickMutex.Unlock()
  90. if clients.getNoMutex(nick) != nil {
  91. return ErrNicknameInUse
  92. }
  93. clients.ByNick[nick] = client
  94. return nil
  95. }
  96. // Remove removes a client from the lookup set.
  97. func (clients *ClientLookupSet) Remove(client *Client) error {
  98. if !client.HasNick() {
  99. return ErrNickMissing
  100. }
  101. clients.ByNickMutex.Lock()
  102. defer clients.ByNickMutex.Unlock()
  103. if clients.getNoMutex(client.nick) != client {
  104. return ErrNicknameMismatch
  105. }
  106. delete(clients.ByNick, client.nickCasefolded)
  107. return nil
  108. }
  109. // Replace renames an existing client in the lookup set.
  110. func (clients *ClientLookupSet) Replace(oldNick, newNick string, client *Client) error {
  111. // get casefolded nicknames
  112. oldNick, err := CasefoldName(oldNick)
  113. if err != nil {
  114. return err
  115. }
  116. newNick, err = CasefoldName(newNick)
  117. if err != nil {
  118. return err
  119. }
  120. // remove and replace
  121. clients.ByNickMutex.Lock()
  122. defer clients.ByNickMutex.Unlock()
  123. oldClient := clients.ByNick[newNick]
  124. if oldClient == nil || oldClient == client {
  125. // whoo
  126. } else {
  127. return ErrNicknameInUse
  128. }
  129. if oldNick == newNick {
  130. // if they're only changing case, don't need to remove+re-add them
  131. return nil
  132. }
  133. delete(clients.ByNick, oldNick)
  134. clients.ByNick[newNick] = client
  135. return nil
  136. }
  137. // AllWithCaps returns all clients with the given capabilities.
  138. func (clients *ClientLookupSet) AllWithCaps(caps ...Capability) (set ClientSet) {
  139. set = make(ClientSet)
  140. clients.ByNickMutex.RLock()
  141. defer clients.ByNickMutex.RUnlock()
  142. var client *Client
  143. for _, client = range clients.ByNick {
  144. // make sure they have all the required caps
  145. for _, Cap := range caps {
  146. if !client.capabilities[Cap] {
  147. continue
  148. }
  149. }
  150. set.Add(client)
  151. }
  152. return set
  153. }
  154. // FindAll returns all clients that match the given userhost mask.
  155. func (clients *ClientLookupSet) FindAll(userhost string) (set ClientSet) {
  156. set = make(ClientSet)
  157. userhost, err := Casefold(ExpandUserHost(userhost))
  158. if err != nil {
  159. return set
  160. }
  161. matcher := ircmatch.MakeMatch(userhost)
  162. clients.ByNickMutex.RLock()
  163. defer clients.ByNickMutex.RUnlock()
  164. for _, client := range clients.ByNick {
  165. if matcher.Match(client.nickMaskCasefolded) {
  166. set.Add(client)
  167. }
  168. }
  169. return set
  170. }
  171. // Find returns the first client that matches the given userhost mask.
  172. func (clients *ClientLookupSet) Find(userhost string) *Client {
  173. userhost, err := Casefold(ExpandUserHost(userhost))
  174. if err != nil {
  175. return nil
  176. }
  177. matcher := ircmatch.MakeMatch(userhost)
  178. var matchedClient *Client
  179. clients.ByNickMutex.RLock()
  180. defer clients.ByNickMutex.RUnlock()
  181. for _, client := range clients.ByNick {
  182. if matcher.Match(client.nickMaskCasefolded) {
  183. matchedClient = client
  184. break
  185. }
  186. }
  187. return matchedClient
  188. }
  189. //
  190. // usermask to regexp
  191. //
  192. //TODO(dan): move this over to generally using glob syntax instead?
  193. // kinda more expected in normal ban/etc masks, though regex is useful (probably as an extban?)
  194. type UserMaskSet struct {
  195. masks map[string]bool
  196. regexp *regexp.Regexp
  197. }
  198. func NewUserMaskSet() *UserMaskSet {
  199. return &UserMaskSet{
  200. masks: make(map[string]bool),
  201. }
  202. }
  203. func (set *UserMaskSet) Add(mask string) bool {
  204. casefoldedMask, err := Casefold(mask)
  205. if err != nil {
  206. log.Println(fmt.Sprintf("ERROR: Could not add mask to usermaskset: [%s]", mask))
  207. return false
  208. }
  209. if set.masks[casefoldedMask] {
  210. return false
  211. }
  212. set.masks[casefoldedMask] = true
  213. set.setRegexp()
  214. return true
  215. }
  216. func (set *UserMaskSet) AddAll(masks []string) (added bool) {
  217. for _, mask := range masks {
  218. if !added && !set.masks[mask] {
  219. added = true
  220. }
  221. set.masks[mask] = true
  222. }
  223. set.setRegexp()
  224. return
  225. }
  226. func (set *UserMaskSet) Remove(mask string) bool {
  227. if !set.masks[mask] {
  228. return false
  229. }
  230. delete(set.masks, mask)
  231. set.setRegexp()
  232. return true
  233. }
  234. func (set *UserMaskSet) Match(userhost string) bool {
  235. if set.regexp == nil {
  236. return false
  237. }
  238. return set.regexp.MatchString(userhost)
  239. }
  240. func (set *UserMaskSet) String() string {
  241. masks := make([]string, len(set.masks))
  242. index := 0
  243. for mask := range set.masks {
  244. masks[index] = mask
  245. index += 1
  246. }
  247. return strings.Join(masks, " ")
  248. }
  249. // Generate a regular expression from the set of user mask
  250. // strings. Masks are split at the two types of wildcards, `*` and
  251. // `?`. All the pieces are meta-escaped. `*` is replaced with `.*`,
  252. // the regexp equivalent. Likewise, `?` is replaced with `.`. The
  253. // parts are re-joined and finally all masks are joined into a big
  254. // or-expression.
  255. func (set *UserMaskSet) setRegexp() {
  256. if len(set.masks) == 0 {
  257. set.regexp = nil
  258. return
  259. }
  260. maskExprs := make([]string, len(set.masks))
  261. index := 0
  262. for mask := range set.masks {
  263. manyParts := strings.Split(mask, "*")
  264. manyExprs := make([]string, len(manyParts))
  265. for mindex, manyPart := range manyParts {
  266. oneParts := strings.Split(manyPart, "?")
  267. oneExprs := make([]string, len(oneParts))
  268. for oindex, onePart := range oneParts {
  269. oneExprs[oindex] = regexp.QuoteMeta(onePart)
  270. }
  271. manyExprs[mindex] = strings.Join(oneExprs, ".")
  272. }
  273. maskExprs[index] = strings.Join(manyExprs, ".*")
  274. }
  275. expr := "^" + strings.Join(maskExprs, "|") + "$"
  276. set.regexp, _ = regexp.Compile(expr)
  277. }