/barrelfish-2018-10-04/doc/013-capability-mgmt/ |
H A D | type_system.tex | 492 \arg VNode entry at which to create mapping 510 the given entry. 659 pte 64 "Kernel address of VNode entry this mapping tracks";
|
/barrelfish-2018-10-04/doc/017-arm/ |
H A D | ARM.tex | 484 \section{Hyp Trap, or Hyp mode entry} 579 on entry to the kernel. 763 \item Kernel writes entry address for new core into SYSFLAG registers
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | programanalysis.tex | 300 exit counters which differ from entry counters, for example.
|
/barrelfish-2018-10-04/kernel/arch/x86_64/ |
H A D | syscall.c | 225 size_t entry = args[0]; local 229 return SYSRET(ptable_modify_flags(to, entry, pages, flags)); 1303 /* syscall C entry point; called only from entry.S so no prototype in header */ 1313 // done in entry.S
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
H A D | mlx4_devif_queue.c | 694 * size, not the raw entry size) 1036 entries[i].entry = i; 1751 static struct mlx4_eqe *get_eqe(struct mlx4_eq *eq, u32 entry, u8 eqe_factor) { argument 1752 /* (entry & (eq->nent - 1)) gives us a cyclic array */ 1753 unsigned long offset = (entry & (eq->nent - 1)) 1799 * Make sure we read EQ entry contents after we've
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | bridge_postorder_sorted.pl | 29 % asq: important: this entry _has_ to be here all the time!!
|
H A D | bridge_postorder_sorted_ascending.pl | 29 % asq: important: this entry _has_ to be here all the time!!
|
H A D | bridge_postorder_sorted_sum.pl | 29 % asq: important: this entry _has_ to be here all the time!!
|
H A D | bridge_postorder_sorted_sum_ascending.pl | 29 % asq: important: this entry _has_ to be here all the time!!
|
/barrelfish-2018-10-04/usr/eclipseclp/Mercury/ |
H A D | m_tree234.pl | 131 This predicate searches the tree Tree for an entry with key Key. 155 This predicate searches the tree Tree for an entry with key Key. 183 This predicate searches the tree Tree for the entry with the 211 This predicate searches the tree Tree for the entry with the 240 This predicate searches the tree Tree for the entry with the 268 This predicate searches the tree Tree for the entry with the
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/aes/asm/ |
H A D | aes-ppc.pl | 115 mflr $Tbl0 ; vvvvv "distance" between . and 1st data entry 123 mflr $Tbl0 ; vvvvvvvv "distance" between . and 1st data entry
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ |
H A D | makeengines.com | 237 $! Write the entry to the .OPT file (for a real engine name).
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embed.tex | 219 through the \verb+ECLIPSEDIR+ registry entry under the registry key 524 referred to by its dictionary entry. Two classes, \verb.EC_atom.
|
H A D | embremote.tex | 690 with a text entry widget, asking the user to supply the requested data. The 704 entry .ec_stream_input_box.input -bg white -width 40 \
|
/barrelfish-2018-10-04/include/sys/ |
H A D | sysctl.h | 239 struct sysctl_oid *entry; member in struct:sysctl_ctx_entry
|
/barrelfish-2018-10-04/doc/019-device-drivers/ |
H A D | DeviceDriver.tex | 209 The \varname{addLibraries} entry specifies the libraries your application 373 node, called PCI root bridge, forms the entry point to such a tree. PCI root
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 191 \item There can be no entry starting and ending in the same node. 402 If a system contains many modules, it can be helpful to provide a query which automatically generates the documentation for all files. In RiskWise, there is a module {\it document} \index{document}with an entry point {\it document/0} which creates the complete documentation tree. It uses the built-in predicates {\it icompile/1} and {\it ecis\_to\_htlms/4} to extract the documentation information from the source files and to build the HTML files required. Whenever we add a new module to the source of the application, we have to add its name into the {\it components} list. 1048 \item[V] a free variable, will be bound to an entry of $L$ 1075 \item[Best] a free variable, will be bound to an entry of $L$ 1164 The merge \index{merge}concept is used when we want to match corresponding entries in two lists. We sort both lists on the same key, and then scan them in parallel, always discarding the entry with the smallest key first. 1336 (foreach(entry with [i:I,j:J,value:V],L),
|
/barrelfish-2018-10-04/kernel/ |
H A D | capabilities.c | 203 "ptable cap @0x%p, entry=%hu, pte_count=%hu)", 207 cap->u.frame_mapping.entry,
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | paddy.pl | 1145 delete_entry deletes an entry with key Atom from Table. 1146 table_entry tests to see if Table has an entry with key Atom.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | kernel.tex | 185 pointer to their dictionary entry (dident, see \ref{chapdictionary}). 280 value. The arity\index{arity} can be looked up from the dident dictionary entry. 446 no choicepoint was created since procedure entry. It becomes invalid 1807 Catcher entry would unify with Ball.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | knowbase-sec.tex | 55 then it would be necessary to have an entry for each flight.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsdeveltools.tex | 523 The table is sorted according to entry port count ($call+redo+resume$).
|
H A D | umsmodules.tex | 674 % need a separate index entry because latex evaluates \atsym too early
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/ |
H A D | ech.pl | 661 original meta-args upon entry into the pre-/post-fired clause that is 1470 processed rule. For a particular rule, an entry is made in Processed for
|
/barrelfish-2018-10-04/doc/000-overview/ |
H A D | Overview.tex | 192 defines a number of upcall entry points that are invoked by the kernel when it
|