Searched refs:list (Results 26 - 50 of 444) sorted by relevance

1234567891011>>

/barrelfish-master/include/collections/
H A Dstack.h20 #include <collections/list.h>
31 * elements of the stack kept in a linked list
/barrelfish-master/lib/cxx/cxxabi/
H A Dabort_message.cpp38 va_list list; local
39 va_start(list, format);
40 vfprintf(stderr, format, list);
41 va_end(list);
/barrelfish-master/lib/term/client/
H A Dfilter_priv.h19 #include <collections/list.h>
/barrelfish-master/usr/gups/
H A Dbench.sh30 sudo taskset --cpu-list 1 chrt 99 numactl -m 0 ./$p $size 2M 1
/barrelfish-master/usr/mem_serv_dist/
H A Dargs.h31 char *list_to_string(coreid_t *list, size_t l_len);
H A Dargs.c28 // assume exclude list isn't sorted
56 DEBUG_ERR(LIB_ERR_MALLOC_FAIL,"when processing core list argument");
66 DEBUG_ERR(LIB_ERR_MALLOC_FAIL,"when processing core list argument");
84 // mallocs *list
85 static void parse_list(char *optargs, coreid_t **list, int *len) argument
88 assert(list != NULL);
91 *list = NULL;
93 // a list looks like this: 0,1,2,3,4,5
98 DEBUG_ERR(LIB_ERR_MALLOC_FAIL, "when parsing core list");
111 *list
147 list_to_string(coreid_t *list, size_t l_len) argument
[all...]
/barrelfish-master/usr/skb/octopus/
H A Dpredicates.c108 pword list, cur, rest; local
110 for (list = ec_arg(2); ec_get_list(list, &cur, &rest) == PSUCCEED; list = rest) {
140 pword list, cur, rest; local
142 for (list = ec_arg(2); ec_get_list(list, &cur, &rest) == PSUCCEED; list = rest) {
182 pword list, cur, rest; local
185 for (list
248 pword list, cur, rest; local
349 pword list, cur, rest; local
396 pword list, cur, rest; local
442 pword list, cur, rest; local
[all...]
/barrelfish-master/lib/libc/iconv/
H A Dbsd_iconv.c13 * notice, this list of conditions and the following disclaimer.
15 * notice, this list of conditions and the following disclaimer in the
182 __bsd___iconv_free_list(char **list, size_t sz) argument
185 _citrus_esdb_free_list(list, sz);
206 char **list, **names; local
215 if (__bsd___iconv_get_list(&list, &sz, true)) {
216 list = NULL;
219 qsort((void *)list, sz, sizeof(char *), qsort_helper);
222 slashpos = strchr(list[i], '/');
226 curkey = strndup(list[
[all...]
H A Dcitrus_esdb.c12 * notice, this list of conditions and the following disclaimer.
14 * notice, this list of conditions and the following disclaimer in the
241 * free the list.
244 _citrus_esdb_free_list(char **list, size_t num) argument
248 free(list[i]);
249 free(list);
261 char **list, **q; local
284 /* allocate list pointer space */
285 list = malloc(num * sizeof(char *));
287 if (list
[all...]
/barrelfish-master/usr/skb/programs/
H A Dtest_algo.pl6 % create list with "region(Base, Size)" elements
/barrelfish-master/lib/libc/net/
H A Dhesiod.c254 hesiod_free_list(context, list)
256 char **list;
260 if (list == NULL)
262 for (p = list; *p; p++)
264 free(list);
365 * return a list of them.
374 char *dst, **list; local
414 list = malloc((ancount + 1) * sizeof(char *));
415 if (!list) {
440 list[
521 static char **list; local
[all...]
/barrelfish-master/usr/eclipseclp/JavaInterface/src/com/parctechnologies/eclipse/
H A DEXDRInputStream.java61 * The following array list is used to map EXDR string references to their
65 * The array list is not synchronized. Multiple threads writing concurrently
68 * List list = Collections.synchronizedList(new ArrayList(...));
69 * An array list is used because string reference idenitifers start from 0,
140 case 'R' : // Retrieve the string from the string list
167 // create an empty list
168 List list = new LinkedList();
170 list.add(readSubTerm());
174 if (c == ']') return list;
175 else if (c == '[') list
[all...]
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dproject.pl4 % Purpose: Select Kth argument of each element of a list
20 % for splitting a list of Key-Value pairs (such as keysort/2 wants and
22 % well be used for building a list of pairs from a pair of lists. In
25 % sort a list without having duplicates removed. You could do
38 % list of structures s(A1,...,Ak,...An), which you can guarantee
39 % are all the same, and you want a list with just the Ak in the
42 pred s_project(list(s(T1,...,Tn)), list(T1), ..., list(Tn)).
53 % list o
[all...]
/barrelfish-master/usr/tests/cxx/
H A Dstl_list.cpp11 #include <list>
79 // This function is required for built-in STL list functions like sort
95 list<AAA> L;
114 list<AAA>::iterator i;
134 list<int> L;
142 list<int>::iterator i;
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Deregex.c67 _get_flags(pword list, int *pcflags, int *peflags) argument
73 for ( ; (err = ec_get_list(list,&car,&cdr)) == PSUCCEED; list = cdr)
186 pword list; local
214 list = ec_nil(); /* build the list backwards */
217 list = ec_list(
220 list);
222 res = ec_unify(ec_arg(4), list);
239 pword list, tai local
296 pword list, tail, newtail; local
[all...]
/barrelfish-master/lib/libc/rpc/
H A Dgetnetconfig.c10 * this list of conditions and the following disclaimer.
12 * this list of conditions and the following disclaimer in the documentation
104 struct netconfig_list *head; /* head of the list */
105 struct netconfig_list *tail; /* last of the list */
246 struct netconfig_list *list; local
264 * If entry has already been read into the list,
265 * we return the entry in the linked list.
267 * linked list. If no entries, we need to read the netconfig db.
285 * If we cannot find the entry in the list and is end of file,
328 list
450 struct netconfig_list *list; /* pointer to cache list */ local
[all...]
/barrelfish-master/lib/dist/
H A Dargs.c28 // assume exclude list isn't sorted
56 DEBUG_ERR(LIB_ERR_MALLOC_FAIL,"when processing core list argument");
66 DEBUG_ERR(LIB_ERR_MALLOC_FAIL,"when processing core list argument");
84 // mallocs *list
85 static void parse_list(char *optargs, coreid_t **list, int *len) argument
88 assert(list != NULL);
91 *list = NULL;
93 // a list looks like this: 0,1,2,3,4,5
98 DEBUG_ERR(LIB_ERR_MALLOC_FAIL, "when parsing core list");
111 *list
147 list_to_string(coreid_t *list, size_t l_len) argument
[all...]
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/
H A Dmthca_memfree.h17 * copyright notice, this list of conditions and the following
21 * copyright notice, this list of conditions and the following
38 #include <linux/list.h>
52 struct list_head list; member in struct:mthca_icm_chunk
105 struct mthca_icm_chunk, list);
117 if (iter->chunk->list.next == &iter->icm->chunk_list) {
122 iter->chunk = list_entry(iter->chunk->list.next,
123 struct mthca_icm_chunk, list);
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Delipsys_fd.c50 #define Append_List3(fct, tag1,val1,tag2,val2,tag3,val3, list) {\
61 if (*(list)) { \
62 _pw2[1].val.ptr = *(list); \
67 *(list) = _pw2; \
72 #define Append_List(wd, tag1, val1, tag2, val2, list){ \
82 if (*(list)) { \
83 _pw2[1].val.ptr = *(list); \
88 *(list) = _pw2; \
144 static BOOLEAN contigs(pword *StructTable, pword *Sequences, pword *Item, pword *Occurences, pword *Contigs, pword **list);
145 static BOOLEAN disjunctive(pword *StructStarts, pword *StructDurations, pword *StructOrientations, pword **list);
239 dupdate_min(pword *p, word newmin, pword **list) argument
247 dupdate_max(pword *p, word newmax, pword **list) argument
254 setup_domain_greatereq(pword *ArgX, pword *ArgY, pword *ArgNb, pword **list) argument
265 dremove_value(pword *p, word v, pword **list) argument
346 pword *list = 0; local
465 disjunctive(pword *StructStarts, pword *StructDurations, pword *StructOrientations, pword **list) argument
1246 pword *list = 0; local
1274 contigs(pword *StructTable, pword *Sequences, pword *Item, pword *Occurences, pword *Contigs, pword **list) argument
1976 pword *list = 0; local
2002 sequences(pword *StructTable, pword *Sequences, pword *Item, pword *Occurences, pword **list) argument
2595 pword *list = 0; local
2617 disjunction_choose(pword *x, pword *Dx, pword *y, pword *Dy, pword *branch, pword **list) argument
[all...]
H A Dwm_types.h62 worker_ptr list; member in struct:__anon1675
/barrelfish-master/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DSpreadSheetSelectionViewletRange.java127 List list = new ArrayList();
129 list.add(it.next());
131 return list;
H A DSymRef.java234 public static boolean containsKey(List list) { argument
235 return (root.matchKey(list) == list.size());
239 * returns the number of elements of the path (list) that were
242 public static int matchKey(List list) { argument
244 final int size = list.size();
246 for(Iterator it = list.iterator(); it.hasNext(); i++ ) {
262 public static Node findNode(List list) { argument
264 final int size = list.size();
265 for(Iterator it = list
[all...]
/barrelfish-master/lib/openssl-1.0.0d/crypto/ts/
H A Dts_conf.c13 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in
334 STACK_OF(CONF_VALUE) *list = NULL;
338 if (policies && !(list = X509V3_parse_list(policies)))
343 for (i = 0; i < sk_CONF_VALUE_num(list); ++i)
345 CONF_VALUE *val = sk_CONF_VALUE_value(list, i);
360 sk_CONF_VALUE_pop_free(list, X509V3_conf_free);
369 STACK_OF(CONF_VALUE) *list = NULL;
376 if (!(list = X509V3_parse_list(digests)))
381 if (sk_CONF_VALUE_num(list)
[all...]
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/
H A Dpci.h12 * notice unmodified, this list of conditions, and the following
15 * notice, this list of conditions and the following disclaimer in the
48 #include <linux/list.h>
/barrelfish-master/lib/bulk_transfer/
H A Dbulk_channel.c162 * Note, the pool can only be added to the list of pools, once the other
199 struct bulk_pool_list *list = channel->pools; local
201 while (list) {
202 if (bulk_pool_cmp_id(&list->pool->id, &pool->id) == 0) {
205 prev = list;
206 list = list->next;
209 channel->pools = list->next;
211 prev->next = list->next;
214 free(list);
[all...]

Completed in 500 milliseconds

1234567891011>>