Searched refs:curr (Results 1 - 25 of 284) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/bzip2/
H A Dformat.pl43 my ($prev, $curr, $str);
44 $prev = ''; $curr = '';
48 $prev = $curr;
49 $curr = $_;
54 $curr = join( '', $prev, "<![CDATA[", $curr );
58 elsif ( $curr =~ /<\/programlisting>|<\/screen>/ ) {
60 $curr = join( '', $prev, "]]>", $curr );
65 print OUTFILE $curr;
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/procps/
H A Dfuser.c95 pid_list *curr = NULL, *last = NULL; local
99 curr = plist;
100 while (curr != NULL) {
101 if (curr->pid == pid)
103 last = curr;
104 curr = curr->next;
106 curr = xzalloc(sizeof(pid_list));
107 last->next = curr;
108 curr
115 inode_list *curr = NULL, *last = NULL; local
176 inode_list *curr; local
286 pid_list *curr = plist; local
301 pid_list *curr = plist; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509v3/
H A Dpcy_tree.c244 static int tree_link_nodes(X509_POLICY_LEVEL *curr, argument
251 last = curr - 1;
264 && !(curr->flags & X509_V_FLAG_INHIBIT_ANY))
271 if (parent && !level_add_node(curr, data, parent, NULL))
282 static int tree_link_any(X509_POLICY_LEVEL *curr, argument
291 last = curr - 1;
313 data->qualifier_set = curr->anyPolicy->data->qualifier_set;
315 if (!level_add_node(curr, data, node, tree))
324 if (!level_add_node(curr, cache->anyPolicy,
336 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
415 X509_POLICY_LEVEL *curr; local
525 X509_POLICY_LEVEL *curr = tree->levels + 1; local
555 X509_POLICY_LEVEL *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/curl/curl-7.36.0/lib/
H A Dbundles.c97 struct curl_llist_element *curr; local
99 curr = cb_ptr->conn_list->head;
100 while(curr) {
101 if(curr->ptr == conn) {
102 Curl_llist_remove(cb_ptr->conn_list, curr, NULL);
107 curr = curr->next;
H A Dpipeline.c130 struct curl_llist_element *curr; local
132 curr = conn->send_pipe->head;
133 while(curr) {
134 if(curr->ptr == handle) {
135 Curl_llist_move(conn->send_pipe, curr,
155 curr = curr->next;
167 struct curl_llist_element *curr; local
169 curr = blacklist->head;
170 while(curr) {
259 struct curl_llist_element *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfs/
H A Dbitmap.c31 __be32 *curr, *end; local
40 curr = bitmap + (offset / 32);
44 val = *curr;
56 while (++curr < end) {
57 val = *curr;
70 start = (curr - bitmap) * 32 + i;
85 *curr++ = cpu_to_be32(n);
88 n = be32_to_cpu(*curr);
95 *curr++ = cpu_to_be32(0xffffffff);
107 *curr
168 __be32 *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/x509v3/
H A Dpcy_tree.c99 X509_POLICY_LEVEL *curr)
106 if (!curr)
107 curr = tree->levels + tree->nlevel;
109 curr++;
111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
112 for (plev = tree->levels; plev != curr; plev++) {
306 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument
309 X509_POLICY_LEVEL *last = curr - 1;
316 if (!level_add_node(curr, data, node, NULL))
322 if (!level_add_node(curr, dat
98 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
333 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument
366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
564 X509_POLICY_LEVEL *curr; local
666 X509_POLICY_LEVEL *curr = tree->levels + 1; local
695 X509_POLICY_LEVEL *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/projects/GNOME/
H A Dtrigger33 curr=`/bin/pwd`
34 if test "$last" = "$curr"; then
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/x509v3/
H A Dpcy_tree.c99 X509_POLICY_LEVEL *curr)
106 if (!curr)
107 curr = tree->levels + tree->nlevel;
109 curr++;
111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
112 for (plev = tree->levels; plev != curr; plev++) {
306 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr, argument
309 X509_POLICY_LEVEL *last = curr - 1;
316 if (!level_add_node(curr, data, node, NULL))
322 if (!level_add_node(curr, dat
98 tree_print(char *str, X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
333 tree_link_nodes(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache) argument
366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument
428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument
488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument
564 X509_POLICY_LEVEL *curr; local
666 X509_POLICY_LEVEL *curr = tree->levels + 1; local
695 X509_POLICY_LEVEL *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/tools/perf/util/ui/
H A Dprogress.h9 void ui_progress__update(struct ui_progress *self, u64 curr);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/
H A Dlockdep.c524 static void lockdep_print_held_locks(struct task_struct *curr) argument
526 int i, depth = curr->lockdep_depth;
529 printk("no locks held by %s/%d.\n", curr->comm, task_pid_nr(curr));
533 depth, depth > 1 ? "s" : "", curr->comm, task_pid_nr(curr));
537 print_lock(curr->held_locks + i);
1044 struct task_struct *curr = current; local
1054 curr->comm, task_pid_nr(curr));
1076 struct task_struct *curr = current; local
1308 print_bad_irq_dependency(struct task_struct *curr, struct lock_list *prev_root, struct lock_list *next_root, struct lock_list *backwards_entry, struct lock_list *forwards_entry, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit1, enum lock_usage_bit bit2, const char *irqclass) argument
1379 check_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit_backwards, enum lock_usage_bit bit_forwards, const char *irqclass) argument
1452 check_irq_usage(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, enum lock_usage_bit bit) argument
1481 check_prev_add_irq(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) argument
1508 check_prev_add_irq(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) argument
1522 print_deadlock_bug(struct task_struct *curr, struct held_lock *prev, struct held_lock *next) argument
1556 check_deadlock(struct task_struct *curr, struct held_lock *next, struct lockdep_map *next_instance, int read) argument
1614 check_prev_add(struct task_struct *curr, struct held_lock *prev, struct held_lock *next, int distance, int trylock_loop) argument
1719 check_prevs_add(struct task_struct *curr, struct held_lock *next) argument
1800 lookup_chain_cache(struct task_struct *curr, struct held_lock *hlock, u64 chain_key) argument
1890 validate_chain(struct task_struct *curr, struct lockdep_map *lock, struct held_lock *hlock, int chain_head, u64 chain_key) argument
1944 validate_chain(struct task_struct *curr, struct lockdep_map *lock, struct held_lock *hlock, int chain_head, u64 chain_key) argument
1956 check_chain_key(struct task_struct *curr) argument
1994 print_usage_bug(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit prev_bit, enum lock_usage_bit new_bit) argument
2033 valid_state(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit, enum lock_usage_bit bad_bit) argument
2050 print_irq_inversion_bug(struct task_struct *curr, struct lock_list *root, struct lock_list *other, struct held_lock *this, int forwards, const char *irqclass) argument
2091 check_usage_forwards(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit bit, const char *irqclass) argument
2115 check_usage_backwards(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit bit, const char *irqclass) argument
2134 print_irqtrace_events(struct task_struct *curr) argument
2190 mark_lock_irq(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit) argument
2251 mark_held_locks(struct task_struct *curr, enum mark_type mark) argument
2294 struct task_struct *curr = current; local
2352 struct task_struct *curr = current; local
2386 struct task_struct *curr = current; local
2420 struct task_struct *curr = current; local
2443 struct task_struct *curr = current; local
2483 mark_irqflags(struct task_struct *curr, struct held_lock *hlock) argument
2547 separate_irq_context(struct task_struct *curr, struct held_lock *hlock) argument
2575 mark_lock_irq(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit) argument
2582 mark_irqflags(struct task_struct *curr, struct held_lock *hlock) argument
2588 separate_irq_context(struct task_struct *curr, struct held_lock *hlock) argument
2603 mark_lock(struct task_struct *curr, struct held_lock *this, enum lock_usage_bit new_bit) argument
2716 struct task_struct *curr = current; local
2863 print_unlock_inbalance_bug(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) argument
2892 check_unlock(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) argument
2935 struct task_struct *curr = current; local
2989 lock_release_non_nested(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) argument
3064 lock_release_nested(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) argument
3108 struct task_struct *curr = current; local
3126 struct task_struct *curr = current; local
3270 print_lock_contention_bug(struct task_struct *curr, struct lockdep_map *lock, unsigned long ip) argument
3299 struct task_struct *curr = current; local
3347 struct task_struct *curr = current; local
3626 print_freed_lock_bug(struct task_struct *curr, const void *mem_from, const void *mem_to, struct held_lock *hlock) argument
3660 struct task_struct *curr = current; local
3683 print_held_locks_bug(struct task_struct *curr) argument
3787 struct task_struct *curr = current; local
3803 struct task_struct *curr = current; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus/
H A Dbitmap.c22 __be32 *pptr, *curr, *end; local
40 curr = pptr + (offset & (PAGE_CACHE_BITS - 1)) / 32;
49 val = *curr;
58 curr++;
62 while (curr < end) {
63 val = *curr;
72 curr++;
84 curr = pptr = kmap(page);
95 start = offset + (curr - pptr) * 32 + i;
112 *curr
165 __be32 *pptr, *curr, *end; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus_journal/
H A Dbitmap.c22 __be32 *pptr, *curr, *end; local
40 curr = pptr + (offset & (PAGE_CACHE_BITS - 1)) / 32;
49 val = *curr;
58 curr++;
62 while (curr < end) {
63 val = *curr;
72 curr++;
84 curr = pptr = kmap(page);
95 start = offset + (curr - pptr) * 32 + i;
112 *curr
165 __be32 *pptr, *curr, *end; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/test/
H A Dtest053.tcl141 for { set j $i; set curr [$dbc get -first]} { $j < $npages} { \
142 incr j; set curr [$dbc get -next]} {
143 error_check_bad dbc:get:next [llength $curr] 0
145 [lindex [lindex $curr 0] 0] $key_set($j)00
148 for { set j [expr $npages - 1]; set curr [$dbc get -last]} { \
150 set j [incr j -1]; set curr [$dbc get -prev]} {
151 error_check_bad dbc:get:prev [llength $curr] 0
153 [lindex [lindex $curr 0] 0] $key_set($j)00
161 set curr [eval {$db get} $txn {-recno $j}]
163 db_get:recno:$j [llength $curr]
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/
H A Dflac_parser.c316 FLACHeaderMarker *curr; local
322 curr = header;
323 while (curr != child) {
326 if (curr->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY) {
328 expected_sample_num += curr->fi.blocksize;
332 curr = curr->next;
346 FLACHeaderMarker *curr; local
354 curr = header->next;
355 for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS && curr !
452 FLACHeaderMarker *curr; local
516 FLACHeaderMarker *curr; local
719 FLACHeaderMarker *curr = fpc->headers, *temp; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/
H A Dflac_parser.c301 FLACHeaderMarker *curr; local
307 curr = header;
308 while (curr != child) {
311 if (curr->link_penalty[i] < FLAC_HEADER_CRC_FAIL_PENALTY) {
313 expected_sample_num += curr->fi.blocksize;
317 curr = curr->next;
331 FLACHeaderMarker *curr; local
339 curr = header->next;
340 for (i = 0; i < FLAC_MAX_SEQUENTIAL_HEADERS && curr !
430 FLACHeaderMarker *curr; local
479 FLACHeaderMarker *curr; local
664 FLACHeaderMarker *curr = fpc->headers, *temp; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/mpstat/
H A Dmpstat.c202 * @curr Position in array where current statistics will be saved.
212 unsigned long long itv, int prev, int curr,
226 p0 = st_ic[curr] + j;
243 p0 = st_ic[curr] + j;
253 scc = st_cpu[curr] + cpu;
276 p0 = st_ic[curr] + j; /* irq field set only for proc #0 */
301 p = st_ic[curr] + (cpu - 1) * ic_nr + j;
322 * @curr Position in array where statistics for current sample are.
332 void write_stats_core(int prev, int curr, int dis, argument
343 g_itv = get_interval(uptime[prev], uptime[curr]);
211 write_irqcpu_stats(struct stats_irqcpu *st_ic[], int ic_nr, int dis, unsigned long long itv, int prev, int curr, char *prev_string, char *curr_string) argument
577 write_stats_avg(int curr, int dis) argument
595 write_stats(int curr, int dis) argument
621 read_interrupts_stat(char *file, struct stats_irqcpu *st_ic[], int ic_nr, int curr) argument
717 int curr = 1, dis = 1; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/time/
H A Dtimer_stats.c169 struct entry **head, *curr, *prev; local
172 curr = *head;
179 while (curr) {
180 if (match_entries(curr, entry))
181 return curr;
183 curr = curr->next;
189 curr = *head;
195 while (curr) {
196 if (match_entries(curr, entr
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/udhcpd/
H A Dserverpacket.c114 struct option_set *curr; local
174 curr = server_config.options;
175 while (curr) {
176 if (curr->data[OPT_CODE] != DHCP_LEASE_TIME)
177 add_option_string(packet.options, curr->data);
178 curr = curr->next;
203 struct option_set *curr; local
222 curr = server_config.options;
223 while (curr) {
246 struct option_set *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/networking/udhcp/
H A Dserverpacket.c108 struct option_set *curr; local
175 curr = server_config.options;
176 while (curr) {
177 if (curr->data[OPT_CODE] != DHCP_LEASE_TIME)
178 add_option_string(packet.options, curr->data);
179 curr = curr->next;
204 struct option_set *curr; local
224 curr = server_config.options;
225 while (curr) {
252 struct option_set *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/common/
H A Dgaugecmn.cpp108 int curr = GetValue(), max = GetRange(); local
112 if (curr < max)
113 SetValue(curr + 1);
122 if (curr > 0)
123 SetValue(curr - 1);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c44 unsigned curr; /* number of index bits for current table */ local
145 filled is at next and has curr index bits. The code being used is huff
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
199 curr = root; /* current table index bits */
228 fill = 1U << curr;
259 next += 1U << curr;
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/contrib/infback9/
H A Dinftree9.c44 unsigned curr; /* number of index bits for current table */ local
145 filled is at next and has curr index bits. The code being used is huff
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
199 curr = root; /* current table index bits */
228 fill = 1U << curr;
259 next += 1U << curr;
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/
H A Dhash.c328 hash_entry *curr; local
334 curr = htab->first;
340 curr = (hash_entry *) *ptr;
342 curr = curr->next;
343 *ptr = (void *) curr;
345 *key = curr->key;
346 *keylen = curr->keylen;
347 *data = curr->data;
362 hash_entry *curr; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/
H A Dhash.c328 hash_entry *curr; local
334 curr = htab->first;
340 curr = (hash_entry *) *ptr;
342 curr = curr->next;
343 *ptr = (void *) curr;
345 *key = curr->key;
346 *keylen = curr->keylen;
347 *data = curr->data;
362 hash_entry *curr; local
[all...]

Completed in 306 milliseconds

1234567891011>>