Searched refs:neighbour (Results 1 - 5 of 5) sorted by path
| /barrelfish-2018-10-04/kernel/ |
| H A D | capabilities.c | 1232 struct cte *neighbour = NULL; local
1233 if (!neighbour
1234 && (neighbour = mdb_predecessor(dest))
1235 && !is_copy(&dest->cap, &neighbour->cap))
1237 neighbour = NULL;
1239 if (!neighbour
1240 && (neighbour = mdb_successor(dest))
1241 && !is_copy(&dest->cap, &neighbour->cap))
1243 neighbour = NULL;
1246 if (neighbour) {
[all...] |
| /barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/core/ |
| H A D | addr.c | 230 struct neighbour *neigh;
260 neigh_event_send(rt->u.dst.neighbour, NULL);
282 struct neighbour *neigh;
318 neigh = dst->neighbour;
320 neigh_event_send(dst->neighbour, NULL);
610 struct neighbour *neigh = ctx;
|
| /barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
| H A D | modelling.tex | 188 \verb?neighbour(X,Y) :- ( X #= Y+1 ; Y #= X+1 ).?
329 (see \ref{chappropiachr}). The original formulation of neighbour/2
|
| H A D | repairtut.tex | 419 To find a neighbour which overall increases the number of satisfied
|
| H A D | tkdebug.tex | 443 findall(C1-C2, (neighbour(C1,C2), C1=<N,C2=<N), Neighbours),
451 pair list is constructed from \verb'neighbour/2' calls. Let's look at the
452 source for \verb'neighbour/2'. We can do this from the predicate browser, by
453 selecting \verb'neighbour/2' and pushing the \button{Show source} button. We see
457 neighbour / 2 in file buggy_data.map, line 2:
458 %neighbour(4, 3).
459 neighbour(4, 2).
460 neighbour(4, 1).
461 neighbour(4, 2).
462 neighbour(
[all...] |
Completed in 177 milliseconds