Searched refs:list (Results 76 - 100 of 444) sorted by relevance

1234567891011>>

/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dqueues.pl38 list_to_queue/2, % convert list to queue
39 queue_to_list/2. % convert queue to list
64 Front is a list and Back is a tail of that list, and is normally a
67 are the list difference, that is, all the elements starting at Front
116 added in the same order that they appear in the list, e.g.
126 summary:"adds the new element at the front of the list",
129 adds the new element at the front of the list. Unlike join_queue,
154 opposite order to the order they had in the list, or we could add
156 in the list
[all...]
H A Dforall.pl62 Can also be used for constructing a list.
98 % iterate over list
107 % reverse list
115 % make list of integers [1,2,3,4,5]
119 % make a list of length 3
123 % get the length of a list
129 % filter list elements
136 % collect args in list (bad example, use =.. if you really want to do that!)
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/
H A Dcm.c15 * copyright notice, this list of conditions and the following
19 * copyright notice, this list of conditions and the following
52 struct list_head list; member in struct:id_map_entry
147 list_del(&ent->list);
237 list_add_tail(&ent->list, &sriov->cm_list);
386 list_for_each_entry_safe(map, tmp_map, &dev->sriov.cm_list, list) {
411 /* first, move nodes belonging to slave to db remove list */
418 list_move_tail(&ent->list, &lh);
421 list_for_each_entry_safe(map, tmp_map, &lh, list) {
427 list_for_each_entry_safe(map, tmp_map, &dev->sriov.cm_list, list) {
[all...]
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Dnotice.c15 * copyright notice, this list of conditions and the following
19 * copyright notice, this list of conditions and the following
110 struct list_head list; member in struct:inform_member
117 struct list_head list; member in struct:inform_notice
199 list_add(&member->list, &group->pending_list);
265 list_move(&member->list, &group->active_list);
272 list_del_init(&member->list);
285 struct inform_member, list);
287 list_del_init(&member->list);
305 * Report a notice to all active subscribers. We use a temporary list t
313 struct list_head list; local
[all...]
H A Daddr.c18 * copyright notice, this list of conditions and the following
22 * copyright notice, this list of conditions and the following
53 struct list_head list; member in struct:addr_req
209 list_for_each_entry_reverse(temp_req, &req_list, list) {
214 list_add(&req->list, &temp_req->list);
216 if (req_list.next == &req->list)
501 list_for_each_entry_safe(req, temp_req, &req_list, list) {
511 list_move_tail(&req->list, &done_list);
515 req = list_entry(req_list.next, struct addr_req, list);
[all...]
H A Duverbs_main.c19 * copyright notice, this list of conditions and the following
23 * copyright notice, this list of conditions and the following
153 list_del(&evt->list);
163 list_del(&evt->list);
176 list_del(&evt->list);
187 list_for_each_entry_safe(mcast, tmp, &uobj->mcast_list, list) {
189 list_del(&mcast->list);
204 list_for_each_entry_safe(uobj, tmp, &context->ah_list, list) {
212 list_for_each_entry_safe(uobj, tmp, &context->qp_list, list) {
225 list_for_each_entry_safe(uobj, tmp, &context->srq_list, list) {
[all...]
H A Ducma.c15 * copyright notice, this list of conditions and the following
19 * copyright notice, this list of conditions and the following
74 struct list_head list; member in struct:ucma_context
84 struct list_head list; member in struct:ucma_multicast
91 struct list_head list; member in struct:ucma_event
158 list_add_tail(&ctx->list, &file->ctx_list);
189 list_add_tail(&mc->list, &ctx->mc_list);
285 list_add_tail(&uevent->list, &ctx->file->event_list);
323 uevent = list_entry(file->event_list.next, struct ucma_event, list);
343 list_del(&uevent->list);
[all...]
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Dbip_comp.c165 * Unify the two terms and return in List the list of metaterms
171 pword *list = (pword *) 0; local
174 res = ec_unify_(v1, t1, v2, t2, &list);
176 if (list == (pword *) 0) {
179 Return_Unify_List(vl, tl, list)
270 wdid2 = v2.ptr->val.did; /* wdid2 != d_.list */
275 return strcmp(DidName(d_.list), DidName(wdid2));
281 wdid = v1.ptr->val.did; /* wdid != d_.list */
286 return strcmp(DidName(wdid), DidName(d_.list));
446 * MetaList is a list o
492 pword list; local
875 pword *list; local
924 register pword *list; local
980 pword *list; local
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DVisualizerDrawer.java232 * @param list
235 public Colors domainBasedColor(FullDomain list) { argument
236 if (list.size() > 1) {
245 * @param list
248 public Colors booleanColor(FullDomain list){ argument
249 if (list.isFixed()) {
250 return booleanColor(list.getIntValue());
256 public Colors booleanColor(FullDomain list, FullDomain removed){ argument
257 if (!list.isFixed()) {
260 if (list
[all...]
H A DVisualizerMatrix.java62 FullDomain list,FullDomain removed){
63 if (list.isFixed()){
72 list.getIntValue(),Colors.ASSIGNED_TEXT_COLOR);
79 for( int v: list) {
142 // FullDomain list = entry.getDomainAsList();
143 // out.println("<!-- index "+xy.getX() + " "+ xy.getY() +" domain "+list+" -->");
144 // if (list.isFixed()){
145 // unitSquareSVG(out,posX(xy),posY(xy),domainBasedColor(list));
147 // list.getIntValue(),Colors.ASSIGNED_TEXT_COLOR);
154 // for( int v: list) {
61 drawMatrixEntry(PrintWriter out,Pair xy, FullDomain list,FullDomain removed) argument
[all...]
/barrelfish-master/lib/lua/src/
H A Dlstring.c77 while (p) { /* for each node in the list */
99 int tag, unsigned int h, GCObject **list) {
103 ts = &luaC_newobj(L, tag, totalsize, list, 0)->ts;
118 GCObject **list; /* (pointer to) list where it will be inserted */ local
123 list = &tb->hash[lmod(h, tb->size)];
124 s = createstrobj(L, str, l, LUA_TSHRSTR, h, list);
98 createstrobj(lua_State *L, const char *str, size_t l, int tag, unsigned int h, GCObject **list) argument
H A Dlcode.h17 ** Marks the end of a patch list. It is an invalid value both as an absolute
18 ** address, and as a list link (would link an element to itself).
71 LUAI_FUNC void luaK_patchlist (FuncState *fs, int list, int target);
72 LUAI_FUNC void luaK_patchtohere (FuncState *fs, int list);
73 LUAI_FUNC void luaK_patchclose (FuncState *fs, int list, int level);
/barrelfish-master/lib/libc/resolv/
H A Dres_mkupdate.c50 #include <isc/list.h>
89 * the linked list, or section order has a problem
1070 findservice(const char *s, struct valuelist **list) { argument
1071 struct valuelist *lp = *list;
1076 if (lp != *list) {
1080 (*list)->prev = lp;
1081 lp->next = *list;
1082 *list = lp;
1120 struct valuelist **list = &servicelist; local
1121 struct valuelist *lp = *list;
1148 struct valuelist **list = &protolist; local
[all...]
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dflat.pl29 a tree such as 1+x+0+(u*v+9)+(x^2+2) and flatten it to a list
37 to a list. They also omit "units" of that operator, that is, if
39 appear in the list. The predicate
49 The list_to_<operator> predicates take a list and turn it back
59 lets you make your own versions. If the list is [] the Unit will
63 list it will fail.
H A Dorder.pl26 % is true when List is a list of terms [T1,T2,...,Tn] such that
29 % sort/2. Beware: just because a list is ordered does not mean
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsparutil.tex44 given list in parallel. Note that it cannot work backwards and generate
45 lists like \bipref{member/2}{../bips/lib/lists/member-2.html} can, the list must be a proper list.
61 the {\it Out} list, since it is implemented on top of \bipref{findall/3}{../bips/kernel/allsols/findall-3.html}.
/barrelfish-master/lib/openssl-1.0.0d/test/
H A Dtestenc30 for i in `$cmd list-cipher-commands`
H A Dtests.com32 $! NOTE: This list reflects the list of dependencies following the
/barrelfish-master/usr/eclipseclp/documents/internal/project/
H A Dorganisation.tex36 e.g.\ cvs repository, bugs list, web site, development tools.
97 \item[majordomo] for mailing list administration
107 \item[eclipse-users] the user mailing list. This is a majordomo-
108 managed mailing list. People can subscribe and unsubscribe
109 themselves. You need to be on the list in order to mail
112 We use the list to discuss questions about \eclipse.
115 \item[eclipse-announce] the announcements mailing list.
116 This is a majordomo-managed mailing list. People can subscribe
119 list. The owner is currently j.schimpf@icparc.ic.ac.uk.
120 We use the list t
[all...]
/barrelfish-master/lib/phoenix/
H A Dqueue.h7 * notice, this list of conditions and the following disclaimer.
9 * notice, this list of conditions and the following disclaimer in the
30 #include "list.h"
32 typedef list queue_t;
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/
H A Dmcg.c17 * copyright notice, this list of conditions and the following
21 * copyright notice, this list of conditions and the following
132 list_for_each_entry(pqp, &s_steer->promisc_qps[steer], list)
165 list_add_tail(&new_entry->list, &s_steer->steer_entries[steer]);
168 * it should be inserted to duplicates list*/
178 list_add_tail(&dqp->list, &new_entry->duplicates);
201 list_for_each_entry(pqp, &s_steer->promisc_qps[steer], list)
223 list_del(&dqp->list);
226 list_del(&new_entry->list);
249 list_for_each_entry(tmp_entry, &s_steer->steer_entries[steer], list)
[all...]
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/
H A Dwait.h12 * notice unmodified, this list of conditions, and the following
15 * notice, this list of conditions and the following disclaimer in the
34 #include <linux/list.h>
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.cc145 // It's not a list
149 // It's not a list of integers
210 return list(EC_word(max), l);
212 return list(EC_word(max-1), list(EC_word(max), l));
214 return list(term(dotdot, EC_word(last), EC_word(max)), l);
/barrelfish-master/lib/cxx/cxx/support/solaris/
H A Dmbsnrtowcs.inc13 * notice, this list of conditions and the following disclaimer.
15 * notice, this list of conditions and the following disclaimer in the
/barrelfish-master/lib/posixcompat/
H A Dpty.h15 #include <collections/list.h>

Completed in 124 milliseconds

1234567891011>>