| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| extent.h | 87 edata_t *neighbor = contents.edata; local
88 if (neighbor == NULL) {
91 /* It's not safe to access *neighbor yet; must verify states first. */
102 /* From this point, it's safe to access *neighbor. */
104 edata_committed_get(neighbor))) {
116 /* From this point, it's safe to access *neighbor. */
120 if (edata_pai_get(neighbor) != pai) {
125 edata_arena_ind_get(neighbor));
128 edata_arena_ind_get(neighbor)) {
132 assert(!edata_guarded_get(edata) && !edata_guarded_get(neighbor));
[all...] |
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| extent.h | 87 edata_t *neighbor = contents.edata; local
88 if (neighbor == NULL) {
91 /* It's not safe to access *neighbor yet; must verify states first. */
102 /* From this point, it's safe to access *neighbor. */
104 edata_committed_get(neighbor))) {
116 /* From this point, it's safe to access *neighbor. */
120 if (edata_pai_get(neighbor) != pai) {
125 edata_arena_ind_get(neighbor));
128 edata_arena_ind_get(neighbor)) {
132 assert(!edata_guarded_get(edata) && !edata_guarded_get(neighbor));
[all...] |
| /src/external/bsd/jemalloc/dist/src/ |
| emap.c | 83 /* From this point, the neighbor edata can be safely acquired. */
84 edata_t *neighbor = neighbor_contents.edata; local
85 assert(edata_state_get(neighbor) == expected_state);
86 emap_update_edata_state(tsdn, emap, neighbor, extent_state_merging);
88 extent_assert_can_expand(edata, neighbor);
90 extent_assert_can_coalesce(edata, neighbor);
93 return neighbor;
|
| /src/external/cddl/osnet/dist/common/avl/ |
| avl.c | 698 * neighbor node. That node will have at most 1 child. Note this
701 * As an optimization, we choose the greater neighbor if the tree
702 * is right heavy, otherwise the left neighbor. This reduces the
830 void *neighbor; local
832 ASSERT(((neighbor = AVL_NEXT(t, obj)) == NULL) ||
833 (t->avl_compar(obj, neighbor) <= 0));
835 neighbor = AVL_PREV(t, obj);
836 if ((neighbor != NULL) && (t->avl_compar(obj, neighbor) < 0)) {
847 void *neighbor; local
864 void *neighbor; local
[all...] |
| /src/usr.sbin/mrinfo/ |
| mrinfo.c | 193 * Process an incoming neighbor-list message.
216 u_int32_t neighbor; local
217 GET_ADDR(neighbor);
218 neighbor = htonl(neighbor);
221 inet_fmt(neighbor),
222 inet_name(neighbor), metric, thresh);
260 u_int32_t neighbor = *(u_int32_t*)p; local
264 inet_fmt(neighbor),
265 inet_name(neighbor), metric, thresh)
[all...] |
| /src/usr.sbin/mrouted/ |
| snmp.c | 373 * Find the lowest neighbor >= (V,A) spec
399 * Find a neighbor, if it exists off a given Vif
426 struct listaddr *neighbor; local
443 if (!(neighbor = find_neighbor(vifi, addr)))
461 neighbor = next_neighbor(&vifi,addr);
462 if (!neighbor)
466 put_address(newname, neighbor->al_addr, vp->namelen+1);
471 if (!(neighbor = next_neighbor(&vifi,addr+1)))
475 put_address(newname, neighbor->al_addr, vp->namelen+1);
490 long_return = (currtime - neighbor->al_ctime)*100
[all...] |
| /src/usr.sbin/map-mbone/ |
| mapper.c | 53 typedef struct neighbor { struct
54 struct neighbor *next;
60 } Neighbor;
65 Neighbor *neighbors; /* List of neighbors' IP addresses */
74 struct interface *interfaces; /* Else, neighbor data */
91 Neighbor * find_neighbor(u_int32_t addr, Node *node);
147 Neighbor *find_neighbor(u_int32_t addr, Node *node)
152 Neighbor *nb;
228 * Process an incoming neighbor probe message.
250 * Process an incoming neighbor-list request message
388 u_int32_t neighbor; local
529 u_int32_t neighbor; local
[all...] |
| /src/usr.sbin/rwhod/ |
| rwhod.c | 86 * We communicate with each neighbor in a list constructed at the time we're
90 struct neighbor { struct
91 struct neighbor *n_next;
98 static struct neighbor *neighbors;
361 struct neighbor *np;
474 struct neighbor *np;
531 np = (struct neighbor *)malloc(len);
533 quit("malloc of neighbor structure");
|
| /src/external/bsd/tcpdump/dist/ |
| print-olsr.c | 174 { 0, "Not-Neighbor" },
181 nd_ipv4 neighbor; member in struct:olsr_lq_neighbor4
188 nd_ipv6 neighbor; member in struct:olsr_lq_neighbor6
235 * print a neighbor list with LQ extensions.
248 ND_PRINT("\n\t neighbor %s, link-quality %.2f%%"
249 ", neighbor-link-quality %.2f%%",
250 GET_IPADDR_STRING(lq_neighbor->neighbor),
273 ND_PRINT("\n\t neighbor %s, link-quality %.2f%%"
274 ", neighbor-link-quality %.2f%%",
275 GET_IP6ADDR_STRING(lq_neighbor->neighbor),
294 int neighbor; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| accesses.cc | 659 // The result is less than zero if CLOBBER should come before NEIGHBOR
660 // or greater than zero if CLOBBER should come after NEIGHBOR.
663 clobber_info *neighbor = group->m_clobber_tree.root (); local
667 neighbor->update_group (group);
669 // If CLOBBER comes before NEIGHBOR, insert CLOBBER to NEIGHBOR's left,
670 // otherwise insert CLOBBER to NEIGHBOR's right.
671 clobber_info::splay_tree::insert_child (neighbor, comparison > 0, clobber);
678 insert_def_after (clobber, neighbor);
679 if (neighbor == group->last_clobber ()
809 clobber_info *neighbor = tree1.root (); local
1230 splay_tree_node<use_info *> *neighbor = def->m_use_tree.root (); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| accesses.cc | 659 // The result is less than zero if CLOBBER should come before NEIGHBOR
660 // or greater than zero if CLOBBER should come after NEIGHBOR.
663 clobber_info *neighbor = group->m_clobber_tree.root (); local
667 neighbor->update_group (group);
669 // If CLOBBER comes before NEIGHBOR, insert CLOBBER to NEIGHBOR's left,
670 // otherwise insert CLOBBER to NEIGHBOR's right.
671 clobber_info::splay_tree::insert_child (neighbor, comparison > 0, clobber);
678 insert_def_after (clobber, neighbor);
679 if (neighbor == group->last_clobber ()
809 clobber_info *neighbor = tree1.root (); local
1230 splay_tree_node<use_info *> *neighbor = def->m_use_tree.root (); local
[all...] |
