2 NNCP -- Node to Node copy, utilities for store-and-forward data exchange
3 Copyright (C) 2016-2021 Sergey Matveev <stargrave@stargrave.org>
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, version 3 of the License.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <http://www.gnu.org/licenses/>.
30 xdr "github.com/davecgh/go-xdr/xdr2"
33 func TestTx(t *testing.T) {
38 nice, replyNice uint8,
42 data := make([]byte, dataSize)
43 if _, err := io.ReadFull(rand.Reader, data); err != nil {
47 if len(pathSrc) > int(MaxPathSize) {
48 pathSrc = pathSrc[:MaxPathSize]
51 spool, err := ioutil.TempDir("", "testtx")
55 defer os.RemoveAll(spool)
56 nodeOur, err := NewNodeGenerate()
60 nodeTgtOur, err := NewNodeGenerate()
64 nodeTgt := nodeTgtOur.Their()
67 LogPath: path.Join(spool, "log.log"),
71 Neigh: make(map[NodeId]*Node, hops),
72 Alias: make(map[string]*NodeId),
74 ctx.Neigh[*nodeOur.Id] = nodeOur.Their()
75 ctx.Neigh[*nodeTgt.Id] = nodeTgt
76 privates := make(map[NodeId]*NodeOur, int(hops)+1)
77 privates[*nodeTgt.Id] = nodeTgtOur
78 privates[*nodeOur.Id] = nodeOur
79 for i := uint8(0); i < hops; i++ {
80 node, err := NewNodeGenerate()
84 ctx.Neigh[*node.Id] = node.Their()
85 privates[*node.Id] = node
86 nodeTgt.Via = append(nodeTgt.Via, node.Id)
88 pkt, err := NewPkt(PktTypeExec, replyNice, []byte(pathSrc))
89 src := bytes.NewReader(data)
90 dstNode, _, err := ctx.Tx(
105 sentJobs := make([]Job, 0, 1)
106 for txJob := range ctx.Jobs(dstNode.Id, TTx) {
107 sentJobs = append(sentJobs, txJob)
109 if len(sentJobs) != 1 {
113 fd, err := os.Open(txJob.Path)
118 var bufR bytes.Buffer
119 if _, err = io.Copy(&bufR, fd); err != nil {
122 var bufW bytes.Buffer
123 vias := append(nodeTgt.Via, nodeTgt.Id)
124 for i, hopId := range vias {
125 hopOur := privates[*hopId]
126 _, foundNode, _, err := PktEncRead(
127 hopOur, ctx.Neigh, &bufR, &bufW, true, nil,
132 if *foundNode.Id != *nodeOur.Id {
135 bufR, bufW = bufW, bufR
138 if _, err = xdr.Unmarshal(&bufR, &pkt); err != nil {
141 if *hopId == *nodeTgt.Id {
142 if pkt.Type != PktTypeExec {
145 if pkt.Nice != replyNice {
148 if !bytes.HasPrefix(pkt.Path[:], []byte(pathSrc)) {
151 if bytes.Compare(bufR.Bytes(), []byte(data)) != 0 {
155 if pkt.Type != PktTypeTrns {
158 if bytes.Compare(pkt.Path[:MTHSize], vias[i+1][:]) != 0 {
165 if err := quick.Check(f, nil); err != nil {