/barrelfish-2018-10-04/lib/barrelfish/vspace/arch/arm/ |
H A D | layout.c | 24 l->granularity = BASE_PAGE_SIZE;
|
/barrelfish-2018-10-04/lib/barrelfish/vspace/arch/aarch64/ |
H A D | layout.c | 25 l->granularity = BASE_PAGE_SIZE;
|
/barrelfish-2018-10-04/lib/barrelfish/vspace/arch/x86_32/ |
H A D | layout.c | 24 l->granularity = X86_32_BASE_PAGE_SIZE;
|
/barrelfish-2018-10-04/lib/barrelfish/vspace/arch/x86_64/ |
H A D | layout.c | 26 l->granularity = X86_64_BASE_PAGE_SIZE;
|
/barrelfish-2018-10-04/include/target/x86_64/barrelfish_kpi/ |
H A D | cpu_target.h | 74 uint64_t granularity:1; // G member in struct:segment_descriptor::__anon359 87 uint64_t granularity:1; member in struct:segment_descriptor::__anon360
|
/barrelfish-2018-10-04/include/barrelfish/ |
H A D | vspace_layout.h | 30 lvaddr_t granularity; member in struct:vspace_layout 37 * \brief Get the granularity of minimum allocation 41 return l->granularity;
|
/barrelfish-2018-10-04/usr/examples/xmpl-cow/ |
H A D | main.c | 71 static errval_t cow_init(size_t bufsize, size_t granularity, argument 81 // get RAM cap bufsize = (bufsize / granularity + 1) * granularity; 89 cslot_t cap_count = bufsize / granularity; 97 err = cap_retype(first_frame, frame, 0, ObjType_Frame, granularity, cap_count); 107 // Can copy-on-write in granularity-sized chunks 111 size_t granularity) 124 size_t chunks = size / granularity; 135 err = (*memobj)->f.fill_foff(*memobj, i * granularity, fc, granularity, 108 vspace_map_one_frame_cow(void **buf, size_t size, struct capref frame, vregion_flags_t flags, struct memobj **memobj, struct vregion **vregion, size_t granularity) argument [all...] |
/barrelfish-2018-10-04/kernel/arch/k1om/ |
H A D | init.c | 102 .granularity = 1, 118 .granularity = 1, 134 .granularity = 1, 150 .granularity = 1, 162 .granularity = 0, 172 .lo_limit = 0, // # 4k pages (since granularity = 1) 179 .granularity = 1,
|
/barrelfish-2018-10-04/kernel/arch/x86_32/ |
H A D | init.c | 104 .granularity = 1, 120 .granularity = 1, 136 .granularity = 1, 152 .granularity = 1, 164 .granularity = 0, 180 .granularity = 1,
|
/barrelfish-2018-10-04/kernel/arch/x86_64/ |
H A D | init.c | 94 .granularity = 1, 110 .granularity = 1, 126 .granularity = 1, 142 .granularity = 1, 154 .granularity = 0, 164 .lo_limit = 0, // # 4k pages (since granularity = 1) 171 .granularity = 1,
|
H A D | exec.c | 289 assert(ldt_descriptor[0].sys_lo.granularity != 0);
|
/barrelfish-2018-10-04/kernel/include/arch/x86_32/ |
H A D | irq.h | 162 uint64_t granularity:1; member in struct:segment_descriptor::__anon449 175 uint64_t granularity:1; member in struct:segment_descriptor::__anon450
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probing_for_scheduling.pl | 85 UserOptions = [granularity(1),priority(5)] -> true 87 UserOptions = options with [granularity:1,priority:5] 109 Options= [granularity(G),priority(P)] 111 'G' is the temporal granularity 130 create_options(List,options with [granularity:G,priority:P]) :- 131 ( remove1(granularity(G),List,List2) -> check_granularity(G) 144 writeln(error,'Error: granularity must be a positive integer'), 163 Options = options with granularity:G, 338 Options=[granularity(1),priority(5)], 439 "Options":" A list, '[granularity( [all...] |
H A D | probing_for_scheduling.pl | 84 UserOptions = [granularity(1),priority(5)] -> true 86 UserOptions = options with [granularity:1,priority:5] 108 Options= [granularity(G),priority(P)] 110 'G' is the temporal granularity 129 create_options(List,options with [granularity:G,priority:P]) :- 130 ( remove1(granularity(G),List,List2) -> check_granularity(G) 143 writeln(error,'Error: granularity must be a positive integer'), 162 Options = options with granularity:G, 338 Options=[granularity(1),priority(5)], 439 "Options":" A list, '[granularity( [all...] |
H A D | ic_probing_tests.pl | 59 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],2,[granularity(1),priority(5)],Cost). 69 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],2,[granularity(1),priority(2)],Cost). 78 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],3,[granularity(1),priority(5)],Cost). 88 ex2([X,Y,Z],[1,5,6],[10,5,5],[R1,R2,R3],3,[granularity(1),priority(5)],Cost). 185 Options = [granularity(G),priority(P)]. 188 %%% Time granularity
|
H A D | probing_tests.pl | 58 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],2,[granularity(1),priority(5)],Cost). 68 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],2,[granularity(1),priority(2)],Cost). 77 [eclipse]: ex2([X,Y,Z],[1,5,6],[10,5,5],[1,2,1],3,[granularity(1),priority(5)],Cost). 87 ex2([X,Y,Z],[1,5,6],[10,5,5],[R1,R2,R3],3,[granularity(1),priority(5)],Cost). 183 Options = [granularity(G),priority(P)]. 186 %%% Time granularity
|
H A D | ic_probe.pl | 52 Options = options with [granularity:Gran,priority:Priority], 245 ?- Options = options{granularity:3,priority:5}, 261 If the inequality is strict, <B>X>Y</B> or <B>X'<'Y</B>, then the granularity 263 inequality, which can be passed to the linear solver. Thus if the granularity
|
H A D | probe.pl | 52 Options = options with [granularity:Gran,priority:Priority], 244 ?- Options = options{granularity:3,priority:5}, 260 If the inequality is strict, <B>X>Y</B> or <B>X'<'Y</B>, then the granularity 262 inequality, which can be passed to the linear solver. Thus if the granularity
|
H A D | ic_probe_support.pl | 38 :- export struct(options(granularity,priority)). 237 options(granularity,priority)
|
H A D | probe_support.pl | 37 :- export struct(options(granularity,priority)). 236 options(granularity,priority)
|
H A D | ic_make_overlap_bivs.pl | 171 Options = options with [granularity:Granularity, priority:Priority],
|
H A D | make_overlap_bivs.pl | 171 Options = options with [granularity:Granularity, priority:Priority],
|
/barrelfish-2018-10-04/lib/barrelfish/arch/x86_64/ |
H A D | ldt.c | 161 .granularity = 1, 177 .granularity = 1, 193 .granularity = 1, 209 .granularity = 1, 221 .granularity = 0, 231 .lo_limit = 0, // # 4k pages (since granularity = 1) 238 .granularity = 1, 273 assert(ldt_descriptor[0].sys_lo.granularity != 0);
|
/barrelfish-2018-10-04/usr/acpi/ |
H A D | acpi.c | 56 // uint64_t granularity, min, max, translationoffset, addrlength; 57 lpaddr_t granularity, min, max, translationoffset, addrlength; local 61 granularity = resource->Data.Address16.Address.Granularity; 69 granularity = resource->Data.Address32.Address.Granularity; 77 granularity = resource->Data.Address64.Address.Granularity; 109 ACPI_DEBUG("PCI mem range %lx-%lx granularity 0x%lx translation offset " 112 granularity, translationoffset, addrlength,
|
/barrelfish-2018-10-04/lib/dmalloc/ |
H A D | dmalloc.c | 233 default granularity, pixel buffers may straddle virtual allocation 1303 given initial capacity, or, if 0, the default granularity size. It 2679 size_t granularity; member in struct:malloc_params 2733 /* granularity-align a size */ 2735 (((S) + (mparams.granularity - SIZE_T_ONE))\ 2736 & ~(mparams.granularity - SIZE_T_ONE)) 2739 /* For mmap, use granularity alignment on windows, else page-align */ 2752 (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0) 3200 mparams.granularity = gsize; 3262 mparams.granularity [all...] |