Esempio n. 1
0
int uei_508_read_record(int m_port, char *m_buf, size_t m_buflen, const char *m_delim, uint32_t m_delimlen)
{
    ph_buf_t *tmp_buf;

    if ((tmp_buf = ph_bufq_consume_record(SL508_read_buffer[m_port], m_delim, m_delimlen))) {
        size_t len = min((size_t)ph_buf_len(tmp_buf), m_buflen);
        if (len) memcpy(m_buf, ph_buf_mem(tmp_buf), len);
        ph_buf_delref(tmp_buf);
        return len;
    } else {
        return 0;
    }
}
Esempio n. 2
0
static void test_straddle_edges(void)
{
  const char *delim = "\r\n";
  int delim_len = strlen(delim);
  int default_buf_size = 8192;
  int i;
  char pad[8192];

  memset(pad, 'x', sizeof(pad));
#define PAD_IT(__n) { \
  uint64_t n = __n; \
  while (n > 0) { \
    ph_bufq_append(q, pad, MIN(n, sizeof(pad)), 0); \
    n -= MIN(n, sizeof(pad)); \
  } \
}

  // We want two buffers: [8192][8192]
  // And then to place our delimiter around the first boundary to verify
  // that the delimiter matching operates correctly
  // We define a cursor offset relative to the end of the first buffer
  // (0 means the last byte of the delimiter is in the last byte of the
  // first buffer, 1 means that the last delimiter byte is in the first
  // byte of the second buffer)

  for (i = - 2 * delim_len; i < 2 * delim_len; i++) {
    ph_bufq_t *q;

    q = ph_bufq_new(16*1024);

    // Fill up the start of the buffer
    uint64_t num_first = default_buf_size + i - delim_len;

    // first data
    PAD_IT(num_first);
    is(num_first, ph_bufq_len(q));
    // first delim
    ph_bufq_append(q, delim, delim_len, 0);

    // second data
    PAD_IT(16);
    // second delim
    ph_bufq_append(q, delim, delim_len, 0);

    ph_buf_t *first = ph_bufq_consume_record(q, delim, delim_len);
    is_int(num_first + 2, ph_buf_len(first));

    ph_buf_t *second = ph_bufq_consume_record(q, delim, delim_len);
    is_int(18, ph_buf_len(second));

    diag("for i = %d, num_first = %d.  first->len=%d second->len=%d",
        i, (int)num_first, (int)ph_buf_len(first), (int)ph_buf_len(second));

    ph_buf_delref(first);
    ph_buf_delref(second);

    ph_bufq_free(q);
  }

  // Now, test the case where we have a partial match at a boundary, but not
  // the true match until later

  ph_bufq_t *q;

  q = ph_bufq_new(24*1024);
  PAD_IT(8191);
  ph_bufq_append(q, "\r", 1, 0);
  PAD_IT(8192);
  ph_bufq_append(q, delim, delim_len, 0);

  ph_buf_t *first = ph_bufq_consume_record(q, delim, delim_len);
  is_int(16386, ph_buf_len(first));

  ph_buf_delref(first);
  ph_bufq_free(q);
}