-
Notifications
You must be signed in to change notification settings - Fork 0
/
BitVecUtilsC.nc
123 lines (98 loc) · 3.11 KB
/
BitVecUtilsC.nc
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/*
* "Copyright (c) 2000-2004 The Regents of the University of California.
* All rights reserved.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose, without fee, and without written agreement is
* hereby granted, provided that the above copyright notice, the following
* two paragraphs and the author appear in all copies of this software.
*
* IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF
* CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
* ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS."
*/
/**
* Provides generic methods for manipulating bit vectors.
*
* @author Jonathan Hui <[email protected]>
*/
#include "BitVecUtils.h"
module BitVecUtilsC {
provides interface BitVecUtils;
}
implementation {
command error_t BitVecUtils.indexOf(uint16_t* pResult, uint16_t fromIndex,
uint8_t* bitVec, uint16_t length) {
uint16_t i = fromIndex;
if (length == 0)
return FAIL;
do {
if (BITVEC_GET(bitVec, i)) {
*pResult = i;
return SUCCESS;
}
i = (i+1) % length;
} while (i != fromIndex);
return FAIL;
}
command error_t BitVecUtils.findZero(uint16_t* pResult, uint16_t fromIndex,
uint8_t* bitVec, uint16_t length) {
uint16_t i = fromIndex;
if (length == 0)
return FAIL;
do {
if (!BITVEC_GET(bitVec, i)) {
*pResult = i;
return SUCCESS;
}
i = (i+1) % length;
} while (i != fromIndex);
return FAIL;
}
command error_t BitVecUtils.findIndex(uint16_t* pResult, uint16_t index,
uint8_t* bitVec, uint16_t length) {
uint16_t i = 0;
uint16_t j = 0;
if (length == 0)
return FAIL;
do {
if (BITVEC_GET(bitVec, i)) {
if (j== index){
*pResult = i;
return SUCCESS;
}
j++;
}
i = i+1;
} while (i < length);
return FAIL;
}
command error_t BitVecUtils.countOnes(uint16_t* pResult, uint8_t* bitVec, uint16_t length) {
int count = 0;
int i;
for ( i = 0; i < length; i++ ) {
if (BITVEC_GET(bitVec, i))
count++;
}
*pResult = count;
return SUCCESS;
}
command void BitVecUtils.printBitVec(char* buf, uint8_t* bitVec, uint16_t length) {
#ifdef PLATFORM_PC
uint16_t i;
dbg(DBG_TEMP, "");
for ( i = 0; i < length; i++ ) {
sprintf(buf++, "%d", !!BITVEC_GET(bitVec, i));
}
#endif
}
command void BitVecUtils.checkImg(bool* res, uint8_t* bitVec, uint16_t length){
}
}