Searched defs:elem (Results 1 - 6 of 6) sorted by relevance

/ndk/sources/host-tools/make-3.81/
H A Dvpath.c163 register unsigned int elem;
236 elem = 0;
267 vpath[elem++] = dir_name (v);
282 if (elem > 0)
288 if (elem < (maxelem - 1))
290 (elem + 1) * sizeof (char *));
293 vpath[elem] = 0;
161 register unsigned int elem; local
H A Dgetloadavg.c505 int elem = 0; /* Return value. */
512 elem = -1;
537 elem = -1;
541 loadavg[elem++] = (double) kn->value.ul/FSCALE;
548 loadavg[elem++] = (double) kn->value.ul/FSCALE;
554 loadavg[elem++] = (double) kn->value.ul/FSCALE;
571 loadavg[elem++] = dyn_info.psd_avg_1_min;
573 loadavg[elem++] = dyn_info.psd_avg_5_min;
575 loadavg[elem++] = dyn_info.psd_avg_15_min;
607 for (elem
503 int elem = 0; /* Return value. */ local
[all...]
/ndk/sources/host-tools/sed-4.2.1/lib/
H A Dregex_internal.c984 re_node_set_init_1 (re_node_set *set, Idx elem)
994 set->elems[0] = elem;
1283 re_node_set_insert (re_node_set *set, Idx elem)
1288 return BE (re_node_set_init_1 (set, elem) == REG_NOERROR, 1);
1293 set->elems[0] = elem;
1311 if (elem < set->elems[0])
1319 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1324 set->elems[idx] = elem;
1335 re_node_set_insert_last (re_node_set *set, Idx elem)
1349 set->elems[set->nelem++] = elem;
982 re_node_set_init_1(re_node_set *set, Idx elem) argument
1281 re_node_set_insert(re_node_set *set, Idx elem) argument
1333 re_node_set_insert_last(re_node_set *set, Idx elem) argument
1371 re_node_set_contains(const re_node_set *set, Idx elem) argument
1580 Idx elem = newstate->nodes.elems[i]; local
[all...]
H A Dregcomp.c82 static reg_errcode_t parse_bracket_element (bracket_elem_t *elem,
88 static reg_errcode_t parse_bracket_symbol (bracket_elem_t *elem,
2479 parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa,
2526 return elem;
2544 if (BE (elem == NULL, 0))
2548 postorder (elem, free_tree, NULL);
2555 tree = elem;
2558 elem = duplicate_tree (elem, dfa);
2559 tree = create_tree (dfa, tree, elem, CONCA
2470 parse_dup_op(bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, re_token_t *token, reg_syntax_t syntax, reg_errcode_t *err) argument
2777 int32_t elem = hash % table_size; local
2835 int32_t elem, idx; local
2967 int32_t elem, idx; local
3313 parse_bracket_element(bracket_elem_t *elem, re_string_t *regexp, re_token_t *token, int token_len, re_dfa_t *dfa, reg_syntax_t syntax, bool accept_hyphen) argument
3353 parse_bracket_symbol(bracket_elem_t *elem, re_string_t *regexp, re_token_t *token) argument
[all...]
H A Dregexec.c3361 bitset_word_t elem, mask;
3506 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;
3507 elem;
3508 mask <<= 1, elem >>= 1, ++ch)
3509 if (BE (elem & 1, 0))
3537 for (ch = i * BITSET_WORD_BITS, elem = acceptable[i], mask = 1;
3538 elem;
3539 mask <<= 1, elem >>= 1, ++ch)
3540 if (BE (elem & 1, 0))
3357 bitset_word_t elem, mask; local
/ndk/sources/third_party/googletest/googletest/include/gtest/internal/
H A Dgtest-internal.h899 // equals elem. Element may be a native array type itself.
901 Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { argument
903 if (internal::ArrayEq(*it, elem))

Completed in 132 milliseconds