Searched defs:n_entries (Results 1 - 11 of 11) 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/bluetooth/glib/gio/xdgmime/
H A Dxdgmimecache.c273 xdg_uint32_t n_entries; local
281 n_entries = GET_UINT32 (cache->buffer, list_offset);
284 for (j = 0; j < n_entries; j++)
322 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
326 max = n_entries - 1;
367 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
371 max = n_entries - 1;
413 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
415 for (j = 0; j < n_entries && n < n_mime_types; j++)
441 xdg_uint32_t n_entries,
440 cache_glob_node_lookup_suffix(XdgMimeCache *cache, xdg_uint32_t n_entries, xdg_uint32_t offset, const char *file_name, int len, int ignore_case, MimeWeight mime_types[], int n_mime_types) argument
528 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
804 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
867 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
918 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
994 xdg_uint32_t n_entries; local
[all...]
/external/bluetooth/glib/glib/
H A Dgoption.c115 gint n_entries; member in struct:_GOptionGroup
472 for (i = 0; i < group->n_entries; i++)
536 for (i = 0, l = (group ? group->n_entries : 0); i < l; i++)
603 for (i = 0; i < context->main_group->n_entries; i++)
642 for (i = 0; i < context->main_group->n_entries; i++)
660 for (i = 0; i < g->n_entries; i++)
751 for (i = 0; i < group->n_entries; i++)
770 for (i = 0; i < g->n_entries; i++)
791 for (i = 0; i < context->main_group->n_entries; i++)
800 for (i = 0; i < g->n_entries;
1953 gint i, n_entries; local
[all...]
H A Dgslice.c1273 unsigned int n_entries; member in struct:__anon567
1292 unsigned int old_size = branch->n_entries * sizeof (branch->entries[0]);
1295 mem_assert (index <= branch->n_entries);
1300 g_memmove (entry + 1, entry, (branch->n_entries - index) * sizeof (entry[0]));
1301 branch->n_entries += 1;
1309 unsigned int n_nodes = branch->n_entries, offs = 0;
1352 entry >= smc_tree_root[ix0][ix1].entries + smc_tree_root[ix0][ix1].n_entries || /* need append */
1373 entry < smc_tree_root[ix0][ix1].entries + smc_tree_root[ix0][ix1].n_entries &&
1394 entry < smc_tree_root[ix0][ix1].entries + smc_tree_root[ix0][ix1].n_entries &&
1398 smc_tree_root[ix0][ix1].n_entries
[all...]
/external/chromium/base/third_party/xdg_mime/
H A Dxdgmimecache.c275 xdg_uint32_t n_entries; local
283 n_entries = GET_UINT32 (cache->buffer, list_offset);
286 for (j = 0; j < n_entries; j++)
324 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
328 max = n_entries - 1;
369 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
373 max = n_entries - 1;
415 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
417 for (j = 0; j < n_entries && n < n_mime_types; j++)
443 xdg_uint32_t n_entries,
442 cache_glob_node_lookup_suffix(XdgMimeCache *cache, xdg_uint32_t n_entries, xdg_uint32_t offset, const char *file_name, int len, int ignore_case, MimeWeight mime_types[], int n_mime_types) argument
530 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
806 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
869 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
920 xdg_uint32_t n_entries = GET_UINT32 (cache->buffer, list_offset); local
996 xdg_uint32_t n_entries; local
[all...]
/external/dbus/bus/
H A Dactivation.c92 int n_entries; member in struct:__anon1703
212 pending_activation->n_entries;
1409 pending_activation->n_entries += 1;
1489 pending_activation->n_entries += 1;
/external/dbus/dbus/
H A Ddbus-hash.c181 int n_entries; /**< Total number of entries present member in struct:DBusHashTable
184 int hi_rebuild_size; /**< Enlarge table when n_entries gets
187 int lo_rebuild_size; /**< Shrink table when n_entries gets
317 table->n_entries = 0;
494 table->n_entries -= 1;
544 real->n_entries_on_init = table->n_entries;
567 _dbus_assert (real->n_entries_on_init >= real->table->n_entries);
796 real->n_entries_on_init = table->n_entries;
821 table->n_entries += 1;
826 if (table->n_entries >
[all...]
H A Ddbus-connection.c1469 int n_entries; local
1474 while ((n_entries = _dbus_hash_table_get_n_entries (shared_connections)) > 0)
1500 _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 239 milliseconds