HomeSort by relevance Sort by last modified time
    Searched refs:n_entries (Results 1 - 5 of 5) sorted by null

  /external/bison/lib/
hash.c 56 are not empty, there are N_ENTRIES active entries in the table. */
61 size_t n_entries; member in struct:hash_table
168 return table->n_entries;
205 size_t n_entries = 0; local
215 n_entries++;
219 n_entries++;
223 if (n_buckets_used == table->n_buckets_used && n_entries == table->n_entries)
232 size_t n_entries = hash_get_n_entries (table); local
237 fprintf (stream, "# entries: %lu\n", (unsigned long int) n_entries);
    [all...]
  /external/e2fsprogs/e2fsck/
profile_helpers.c 264 int n_entries, i; local
271 for(s = filepath, n_entries = 1; *s; s++) {
273 n_entries++;
277 filenames = (char **) malloc((n_entries+1) * sizeof(char*));
  /external/chromium_org/chrome/browser/ui/libgtk2ui/
x11_input_method_context_impl_gtk2.cc 49 gint n_entries = 0; local
52 &keys, &keyvals, &n_entries)) {
53 for (gint i = 0; i < n_entries; ++i) {
  /external/pixman/demos/
scale.c 303 int n_entries, const named_int_t table[])
320 for (i = 0; i < n_entries; ++i)
  /external/wpa_supplicant_8/src/ap/
hostapd.c 918 int n_entries, u8 accept_acl)
924 (n_entries * sizeof(acl_params->mac_acl[0])));
928 for (i = 0; i < n_entries; i++)
933 acl_params->num_mac_acl = n_entries;
    [all...]

Completed in 198 milliseconds