/barrelfish-master/usr/drivers/megaraid/ |
H A D | linux_defs.h | 10 #define offsetof(type, member) __builtin_offsetof(type, member)
|
/barrelfish-master/usr/eclipseclp/Opium/demo/ |
H A D | master_basic.pl | 12 member/2, 41 member(X, [X|Xs]). 42 member(X, [Y|Ys]) :- 43 member(X, Ys).
|
H A D | yoyo2.pl | 51 not (member(A, Nodes), 52 member(B, Nodes), 61 member(X, L), 62 member(Y, L), 65 member(Y, L), 68 member(X, L), 77 member(A, Nodes), 78 member(B, Nodes), 102 member(X, L), 109 member( [all...] |
H A D | yoyo1.pl | 23 clause succeeds --> member/2 is called with non-ground parameters --> \n\ 25 but member/2 will produces infinitely many of such lists on \n\ 47 member(X,[X|Tail]). 48 member(X,[Head|Tail]) :- 49 member(X,Tail). 66 member(X,S1),
|
H A D | master_tools.pl | 14 member/2 40 member(X, Ys),
|
H A D | pendulum.pl | 92 member((PredName,Arity),Subgoals), 113 member((PredName/Arity,FileName),PredList), 229 member(X,[X|Xs]). 230 member(X,[Y|Ys]) :- 231 member(X,Ys). 268 member(Element,List). 299 definition_in__db((member, 2), 'loop14.pl'). 313 subgoals_of__db((generate_directly_recursive, 0), [(definition_in__db, 2), (subgoals_of__db, 3), (member, 2)], 'loop14.pl'). 317 subgoals_of__db((generate_indirectly_recursive, 0), [(indirect_recursion__db, 1), (member, 2)], 'loop14.pl'). 329 subgoals_of__db((member, [all...] |
H A D | basic.pl | 54 not(member([cop,X,Y],List)), 61 not(member([Attr,Val],List)), 115 member(X,Set), 149 member(X,[X|Tail]). 150 member(X,[Head|Tail]) :- 151 member(X,Tail). 174 member([Attr,Val],ValList), 220 not(member([Attr,X],List)), 329 member(LibDir, Path), 334 member(Suffi [all...] |
H A D | puzzle.pl | 45 [member(Q1, Friends), 48 member(Q2, Friends),
|
H A D | show_queens.pl | 62 (member((X, Y), CoList) ->
|
/barrelfish-master/include/ |
H A D | stddef.h | 65 #define offsetof(type, member) __offsetof(type, member)
|
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/ |
H A D | notice.c | 187 static void deref_member(struct inform_member *member) argument 189 if (atomic_dec_and_test(&member->refcount)) 190 complete(&member->comp); 193 static void queue_reg(struct inform_member *member) argument 195 struct inform_group *group = member->group; 199 list_add(&member->list, &group->pending_list); 208 static int send_reg(struct inform_group *group, struct inform_member *member) argument 219 inform.trap.generic.trap_num = cpu_to_be16(member->info.trap_number); 224 group->last_join = member; 261 static void join_group(struct inform_group *group, struct inform_member *member) argument 268 fail_join(struct inform_group *group, struct inform_member *member, int status) argument 279 struct inform_member *member; local 312 struct inform_member *member; local 340 struct inform_member *member; local 410 struct inform_member *member; local 547 struct inform_member *member; local 594 struct inform_member *member; local [all...] |
H A D | multicast.c | 199 static void deref_member(struct mcast_member *member) argument 201 if (atomic_dec_and_test(&member->refcount)) 202 complete(&member->comp); 205 static void queue_join(struct mcast_member *member) argument 207 struct mcast_group *group = member->group; 211 list_add_tail(&member->list, &group->pending_list); 221 * A multicast group has three types of members: full member, non member, and 222 * send only member. We need to keep track of the number of members of each 237 * the group is still a member wit 300 send_join(struct mcast_group *group, struct mcast_member *member) argument 343 join_group(struct mcast_group *group, struct mcast_member *member, u8 join_state) argument 354 fail_join(struct mcast_group *group, struct mcast_member *member, int status) argument 365 struct mcast_member *member; local 405 struct mcast_member *member; local 471 struct mcast_member *member; local 586 struct mcast_member *member; local 634 struct mcast_member *member; local [all...] |
/barrelfish-master/usr/skb/programs/ |
H A D | plat_omap44xx.pl | 112 member(Core, Cores), 125 member(Core, Cores), 135 member(Device, Devices), 136 findall(drv_dep(Dep),member(Dep,Deps),DepInfo),
|
H A D | db_partitions.pl | 20 member(task(taskname(987654321,987654321), CoreList), AllocatedCores), 44 member(task(taskname(987654321,987654321), CoreList), AllocatedCores),
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | bags.pl | 19 member/3, 73 % member/3, 74 % member/3, 180 /* There are two versions of the routines member, bagmax, and bagmin. 186 member(E, M, bag(E,K,B)) :- 187 member(B, E, K, M). 188 member(E, M, bag(_,_,B)) :- 189 member(E, M, B). 191 member(bag(E,L,B), E, K, M) :- !, 193 member( [all...] |
H A D | xml_diagnosis.pl | 26 member( Attribute, Attributes ),
55 member( Attribute, Attributes ),
72 \+ (member( Char, Chars ), \+ (integer(Char), Char >=0, Char =< 255)).
81 {member( id=Chars, Attributes ), is_chars( Chars )},
|
H A D | graphs.pl | 167 member(X-Y, P_Graph). 176 member(X-Neibs, S_Graph), 177 member(Y, Neibs). 180 member(X-Neibs, S_Graph), 185 member(Y, Neibs).
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | par_util.pl | 62 summary:"Parallel version of member/2", 63 desc:html("Parallel version of member/2, i.e. selects elements from 65 and generate lists like member/2 can, the list must be a proper list.")]). 100 % Parallel member(?, +List), it can't generate lists! 130 member(a-Goal1, Bag), 131 member(b-Goal2, Bag). 168 (member(Wid, AliveIds) ; member(Wid, SleepIds)), 189 (member(Wid, AliveIds) ; member(Wi [all...] |
H A D | lists.pl | 39 * member/2, 63 member/2, length/2 etc) are available by default and do not require 99 member/2, 700 see_also:[subtract / 3, member / 2]]). 732 see_also:[subtract / 3, member / 2]]). 801 :- comment(member / 2, [ 802 summary:"Succeeds if Term unifies with a member of the list List.\n\n", 803 amode:(member(-,+) is nondet), 804 amode:(member(+,-) is nondet), 805 amode:(member( [all...] |
/barrelfish-master/lib/rcce/ |
H A D | RCCE_reduce.c | 92 if (RCCE_IAM != comm.member[root]) { 94 if (ierr=RCCE_send(inbuf, num*type_size, comm.member[root])) 97 if (all) if (ierr=RCCE_recv(outbuf, num*type_size, comm.member[root])) 104 if (ierr=RCCE_recv(inbuf, num*type_size, comm.member[ue])) 134 if(ierr=RCCE_send(outbuf, num*type_size, comm.member[ue])) 171 int root, // member of "comm" receiving reduction results 176 // check to make sure root is member of the communicator
|
H A D | RCCE_comm.c | 58 comm->member[comm->size++] = i;
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsparutil.tex | 43 Parallel version of \bipref{member/2}{../bips/lib/lists/member-2.html}, i.e.\ selects elements from the 45 lists like \bipref{member/2}{../bips/lib/lists/member-2.html} can, the list must be a proper list.
|
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/ |
H A D | rbtree.h | 45 * presents so it matches the member names expected by linux. 65 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
|
/barrelfish-master/usr/eclipseclp/ecrc_solvers/chr/ |
H A D | time.pl | 26 equality(_1039, i - i) :- !, member(equals, _1039). 27 equality(_1119, s - s) :- !, member(eq, _1119). 28 equality(_1199, p - p) :- (is_quall(_1199) -> member(_1220, _1199), (_1220 = eq ; number(_1220), _1220 =:= 0) ; member(_1250 - _1254, _1199), (_1250 = 0, _1254 = 0 ; _1250 =< 0, 0 =< _1254)), !. 53 transl(_4675, _4678, _4681, _4684, _4687) :- var(_4681), !, setof(_4709, _4712 ^ _4716 ^ (member(_4712, _4675), member(_4716, _4678), trans(_4712, _4716, _4709, _4684, _4687)), _4758), mergerel(_4758, _4681, _4684, _4687). 54 transl(_4959, _4962, _4965, _4968, _4971) :- var(_4962), !, setof(_4993, _4996 ^ _5000 ^ (member(_4996, _4959), member(_5000, _4965), trans(_4996, _4993, _5000, _4968, _4971)), _5042), mergerel(_5042, _4962, _4968, _4971). 55 transl(_5243, _5246, _5249, _5252, _5255) :- var(_5243), !, setof(_5277, _5280 ^ _5284 ^ (member(_5280, _5246), member(_528 [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/ |
H A D | domain.pl | 153 X::[A|L] <=> domain(number), member(X,[A|L]), not number(X) | 164 X::[A|L] <=> ground(X) | (member(X,[A|L]) -> true). 169 I-I::L <=> setof(X,member(X-X,L),L1), I::L1. 170 I-V::L <=> ground(I) | setof(X,member(I-X,L),L1), V::L1. 171 I-V::L <=> ground(V) | setof(X,member(X-V,L),L1), I::L1. 310 intersect(A::L1,B::L2,C::L3):- findall(C,(member(A,L1),member(B,L2)),L3). 313 Y lt X, X-Y::L <=> A=R-S,findall(A,(member(A,L),R@< S),L1) | X-Y::L1. 314 X lt Y, X-Y::L <=> A=R-S,findall(A,(member(A,L),S@< R),L1) | X-Y::L1. 315 Y le X, X-Y::L <=> A=R-S,findall(A,(member( [all...] |