Searched refs:large (Results 1 - 25 of 74) sorted by relevance

123

/barrelfish-2018-10-04/kernel/include/target/x86_64/
H A Dpaging_kernel_target.h136 } large; member in union:x86_64_ptable_entry
242 * \brief Maps a large page.
244 * From large page table entry, pointed to by 'entry', maps physical address
257 tmp.large.present = bitmap & X86_64_PTABLE_PRESENT ? 1 : 0;
258 tmp.large.read_write = bitmap & X86_64_PTABLE_READ_WRITE ? 1 : 0;
259 tmp.large.user_supervisor = bitmap & X86_64_PTABLE_USER_SUPERVISOR ? 1 : 0;
260 tmp.large.write_through = bitmap & X86_64_PTABLE_WRITE_THROUGH ? 1 : 0;
261 tmp.large.cache_disabled = bitmap & X86_64_PTABLE_CACHE_DISABLED ? 1 : 0;
264 tmp.large.global = 0;
266 tmp.large
[all...]
/barrelfish-2018-10-04/kernel/include/target/x86_32/
H A Dpaging_kernel_target.h121 } large; member in union:x86_32_ptable_entry
178 } large; member in union:x86_32_ptable_entry
264 * \brief Maps a large page.
266 * From large page table entry, pointed to by 'entry', maps physical address
280 tmp.large.present = bitmap & X86_32_PTABLE_PRESENT ? 1 : 0;
281 tmp.large.read_write = bitmap & X86_32_PTABLE_READ_WRITE ? 1 : 0;
282 tmp.large.user_supervisor = bitmap & X86_32_PTABLE_USER_SUPERVISOR ? 1 : 0;
283 tmp.large.write_through = bitmap & X86_32_PTABLE_WRITE_THROUGH ? 1 : 0;
284 tmp.large.cache_disabled = bitmap & X86_32_PTABLE_CACHE_DISABLED ? 1 : 0;
285 tmp.large
[all...]
/barrelfish-2018-10-04/tools/elver/
H A Delver.c97 } large; member in union:ptable_entry
226 entry->large.present = bitmap & PTABLE_PRESENT ? 1 : 0;
227 entry->large.read_write = bitmap & PTABLE_READ_WRITE ? 1 : 0;
228 entry->large.user_supervisor = bitmap & PTABLE_USER_SUPERVISOR ? 1 : 0;
229 entry->large.write_through = bitmap & PTABLE_WRITE_THROUGH ? 1 : 0;
230 entry->large.cache_disabled = bitmap & PTABLE_CACHE_DISABLED ? 1 : 0;
231 entry->large.global = bitmap & PTABLE_GLOBAL_PAGE ? 1 : 0;
232 entry->large.attr_index = bitmap & PTABLE_ATTR_INDEX ? 1 : 0;
233 entry->large.execute_disable = bitmap & PTABLE_EXECUTE_DISABLE ? 1 : 0;
234 entry->large
[all...]
/barrelfish-2018-10-04/lib/compiler-rt/builtins/
H A Dfp_fixint_impl.inc31 // If the value is too large for the integer type, saturate.
H A Dfp_fixuint_impl.inc29 // If the value is too large for the integer type, saturate.
/barrelfish-2018-10-04/usr/bench/largepage/
H A Dlargepage_64_bench.c3 * \brief Test program for large page code
69 static void test_region(uint32_t *buf, size_t size, bool large, bool area) argument
98 if(!large && !area) {
103 else if (large && !area) {
108 else if (!large && area) {
149 if(!large && !area) {
154 else if (large && !area){
158 }else if (!large && area) {
218 //large page via pmap interface
296 printf("large are
[all...]
/barrelfish-2018-10-04/kernel/arch/x86_32/
H A Dpage_mappings_arch.c93 // large page code
374 // invlpg should work for large/huge pages
413 union x86_32_ptable_entry *large = (union x86_32_ptable_entry *)ptable; local
415 if (large->large.always1) {
416 // large page
417 genpaddr_t paddr = large->large.base_addr << X86_32_LARGE_PAGE_BITS;
/barrelfish-2018-10-04/kernel/arch/x86_64/
H A Dpage_mappings_arch.c176 // determine if we map a large/huge page or a normal entry
179 //a large page is mapped
403 if (entry->large.present) {
413 if (entry->large.present) {
480 // invlpg should work for large/huge pages
564 // check if ptable or large page
565 if (pt->large.always1) {
566 // is large page mapping
567 genpaddr_t paddr = (genpaddr_t)pt->large.base_addr << LARGE_PAGE_BITS;
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dconclusion.tex26 Performance is in the same order of magnitude as seen on Linux for large
H A Dlibahci.tex85 If there is no block large enough to satisfy the allocation request, the pool
101 traversal continues with the new memory regions. When a sufficiently large
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Decoptions.tex49 default to very large sizes (128MB), where real memory or space in the
H A Ddbi.tex36 A number of features are designed to permit transfer of large amounts
287 database, and the data is too large for the database, the exact behaviour
289 database, and the data is too large for the buffer, an error will be raised.
/barrelfish-2018-10-04/doc/004-virtual_memory/
H A DVirtualMemory.tex98 This supports users that have a large frame that need not be mapped in its entirety.
135 capability with a large enough Frame capability as the source capability.
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/
H A Dpuzzle_bool.pl61 the expression generated by the program below, for large N and in reasonable
/barrelfish-2018-10-04/doc/022-armv8/
H A Dreport.tex59 basis for ongoing research into large-scale non-cache-coherent systems using
68 software support for likely future architectures, where large numbers of
70 into a single large-scale system. As such, support for a common non-x86
216 \texttt{X8} & & indirect result e.g. location of large return value
251 \paragraph{Indirect result} This register is used when returning a large value
330 Barrelfish, as it ties a large number (48) of less-powerful (2-issue) cores.
590 and uses the large set of supplied services to do as much of the one-time
1000 interest from well-known systems integration firms investigating large
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Dintro-sec.tex35 language to provide large scale persistent storage of knowledge in such a
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumscmdlineopts.tex78 structures and may have to be increased for very large applications.
H A Dumsstring.tex153 It should be used when handling large amounts of input, when the extreme
/barrelfish-2018-10-04/doc/003-hake/
H A DHake.tex79 Hake builds a single, very large \texttt{Makefile} which
108 \item Hake constructs a single very large Haskell expression out of
114 \item This large expression is then evaluated. The result is a single
125 This single Makefile is large, but is also quite simple: it contains
655 Hake generates a single large Makefile at the top of the tree.
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dreal.tex175 not throw exceptions or leave behind large numbers of meaningless delayed
440 comprising a large triangular lake with a square field on each side. The
H A Dtutorial.tex132 A methodology for developing large scale applications with \eclipse{}
/barrelfish-2018-10-04/lib/tommath/
H A Dbn.tex76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming
169 In the file tommath\_class.h you will see a large list of C ``defines'' followed by a series of ``ifdefs''
282 would require when working with large integers.
441 Certain algorithms require more than one large integer. In these instances it is ideal to initialize all of the mp\_int
1159 should only be used with very large inputs. This is followed by the Karatsuba multiplications which are for moderate
1242 Toom-Cook has incredible overhead and is probably only useful for very large inputs. So far no known cutoff points
1583 the algorithm requires raising $a$ to the power of $b$ it is not ideal to attempt to find roots for large
1584 values of $b$. If particularly large roots are required then a factor method could be used instead. For example,
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dfdglobal.tex46 which simply indicates that they can constrain a large number of variables
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dfd.pl92 checks. If the domain ranges or coefficients are too large,
889 domain variables. If Var is instantiated, N is bound to a very large
1070 representation of large intervals into an explicit list of their
1177 representation of large intervals into an explicit list of their
1959 exceptions:[4 : "List is not ground.", 5 : "List contains an element which is neither integer nor an integer interval.", 6 : "The size of the resulting domain is too large.", 6 : "The list is not sorted properly."],
2027 exceptions:[4 : "List is not ground.", 5 : "List contains an element which is neither atomic nor an integer interval.", 6 : "The size of the resulting domain is too large.", 6 : "The lower bound of an integer interval is greater than its upper bound."],
2327 search space is too large or when a suboptimal solution is sufficient.
2362 search space is too large or when a suboptimal solution is sufficient.
2590 search space is too large or when a suboptimal solution is sufficient.
2625 search space is too large o
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dclients.tex246 when visualising large \viewable{}s which may not easily fit the
288 So as to facilitate visualisation of large \viewable{}s, all \viewer{}s
587 visualisation of large programs.

Completed in 102 milliseconds

123