Searched refs:entries (Results 126 - 150 of 701) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/rpc_server/cxx/
H A Ddb_server_cxxutil.cpp240 nextctp = LIST_NEXT(ctp, entries);
287 nextctp = LIST_NEXT(ctp, entries);
317 nextctp = LIST_NEXT(ctp, entries);
327 nextctp = LIST_NEXT(ctp, entries);
336 LIST_REMOVE(ctp, entries);
362 * find an unused one. We insert entries in LRU fashion at the
380 LIST_INSERT_HEAD(&__dbsrv_head, ctp, entries);
390 ctp = LIST_NEXT(ctp, entries))
416 ctp = LIST_NEXT(ctp, entries)) {
462 ctp = LIST_NEXT(ctp, entries)) {
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/wireless/p54/
H A Deeprom.c71 size_t entries; member in struct:p54_channel_list
128 if ((!list->entries) || (!list->band_channel_num[band]))
145 (i < list->entries); i++) {
205 for (i = list->entries; i >= 0; i--) {
212 if ((i < 0) && (list->entries < list->max_entries)) {
223 i = list->entries++;
242 if ((priv->iq_autocal_len != priv->curve_data->entries) ||
243 (priv->iq_autocal_len != priv->output_limit->entries))
248 max_channel_num = max_t(unsigned int, priv->output_limit->entries,
251 priv->curve_data->entries);
511 size_t payload_len, entries, entry_size, offset; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/wireless/rt2x00/
H A Drt2x00queue.c462 * 2) Rule 1 can be broken when the available entries
653 entry = &queue->entries[queue->index[index]];
721 queue->entries[i].flags = 0;
723 rt2x00dev->ops->lib->clear_entry(&queue->entries[i]);
731 struct queue_entry *entries; local
743 * Allocate all queue entries.
745 entry_size = sizeof(*entries) + qdesc->priv_size;
746 entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
747 if (!entries)
755 entries[
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dsonic.c160 static inline int intlist_write(RangeCoder *c, uint8_t *state, int *buf, int entries, int base_2_part) argument
164 for (i = 0; i < entries; i++)
170 static inline int intlist_read(RangeCoder *c, uint8_t *state, int *buf, int entries, int base_2_part) argument
174 for (i = 0; i < entries; i++)
180 static inline int intlist_write(PutBitContext *pb, int *buf, int entries, int base_2_part) argument
184 for (i = 0; i < entries; i++)
190 static inline int intlist_read(GetBitContext *gb, int *buf, int entries, int base_2_part) argument
194 for (i = 0; i < entries; i++)
252 static int intlist_write(PutBitContext *pb, int *buf, int entries, int base_2_part) argument
258 copy = av_calloc(entries, sizeo
349 intlist_read(GetBitContext *gb, int *buf, int entries, int base_2_part) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/dbus-1.6.8/bus/
H A Dactivation.c48 DBusHashTable *entries; member in struct:BusActivation
64 DBusHashTable *entries; member in struct:__anon1602
96 DBusList *entries; member in struct:__anon1604
127 if (dir->entries)
128 _dbus_hash_table_unref (dir->entries);
194 link = _dbus_list_get_first_link (&pending_activation->entries);
202 link = _dbus_list_get_next_link (&pending_activation->entries, link);
204 _dbus_list_clear (&pending_activation->entries);
355 entry = _dbus_hash_table_lookup_string (s_dir->entries,
363 if (_dbus_hash_table_lookup_string (activation->entries, nam
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/nfs/
H A Dmount_clnt.c416 u32 entries, i; local
422 p = xdr_inline_decode(xdr, sizeof(entries));
425 entries = ntohl(*p);
426 dprintk("NFS: received %u auth flavors\n", entries);
427 if (entries > NFS_MAX_SECFLAVORS)
428 entries = NFS_MAX_SECFLAVORS;
430 p = xdr_inline_decode(xdr, sizeof(u32) * entries);
434 if (entries > *count)
435 entries = *count;
437 for (i = 0; i < entries;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/arm/mm/
H A Dproc-arm940.S88 * There is no efficient way to flush a range of cache entries
101 1: orr r3, r1, #(CACHE_DENTRIES - 1) << 26 @ 64 entries
104 bcs 2b @ entries 63 to 0
151 1: orr r3, r1, #(CACHE_DENTRIES - 1) << 26 @ 64 entries
154 bcs 2b @ entries 63 to 0
173 1: orr r3, r1, #(CACHE_DENTRIES - 1) << 26 @ 64 entries
176 bcs 2b @ entries 63 to 0
196 1: orr r3, r1, #(CACHE_DENTRIES - 1) << 26 @ 64 entries
199 bcs 2b @ entries 63 to 0
218 1: orr r3, r1, #(CACHE_DENTRIES - 1) << 26 @ 64 entries
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/bridge/netfilter/
H A Debtables.c213 base = private->entries;
432 struct ebt_entry *e = (void *)newinfo->entries + offset;
441 repl->entries + offset)
503 /* this checks if the previous chain has as many entries
506 BUGPRINT("nentries does not equal the nr of entries "
555 * entries is a jump to the beginning of a new chain.
830 /* do the parsing of the table/chains/entries/matches/watchers/targets, heh */
845 if (newinfo->hook_entry[i] != (struct ebt_entries *)newinfo->entries) {
862 i = 0; /* holds the expected nr. of entries for the chain */
863 j = 0; /* holds the up to now counted entries fo
1407 char *entries; local
1542 compat_uptr_t entries; member in struct:compat_ebt_replace
1757 const void *entries = info->entries; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/x509/
H A Dx509name.c99 return (sk_X509_NAME_ENTRY_num(name->entries));
123 sk = name->entries;
135 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
139 return (sk_X509_NAME_ENTRY_value(name->entries, loc));
148 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
151 sk = name->entries;
236 sk = name->entries;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/parisc/kernel/
H A Dinventory.c290 int entries; local
312 entries = actual_len / sizeof(struct pdc_pat_pd_addr_map_entry);
314 if (entries > PAT_MAX_RANGES) {
321 * "may" above. We'll use all the entries that were returned.
327 for (i = 0; i < entries; i++,mtbl_ptr++) {
384 int entries; local
407 entries = (int)r_addr.entries_returned;
412 for (i = 0; i < entries; i++,mtbl_ptr++) {
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/test/
H A Drep039.tcl307 set entries 10
308 eval rep_test $method $envs($master) NULL $entries $niter 0 0 0 $largs
375 set start [expr $i * $entries]
376 eval rep_test $method $envs($master) NULL $entries $start \
381 set start [expr $i * $entries]
403 set entries 10
404 eval rep_test $method $envs($master) NULL $entries $start \
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509/
H A Dx509name.c95 return(sk_X509_NAME_ENTRY_num(name->entries));
118 sk=name->entries;
131 if(name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
135 return(sk_X509_NAME_ENTRY_value(name->entries,loc));
144 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
147 sk=name->entries;
220 sk=name->entries;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/x509/
H A Dx509name.c99 return (sk_X509_NAME_ENTRY_num(name->entries));
123 sk = name->entries;
135 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
139 return (sk_X509_NAME_ENTRY_value(name->entries, loc));
148 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
151 sk = name->entries;
236 sk = name->entries;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/
H A Dfault-inject.c64 unsigned long entries[MAX_STACK_TRACE_DEPTH]; local
72 trace.entries = entries;
78 if (attr->reject_start <= entries[n] &&
79 entries[n] < attr->reject_end)
81 if (attr->require_start <= entries[n] &&
82 entries[n] < attr->require_end)
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-runtime/intl/
H A Dl10nflist.c188 size_t entries;
302 entries = 0;
326 retval->successor[entries++]
333 retval->successor[entries++]
338 retval->successor[entries] = NULL;
187 size_t entries; local
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/time/
H A Dtimer_stats.c12 * on dynamic allocation of the statistics entries and linear search based
117 static struct entry entries[MAX_ENTRIES]; variable in typeref:struct:entry
122 * The entries are in a hash-table, for fast lookup:
141 memset(entries, 0, sizeof(entries));
151 return entries + nr_entries++;
304 seq_printf(m, "Overflow: %d entries\n",
308 entry = entries + i;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/
H A Dbuiltin-diff.c89 struct rb_node *next = rb_first(&self->entries);
95 rb_erase(&n->rb_node, &self->entries);
100 self->entries = tmp;
112 struct rb_node *n = self->entries.rb_node;
133 for (nd = rb_first(&newer->entries); nd; nd = rb_next(nd)) {
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/netfilter_bridge/
H A Debtables.h47 /* total size of the entries */
55 char __user *entries; member in struct:ebt_replace
63 /* total size of the entries */
71 char *entries; member in struct:ebt_replace_kernel
85 /* nr. of entries */
94 * ebt_entries struct when traversing the entries from start to end.
262 /* total size of the entries */
269 char *entries; member in struct:ebt_table_info
357 #define EBT_ENTRY_ITERATE(entries, size, fn, args...) \
364 __entry = (void *)(entries)
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iproute2/include/linux/netfilter_ipv4/
H A Dip_tables.h221 /* Number of entries */
224 /* Size of entries. */
238 /* Number of entries */
241 /* Total size of new entries */
250 /* Information about old entries: */
251 /* Number of counters (must be equal to current number of entries). */
254 /* The old entries' counters. */
257 /* The entries (hang off end: not really an array). */
258 struct ipt_entry entries[0]; member in struct:ipt_replace
282 /* The entries
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iptables-1.4.12.1/include/linux/netfilter_ipv6/
H A Dip6_tables.h212 /* Number of entries */
215 /* Size of entries. */
228 /* Number of entries */
231 /* Total size of new entries */
240 /* Information about old entries: */
241 /* Number of counters (must be equal to current number of entries). */
243 /* The old entries' counters. */
246 /* The entries (hang off end: not really an array). */
247 struct ip6t_entry entries[0]; member in struct:ip6t_replace
261 /* The entries
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/avahi-0.6.25/avahi-core/
H A Dinternal.h76 AVAHI_LLIST_FIELDS(AvahiEntry, entries);
100 AVAHI_LLIST_HEAD(AvahiEntry, entries);
109 AVAHI_LLIST_HEAD(AvahiEntry, entries);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/avahi-0.6.25/avahi-core/
H A Dinternal.h76 AVAHI_LLIST_FIELDS(AvahiEntry, entries);
100 AVAHI_LLIST_HEAD(AvahiEntry, entries);
109 AVAHI_LLIST_HEAD(AvahiEntry, entries);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/reiserfs/
H A Ditem_ops.c500 /* compare total size of entries with item length */
525 // return number of entries which may fit into specified amount of
532 int entries = 0; local
541 entries++;
544 if (entries == dir_u->entry_count) {
552 && entries < 2)
553 entries = 0;
555 return entries ? : -1;
561 int entries = 0; local
570 entries
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/infiniband/hw/ehca/
H A Dipz_pt_fn.h61 u8 entries[EHCA_PAGESIZE]; member in struct:ipz_page
99 return &current_page->entries[q_offset & (EHCA_PAGESIZE - 1)];
187 u64 entries[EHCA_PT_ENTRIES]; member in struct:ipz_pt
195 u32 n_ptes; /* number of page table entries */
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/gpu/drm/nouveau/
H A Dnouveau_bios.h59 int entries; member in struct:dcb_gpio_table
88 int entries; member in struct:dcb_connector_table
144 int entries; member in struct:dcb_table

Completed in 238 milliseconds

1234567891011>>