| /src/sbin/fsck_v7fs/ |
| datablock.c | 373 v7fs_ino_t victim; local
377 pwarn("Is victim %s (%s is preserved)", filename(fs, i),
380 victim = i;
382 pwarn("Is victim %s (%s is preserved)",
385 victim = j;
392 if ((error = v7fs_inode_load(fs, &inode, victim)))
|
| /src/lib/libc/rpc/ |
| svc_dg.c | 394 u_int uc_nextvictim; /* points to next victim in fifo list */
471 static const char cache_set_err1[] = "victim not found";
472 static const char cache_set_err2[] = "victim alloc failed";
478 cache_ptr victim; local
499 victim = uc->uc_fifo[uc->uc_nextvictim];
500 if (victim != NULL) {
501 loc = CACHE_LOC(xprt, victim->cache_xid);
503 *vicp != NULL && *vicp != victim;
511 *vicp = victim->cache_next; /* remove from cache */
512 newbuf = victim->cache_reply
[all...] |
| /src/external/bsd/jemalloc/dist/test/unit/ |
| hpa.c | 204 size_t victim = prng_range_zu(&prng_state, nlive_edatas); local
205 edata_t *to_free = live_edatas[victim];
206 live_edatas[victim] = live_edatas[nlive_edatas - 1];
|
| rb.c | 954 int victim = (int)gen_rand64_range(sfmt, nnodes); local
955 if (!nodes[victim].mid_remove) {
956 tree_remove(&tree, &nodes[victim]);
957 nodes[victim].mid_remove = true;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-scopedtables.cc | 54 std::pair<expr_hash_elt_t, expr_hash_elt_t> victim = m_stack.pop (); local
57 if (victim.first == NULL)
66 victim.first->print (dump_file);
69 slot = m_avail_exprs->find_slot (victim.first, NO_INSERT);
70 gcc_assert (slot && *slot == victim.first);
71 if (victim.second != NULL)
74 *slot = victim.second;
|
| tree-ssa-threadupdate.cc | 1042 edge victim; local
1055 victim = find_edge (rd->dup_blocks[count], (*path)[i]->e->dest);
1058 then redirect VICTIM to the final destination of the jump
1062 if (victim->dest != elast->dest)
1064 e2 = redirect_edge_and_branch (victim, elast->dest);
1066 at the target. If the edge already existed (e2 != victim
1069 if (e2 == victim)
1074 e2 = victim;
1078 /* Redirect VICTIM to the next duplicated block in the path. */
1079 e2 = redirect_edge_and_branch (victim, rd->dup_blocks[count + 1])
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-scopedtables.cc | 54 std::pair<expr_hash_elt_t, expr_hash_elt_t> victim = m_stack.pop (); local
57 if (victim.first == NULL)
66 victim.first->print (dump_file);
69 slot = m_avail_exprs->find_slot (victim.first, NO_INSERT);
70 gcc_assert (slot && *slot == victim.first);
71 if (victim.second != NULL)
74 *slot = victim.second;
|
| tree-ssa-threadupdate.cc | 1067 edge victim; local
1080 victim = find_edge (rd->dup_blocks[count], (*path)[i]->e->dest);
1083 then redirect VICTIM to the final destination of the jump
1087 e2 = redirect_edge_and_branch (victim, elast->dest);
1089 at the target. If the edge already existed (e2 != victim
1092 if (e2 == victim)
1098 /* Redirect VICTIM to the next duplicated block in the path. */
1099 e2 = redirect_edge_and_branch (victim, rd->dup_blocks[count + 1]);
|
| /src/sys/altq/ |
| altq_jobs.c | 774 int victim; local
779 victim = -1;
841 victim = pick_dropped_rlc(jif);
843 if (victim == -1) {
853 victim_class = jif->jif_classes[victim];
882 victim = pick_dropped_rlc(jif);
883 if (victim == -1) {
891 victim_class = jif->jif_classes[victim];
|
| /src/external/bsd/libevent/dist/ |
| evutil.c | 1356 struct evutil_addrinfo *victim = *ai; local
1357 *ai = victim->ai_next;
1358 victim->ai_next = NULL;
1359 freeaddrinfo(victim);
|
| event.c | 593 struct event_debug_entry **ent, *victim; local
597 victim = *ent;
599 mm_free(victim);
|
| evdns.c | 2068 struct server_reply_item *victim, *next, **list; local
2078 victim = *list;
2079 while (victim) {
2080 next = victim->next;
2081 mm_free(victim->name);
2082 if (victim->data)
2083 mm_free(victim->data);
2084 mm_free(victim);
2085 victim = next;
4151 struct hosts_entry *victim; local
4176 struct hosts_entry *victim; local
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| evutil.c | 1354 struct evutil_addrinfo *victim = *ai; local
1355 *ai = victim->ai_next;
1356 victim->ai_next = NULL;
1357 freeaddrinfo(victim);
|
| event.c | 591 struct event_debug_entry **ent, *victim; local
595 victim = *ent;
597 mm_free(victim);
|
| evdns.c | 2066 struct server_reply_item *victim, *next, **list; local
2076 victim = *list;
2077 while (victim) {
2078 next = victim->next;
2079 mm_free(victim->name);
2080 if (victim->data)
2081 mm_free(victim->data);
2082 mm_free(victim);
2083 victim = next;
4149 struct hosts_entry *victim; local
4174 struct hosts_entry *victim; local
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| adb.c | 2389 dns_adbname_t *victim, *next_victim; local
2403 victim = ISC_LIST_TAIL(adb->names[bucket]);
2404 for (victims = 0; victim != NULL && victims < max_victims && scans < 10;
2405 victim = next_victim)
2407 INSIST(!NAME_DEAD(victim));
2409 next_victim = ISC_LIST_PREV(victim, plink);
2410 (void)check_expire_name(&victim, now);
2411 if (victim == NULL) {
2416 if (!NAME_FETCH(victim) &&
2417 (overmem || victim->last_used + ADB_STALE_MARGIN <= now)
[all...] |
