Ivan Kluchnikov | 962f97b | 2012-04-30 17:51:23 +0400 | [diff] [blame] | 1 | /* bitvector.cpp |
| 2 | * |
| 3 | * Copyright (C) 2012 Ivan Klyuchnikov |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or |
| 6 | * modify it under the terms of the GNU General Public License |
| 7 | * as published by the Free Software Foundation; either version 2 |
| 8 | * of the License, or (at your option) any later version. |
| 9 | * |
| 10 | * This program is distributed in the hope that it will be useful, |
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 13 | * GNU General Public License for more details. |
| 14 | * |
| 15 | * You should have received a copy of the GNU General Public License |
| 16 | * along with this program; if not, write to the Free Software |
| 17 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| 18 | */ |
| 19 | |
| 20 | /*! \addtogroup bitvector |
| 21 | * @{ |
| 22 | */ |
| 23 | |
| 24 | /*! \file bitvector.cpp |
| 25 | * \brief Additional functions for Osmocom bit vector abstraction. |
| 26 | */ |
| 27 | |
| 28 | #include <bitvector.h> |
| 29 | extern "C" { |
| 30 | #include <osmocom/core/talloc.h> |
| 31 | } |
| 32 | |
| 33 | void *bv_tall_ctx; |
| 34 | |
| 35 | struct bitvec *bitvec_alloc(unsigned size) |
| 36 | { |
| 37 | struct bitvec *bv = talloc_zero(bv_tall_ctx, struct bitvec); |
| 38 | bv->data_len = size; |
| 39 | bv->cur_bit = 0; |
| 40 | bv->data = talloc_zero_array(bv_tall_ctx, uint8_t, size); |
| 41 | return bv; |
| 42 | } |
| 43 | |
| 44 | void bitvec_free(struct bitvec *bv) |
| 45 | { |
| 46 | talloc_free(bv->data); |
| 47 | talloc_free(bv); |
| 48 | } |
| 49 | |
| 50 | int bitvec_pack(struct bitvec *bv, uint8_t *buffer) |
| 51 | { |
| 52 | int i = 0; |
| 53 | for (i = 0; i < bv->data_len; i++) |
| 54 | { |
| 55 | buffer[i] = bv->data[i]; |
| 56 | } |
| 57 | return i; |
| 58 | } |
| 59 | |
| 60 | int bitvec_unpack(struct bitvec *bv, uint8_t *buffer) |
| 61 | { |
| 62 | int i = 0; |
| 63 | for (i = 0; i < bv->data_len; i++) |
| 64 | { |
| 65 | bv->data[i] = buffer[i]; |
| 66 | } |
| 67 | return i; |
| 68 | } |
| 69 | |
| 70 | |
| 71 | int bitvec_unhex(struct bitvec *bv, const char* src) |
| 72 | { |
| 73 | unsigned val; |
| 74 | unsigned write_index = 0; |
| 75 | unsigned digits = bv->data_len*2; |
| 76 | for (unsigned i=0; i<digits; i++) { |
| 77 | if (sscanf(src+i, "%1x", &val) < 1) { |
| 78 | return 1; |
| 79 | } |
| 80 | bitvec_write_field(bv, write_index,val, 4); |
| 81 | } |
| 82 | return 0; |
| 83 | } |
| 84 | |
| 85 | uint64_t bitvec_read_field(struct bitvec *bv, unsigned& read_index, unsigned len) |
| 86 | { |
| 87 | int i; |
| 88 | uint64_t ui = 0; |
| 89 | bv->cur_bit = read_index; |
| 90 | |
| 91 | for (i = 0; i < len; i++) { |
| 92 | int bit = bitvec_get_bit_pos((const struct bitvec *)bv, bv->cur_bit); |
| 93 | if (bit < 0) |
| 94 | return bit; |
| 95 | if (bit) |
| 96 | ui |= ((uint64_t)1 << (len - i - 1)); |
| 97 | bv->cur_bit++; |
| 98 | } |
| 99 | read_index += len; |
| 100 | return ui; |
| 101 | } |
| 102 | |
| 103 | |
| 104 | int bitvec_write_field(struct bitvec *bv, unsigned& write_index, uint64_t val, unsigned len) |
| 105 | { |
| 106 | int i, rc; |
| 107 | bv->cur_bit = write_index; |
| 108 | for (i = 0; i < len; i++) { |
| 109 | int bit = 0; |
| 110 | if (val & ((uint64_t)1 << (len - i - 1))) |
| 111 | bit = 1; |
| 112 | rc = bitvec_set_bit(bv, (bit_value)bit); |
| 113 | if (rc) |
| 114 | return rc; |
| 115 | } |
| 116 | write_index += len; |
| 117 | return 0; |
| 118 | } |