| /l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/search/ |
| A D | insremque.c | 27 insque (void *elem, void *prev) in insque() argument
31 ((struct qelem *) elem)->q_forw = NULL; in insque()
32 ((struct qelem *) elem)->q_back = NULL; in insque()
37 ((struct qelem *) prev)->q_forw = (struct qelem *) elem; in insque()
39 next->q_back = (struct qelem *) elem; in insque()
40 ((struct qelem *) elem)->q_forw = next; in insque()
41 ((struct qelem *) elem)->q_back = (struct qelem *) prev; in insque()
51 remque (void *elem) in remque() argument
53 struct qelem *next = ((struct qelem *) elem)->q_forw; in remque()
54 struct qelem *prev = ((struct qelem *) elem)->q_back; in remque()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/sysdeps/pthread/ |
| A D | list.h | 57 list_del (list_t *elem) in list_del() argument
59 elem->next->prev = elem->prev; in list_del()
60 elem->prev->next = elem->next; in list_del()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/linuxthreads/sysdeps/pthread/ |
| A D | list.h | 68 list_del (list_t *elem) in list_del() argument
70 elem->next->prev = elem->prev; in list_del()
71 elem->prev->next = elem->next; in list_del()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/fnmatch/ |
| A D | fnmatch_loop.c | 472 int32_t elem; in FCT() local
499 elem = hash % table_size; in FCT()
500 if (symb_table[2 * elem] != 0) in FCT()
511 &extra[symb_table[2 * elem in FCT()
516 idx = symb_table[2 * elem + 1]; in FCT()
522 elem += second; in FCT()
692 int32_t elem; in FCT() local
720 elem = hash % table_size; in FCT()
721 if (symb_table[2 * elem] != 0) in FCT()
742 elem += second; in FCT()
[all …]
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libpthread/nptl/ |
| A D | allocatestack.c | 135 stack_list_del (list_t *elem)
137 in_flight_stack = (uintptr_t) elem;
141 list_del (elem);
152 in_flight_stack = (uintptr_t) elem | 1; in stack_list_add()
156 list_add (elem, list); in stack_list_add()
799 assert (l->next->prev == elem); in __reclaim_stacks()
801 elem->next = l->next; in __reclaim_stacks()
802 elem->prev = l; in __reclaim_stacks()
803 l->next = elem; in __reclaim_stacks()
817 elem->next->prev = elem->prev; in __reclaim_stacks()
[all …]
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/test/malloc/ |
| A D | tst-calloc.c | 72 int elem = 1 + random () % 100; in random_test() local
73 int size = n * elem; in random_test()
75 ptrs[i] = (char *) calloc (n, elem); in random_test()
|
| /l4re-core-master/uclibc/lib/contrib/uclibc/libc/misc/regex/ |
| A D | regcomp.c | 2449 return elem; in parse_dup_op()
2478 tree = elem; in parse_dup_op()
2481 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2491 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2498 postorder (elem, mark_opt_subexp, (void *) (long) elem->token.opr.idx); in parse_dup_op()
2509 elem = duplicate_tree (elem, dfa); in parse_dup_op()
2723 elem += second; in parse_bracket_exp()
2727 return elem; in parse_bracket_exp()
2760 int32_t elem, idx; in parse_bracket_exp()
2891 int32_t elem, idx; in parse_bracket_exp()
[all …]
|
| A D | regex_internal.c | 888 re_node_set_init_1 (re_node_set *set, int elem) in re_node_set_init_1() argument
898 set->elems[0] = elem; in re_node_set_init_1()
1185 re_node_set_insert (re_node_set *set, int elem) in re_node_set_insert() argument
1199 set->elems[0] = elem; in re_node_set_insert()
1217 if (elem < set->elems[0]) in re_node_set_insert()
1230 set->elems[idx] = elem; in re_node_set_insert()
1255 set->elems[set->nelem++] = elem; in re_node_set_insert_last()
1291 if (set->elems[mid] < elem) in internal_function()
1296 return set->elems[idx] == elem ? idx + 1 : 0; in internal_function()
1476 int elem = newstate->nodes.elems[i]; in register_state() local
[all …]
|
| A D | regex_old.c | 2972 int32_t elem; in PREFIX() local
2998 elem = hash % table_size; in PREFIX()
3000 while (symb_table[2 * elem] != 0) in PREFIX()
3010 idx = symb_table[2 * elem + 1]; in PREFIX()
3016 elem += second; in PREFIX()
3019 if (symb_table[2 * elem] != 0) in PREFIX()
3530 int32_t elem; in PREFIX() local
3548 elem = hash % table_size; in PREFIX()
3553 if (symb_table[2 * elem] == hash in PREFIX()
3567 elem += second; in PREFIX()
[all …]
|
| A D | regexec.c | 3222 bitset_word_t elem, mask; in build_trtable() local
3360 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3361 elem; in build_trtable()
3362 mask <<= 1, elem >>= 1, ++ch) in build_trtable()
3363 if (BE (elem & 1, 0)) in build_trtable()
3390 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1; in build_trtable()
3391 elem; in build_trtable()
3392 mask <<= 1, elem >>= 1, ++ch) in build_trtable()
3393 if (BE (elem & 1, 0)) in build_trtable()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/src/filesystem/ |
| A D | std-path.cc | 409 auto elem = ret._M_cmpts.end() - 2; in lexically_normal() local
410 if (elem->has_filename() && !is_dotdot(*elem)) in lexically_normal()
415 if (elem == ret._M_cmpts.begin()) in lexically_normal()
419 ret._M_pathname.erase(elem->_M_pos); in lexically_normal()
424 if (std::prev(elem)->_M_type == _Type::_Filename) in lexically_normal()
425 elem->clear(); in lexically_normal()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/src/c++17/ |
| A D | fs_path.cc | 1718 auto elem = ret._M_cmpts.end() - 2; in lexically_normal() local
1719 if (elem->has_filename() && !is_dotdot(*elem)) in lexically_normal()
1724 if (elem == ret._M_cmpts.begin()) in lexically_normal()
1728 ret._M_pathname.erase(elem->_M_pos); in lexically_normal()
1733 if (std::prev(elem)->_M_type() == _Type::_Filename) in lexically_normal()
1734 elem->clear(); in lexically_normal()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/src/c++17/ |
| A D | fs_path.cc | 1725 auto elem = ret._M_cmpts.end() - 2; in lexically_normal() local
1726 if (elem->has_filename() && !is_dotdot(*elem)) in lexically_normal()
1731 if (elem == ret._M_cmpts.begin()) in lexically_normal()
1735 ret._M_pathname.erase(elem->_M_pos); in lexically_normal()
1740 if (std::prev(elem)->_M_type() == _Type::_Filename) in lexically_normal()
1741 elem->clear(); in lexically_normal()
|
| /l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/src/c++17/ |
| A D | fs_path.cc | 1725 auto elem = ret._M_cmpts.end() - 2; in lexically_normal() local
1726 if (elem->has_filename() && !is_dotdot(*elem)) in lexically_normal()
1731 if (elem == ret._M_cmpts.begin()) in lexically_normal()
1735 ret._M_pathname.erase(elem->_M_pos); in lexically_normal()
1740 if (std::prev(elem)->_M_type() == _Type::_Filename) in lexically_normal()
1741 elem->clear(); in lexically_normal()
|