Searched refs:L1 (Results 1 - 25 of 103) sorted by last modified time

12345

/barrelfish-master/usr/skb/programs/
H A Dscheduler.pl226 rotation(L1,L2) :-
227 length(L1, Len),
228 rotationimp(L1, L2, Len).
H A Dglobalthreadalloc.pl107 findall(H, (memory_affinity(L1, S, NUMADomain), H is L1 + S), AfH),
H A Ddecoding_net4_tests.pl421 length(L1, 1).
H A Ddecoding_net3_multid.pl1578 word_to_num(L1W, L1),
1583 Parts = [L3,L2,L1].
H A Ddecoding_net3.pl1559 word_to_num(L1W, L1),
1564 Parts = [L3,L2,L1].
H A Ddecoding_net2.pl1233 word_to_num(L1W, L1),
1238 Parts = [L3,L2,L1].
1281 split_vpn(VPN, [L3,L2,L1]),
1284 pt_delta_append_if_new(Out2,Out, pt(L1Idx, L1, PPN))
H A Dbridge_postorder_sorted_sum_ascending.pl212 foreach(L1,ChildList)
214 tree2list(El,L1)
224 % foreach(L1,ChildList)
226 % tree2list(El,L1)
H A Dbridge_postorder_sorted_sum.pl216 foreach(L1,ChildList)
218 tree2list(El,L1)
228 % foreach(L1,ChildList)
230 % tree2list(El,L1)
H A Dbridge_postorder_sorted_ascending.pl211 foreach(L1,ChildList)
213 tree2list(El,L1)
223 % foreach(L1,ChildList)
225 % tree2list(El,L1)
H A Dbridge_postorder_sorted.pl210 foreach(L1,ChildList)
212 tree2list(El,L1)
222 % foreach(L1,ChildList)
224 % tree2list(El,L1)
H A Dbridge_postorder.pl188 foreach(L1,ChildList)
190 tree2list(El,L1)
200 % foreach(L1,ChildList)
202 % tree2list(El,L1)
H A Dbridge_page.pl460 append(Size, Base , L1),
461 append(L1, High , L2),
468 append(Size, Base , L1),
469 append(L1, High , L2),
594 foreach(L1,ChildList)
596 tree2list(El,L1)
H A Dbridge_fake_bigfish.pl159 append(Base, High, L1),
160 append(L1, Size, L2),
229 foreach(L1,ChildList)
231 tree2list(El,L1)
H A Dbridge_fake_babybel.pl649 append(Base, High, L1),
650 append(L1, Size, L2),
719 foreach(L1,ChildList)
721 tree2list(El,L1)
H A Dbridge.pl87 append(Base, High, L1),
88 append(L1, Size, L2),
145 foreach(L1,ChildList)
147 tree2list(El,L1)
H A Ddb_partitions.pl26 findall(H, (memory_affinity(L1, S, AffinityDomain), H is L1 + S), AfH),
50 findall(H, (memory_affinity(L1, S, AffinityDomain), H is L1 + S), AfH),
H A Dbridge_page_orig_naturally_aligned.pl160 append(Base, High, L1),
161 append(L1, Size, L2),
221 foreach(L1,ChildList)
223 tree2list(El,L1)
/barrelfish-master/lib/compiler-rt/builtins/riscv/
H A Dmulsi3.S18 .L1:
25 bnez a1, .L1
/barrelfish-master/doc/022-armv8/
H A Dreport.tex395 \texttt{EL1} guests \textbf{shall} be isolated at the L1 translation layer,
1103 (L1), outer (L2+, usually), write-back or write-through. Combined with the
/barrelfish-master/doc/017-arm/
H A DARM.tex299 mapping of the kernel pages into every L1 page table of each process.
317 The L1 page table of the kernel address space is located inside the
705 \item Allocate L1 page table for kernel
712 \item Map the available physical memory in the kernel L1 page table
/barrelfish-master/doc/000-overview/
H A DOverview.tex355 L1 Page Table of this vspace to an ARMv7 core for installation.
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.pl357 dvar_domain(V1, Dom1), get_domain(Dom1, L1),
359 domain_union(L1, L2, L, _),
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/
H A Dech.pl319 append(Index, ConsArgs, L1),
320 append(L1, MetaArgs, ArgList),
1369 intersect([V1|L1], L2, Intersect, Remain) :-
1373 ), intersect(L1, L2, Intersect0, Remain0).
1813 L1 is L0 + 1,
1814 count_dead(Ss, L1, L, D1, D).
2317 ordered_merge(L0, L1, L) :-
2319 L1 = [SIndex1|L11],
2329 ordered_merge(L00, L1, L2)
2336 ; ordered_merge(L00, L1,
[all...]
H A Ddomain.pl154 eval_list([A|L],L1),sort(L1,L2), X::L2.
157 eval_list([X|L1],[Y|L2]):-
159 eval_list(L1,L2).
169 I-I::L <=> setof(X,member(X-X,L),L1), I::L1.
170 I-V::L <=> ground(I) | setof(X,member(I-X,L),L1), V::L1.
171 I-V::L <=> ground(V) | setof(X,member(X-V,L),L1), I::L1
[all...]
H A Dbool.pl186 pos_red ::= card(A,B,L,N) <=> delete(X,L,L1),X==1 | % positive reduction
188 card(A1,B1,L1,N1).
189 neg_red ::= card(A,B,L,N) <=> delete(X,L,L1),X==0 | % negative reduction
191 card(A,B,L1,N1).

Completed in 282 milliseconds

12345