Searched refs:L2 (Results 1 - 25 of 76) sorted by last modified time

1234

/barrelfish-master/usr/skb/programs/
H A Dscheduler.pl226 rotation(L1,L2) :-
228 rotationimp(L1, L2, Len).
H A Droute_tree_radix.pl61 subtract(L,[Root],L2),
62 route_tree(Radix, Root, L2, T),
H A Dqueries.pl87 % 3. find core ID list which share same L2/L3 cache
H A Dmulticast.pl35 findall(X, message_rtt(X,_,_,_,_,_), L2),
36 length(L2, ExpectedNrRTTMeasurements).
H A Ddecoding_net3_multid.pl1580 word_to_num(L2W, L2),
1583 Parts = [L3,L2,L1].
H A Ddecoding_net3.pl1561 word_to_num(L2W, L2),
1564 Parts = [L3,L2,L1].
H A Ddecoding_net2.pl1235 word_to_num(L2W, L2),
1238 Parts = [L3,L2,L1].
1281 split_vpn(VPN, [L3,L2,L1]),
1283 pt_delta_append_if_new(Out1,Out2, pt(L2Idx, L2, L1Idx)),
H A Dbridge_postorder_sorted_sum_ascending.pl216 flatten(ChildList,L2),
217 List = [Node|L2].
228 % flatten(ChildList,L2),
229 % List = [Node|L2].
H A Dbridge_postorder_sorted_sum.pl220 flatten(ChildList,L2),
221 List = [Node|L2].
232 % flatten(ChildList,L2),
233 % List = [Node|L2].
H A Dbridge_postorder_sorted_ascending.pl215 flatten(ChildList,L2),
216 List = [Node|L2].
227 % flatten(ChildList,L2),
228 % List = [Node|L2].
H A Dbridge_postorder_sorted.pl214 flatten(ChildList,L2),
215 List = [Node|L2].
226 % flatten(ChildList,L2),
227 % List = [Node|L2].
H A Dbridge_postorder.pl192 flatten(ChildList,L2),
193 List = [Node|L2].
204 % flatten(ChildList,L2),
205 % List = [Node|L2].
H A Dbridge_page.pl34 merge_window([], T2, L2),
35 (member(L2, range(B2, H2)) ->
36 L = [range(B, H) | L2]
38 append([range(B,H)], [range(B2, H2) | L2], L)
461 append(L1, High , L2),
462 labeling(L2).
469 append(L1, High , L2),
470 append(L2, ExtraVars , L3),
598 flatten(ChildList,L2),
599 List = [Node|L2]
[all...]
H A Dbridge_linux.pl42 convert_devices(T, L2),
43 append(L2, Elements, L).
60 convert_bridges(T, L2),
61 append(L2, BridgeList, L).
H A Dbridge_fake_bigfish.pl160 append(L1, Size, L2),
161 labeling(L2).
233 flatten(ChildList,L2),
234 List = [Node|L2].
H A Dbridge_fake_babybel.pl51 convert_devices(T, L2),
52 append(L2, Elements, L).
69 convert_bridges(T, L2),
70 append(L2, BridgeList, L).
650 append(L1, Size, L2),
651 labeling(L2).
723 flatten(ChildList,L2),
724 List = [Node|L2].
H A Dbridge.pl88 append(L1, Size, L2),
89 labeling(L2).
149 flatten(ChildList,L2),
150 List = [Node|L2].
H A Dbridge_page_orig_naturally_aligned.pl161 append(L1, Size, L2),
162 labeling(L2).
225 flatten(ChildList,L2),
226 List = [Node|L2].
/barrelfish-master/lib/compiler-rt/builtins/riscv/
H A Dmulsi3.S20 beqz a3, .L2
22 .L2:
/barrelfish-master/doc/022-armv8/
H A Dreport.tex1103 (L1), outer (L2+, usually), write-back or write-through. Combined with the
/barrelfish-master/doc/017-arm/
H A DARM.tex323 for a kernel L2 page table.
883 \item Enable the L2 MMU
884 \item Set up mappings for the loaded image in the L2 MMU (can be
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.pl358 dvar_domain(V2, Dom2), get_domain(Dom2, L2),
359 domain_union(L1, L2, L, _),
/barrelfish-master/usr/eclipseclp/icparc_solvers/ech/
H A Dech.pl1369 intersect([V1|L1], L2, Intersect, Remain) :-
1370 (membervar(L2, V1) ->
1373 ), intersect(L1, L2, Intersect0, Remain0).
2325 L = [SIndex0|L2], % identical, throw one away
2326 ordered_merge(L00, L11, L2)
2328 L = [SIndex0|L2],
2329 ordered_merge(L00, L1, L2)
2331 L = [SIndex1|L2],
2332 ordered_merge(L0, L11, L2)
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).
187 X::[A1|L1], X::[A2|L2] <=> intersection([A1|L1],[A2|L2],L) | X::L.
193 Y lt X, X::[A|L] <=> ground(Y) , remove_lower(Y,[A|L],L1),remove(Y,L1,L2),
194 L2\==[A|L] | X::L2.
195 X lt Y, X::[A|L] <=> ground(Y) , remove_higher(Y,[A|L],L1),remove(Y,L1,L2),
[all...]
/barrelfish-master/usr/eclipseclp/ecrc_solvers/
H A Dset.pl412 s_card(Glb,L2),
413 Card ::L2..L1

Completed in 114 milliseconds

1234