| /third_party/musl/libc-test/src/functional/ |
| H A D | search_lsearch.c | 10 static size_t nel; variable
13 char *r = lsearch(k, tab, &nel, W, (int(*)(const void*,const void*))strcmp); \
18 #define get(k) lfind(k, tab, &nel, W, (int(*)(const void*,const void*))strcmp)
38 n = nel; in main()
40 if (nel != n) in main()
41 t_error("lsearch g should not modify the table size (%d, was %d)\n", nel, n); in main()
42 n = nel; in main()
44 if (nel != n+1) in main()
45 t_error("lsearch j should increase the table size (%d, was %d)\n", nel, n); in main()
|
| /third_party/musl/porting/uniproton/kernel/src/stdlib/ |
| H A D | bsearch.c | 3 void *bsearch(const void *key, const void *base, size_t nel, size_t width, int (*cmp)(const void *, const void *))
in bsearch() argument
7 while (nel > 0) {
in bsearch()
8 try = (char *)base + width*(nel/2);
in bsearch()
11 nel /= 2;
in bsearch()
14 nel -= nel/2+1;
in bsearch()
|
| /third_party/musl/src/stdlib/ |
| H A D | bsearch.c | 3 void *bsearch(const void *key, const void *base, size_t nel, size_t width, int (*cmp)(const void *, const void *)) in bsearch() argument
7 while (nel > 0) { in bsearch()
8 try = (char *)base + width*(nel/2); in bsearch()
11 nel /= 2; in bsearch()
14 nel -= nel/2+1; in bsearch()
|
| H A D | qsort_nr.c | 11 void qsort(void *base, size_t nel, size_t width, cmpfun cmp) in qsort() argument
13 __qsort_r(base, nel, width, wrapper_cmp, (void *)cmp); in qsort()
|
| H A D | qsort.c | 158 void __qsort_r(void *base, size_t nel, size_t width, cmpfun cmp, void *arg) in __qsort_r() argument
161 size_t i, size = width * nel; in __qsort_r()
|
| /third_party/musl/porting/liteos_m/kernel/src/stdlib/ |
| H A D | bsearch.c | 3 void *bsearch(const void *key, const void *base, size_t nel, size_t width, int (*cmp)(const void *, const void *))
in bsearch() argument
7 while (nel > 0) {
in bsearch()
8 try = (char *)base + width*(nel/2);
in bsearch()
11 nel /= 2;
in bsearch()
14 nel -= nel/2+1;
in bsearch()
|
| /third_party/musl/src/search/ |
| H A D | hsearch.c | 40 static int resize(size_t nel, struct hsearch_data *htab) in resize() argument
48 if (nel > MAXSIZE) in resize()
49 nel = MAXSIZE; in resize()
50 for (newsize = MINSIZE; newsize < nel; newsize *= 2); in resize()
72 int hcreate(size_t nel) in hcreate() argument
74 return __hcreate_r(nel, &htab); in hcreate()
103 static int __hcreate_r(size_t nel, struct hsearch_data *htab) in __hcreate_r() argument
110 r = resize(nel, htab); in __hcreate_r()
|
| /third_party/musl/porting/liteos_a/user/src/stdlib/ |
| H A D | qsort.c | 46 void __qsort_r(void *base, size_t nel, size_t width, cmpfun cmp, void *arg) in __qsort_r() argument
52 if (width == 0 || base == NULL || nel == 0) { in __qsort_r()
57 end = start + (nel - 1) * width; in __qsort_r()
59 if (nel < 7) { // insertion sort in __qsort_r()
76 m = start + (nel >> 1) * width; in __qsort_r()
111 nel = (end - start) / width + 1; in __qsort_r()
119 nel = (end - start) / width + 1; in __qsort_r()
|
| /third_party/musl/src/stdlib/liteos_a/ |
| H A D | qsort.c | 46 void __qsort_r(void *base, size_t nel, size_t width, cmpfun cmp, void *arg) in __qsort_r() argument
52 if (width == 0 || base == NULL || nel == 0) { in __qsort_r()
57 end = start + (nel - 1) * width; in __qsort_r()
59 if (nel < 7) { // insertion sort in __qsort_r()
76 m = start + (nel >> 1) * width; in __qsort_r()
111 nel = (end - start) / width + 1; in __qsort_r()
119 nel = (end - start) / width + 1; in __qsort_r()
|
| /third_party/selinux/libsepol/src/ |
| H A D | write.c | 107 unsigned merge, unsigned commit, uint32_t * nel) in avtab_write_item()
185 if (nel) in avtab_write_item()
186 (*nel)--; /* one less node */ in avtab_write_item()
285 uint32_t nel; in avtab_write() local
294 and compute the final nel. */ in avtab_write()
303 nel = a->nel; in avtab_write()
305 /* New avtab format. nel is good to go. */ in avtab_write()
306 nel = cpu_to_le32(a->nel); in avtab_write()
105 avtab_write_item(policydb_t * p, avtab_ptr_t cur, struct policy_file *fp, unsigned merge, unsigned commit, uint32_t * nel) avtab_write_item() argument
509 size_t nel, items; role_trans_write() local
553 size_t nel, items; role_allow_write() local
1354 size_t nel, items, len; ocontext_write_xen() local
1462 size_t nel, items, len; ocontext_write_selinux() local
1607 size_t nel = 0, items, len; genfs_write() local
1654 size_t nel; global() member
1795 size_t nel = ARRAY_SIZE(avrule->xperms->perms); avrule_write() local
1881 int nel = 0; role_trans_rule_write() local
1922 int nel = 0; role_allow_rule_write() local
1945 int nel = 0; filename_trans_rule_write() local
1998 int nel = 0; range_trans_rule_write() local
[all...] |
| H A D | sidtab.c | 32 s->nel = 0; in sepol_sidtab_init()
78 s->nel++; in sepol_sidtab_insert()
161 s->nel--; in sepol_sidtab_map_remove_on_error()
250 tag, h->nel, slots_used, SIDTAB_SIZE, max_chain_len); in sepol_sidtab_hash_eval()
273 s->nel = 0; in sepol_sidtab_destroy()
281 dst->nel = src->nel; in sepol_sidtab_set()
|
| H A D | avtab.c | 132 h->nel++; in avtab_insert_node()
359 h->nel = 0; in avtab_init()
388 h->nel = 0; in avtab_alloc()
418 tag, h->nel, slots_used, h->nslot, max_chain_len); in avtab_hash_eval()
596 uint32_t nel; in avtab_read() local
603 nel = le32_to_cpu(buf[0]); in avtab_read()
604 if (!nel) { in avtab_read()
609 rc = avtab_alloc(a, nel); in avtab_read()
615 for (i = 0; i < nel; i++) { in avtab_read()
622 ERR(fp->handle, "failed on entry %d of %u", i, nel); in avtab_read()
[all...] |
| H A D | policydb.c | 1241 p->p_classes.nprim, p->te_avtab.nel, p->te_cond_avtab.nel); in policydb_index_others()
2098 size_t len, nel; in common_read() local
2121 nel = le32_to_cpu(buf[3]); in common_read()
2131 for (i = 0; i < nel; i++) { in common_read()
2246 size_t len, len2, ncons, nel; in class_read() local
2271 nel = le32_to_cpu(buf[4]); in class_read()
2299 for (i = 0; i < nel; i++) { in class_read()
2528 uint32_t buf[3], nel; in role_trans_read() local
2537 nel in role_trans_read()
2570 uint32_t buf[2], nel; role_allow_read() local
2848 uint32_t buf[1], nel; filename_trans_read() local
2876 size_t nel, len; ocontext_read_xen() local
2987 size_t nel, len; ocontext_read_selinux() local
3183 size_t nel, nel2, len, len2; genfs_read() local
3567 size_t nel = ARRAY_SIZE(avrule->xperms->perms); avrule_read() local
3622 uint32_t buf[2], nel; range_read() local
3752 uint32_t buf[1], nel; role_trans_rule_read() local
3804 uint32_t buf[1], nel; role_allow_rule_read() local
3840 uint32_t buf[3], nel, i, len; filename_trans_rule_read() local
3906 uint32_t buf[1], nel; range_trans_rule_read() local
3983 uint32_t buf[2], nprim, nel; avrule_decl_read() local
4036 uint32_t buf[1], num_blocks, nel; avrule_block_read() local
4230 size_t len, nprim, nel; policydb_read() local
[all...] |
| H A D | hashtab.c | 53 p->nel = 0; in hashtab_create()
70 while (new_size <= h->nel && new_size * 2 != 0) in hashtab_check_resize()
139 h->nel++; in hashtab_insert()
172 h->nel--; in hashtab_remove()
268 tag, h->nel, slots_used, h->size, max_chain_len); in hashtab_hash_eval()
|
| H A D | module.c | 352 uint32_t offset, nel, read_len; in read_helper() local
356 nel = bytes; in read_helper()
358 while (nel) { in read_helper()
359 if (nel < _read_helper_bufsize) in read_helper()
360 read_len = nel; in read_helper()
367 nel -= read_len; in read_helper()
|
| /third_party/selinux/libselinux/src/ |
| H A D | compute_user.c | 21 unsigned int i, nel; in security_compute_user_raw() local
58 if (sscanf(buf, "%u", &nel) != 1) { in security_compute_user_raw()
63 ary = malloc((nel + 1) * sizeof(char *)); in security_compute_user_raw()
70 for (i = 0; i < nel; i++) { in security_compute_user_raw()
79 ary[nel] = NULL; in security_compute_user_raw()
|
| H A D | avc_sidtab.c | 43 s->nel = 0; in sidtab_init()
71 s->nel++; in sidtab_insert()
127 "chain length %d\n", avc_prefix, s->nel, slots_used, in sidtab_sid_stats()
|
| H A D | matchpathcon.c | 269 int h, used, nel, len, longest; in matchpathcon_filespec_eval() local
276 nel = 0; in matchpathcon_filespec_eval()
286 nel += len; in matchpathcon_filespec_eval()
291 __FUNCTION__, nel, used, HASH_BUCKETS, longest); in matchpathcon_filespec_eval()
|
| H A D | avc_sidtab.h | 23 unsigned nel; member
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| H A D | hb-algs.hh | 927 nel is the number of elements in the array
932 void hb_qsort(void *base, size_t nel, size_t width,
985 static inline void sort_r_simple(void *base, size_t nel, size_t w, in sort_r_simple() argument
991 char *b = (char *)base, *end = b + nel*w; in sort_r_simple()
993 /* for(size_t i=0; i<nel; i++) {printf("%4i", *(int*)(b + i*sizeof(int)));} in sort_r_simple()
996 if(nel < 10) { in sort_r_simple()
1005 /* nel > 9; Quicksort */ in sort_r_simple()
1009 char *last = b+w*(nel-1), *tmp; in sort_r_simple()
1017 l[1] = b+w*(nel/2); in sort_r_simple()
1096 /*for(size_t i=0; i<nel; in sort_r_simple()
1105 hb_qsort(void *base, size_t nel, size_t width, int (*compar)(const void *_a, const void *_b)) hb_qsort() argument
1116 hb_qsort(void *base, size_t nel, size_t width, int (*compar)(const void *_a, const void *_b, void *_arg), void *arg) hb_qsort() argument
[all...] |
| /third_party/musl/porting/uniproton/kernel/src/locale/ |
| H A D | iconv.c | 210 unsigned nel = sizeof rev_jis / sizeof *rev_jis; in uni_to_jis() local
213 i = nel/2; in uni_to_jis()
217 else if (nel == 1) return 0; in uni_to_jis()
219 nel /= 2; in uni_to_jis()
222 nel -= nel/2; in uni_to_jis()
|
| /third_party/musl/porting/liteos_m/kernel/src/locale/ |
| H A D | iconv.c | 210 unsigned nel = sizeof rev_jis / sizeof *rev_jis; in uni_to_jis() local
213 i = nel/2; in uni_to_jis()
217 else if (nel == 1) return 0; in uni_to_jis()
219 nel /= 2; in uni_to_jis()
222 nel -= nel/2; in uni_to_jis()
|
| /third_party/musl/src/locale/ |
| H A D | iconv.c | 210 unsigned nel = sizeof rev_jis / sizeof *rev_jis; in uni_to_jis() local
213 i = nel/2; in uni_to_jis()
217 else if (nel == 1) return 0; in uni_to_jis()
219 nel /= 2; in uni_to_jis()
222 nel -= nel/2; in uni_to_jis()
|
| /third_party/selinux/libsepol/include/sepol/policydb/ |
| H A D | hashtab.h | 40 uint32_t nel; /* number of elements in hash table */ member
|
| H A D | sidtab.h | 35 unsigned int nel; /* number of elements */ member
|