Searched refs:array (Results 1 – 5 of 5) sorted by relevance
| /lib/libc/minimal/source/stdlib/ |
| A D | bsearch.c | 22 void *bsearch(const void *key, const void *array, size_t count, size_t size, in bsearch() argument
33 pivot = (const char *)array + index * size; in bsearch()
|
| /lib/heap/ |
| A D | Kconfig | 56 int "Size of array to store heap pointers"
59 The size of the internal array to store heap pointers. The array
61 One can then iterate through the array to get all heaps statistics
64 The default array size is zero, which disables the feature.
|
| /lib/utils/ |
| A D | json.c | 860 return arr_parse(obj, descr->array.element_descr, in decode_value()
861 descr->array.n_elements, field, val); in decode_value()
963 size = descr->array.n_elements * get_elem_size(descr->array.element_descr); in get_elem_size()
1007 elem_descr = elem_descr->array.element_descr; in arr_parse()
1168 return arr_parse(&arr, descr->array.element_descr, in json_arr_parse()
1169 descr->array.n_elements, ptr, val); in json_arr_parse()
1329 elem_descr = elem_descr->array.element_descr; in arr_encode()
1639 return arr_encode(descr->array.element_descr, ptr, in encode()
1857 size_t actual_n_elements = elem->array.n_elements; in decode_mixed_value()
2046 field_ptr = (char *)val + descr[elem_idx].array.offset; in mixed_arr_parse()
[all …]
|
| /lib/libc/minimal/include/ |
| A D | stdlib.h | 35 void *bsearch(const void *key, const void *array,
|
| /lib/posix/options/ |
| A D | Kconfig.proc1 | 33 The sysconf() function is implemented as a large integer-integer array. The advantage if this
|
Completed in 16 milliseconds