Searched defs:n_entries (Results 1 - 7 of 7) sorted by relevance

/external/e2fsprogs/e2fsck/
H A Dprofile_helpers.c264 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/dbus/tools/
H A Ddbus-cleanup-sockets.c160 int n_entries; local
163 n_entries = 0;
184 if (n_entries == allocated)
190 entries[n_entries] = se;
191 n_entries += 1;
197 *n_entries_p = n_entries;
263 int n_entries)
271 while (i < n_entries)
338 int n_entries; local
340 read_sockets (dir, &entries, &n_entries);
262 handle_sockets(SocketEntry **entries, int n_entries) argument
[all...]
/external/bison/lib/
H A Dhash.c61 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);
283 if (table->n_entries
[all...]
/external/dbus/bus/
H A Dactivation.c97 int n_entries; member in struct:__anon4934
218 pending_activation->n_entries;
1767 pending_activation->n_entries += 1;
1860 pending_activation->n_entries += 1;
/external/dbus/dbus/
H A Ddbus-hash.c182 int n_entries; /**< Total number of entries present member in struct:DBusHashTable
185 int hi_rebuild_size; /**< Enlarge table when n_entries gets
188 int lo_rebuild_size; /**< Shrink table when n_entries gets
318 table->n_entries = 0;
495 table->n_entries -= 1;
545 real->n_entries_on_init = table->n_entries;
568 _dbus_assert (real->n_entries_on_init >= real->table->n_entries);
797 real->n_entries_on_init = table->n_entries;
822 table->n_entries += 1;
827 if (table->n_entries >
[all...]
H A Ddbus-connection.c1520 int n_entries; local
1525 while ((n_entries = _dbus_hash_table_get_n_entries (shared_connections)) > 0)
1540 _dbus_assert (_dbus_hash_table_get_n_entries (shared_connections) < n_entries);
H A Ddbus-marshal-recursive-util.c3328 int n_entries; local
3332 n_entries = node->klass->subclass_detail;
3375 while (i < n_entries)
3424 int n_entries; local
3427 n_entries = node->klass->subclass_detail;
3433 if (n_entries > 0)
3440 while (i < n_entries)
3485 if (i == (n_entries - 1))

Completed in 390 milliseconds