mirror of
https://github.com/cwinfo/matterbridge.git
synced 2025-06-28 19:39:24 +00:00
Add scripting (tengo) support for every incoming message (#731)
TengoModifyMessage allows you to specify the location of a tengo (https://github.com/d5/tengo/) script. This script will receive every incoming message and can be used to modify the Username and the Text of that message. The script will have the following global variables: to modify: msgUsername and msgText to read: msgChannel and msgAccount The script is reloaded on every message, so you can modify the script on the fly. Example script can be found in https://github.com/42wim/matterbridge/tree/master/gateway/bench.tengo and https://github.com/42wim/matterbridge/tree/master/contrib/example.tengo The example below will check if the text contains blah and if so, it'll replace the text and the username of that message. text := import("text") if text.re_match("blah",msgText) { msgText="replaced by this" msgUsername="fakeuser" } More information about tengo on: https://github.com/d5/tengo/blob/master/docs/tutorial.md and https://github.com/d5/tengo/blob/master/docs/stdlib.md
This commit is contained in:
110
vendor/github.com/d5/tengo/compiler/source/file.go
generated
vendored
Normal file
110
vendor/github.com/d5/tengo/compiler/source/file.go
generated
vendored
Normal file
@ -0,0 +1,110 @@
|
||||
package source
|
||||
|
||||
// File represents a source file.
|
||||
type File struct {
|
||||
// File set for the file
|
||||
set *FileSet
|
||||
// File name as provided to AddFile
|
||||
Name string
|
||||
// Pos value range for this file is [base...base+size]
|
||||
Base int
|
||||
// File size as provided to AddFile
|
||||
Size int
|
||||
// Lines contains the offset of the first character for each line (the first entry is always 0)
|
||||
Lines []int
|
||||
}
|
||||
|
||||
// Set returns FileSet.
|
||||
func (f *File) Set() *FileSet {
|
||||
return f.set
|
||||
}
|
||||
|
||||
// LineCount returns the current number of lines.
|
||||
func (f *File) LineCount() int {
|
||||
return len(f.Lines)
|
||||
}
|
||||
|
||||
// AddLine adds a new line.
|
||||
func (f *File) AddLine(offset int) {
|
||||
if i := len(f.Lines); (i == 0 || f.Lines[i-1] < offset) && offset < f.Size {
|
||||
f.Lines = append(f.Lines, offset)
|
||||
}
|
||||
}
|
||||
|
||||
// LineStart returns the position of the first character in the line.
|
||||
func (f *File) LineStart(line int) Pos {
|
||||
if line < 1 {
|
||||
panic("illegal line number (line numbering starts at 1)")
|
||||
}
|
||||
|
||||
if line > len(f.Lines) {
|
||||
panic("illegal line number")
|
||||
}
|
||||
|
||||
return Pos(f.Base + f.Lines[line-1])
|
||||
}
|
||||
|
||||
// FileSetPos returns the position in the file set.
|
||||
func (f *File) FileSetPos(offset int) Pos {
|
||||
if offset > f.Size {
|
||||
panic("illegal file offset")
|
||||
}
|
||||
|
||||
return Pos(f.Base + offset)
|
||||
}
|
||||
|
||||
// Offset translates the file set position into the file offset.
|
||||
func (f *File) Offset(p Pos) int {
|
||||
if int(p) < f.Base || int(p) > f.Base+f.Size {
|
||||
panic("illegal Pos value")
|
||||
}
|
||||
|
||||
return int(p) - f.Base
|
||||
}
|
||||
|
||||
// Position translates the file set position into the file position.
|
||||
func (f *File) Position(p Pos) (pos FilePos) {
|
||||
if p != NoPos {
|
||||
if int(p) < f.Base || int(p) > f.Base+f.Size {
|
||||
panic("illegal Pos value")
|
||||
}
|
||||
|
||||
pos = f.position(p)
|
||||
}
|
||||
|
||||
return
|
||||
}
|
||||
|
||||
func (f *File) position(p Pos) (pos FilePos) {
|
||||
offset := int(p) - f.Base
|
||||
pos.Offset = offset
|
||||
pos.Filename, pos.Line, pos.Column = f.unpack(offset)
|
||||
|
||||
return
|
||||
}
|
||||
|
||||
func (f *File) unpack(offset int) (filename string, line, column int) {
|
||||
filename = f.Name
|
||||
if i := searchInts(f.Lines, offset); i >= 0 {
|
||||
line, column = i+1, offset-f.Lines[i]+1
|
||||
}
|
||||
|
||||
return
|
||||
}
|
||||
|
||||
func searchInts(a []int, x int) int {
|
||||
// This function body is a manually inlined version of:
|
||||
// return sort.Search(len(a), func(i int) bool { return a[i] > x }) - 1
|
||||
i, j := 0, len(a)
|
||||
for i < j {
|
||||
h := i + (j-i)/2 // avoid overflow when computing h
|
||||
// i ≤ h < j
|
||||
if a[h] <= x {
|
||||
i = h + 1
|
||||
} else {
|
||||
j = h
|
||||
}
|
||||
}
|
||||
|
||||
return i - 1
|
||||
}
|
47
vendor/github.com/d5/tengo/compiler/source/file_pos.go
generated
vendored
Normal file
47
vendor/github.com/d5/tengo/compiler/source/file_pos.go
generated
vendored
Normal file
@ -0,0 +1,47 @@
|
||||
package source
|
||||
|
||||
import "fmt"
|
||||
|
||||
// FilePos represents a position information in the file.
|
||||
type FilePos struct {
|
||||
Filename string // filename, if any
|
||||
Offset int // offset, starting at 0
|
||||
Line int // line number, starting at 1
|
||||
Column int // column number, starting at 1 (byte count)
|
||||
}
|
||||
|
||||
// IsValid returns true if the position is valid.
|
||||
func (p FilePos) IsValid() bool {
|
||||
return p.Line > 0
|
||||
}
|
||||
|
||||
// String returns a string in one of several forms:
|
||||
//
|
||||
// file:line:column valid position with file name
|
||||
// file:line valid position with file name but no column (column == 0)
|
||||
// line:column valid position without file name
|
||||
// line valid position without file name and no column (column == 0)
|
||||
// file invalid position with file name
|
||||
// - invalid position without file name
|
||||
//
|
||||
func (p FilePos) String() string {
|
||||
s := p.Filename
|
||||
|
||||
if p.IsValid() {
|
||||
if s != "" {
|
||||
s += ":"
|
||||
}
|
||||
|
||||
s += fmt.Sprintf("%d", p.Line)
|
||||
|
||||
if p.Column != 0 {
|
||||
s += fmt.Sprintf(":%d", p.Column)
|
||||
}
|
||||
}
|
||||
|
||||
if s == "" {
|
||||
s = "-"
|
||||
}
|
||||
|
||||
return s
|
||||
}
|
96
vendor/github.com/d5/tengo/compiler/source/file_set.go
generated
vendored
Normal file
96
vendor/github.com/d5/tengo/compiler/source/file_set.go
generated
vendored
Normal file
@ -0,0 +1,96 @@
|
||||
package source
|
||||
|
||||
import (
|
||||
"sort"
|
||||
)
|
||||
|
||||
// FileSet represents a set of source files.
|
||||
type FileSet struct {
|
||||
Base int // base offset for the next file
|
||||
Files []*File // list of files in the order added to the set
|
||||
LastFile *File // cache of last file looked up
|
||||
}
|
||||
|
||||
// NewFileSet creates a new file set.
|
||||
func NewFileSet() *FileSet {
|
||||
return &FileSet{
|
||||
Base: 1, // 0 == NoPos
|
||||
}
|
||||
}
|
||||
|
||||
// AddFile adds a new file in the file set.
|
||||
func (s *FileSet) AddFile(filename string, base, size int) *File {
|
||||
if base < 0 {
|
||||
base = s.Base
|
||||
}
|
||||
if base < s.Base || size < 0 {
|
||||
panic("illegal base or size")
|
||||
}
|
||||
|
||||
f := &File{
|
||||
set: s,
|
||||
Name: filename,
|
||||
Base: base,
|
||||
Size: size,
|
||||
Lines: []int{0},
|
||||
}
|
||||
|
||||
base += size + 1 // +1 because EOF also has a position
|
||||
if base < 0 {
|
||||
panic("offset overflow (> 2G of source code in file set)")
|
||||
}
|
||||
|
||||
// add the file to the file set
|
||||
s.Base = base
|
||||
s.Files = append(s.Files, f)
|
||||
s.LastFile = f
|
||||
|
||||
return f
|
||||
}
|
||||
|
||||
// File returns the file that contains the position p.
|
||||
// If no such file is found (for instance for p == NoPos),
|
||||
// the result is nil.
|
||||
//
|
||||
func (s *FileSet) File(p Pos) (f *File) {
|
||||
if p != NoPos {
|
||||
f = s.file(p)
|
||||
}
|
||||
|
||||
return
|
||||
}
|
||||
|
||||
// Position converts a Pos p in the fileset into a FilePos value.
|
||||
func (s *FileSet) Position(p Pos) (pos FilePos) {
|
||||
if p != NoPos {
|
||||
if f := s.file(p); f != nil {
|
||||
return f.position(p)
|
||||
}
|
||||
}
|
||||
|
||||
return
|
||||
}
|
||||
|
||||
func (s *FileSet) file(p Pos) *File {
|
||||
// common case: p is in last file
|
||||
if f := s.LastFile; f != nil && f.Base <= int(p) && int(p) <= f.Base+f.Size {
|
||||
return f
|
||||
}
|
||||
|
||||
// p is not in last file - search all files
|
||||
if i := searchFiles(s.Files, int(p)); i >= 0 {
|
||||
f := s.Files[i]
|
||||
|
||||
// f.base <= int(p) by definition of searchFiles
|
||||
if int(p) <= f.Base+f.Size {
|
||||
s.LastFile = f // race is ok - s.last is only a cache
|
||||
return f
|
||||
}
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
func searchFiles(a []*File, x int) int {
|
||||
return sort.Search(len(a), func(i int) bool { return a[i].Base > x }) - 1
|
||||
}
|
12
vendor/github.com/d5/tengo/compiler/source/pos.go
generated
vendored
Normal file
12
vendor/github.com/d5/tengo/compiler/source/pos.go
generated
vendored
Normal file
@ -0,0 +1,12 @@
|
||||
package source
|
||||
|
||||
// Pos represents a position in the file set.
|
||||
type Pos int
|
||||
|
||||
// NoPos represents an invalid position.
|
||||
const NoPos Pos = 0
|
||||
|
||||
// IsValid returns true if the position is valid.
|
||||
func (p Pos) IsValid() bool {
|
||||
return p != NoPos
|
||||
}
|
Reference in New Issue
Block a user