Function OD_find

301/CO_ODinterface.c:139–174

}

OD_entry_t*
OD_find(OD_t* od, uint16_t index) {
    if ((od == NULL) || (od->size == 0U)) {
        return NULL;
    }

    uint16_t min = 0;
    uint16_t max = od->size - 1U;

    /* Fast search in ordered Object Dictionary. If indexes are mixed, this won't work. If Object
     * Dictionary has up to N entries, then the max number of loop passes is log2(N) */
    while (min < max) {
        /* get entry between min and max */
        uint16_t cur = (min + max) >> 1;
        OD_entry_t* entry = &od->list[cur];

        if (index == entry->index) {
            return entry;
        }

        if (index < entry->index) {
            max = (cur > 0U) ? (cur - 1U) : cur;
        } else {
            min = cur + 1U;
        }
    }

    if (min == max) {
        OD_entry_t* entry = &od->list[min];
        if (index == entry->index) {
            return entry;
        }
    }

    return NULL; /* entry does not exist in OD */
}

ODR_t
OD_getSub(const OD_entry_t* entry, uint8_t subIndex, OD_IO_t* io, bool_t odOrig) {