summaryrefslogtreecommitdiffstats
path: root/src/dle.c
blob: 3e291e47fdb464757edfc38a1a9fb57a76291b9f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/* $Id$ */

/***
  This file is part of ivam2.

  ivam2 is free software; you can redistribute it and/or modify it
  under the terms of the GNU General Public License as published by
  the Free Software Foundation; either version 2 of the License, or
  (at your option) any later version.
  
  ivam2 is distributed in the hope that it will be useful, but WITHOUT
  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
  License for more details.
  
  You should have received a copy of the GNU General Public License
  along with ivam2; if not, write to the Free Software Foundation,
  Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
***/

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <assert.h>

#include "dle.h"

size_t dle_decode(const uint8_t* s, size_t ls, uint8_t* d, size_t *ld, int (*dle_func) (uint8_t c, void *user), void *user, int *dle_flag) {
    size_t ns, nd;
    assert(s && ls && d && ld && *ld && dle_flag);

    for (ns = nd = 0; ns < ls && nd < *ld; ns++) {
        
        if (*dle_flag) {
            if (s[ns] == DLE)
                d[nd++] = DLE;
            else {
                if (dle_func) 
                    if (dle_func(s[ns], user) < 0) {
                        ns++;
                        break;
                    }
            }
            
            *dle_flag = 0;
        } else {
            if (s[ns] == DLE)
                *dle_flag = 1;
            else
                d[nd++] = s[ns];
        }
    }

    *ld = nd;
    return ns;
}

size_t dle_encode(const uint8_t* s, size_t ls, uint8_t* d, size_t *ld) {
    size_t ns, nd;

    for (ns = nd = 0; ns < ls && nd < *ld; ns++) {
        if (s[ns] == DLE) {
            if (nd+1 >= *ld)
                break;
            d[nd++] = DLE;
        }

        d[nd++] = s[ns];
    }

    *ld = nd;
    return ns;
}