| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/ |
| H A D | builtin-report.c | 271 if (rb_first(&hists->entries) != rb_last(&hists->entries))
443 "Only display entries with parent-match"),
460 "Only display entries resolved to a symbol"),
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/atm/ |
| H A D | iphase.c | 405 int entries; local
422 entries = rate / dev->Granularity;
423 IF_CBR(printk("CBR: CBR entries=0x%x for rate=0x%x & Gran=0x%x\n",
424 entries, rate, dev->Granularity);)
425 if (entries < 1)
427 rateLow = entries * dev->Granularity;
428 rateHigh = (entries + 1) * dev->Granularity;
430 entries++;
431 if (entries > dev->CbrRemEntries) {
434 entries, de
[all...] |
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/dbus-1.6.8/dbus/ |
| H A D | dbus-transport.c | 251 DBusAddressEntry **entries; local
257 if (!dbus_parse_address (address, &entries, &len, error))
262 transport = _dbus_transport_open (entries[i], error);
267 dbus_address_entries_free (entries);
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/smbd/ |
| H A D | conn.c | 296 for (i=0;i<conn->vuid_cache.entries && i< VUID_CACHE_SIZE;i++) {
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/db/ |
| H A D | db_reclaim.c | 217 ldbt.size += p->entries * sizeof(db_indx_t);
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavformat/ |
| H A D | internal.h | 200 int ff_index_search_timestamp(const AVIndexEntry *entries, int nb_entries,
227 * AVFormatContext.max_index_size by discarding entries if it grows
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/gtk/ |
| H A D | toplevel.cpp | 777 wxAcceleratorEntry* entries = new wxAcceleratorEntry[n];
782 entries[i] = (*entry);
787 wxAcceleratorTable table(n, entries);
788 delete[] entries;
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/docs/latex/wx/ |
| H A D | mimetype.tex | 174 overriding the settings found in the standard files: normally, entries from
175 files loaded with ReadMailcap will override the entries from files loaded
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/irda/ |
| H A D | nsc-ircc.h | 218 /* For storing entries in the status FIFO */
228 struct st_fifo_entry entries[MAX_RX_WINDOW]; member in struct:st_fifo
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/wireless/p54/ |
| H A D | fwio.c | 435 for (i = 0; i < priv->output_limit->entries; i++) {
462 if (i == priv->output_limit->entries)
466 for (i = 0; i < priv->curve_data->entries; i++) {
490 if (i == priv->curve_data->entries)
|
| H A D | p54.h | 127 size_t entries; member in struct:p54_cal_database
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/net/wireless/rt2x00/ |
| H A D | rt2x00queue.h | 46 * DOC: Number of entries per queue
48 * Under normal load without fragmentation, 12 entries are sufficient
53 * Since we don't use preallocated DMA, having a large number of queue entries
421 * @entries: Base address of the &struct queue_entry which are
428 * @limit: Maximum number of entries in the queue.
429 * @threshold: Minimum number of free entries before queue is kicked by force.
444 struct queue_entry *entries; member in struct:data_queue
475 * @entry_num: Maximum number of entries for a queue.
586 * rt2x00queue_free - Check the number of available entries in queue.
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/examples/LDAP/smbldap-tools-0.9.2/doc/ |
| H A D | smbldap-migrate-unix-groups | 28 print " -v displays modified entries to STDOUT\n";
201 -v displayes modified entries to STDOUT
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/flac-1.2.1/src/metaflac/ |
| H A D | operations.c | 519 if(options->args.arguments[i].value.block_type.entries[j].type == block->type) {
520 if(block->type != FLAC__METADATA_TYPE_APPLICATION || !options->args.arguments[i].value.block_type.entries[j].filter_application_by_id || 0 == memcmp(options->args.arguments[i].value.block_type.entries[j].application_id, block->data.application.id, FLAC__STREAM_METADATA_APPLICATION_ID_LEN/8))
528 if(options->args.arguments[i].value.block_number.entries[j] == block_number)
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/gpu/drm/nouveau/ |
| H A D | nv04_display.c | 151 for (i = 0; i < dcb->entries; i++) {
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/powerpc/mm/ |
| H A D | numa.c | 361 "%d entries\n", MAX_DISTANCE_REF_POINTS);
432 * list entries followed by N memblock list entries. Each memblock list entry
438 u32 len, entries; local
444 entries = *prop++;
446 /* Now that we know the number of entries, revalidate the size
449 if (len < (entries * (n_mem_addr_cells + 4) + 1) * sizeof(unsigned int))
453 return entries;
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/s390/kernel/ |
| H A D | head64.S | 76 .long 0x80000000,0,0,0 # invalid access-list entries
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/mips/alchemy/common/ |
| H A D | dbdma.c | 367 u32 au1xxx_dbdma_ring_alloc(u32 chanid, int entries) argument
391 desc_base = (u32)kmalloc(entries * sizeof(au1x_ddma_desc_t),
402 i = entries * sizeof(au1x_ddma_desc_t);
534 for (i = 0; i < entries; i++) {
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/mips/include/asm/mach-au1x00/ |
| H A D | au1xxx_dbdma.h | 335 u32 au1xxx_dbdma_ring_alloc(u32 chanid, int entries);
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/mac80211/ |
| H A D | mesh.h | 116 * @entries: number of entries in the table
130 atomic_t entries; /* Up to MAX_MESH_NEIGHBOURS */ member in struct:mesh_table
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/ |
| H A D | latencytop.c | 120 /* 0 and ULONG_MAX entries mean end of backtrace: */
151 trace.entries = &lat->backtrace[0];
161 * This function is the main entry point for recording latency entries
210 /* 0 and ULONG_MAX entries mean end of backtrace: */
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/trace/ |
| H A D | trace_stack.c | 26 .entries = stack_dump_trace,
79 * Loop through all the entries. One of the entries may
273 " (%d entries)\n"
|
| /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/mm/ |
| H A D | memcontrol.c | 159 /* Size of entries[] */
162 struct mem_cgroup_threshold entries[0]; member in struct:mem_cgroup_threshold_ary
171 * It must be able to store at least primary->size - 1 entries.
3568 for (; i >= 0 && unlikely(t->entries[i].threshold > usage); i--)
3569 eventfd_signal(t->entries[i].eventfd, 1);
3580 for (; i < t->size && unlikely(t->entries[i].threshold <= usage); i++)
3581 eventfd_signal(t->entries[i].eventfd, 1);
3664 memcpy(new->entries, thresholds->primary->entries, (size - 1) *
3669 new->entries[siz
[all...] |
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/ |
| H A D | antlr3collections.h | 93 * may be NULL). Duplicate entries are chained from
96 pANTLR3_HASH_ENTRY entries; member in struct:ANTLR3_HASH_BUCKET_struct
241 /** Number of entries currently in the list;
257 * entries calling any free pointers for each entry.
261 /** Total number of entries in elements at any point in time
342 struct ANTLR3_TRIE_ENTRY_struct * next; /* Allows duplicate entries for same key in insertion order */
363 * Note also that this trie [can] accept multiple entries for the same key and is
397 * the vector entries in place, as well as a sort method that just returns an
|
| /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/ |
| H A D | svq1dec.c | 148 /* add codebook entries to vector */\
150 n3 = codebook[entries[j]] ^ 0x80808080;\
200 /* calculate codebook entries for this vector */\
202 entries[j] = (((bit_cache >> (4*(stages - j - 1))) & 0xF) + 16*j) << (level + 1);\
212 int entries[6]; local
267 int entries[6]; local
|