Searched refs:common (Results 101 - 125 of 159) sorted by relevance

1234567

/barrelfish-2018-10-04/usr/drivers/xeon_phi/
H A Dxphi_service.c63 struct txq_msg_st common; member in struct:xphi_svc_msg_st
/barrelfish-2018-10-04/doc/009-notifications/
H A DNotify.tex103 it is common to see $O(N)$ and even $O(N^2)$ URPC channels between
246 other domains. Net result is that the common case RPC cost is about
/barrelfish-2018-10-04/lib/acpica/tests/aslts/bin/
H A Dasltsrun38 . common
43 # Store message to the common multi-result log file
701 # survey in the common multi-result log.
882 # Set up the common messages log file
/barrelfish-2018-10-04/lib/bomp/backends/
H A Dxomp_worker.c76 struct txq_msg_st common; member in struct:xomp_msg_st
H A Dxomp_master.c110 struct txq_msg_st common; ///< common msg state member in struct:xomp_msg_st
/barrelfish-2018-10-04/tools/harness/
H A Dscalebench.py33 from tests.common import TimeoutError
/barrelfish-2018-10-04/tools/harness/tests/
H A Dwebserver.py12 from common import TestCommon, TimeoutError, select_timeout
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dordset.pl277 Succeeds when the two ordered sets have no element in common.
347 in common. Note that the test is == rather than = .
H A Dsetof.pl282 % one or more variables. In particular \+ is quite common.
H A Ddynamic.pl107 % call_dynamic_/3 is common code, essentially an interpreter for the
H A Dtracer.pl153 % common ancestor of the failed and the redone goal.
H A Dheaps.pl93 starting from the same heap, and they will share what common
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dfdsets.tex243 any two triplets have at most one element in common.
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsarith.tex138 greatest common divisor of numerator and denominator is 1 and the
272 gcd(E1,E2) & greatest common divisor & integer $\times$ integer & integer \\
273 lcm(E1,E2) & least common multiple & integer $\times$ integer & integer \\
H A Dumsprofile.tex102 common name without arity, e.g. {\it arithmetic} or {\it all_solutions}.
H A Dumsdeveltools.tex406 common name without arity, e.g., \notation{arithmetic} or
665 necessary to capture the most common invocations of each predicate
H A Dumsmodules.tex51 In constraint programming it is quite common to have different
529 The most common case is where a predicate is a \Index{meta-predicate},
/barrelfish-2018-10-04/doc/022-armv8/
H A Dreport.tex70 into a single large-scale system. As such, support for a common non-x86
613 UEFI is multi-platform (and becoming more and more common in the x86 world),
837 Processor architectures are, understandably, designed with common software in
840 common design (which ARMv8 also implements) is the \emph{exception return},
977 unfortunately extremely common. Unnecessary overheads, such as the additional
/barrelfish-2018-10-04/doc/006-routing/
H A DRouting.tex146 The multi-hop interconnect driver was designed to be independent of the type of the underlying ICD links between the nodes on the multi-hop channel. This means that it uses the common flounder interface supported by all ICDs when interacting with the underlying ICD link and uses no ICD-specific knowledge. This design involves a performance penalty: Interacting directly with the underlying ICDs instead of via the common flounder-interface would certainly perform better. Nevertheless, we chose this design, as it gives us more flexibility: The multi-hop interconnect channel can run over all present and future interconnect drivers in Barrelfish, as long as they support the common flounder interface.
294 The generated stubs can be seen as an ''adaptor'' to the multi-hop interconnect driver. They translate calls to the common flounder interface to the interface of the multi-hop interconnect driver. Supported functionality mainly includes binding, sending and receiving of multi-hop messages and some control operations.
330 There is one issue regarding communication in heterogeneous systems of our implementation: To be consistent with the common flounder interface, we have to use a variable of type \texttt{size\_t} to represent the size of a dynamic array. The type \texttt{size\_t} is architecture dependent. On a 32-bit system it will likely be at least 32-bits wide. On a 64-bit system it will likely be at least 64-bit wide. If a dispatcher on a 64-bit system communicates with a dispatcher on a 32-bit system, this can lead to a problem: The dispatcher on the 64-bit system can potentially send dynamic arrays that are bigger than the dispatcher on the 32-bit system can receive. This is a problem of the current Barrelfish version and remains unsolved.
637 as a common system resource that is being multiplexed between the users.
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dprolog.tex303 Because this is so common, Prolog uses the comma for AND and the
744 The most common case of a partial data structure is a list whose
1036 Prolog is different from conventional programming languages, and a common
1049 One common problem is to write a predicate expecting certain instantiation
/barrelfish-2018-10-04/lib/openssl-1.0.0d/
H A Dmakevms.com468 $! Add in the common "crypto/opensslconf.h.in".
/barrelfish-2018-10-04/doc/021-cpudriver/
H A Dcpudriver.tex350 common with other architectures.
/barrelfish-2018-10-04/lib/acpica/tests/aslts/bin/bugstate/
H A Dbdemostabs25 . common
/barrelfish-2018-10-04/lib/vfs/
H A Dvfs_ramfs.c37 struct vfs_handle common; member in struct:ramfs_handle
/barrelfish-2018-10-04/lib/xeon_phi/
H A Dxeon_phi_client.c71 struct txq_msg_st common; member in struct:xphi_msg_st

Completed in 242 milliseconds

1234567