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
|
/* $Id$ */
/*
* Copyright (C) 2008-2009 Teluu Inc. (http://www.teluu.com)
* Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* THIS FILE IS INCLUDED BY scanner.c.
* DO NOT COMPILE THIS FILE ALONE!
*/
PJ_DEF(void) pj_cis_buf_init( pj_cis_buf_t *cis_buf)
{
pj_bzero(cis_buf->cis_buf, sizeof(cis_buf->cis_buf));
cis_buf->use_mask = 0;
}
PJ_DEF(pj_status_t) pj_cis_init(pj_cis_buf_t *cis_buf, pj_cis_t *cis)
{
unsigned i;
cis->cis_buf = cis_buf->cis_buf;
for (i=0; i<PJ_CIS_MAX_INDEX; ++i) {
if ((cis_buf->use_mask & (1 << i)) == 0) {
cis->cis_id = i;
cis_buf->use_mask |= (1 << i);
return PJ_SUCCESS;
}
}
cis->cis_id = PJ_CIS_MAX_INDEX;
return PJ_ETOOMANY;
}
PJ_DEF(pj_status_t) pj_cis_dup( pj_cis_t *new_cis, pj_cis_t *existing)
{
pj_status_t status;
unsigned i;
/* Warning: typecasting here! */
status = pj_cis_init((pj_cis_buf_t*)existing->cis_buf, new_cis);
if (status != PJ_SUCCESS)
return status;
for (i=0; i<256; ++i) {
if (PJ_CIS_ISSET(existing, i))
PJ_CIS_SET(new_cis, i);
else
PJ_CIS_CLR(new_cis, i);
}
return PJ_SUCCESS;
}
|
