Searched refs:order (Results 1 - 25 of 33) sorted by relevance

12

/seL4-camkes-master/tools/rumprun/platform/xen/xen/include/mini-os/
H A Dmm.h49 int order; local
51 for ( order = 0; size; order++ )
53 return order;
70 unsigned long minios_alloc_contig_pages(int order, unsigned int addr_bits);
/seL4-camkes-master/tools/rumprun/lib/libbmk_core/
H A Dpgalloc.c197 * that much address space. The order of what most CPUs implement (48bits)
205 freechunk_link(void *addr, int order) argument
209 ch->level = order;
212 LIST_INSERT_HEAD(&freelist[order], ch, entries);
367 bmk_pgalloc(int order) argument
370 return bmk_pgalloc_align(order, BMK_PCPU_PAGE_SIZE);
374 bmk_pgalloc_align(int order, unsigned long align) argument
381 bmk_assert((unsigned)order < FREELIST_LEVELS);
383 for (bucket = order; bucket < FREELIST_LEVELS; bucket++) {
388 bmk_printf("cannot handle page request order
431 bmk_pgfree(void *pointer, int order) argument
[all...]
/seL4-camkes-master/projects/projects_libs/libjansson/jansson-2.7/src/
H A Dhashtable.c108 index = hash & hashmask(hashtable->order);
155 hashtable->order++;
156 new_size = hashsize(hashtable->order);
162 for(i = 0; i < hashsize(hashtable->order); i++)
187 hashtable->order = 3;
188 hashtable->buckets = jsonp_malloc(hashsize(hashtable->order) * sizeof(bucket_t));
194 for(i = 0; i < hashsize(hashtable->order); i++)
218 if(hashtable->size >= hashsize(hashtable->order))
223 index = hash & hashmask(hashtable->order);
268 bucket = &hashtable->buckets[hash & hashmask(hashtable->order)];
[all...]
H A Dhashtable.h35 size_t order; /* hashtable has pow(2, order) buckets */ member in struct:hashtable
70 * @serial: For addition order of keys
120 * The hashtable items are not iterated over in any particular order.
/seL4-camkes-master/projects/picotcp/docs/user_manual/
H A Dchap_api_aodv.tex8 In order to create a route, one node must explicitly start the communication
11 AODV guarantees that the traffic generated by each node in order to create
22 In order to use multiple devices in the AODV system, this function needs to be called
H A Dchap_api_olsr.tex29 In order to use multiple devices in the OLSR system, this function needs to be called
H A Dchap_api_ppp.tex31 must then afterwards be associated with lower-level serial functions in order to be used.
147 This function allows the configuration of the APN name in order for PPP to correctly establish the connection
H A Dchap_api_tftp.tex16 In order to start transmission or reception of files a session handler must be obtained with a call to pico$\_$tftp$\_$session$\_$setup. The created session may take advantage of the Extenxed Options of the TFTP protocol invoking pico$\_$tftp$\_$set$\_$option before starting using it.
227 In order to require Transfer size Option PICO$\_$TFTP$\_$OPTION$\_$FILE must be used and its value set to the file size in case of a Write Request or to 0 in case of a Read Request.
264 In order to ask Transfer size Option value PICO$\_$TFTP$\_$OPTION$\_$FILE must be used; it may be used for example for example in receiver callback for calculation of remaining bytes to be received to complete the current transfer.
447 \item \texttt{len} - the size of the buffer being transmitted. If $<$ \texttt{BLOCKSIZE}, the transfer is concluded. In order to terminate a transfer where the content is aligned to \texttt{BLOCKSIZE}, a zero-sized \texttt{pico$\_$tftp$\_$send} must be called at the end of the transfer.
H A Dchap_api_ipv4.tex9 The result is stored in the char array that ipbuf points to. The given IP address argument must be in network order (i.e. 0xC0A80101 becomes 192.168.1.1).
/seL4-camkes-master/tools/rumprun/platform/xen/xen/arch/x86/
H A Dmm.c654 unsigned long minios_alloc_contig_pages(int order, unsigned int addr_bits) argument
657 unsigned long in_frames[1UL << order], out_frames, mfn;
658 multicall_entry_t call[1UL << order];
659 unsigned int i, num_pages = 1UL << order;
663 * request 1 extend of size 'order */
672 .extent_order = order,
679 if ( order > MAX_CONTIG_ORDER )
681 minios_printk("alloc_contig_pages: order too large 0x%x > 0x%x\n",
682 order, MAX_CONTIG_ORDER);
687 in_va = (unsigned long)bmk_pgalloc(order);
[all...]
/seL4-camkes-master/projects/musllibc/src/thread/powerpc/
H A Dclone.s16 # store non-volatile regs r30, r31 on stack in order to put our
/seL4-camkes-master/tools/cogent/cogent/scripts/
H A Dman-gen.pl91 in order to access Cogent functions and datatypes.
/seL4-camkes-master/kernel/manual/
H A Dmanual.tex116 % add your name in alphabetical order.
/seL4-camkes-master/tools/cogent/impl/fs/skel-fs/cogent/
H A DMakefile148 $(Q) rm -f $(MODULE).mod.[co] $(MODULE).o $(MODULE).ko Module.symvers modules.order
/seL4-camkes-master/tools/cogent/impl/fs/vfat/cogent/
H A DMakefile163 $(Q) rm -f $(MODULE).mod.[co] $(MODULE).o $(MODULE).ko Module.symvers modules.order
/seL4-camkes-master/tools/cogent/impl/net/loopback/cogent/
H A DMakefile164 $(Q)rm -f $(MODULE).mod.[co] $(MODULE).o $(MODULE).ko Module.symvers modules.order
/seL4-camkes-master/kernel/manual/parts/
H A Dbootup.tex72 platform configuration (devices) etc. In order to tell the initial thread
148 The capabilities in \texttt{userImagePaging} are ordered in descending order
169 Untyped memory is given in no particular order. The array entry
H A Dvspace.tex248 number of applications the system can support. In order to manage
H A Dcspace.tex400 translated. Therefore, in order to address a \obj{CNode} capability,
413 \autoref{fig2.1} depicts an example CSpace. In order to illustrate
H A Dobjects.tex55 Access control governs all kernel services; in order to perform an
349 order to create new objects, and all objects consume a fixed amount of memory once
/seL4-camkes-master/tools/cogent/impl/fs/bilby/cogent/
H A DMakefile188 $(Q)rm -f $(MODULE).mod.[co] $(MODULE).o $(MODULE).ko Module.symvers modules.order
/seL4-camkes-master/tools/cogent/impl/fs/ext2/cogent/
H A DMakefile193 $(Q)rm -f $(MODULE).mod.[co] $(MODULE).o $(MODULE).ko Module.symvers modules.order
/seL4-camkes-master/projects/util_libs/libutils/include/utils/
H A Dsglib.h728 #define SGLIB___BIN_TREE_MAP_ON_ELEMENTS(type, tree, iteratedVariable, order, left, right, command) {\
751 if (order == 0) {\
760 if ((order==1 && _pass_[_pathi_] == 0)\
761 || (order == 2 && (_pass_[_pathi_] == 1 || _right_[_pathi_]==NULL))) {\
1813 if (it->pathi>0 && it->order == it->pass[it->pathi-1]) {\
1818 type *sglib__##type##_it_init(struct sglib_##type##_iterator *it, type *tree, int order, int (*subcomparator)(type *, type *), type *equalto) {\
1821 it->order = order;\
1840 if (order == 0) {\
1904 short int order;\
[all...]
/seL4-camkes-master/tools/cogent/cogent/doc/
H A Ddoc.tex469 \paragraph{Permissions} In order to classify uniqueness properties of each type of objects, we introduce permissions.
514 In order to restrain the permissions type variables possess, constraints can be given when explicit quantifiers
525 \paragraph{Record types} Similar to C structs, each record consists of more than 1 field. Fields are order-sensitive.
544 \paragraph{Tuples} Tuples can be considered as unnamed unboxed records. It is also order-sensitive.
613 In order to temporarily turn it into a shareable one, we use \code{!} operator, which is introduced later in Section~\ref{ssec:letbang}.
661 The aforementioned take operation applies to both linear fields and non-linear ones, although it turns out to be overweighted for non-linears. In order to ``take'' a non-linear field, the first
/seL4-camkes-master/tools/cogent/cogent/manual/
H A Dcogent-manual.tex174 The reserved words are in alphabetical order:
363 A tuple type represents mathematical tuples, i.e., values with a fixed number of fields specified in a certain order. Every field may have a different type.
428 The fields in a record type are order-sensitive. Therefore, the type expressions \code{\{a: U8, b: U16\}} and
509 Note, that a \textit{TypeA1} cannot be a function type. Hence, to specify a higher order function type in \cogent, which
735 In order to decouple the property of linearity somewhat from the way how types are composed, the concept of
1437 As for record types, but other than for record patterns, the order of the field specifications is significant. Hence
1444 The type inferred from a record type's structure is the unboxed record type with the same number of fields in the same order
1689 Unlike in a record term, the field order in a \textit{PutExpression} is not significant.
1796 The order in which alternatives are specified is irrelevant. The pattern syntax in \cogent

Completed in 148 milliseconds

12