2010-04-02 18:18:27 +00:00
|
|
|
/*
|
2013-04-23 20:24:30 +00:00
|
|
|
* This file is part of the libsigrok project.
|
2010-04-02 18:18:27 +00:00
|
|
|
*
|
2012-02-13 13:31:51 +00:00
|
|
|
* Copyright (C) 2010-2012 Bert Vermeulen <bert@biot.com>
|
2010-04-02 18:18:27 +00:00
|
|
|
*
|
|
|
|
* 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 3 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, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <string.h>
|
2013-01-07 00:52:02 +00:00
|
|
|
#include <glib.h>
|
2012-07-04 22:55:07 +00:00
|
|
|
#include "libsigrok.h"
|
|
|
|
#include "libsigrok-internal.h"
|
2010-04-02 18:18:27 +00:00
|
|
|
|
2012-11-11 11:44:16 +00:00
|
|
|
/* Message logging helpers with driver-specific prefix string. */
|
|
|
|
#define DRIVER_LOG_DOMAIN "filter: "
|
|
|
|
#define sr_log(l, s, args...) sr_log(l, DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
#define sr_spew(s, args...) sr_spew(DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
#define sr_dbg(s, args...) sr_dbg(DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
#define sr_info(s, args...) sr_info(DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
#define sr_warn(s, args...) sr_warn(DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
#define sr_err(s, args...) sr_err(DRIVER_LOG_DOMAIN s, ## args)
|
|
|
|
|
2012-10-21 22:30:12 +00:00
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
*
|
|
|
|
* Helper functions to filter out unused probes from samples.
|
|
|
|
*/
|
|
|
|
|
2012-10-21 14:13:36 +00:00
|
|
|
/**
|
|
|
|
* @defgroup grp_filter Probe filter
|
|
|
|
*
|
|
|
|
* Helper functions to filter out unused probes from samples.
|
|
|
|
*
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2011-02-22 22:01:29 +00:00
|
|
|
/**
|
|
|
|
* Remove unused probes from samples.
|
|
|
|
*
|
2010-04-15 18:16:53 +00:00
|
|
|
* Convert sample from maximum probes -- the way the hardware driver sent
|
2010-04-02 18:18:27 +00:00
|
|
|
* it -- to a sample taking up only as much space as required, with
|
|
|
|
* unused probes removed.
|
2011-02-22 22:01:29 +00:00
|
|
|
*
|
2011-12-22 13:10:16 +00:00
|
|
|
* The "unit size" is the number of bytes used to store probe values.
|
|
|
|
* For example, a unit size of 1 means one byte is used (which can store
|
|
|
|
* 8 probe values, each of them is 1 bit). A unit size of 2 means we can
|
|
|
|
* store 16 probe values, 3 means we can store 24 probe values, and so on.
|
|
|
|
*
|
|
|
|
* If the data coming from the logic analyzer has a unit size of 4 for
|
|
|
|
* example (as the device has 32 probes), but only 2 of them are actually
|
|
|
|
* used in an acquisition, this function can convert the samples to only
|
|
|
|
* use up 1 byte per sample (unit size = 1) instead of 4 bytes per sample.
|
|
|
|
*
|
|
|
|
* The output will contain the probe values in the order specified via the
|
|
|
|
* probelist. For example, if in_unitsize = 4, probelist = [5, 16, 30], and
|
|
|
|
* out_unitsize = 1, then the output samples (each of them one byte in size)
|
|
|
|
* will have the following format: bit 0 = value of probe 5, bit 1 = value
|
|
|
|
* of probe 16, bit 2 = value of probe 30. Unused bit(s) in the output byte(s)
|
|
|
|
* are zero.
|
|
|
|
*
|
|
|
|
* The caller must make sure that length_in is not bigger than the memory
|
|
|
|
* actually allocated for the input data (data_in), as this function does
|
|
|
|
* not check that.
|
|
|
|
*
|
|
|
|
* @param in_unitsize The unit size (>= 1) of the input (data_in).
|
|
|
|
* @param out_unitsize The unit size (>= 1) the output shall have (data_out).
|
2011-12-23 14:26:54 +00:00
|
|
|
* The requested unit size must be big enough to hold as
|
|
|
|
* much data as is specified by the number of enabled
|
|
|
|
* probes in 'probelist'.
|
2013-04-06 17:18:37 +00:00
|
|
|
* @param probe_array Pointer to a list of probe numbers, numbered starting
|
|
|
|
* from 0. The list is terminated with -1.
|
2011-12-22 13:10:16 +00:00
|
|
|
* @param data_in Pointer to the input data buffer. Must not be NULL.
|
|
|
|
* @param length_in The input data length (>= 1), in number of bytes.
|
|
|
|
* @param data_out Variable which will point to the newly allocated buffer
|
|
|
|
* of output data. The caller is responsible for g_free()'ing
|
|
|
|
* the buffer when it's no longer needed. Must not be NULL.
|
|
|
|
* @param length_out Pointer to the variable which will contain the output
|
|
|
|
* data length (in number of bytes) when the function
|
|
|
|
* returns SR_OK. Must not be NULL.
|
|
|
|
*
|
|
|
|
* @return SR_OK upon success, SR_ERR_MALLOC upon memory allocation errors,
|
|
|
|
* or SR_ERR_ARG upon invalid arguments.
|
|
|
|
* If something other than SR_OK is returned, the values of
|
|
|
|
* out_unitsize, data_out, and length_out are undefined.
|
2013-04-13 16:58:11 +00:00
|
|
|
*
|
|
|
|
* @since 0.1.0 (but the API changed in 0.2.0)
|
2010-04-02 18:18:27 +00:00
|
|
|
*/
|
2013-01-07 00:52:02 +00:00
|
|
|
SR_API int sr_filter_probes(unsigned int in_unitsize, unsigned int out_unitsize,
|
|
|
|
const GArray *probe_array, const uint8_t *data_in,
|
2012-03-28 18:00:13 +00:00
|
|
|
uint64_t length_in, uint8_t **data_out,
|
2012-02-01 22:40:35 +00:00
|
|
|
uint64_t *length_out)
|
2010-04-02 18:18:27 +00:00
|
|
|
{
|
2010-04-09 20:18:46 +00:00
|
|
|
unsigned int in_offset, out_offset;
|
2013-01-07 00:52:02 +00:00
|
|
|
int *probelist, out_bit;
|
|
|
|
unsigned int i;
|
2010-04-02 18:18:27 +00:00
|
|
|
uint64_t sample_in, sample_out;
|
|
|
|
|
2013-01-07 00:52:02 +00:00
|
|
|
if (!probe_array) {
|
|
|
|
sr_err("%s: probe_array was NULL", __func__);
|
2011-12-22 13:10:16 +00:00
|
|
|
return SR_ERR_ARG;
|
|
|
|
}
|
2013-01-07 00:52:02 +00:00
|
|
|
probelist = (int *)probe_array->data;
|
2011-12-22 13:10:16 +00:00
|
|
|
|
|
|
|
if (!data_in) {
|
2012-11-11 11:44:16 +00:00
|
|
|
sr_err("%s: data_in was NULL", __func__);
|
2011-12-22 13:10:16 +00:00
|
|
|
return SR_ERR_ARG;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!data_out) {
|
2012-11-11 11:44:16 +00:00
|
|
|
sr_err("%s: data_out was NULL", __func__);
|
2011-12-22 13:10:16 +00:00
|
|
|
return SR_ERR_ARG;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!length_out) {
|
2012-11-11 11:44:16 +00:00
|
|
|
sr_err("%s: length_out was NULL", __func__);
|
2011-12-22 13:10:16 +00:00
|
|
|
return SR_ERR_ARG;
|
|
|
|
}
|
|
|
|
|
2011-12-23 14:26:54 +00:00
|
|
|
/* Are there more probes than the target unit size supports? */
|
2013-01-07 00:52:02 +00:00
|
|
|
if (probe_array->len > out_unitsize * 8) {
|
2012-11-11 11:44:16 +00:00
|
|
|
sr_err("%s: too many probes (%d) for the target unit "
|
2013-01-07 00:52:02 +00:00
|
|
|
"size (%d)", __func__, probe_array->len, out_unitsize);
|
2011-12-23 14:26:54 +00:00
|
|
|
return SR_ERR_ARG;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(*data_out = g_try_malloc(length_in))) {
|
2012-11-11 11:44:16 +00:00
|
|
|
sr_err("%s: data_out malloc failed", __func__);
|
2011-12-23 14:26:54 +00:00
|
|
|
return SR_ERR_MALLOC;
|
|
|
|
}
|
|
|
|
|
2013-01-07 00:52:02 +00:00
|
|
|
if (probe_array->len == in_unitsize * 8) {
|
2010-04-15 18:16:53 +00:00
|
|
|
/* All probes are used -- no need to compress anything. */
|
2010-04-02 18:18:27 +00:00
|
|
|
memcpy(*data_out, data_in, length_in);
|
|
|
|
*length_out = length_in;
|
2011-01-29 15:23:12 +00:00
|
|
|
return SR_OK;
|
2010-05-09 17:36:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* If we reached this point, not all probes are used, so "compress". */
|
|
|
|
in_offset = out_offset = 0;
|
|
|
|
while (in_offset <= length_in - in_unitsize) {
|
|
|
|
memcpy(&sample_in, data_in + in_offset, in_unitsize);
|
|
|
|
sample_out = out_bit = 0;
|
2013-01-07 00:52:02 +00:00
|
|
|
for (i = 0; i < probe_array->len; i++) {
|
2012-07-23 00:57:17 +00:00
|
|
|
if (sample_in & (1 << (probelist[i])))
|
2010-05-09 17:36:43 +00:00
|
|
|
sample_out |= (1 << out_bit);
|
|
|
|
out_bit++;
|
|
|
|
}
|
|
|
|
memcpy((*data_out) + out_offset, &sample_out, out_unitsize);
|
|
|
|
in_offset += in_unitsize;
|
|
|
|
out_offset += out_unitsize;
|
2010-04-02 18:18:27 +00:00
|
|
|
}
|
2010-05-09 17:36:43 +00:00
|
|
|
*length_out = out_offset;
|
2010-04-02 18:18:27 +00:00
|
|
|
|
2011-01-29 15:23:12 +00:00
|
|
|
return SR_OK;
|
2010-04-02 18:18:27 +00:00
|
|
|
}
|
2012-10-21 14:13:36 +00:00
|
|
|
|
|
|
|
/** @} */
|