Searched refs:dups (Results 1 – 6 of 6) sorted by relevance
72 my $dups = 0;79 $dups++;90 if ($dups > 0) {91 print "$file: removed $dups duplicate includes\n";
34 more "dups". Each "dup" keeps reverse mapping information for a KSM37 Every "chain" and all "dups" linked into a "chain" enforce the54 but N is the number of stable_node "dups", not the number of57 at the head of the "dups" list.60 (because there will be fewer stable_node dups queued into the68 in the stable_node dups, which could be solved by introducing71 stable_node "dups" with few rmap_items in them, but that may increase75 The whole list of stable_node "dups" linked in the stable_node
96 struct list_head *dups) in ttm_eu_reserve_buffers() argument120 } else if (ret == -EALREADY && dups) { in ttm_eu_reserve_buffers()124 list_add(&safe->head, dups); in ttm_eu_reserve_buffers()
230 int i, pos, dups = 0; in unique() local243 dups++; in unique()247 if (dups) in unique()251 AA_BUG(dups < 0); in unique()253 return dups; in unique()268 int i, dups = 0; in aa_vec_unique() local276 dups = unique(vec, n); in aa_vec_unique()285 for (pos = i - 1 - dups; pos >= 0; pos--) { in aa_vec_unique()291 dups++; in aa_vec_unique()299 for (j = i - dups; j > pos; j--) in aa_vec_unique()[all …]
101 struct list_head *dups);
952 unsigned int dups = 0, total_dups = 0; in detect_dups() local965 dups++; total_dups++; in detect_dups()969 dups = 0; in detect_dups()
