-
Notifications
You must be signed in to change notification settings - Fork 33
Misc fixes for qrild #21
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Changes from 1 commit
ca18508
d86dacc
4246d2a
9e9b6ba
8ade7c5
b501651
bec5bb2
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -38,7 +38,7 @@ void qlog(int priority, const char *format, ...) __PRINTF__(2, 3); | |
| } while(0) | ||
|
|
||
| #ifdef __cplusplus | ||
| extern "C" { | ||
|
||
| } | ||
| #endif | ||
|
|
||
| #endif | ||
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,282 @@ | ||
| #include <errno.h> | ||
| #include <string.h> | ||
| #include <stdint.h> | ||
| #include <stdlib.h> | ||
| #include <stdbool.h> | ||
| #include <stdio.h> | ||
|
|
||
| #include "libqrtr.h" | ||
|
|
||
| struct qmi_tlv { | ||
| void *allocated; | ||
| void *buf; | ||
| size_t size; | ||
| int error; | ||
| }; | ||
|
|
||
| struct qmi_tlv_item { | ||
| uint8_t key; | ||
| uint16_t len; | ||
| uint8_t data[]; | ||
| } __attribute__((__packed__)); | ||
|
|
||
| struct qmi_tlv *qmi_tlv_init(uint16_t txn, uint32_t msg_id, uint32_t msg_type) | ||
| { | ||
| struct qmi_header *pkt; | ||
| struct qmi_tlv *tlv; | ||
|
|
||
| tlv = malloc(sizeof(struct qmi_tlv)); | ||
| memset(tlv, 0, sizeof(struct qmi_tlv)); | ||
|
|
||
| tlv->size = sizeof(struct qmi_header); | ||
| tlv->allocated = malloc(tlv->size); | ||
| tlv->buf = tlv->allocated; | ||
|
|
||
| pkt = tlv->buf; | ||
| pkt->type = msg_type; | ||
| pkt->txn_id = txn; | ||
| pkt->msg_id = msg_id; | ||
| pkt->msg_len = 0; | ||
|
|
||
| return tlv; | ||
| } | ||
|
|
||
| struct qmi_tlv *qmi_tlv_decode(void *buf, size_t len) | ||
| { | ||
| struct qmi_header *pkt = buf; | ||
| struct qmi_tlv *tlv; | ||
|
|
||
| tlv = malloc(sizeof(struct qmi_tlv)); | ||
| memset(tlv, 0, sizeof(struct qmi_tlv)); | ||
|
|
||
| tlv->buf = buf; | ||
| tlv->size = len; | ||
|
|
||
| return tlv; | ||
| } | ||
|
|
||
| void *qmi_tlv_encode(struct qmi_tlv *tlv, size_t *len) | ||
| { | ||
| struct qmi_header *pkt; | ||
|
|
||
| if (!tlv || tlv->error) | ||
| return NULL; | ||
|
|
||
| pkt = tlv->buf; | ||
| pkt->msg_len = tlv->size - sizeof(struct qmi_header); | ||
|
|
||
| *len = tlv->size; | ||
| return tlv->buf; | ||
| } | ||
|
|
||
| void qmi_tlv_free(struct qmi_tlv *tlv) | ||
| { | ||
| free(tlv->allocated); | ||
| free(tlv); | ||
| } | ||
|
|
||
| static struct qmi_tlv_item *qmi_tlv_get_item(struct qmi_tlv *tlv, unsigned id) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
| struct qmi_header *pkt; | ||
| unsigned offset = 0; | ||
| void *pkt_data; | ||
|
|
||
| pkt = tlv->buf; | ||
| pkt_data = &pkt[1]; | ||
|
|
||
| while (offset < tlv->size) { | ||
| item = pkt_data + offset; | ||
| if (item->key == id) | ||
| return pkt_data + offset; | ||
|
|
||
| offset += sizeof(struct qmi_tlv_item) + item->len; | ||
| } | ||
| return NULL; | ||
| } | ||
|
|
||
| void *qmi_tlv_get(struct qmi_tlv *tlv, uint8_t id, size_t *len) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
|
|
||
| item = qmi_tlv_get_item(tlv, id); | ||
| if (!item) | ||
| return NULL; | ||
|
|
||
| if (len) | ||
| *len = item->len; | ||
| return item->data; | ||
| } | ||
|
|
||
| void *qmi_tlv_get_array(struct qmi_tlv *tlv, uint8_t id, size_t len_size, | ||
| size_t *len, size_t *size) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
| unsigned count; | ||
| void *ptr; | ||
|
|
||
| item = qmi_tlv_get_item(tlv, id); | ||
| if (!item) | ||
| return NULL; | ||
|
|
||
| ptr = item->data; | ||
| switch (len_size) { | ||
| case 4: | ||
| count = *(uint32_t *)ptr++; | ||
| break; | ||
| case 2: | ||
| count = *(uint16_t *)ptr++; | ||
| break; | ||
| case 1: | ||
| count = *(uint8_t *)ptr++; | ||
| break; | ||
| default: | ||
| return NULL; | ||
| } | ||
|
|
||
| *len = count; | ||
| *size = (item->len - len_size) / count; | ||
|
|
||
| return ptr; | ||
| } | ||
|
|
||
| static struct qmi_tlv_item *qmi_tlv_alloc_item(struct qmi_tlv *tlv, unsigned id, | ||
| size_t len) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
| size_t new_size; | ||
| bool migrate; | ||
| void *newp; | ||
|
|
||
| /* If using user provided buffer, migrate data */ | ||
| migrate = !tlv->allocated; | ||
|
|
||
| new_size = tlv->size + sizeof(struct qmi_tlv_item) + len; | ||
| newp = realloc(tlv->allocated, new_size); | ||
| if (!newp) | ||
| return NULL; | ||
|
|
||
| if (migrate) | ||
| memcpy(newp, tlv->buf, tlv->size); | ||
|
|
||
| item = newp + tlv->size; | ||
| item->key = id; | ||
| item->len = len; | ||
|
|
||
| tlv->buf = tlv->allocated = newp; | ||
| tlv->size = new_size; | ||
|
|
||
| return item; | ||
| } | ||
|
|
||
| int qmi_tlv_set(struct qmi_tlv *tlv, uint8_t id, void *buf, size_t len) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
|
|
||
| if (!tlv) | ||
| return -EINVAL; | ||
|
|
||
| item = qmi_tlv_alloc_item(tlv, id, len); | ||
| if (!item) { | ||
| tlv->error = ENOMEM; | ||
| return -ENOMEM; | ||
| } | ||
|
|
||
| memcpy(item->data, buf, len); | ||
|
|
||
| return 0; | ||
| } | ||
|
|
||
| int qmi_tlv_set_array(struct qmi_tlv *tlv, uint8_t id, size_t len_size, | ||
| void *buf, size_t len, size_t size) | ||
| { | ||
| struct qmi_tlv_item *item; | ||
| size_t array_size; | ||
| void *ptr; | ||
|
|
||
| if (!tlv) | ||
| return -EINVAL; | ||
|
|
||
| array_size = len * size; | ||
| item = qmi_tlv_alloc_item(tlv, id, len_size + array_size); | ||
| if (!item) { | ||
| tlv->error = ENOMEM; | ||
| return -ENOMEM; | ||
| } | ||
|
|
||
| ptr = item->data; | ||
|
|
||
| switch (len_size) { | ||
| case 4: | ||
| *(uint32_t *)ptr++ = len; | ||
| break; | ||
| case 2: | ||
| *(uint16_t *)ptr++ = len; | ||
| break; | ||
| case 1: | ||
| *(uint8_t *)ptr++ = len; | ||
| break; | ||
| } | ||
| memcpy(ptr, buf, array_size); | ||
|
|
||
| return 0; | ||
| } | ||
|
|
||
| struct qmi_response_type_v01 *qmi_tlv_get_result(struct qmi_tlv *tlv) | ||
| { | ||
| return qmi_tlv_get(tlv, 2, NULL); | ||
| } | ||
|
|
||
| #define MIN(x, y) ((x) < (y) ? (x) : (y)) | ||
| #define LINE_LENGTH 64 | ||
|
|
||
| static inline uint8_t to_hex(uint8_t ch) | ||
| { | ||
| ch &= 0xf; | ||
| return ch <= 9 ? '0' + ch : 'a' + ch - 10; | ||
| } | ||
|
|
||
| void qmi_tlv_dump(struct qmi_tlv *tlv) { | ||
| struct qmi_tlv_item *item; | ||
| struct qmi_header *pkt; | ||
| unsigned offset = 0; | ||
| void *pkt_data; | ||
| int i = 0, li, j, k; | ||
| uint8_t ch; | ||
| size_t linelen; | ||
| char line[LINE_LENGTH * 4 + 1]; | ||
|
|
||
| pkt = tlv->buf; | ||
| pkt_data = &pkt[1]; | ||
|
|
||
| printf("<<< Message:\n"); | ||
| printf("<<< type : %u\n", pkt->type); | ||
| printf("<<< msg_len : %u\n", pkt->msg_len); | ||
| printf("<<< msg_id : 0x%04x\n", pkt->msg_id); | ||
| printf("<<< txn_id : %u\n", pkt->txn_id); | ||
| printf("<<< TLVs:\n"); | ||
|
||
| while (offset < tlv->size - sizeof(struct qmi_header)) { | ||
| item = pkt_data + offset; | ||
| printf("<<< TLV %d: {id: 0x%02x, len: 0x%02x}\n", i, item->key, item->len); | ||
| if (item->len > pkt->msg_len - offset) { | ||
| fprintf(stderr, "Invalid item length!\n"); | ||
| return; | ||
| } | ||
| for (j = 0; j < item->len; j += LINE_LENGTH) { | ||
| linelen = MIN(LINE_LENGTH, item->len - j); | ||
| li = 0; | ||
|
|
||
| for (k = 0; k < linelen; k++) { | ||
| ch = item->data[j + k]; | ||
| line[li++] = to_hex(ch >> 4); | ||
| line[li++] = to_hex(ch); | ||
| line[li++] = k < linelen - 1 ? ':' : ' '; | ||
| } | ||
| line[li] = '\0'; | ||
|
|
||
| printf("%s\n\n", line); | ||
| } | ||
| offset += sizeof(struct qmi_tlv_item) + item->len; | ||
| i++; | ||
| } | ||
| } | ||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'd say, also squash