Searched refs:table (Results 76 - 100 of 788) sorted by relevance

1234567891011>>

/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/zebra/zebra/
H A Drt.h2 * kernel routing table update prototype.
36 unsigned int index, int flags, int table);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/include/linux/
H A Dparser.h28 int match_token(char *, match_table_t table, substring_t args[]);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/
H A Dmbsstr.c41 /* Allocate the table. */
42 size_t *table = (size_t *) malloca (m * sizeof (size_t)); local
43 if (table == NULL)
45 /* Fill the table.
47 0 < table[i] <= i is defined such that
50 forall 0 <= x < table[i]: rhaystack[x..x+m-1] != needle[0..m-1],
51 and table[i] is as large as possible with this property.
52 table[0] remains uninitialized. */
56 table[1] = 1;
66 table[
127 size_t *table; local
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/libvorbis-1.2.3/doc/
H A D10-tables.tex6 \subsection{floor1\_inverse\_dB\_table} \label{vorbis:spec:floor1:inverse:dB:table}
9 lookup table consiting of the following values (read left to right
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/minidlna/
H A Dscanner.h31 get_next_available_id(const char * table, const char * parentID);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/minidlna.07.26/
H A Dscanner.h31 get_next_available_id(const char * table, const char * parentID);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/mtools-4.0.10/
H A Dmatch.c40 wchar_t table[256]; local
51 table[i]=0;
63 table[i] = 1;
65 table[(int) *((*p)++)] = 1;
69 if(table[(int) *s])
73 if(table[tolower(*s)]) {
78 if(table[toupper(*s)]) {
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/zebra/ospf6d/
H A Dospf6_route.h35 struct route_table *table; member in struct:ospf6_route_table
104 struct ospf6_route_table *table;
131 struct ospf6_route_table *table;
174 struct ospf6_route_table *table);
176 struct ospf6_route_table *table);
194 struct ospf6_route_table *table);
199 struct ospf6_route_table *table);
103 struct ospf6_route_table *table; member in struct:ospf6_route_node
130 struct ospf6_route_table *table; member in struct:ospf6_route_req
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/lib/zlib_inflate/
H A Dinftrees.c13 The code lengths are lens[0..codes-1]. The result starts at *table,
17 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
19 requested root table index bits, and on return it is the actual root
20 table index bits. It will differ if the request is greater than the
24 code **table, unsigned *bits, unsigned short *work)
29 unsigned root; /* number of index bits for root table */
30 unsigned curr; /* number of index bits for current table */
31 unsigned drop; /* code bits to drop for sub-table */
33 unsigned used; /* code entries in table used */
39 code this; /* table entr
23 zlib_inflate_table(codetype type, unsigned short *lens, unsigned codes, code **table, unsigned *bits, unsigned short *work) argument
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/openssl/crypto/engine/
H A Deng_int.h111 /* This represents an implementation table. Dependent code should instantiate it
114 int engine_table_register(ENGINE_TABLE **table, ENGINE_CLEANUP_CB *cleanup,
116 void engine_table_unregister(ENGINE_TABLE **table, ENGINE *e);
117 void engine_table_cleanup(ENGINE_TABLE **table);
119 ENGINE *engine_table_select(ENGINE_TABLE **table, int nid);
121 ENGINE *engine_table_select_tmp(ENGINE_TABLE **table, int nid, const char *f, int l);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/openssl-0.9.8e/crypto/engine/
H A Deng_int.h117 /* This represents an implementation table. Dependent code should instantiate it
120 int engine_table_register(ENGINE_TABLE **table, ENGINE_CLEANUP_CB *cleanup,
122 void engine_table_unregister(ENGINE_TABLE **table, ENGINE *e);
123 void engine_table_cleanup(ENGINE_TABLE **table);
125 ENGINE *engine_table_select(ENGINE_TABLE **table, int nid);
127 ENGINE *engine_table_select_tmp(ENGINE_TABLE **table, int nid, const char *f, int l);
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/acpi/namespace/
H A Dnsparse.c58 * table_desc - The table to be parsed.
62 * DESCRIPTION: Perform one complete parse of an ACPI/AML table.
74 struct acpi_table_header *table; local
99 status = acpi_get_table_by_index(table_index, &table);
108 if (table->length < sizeof(struct acpi_table_header)) {
111 aml_start = (u8 *) table + sizeof(struct acpi_table_header);
112 aml_length = table->length - sizeof(struct acpi_table_header);
138 * PARAMETERS: table_desc - An ACPI table descriptor for table to parse
139 * start_node - Where to enter the table int
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/router/busybox-1.x/networking/
H A Dvconfig.c53 /* On entry, table points to the length of the current string plus
56 static const char *xfind_str(const char *table, const char *str) argument
58 while (strcasecmp(str, table+1) != 0) {
59 if (!*(table += table[0])) {
63 return table - 1;
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/libexif-0.6.19/libexif/olympus/
H A Dmnote-olympus-tag.c34 } table[] = { variable in typeref:struct:__anon1043
201 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
202 if (table[i].tag == t) return (table[i].name);
212 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
213 if (table[i].tag == t) return (_(table[i].title));
223 for (i = 0; i < sizeof (table) / sizeo
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
32 int inflate_table9(type, lens, codes, table, bits, work)
36 code FAR * FAR *table;
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
47 unsigned used; /* code entries in table use
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
32 int inflate_table9(type, lens, codes, table, bits, work)
36 code FAR * FAR *table;
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
47 unsigned used; /* code entries in table use
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/netatalk-2.2.5/contrib/shell_utils/
H A Dmake-casetable.pl71 our @table;
125 # init table -----------------------------------------------------
128 $table[$char][0] = $char; # mapped char
129 $table[$char][1] = $char; # orig char
130 $table[$char][2] = ""; # char name
154 # write data to table --------------------------------------------
192 $table[$hex_code0][0] = $hex_Mapping;
193 #table[$hex_code0][1] already set
194 $table[$hex_code0][2] = $Name1;
239 $table[
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/sparc64/kernel/
H A Dus3_cpufreq.c24 struct cpufreq_frequency_table table[4]; member in struct:us3_freq_percpu_info
153 &us3_freq_table[policy->cpu].table[0],
167 &us3_freq_table[policy->cpu].table[0]);
174 struct cpufreq_frequency_table *table = local
175 &us3_freq_table[cpu].table[0];
177 table[0].index = 0;
178 table[0].frequency = clock_tick / 1;
179 table[1].index = 1;
180 table[1].frequency = clock_tick / 2;
181 table[
[all...]
H A Dus2e_cpufreq.c25 struct cpufreq_frequency_table table[6]; member in struct:us2e_freq_percpu_info
294 &us2e_freq_table[policy->cpu].table[0],
306 &us2e_freq_table[policy->cpu].table[0]);
313 struct cpufreq_frequency_table *table = local
314 &us2e_freq_table[cpu].table[0];
316 table[0].index = 0;
317 table[0].frequency = clock_tick / 1;
318 table[1].index = 1;
319 table[1].frequency = clock_tick / 2;
320 table[
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/zebra/bgpd/
H A Dbgp_table.c1 /* BGP routing table
63 bgp_node_set (struct bgp_table *table, struct prefix *prefix)
70 node->table = table;
82 /* Free route table. */
228 bgp_node_match (struct bgp_table *table, struct prefix *p)
234 node = table->top;
254 bgp_node_match_ipv4 (struct bgp_table *table, struct in_addr *addr)
263 return bgp_node_match (table, (struct prefix *) &p);
268 bgp_node_match_ipv6 (struct bgp_table *table, struc
62 bgp_node_set(struct bgp_table *table, struct prefix *prefix) argument
227 bgp_node_match(struct bgp_table *table, struct prefix *p) argument
253 bgp_node_match_ipv4(struct bgp_table *table, struct in_addr *addr) argument
267 bgp_node_match_ipv6(struct bgp_table *table, struct in6_addr *addr) argument
282 bgp_node_lookup(struct bgp_table *table, struct prefix *p) argument
302 bgp_node_get(struct bgp_table *table, struct prefix *p) argument
398 bgp_table_top(struct bgp_table *table) argument
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/zebra/lib/
H A Dtable.c26 #include "table.h"
60 route_node_set (struct route_table *table, struct prefix *prefix)
67 node->table = table;
79 /* Free route table. */
223 /* Dump routing table. */
242 route_node_match (struct route_table *table, struct prefix *p)
248 node = table->top;
268 route_node_match_ipv4 (struct route_table *table, struct in_addr *addr)
277 return route_node_match (table, (struc
59 route_node_set(struct route_table *table, struct prefix *prefix) argument
241 route_node_match(struct route_table *table, struct prefix *p) argument
267 route_node_match_ipv4(struct route_table *table, struct in_addr *addr) argument
281 route_node_match_ipv6(struct route_table *table, struct in6_addr *addr) argument
296 route_node_lookup(struct route_table *table, struct prefix *p) argument
316 route_node_get(struct route_table *table, struct prefix *p) argument
412 route_top(struct route_table *table) argument
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/drivers/char/
H A Dtipar.c83 static struct tipar_struct table[PP_NO]; variable in typeref:struct:tipar_struct
95 #define r_dtr(x) (parport_read_data(table[(x)].dev->port))
96 #define r_str(x) (parport_read_status(table[(x)].dev->port))
97 #define w_ctr(x,y) (parport_write_control(table[(x)].dev->port, (y)))
98 #define w_dtr(x,y) (parport_write_data(table[(x)].dev->port, (y)))
259 if (!table[minor].dev) {
264 parport_claim_or_block(table[minor].dev);
266 parport_release(table[minor].dev);
291 parport_claim_or_block(table[minor].dev);
308 parport_release(table[mino
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/prebuilt/WW/www/cgi-bin/
H A Dsorttable.js10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/prebuilt/WW/www/script/
H A Dsorttable.js10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table
[all...]
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/iptables-1.4.12.1/iptables/
H A Dip6tables-standalone.c14 * firewall table (aimed for the 2.3 kernels)
44 char *table = "filter"; local
61 ret = do_command6(argc, argv, &table, &handle);

Completed in 336 milliseconds

1234567891011>>