Searched refs:store (Results 101 - 125 of 138) sorted by relevance

123456

/barrelfish-master/usr/skb/programs/
H A Dbridge_fake_bigfish.pl239 % store the new values of the BARs
H A Dbridge_fake_babybel.pl729 % store the new values of the BARs
H A Dbridge_page.pl604 % store the new values of the BARs
/barrelfish-master/doc/000-overview/
H A DOverview.tex453 which is used to store, query, unify, and compute on a variety of data
480 key-value store which can also retain capabilities. Aside from the
524 \item The System Knowledge Base is used to store information about all
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsintro.tex192 %to store several terms under a specified key.
/barrelfish-master/lib/openssl-1.0.0d/ssl/
H A Dssl_lib.c1743 * the ex_data of SSL_CTX, thus the ex_data store can only be removed
2839 void SSL_CTX_set_cert_store(SSL_CTX *ctx,X509_STORE *store) argument
2843 ctx->cert_store=store;
H A Dkssl.c698 krb5_error_code (KRB5_CALLCONV *store) member in struct:_krb5_cc_ops
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dbranch_and_bound.pl397 % Otherwise we might copy the whole constraint store!
583 % Otherwise we might copy the whole constraint store!
H A Dasm.pl1014 Hash is used to store the label index to variable mapping - this allow
1320 % small bitmap, store inline
1325 % large bitmap, store separately, pointer in code
1497 HashTable: hash-table used to store references to labels encountered
H A Dmodes.pl341 % (To avoid keeping substitutions explicit, we store copies
H A Dkernel.pl1555 % Clauses are stored in a bag which itself is stored in a hash store
1559 % The source store entries are removed. We could make it possible to
3199 local_body(store(Key), M) :-
3252 valid_local_spec(store(_)).
5572 :- local store(domain_def).
5573 :- local store(imported_domain).
5574 :- local store(domain_symbols).
5744 This gives us the 12 levels we currently have. Since we use 4 bits to store
6235 :- local store(name_ctr).
H A Dfd.pl529 % Otherwise we might copy the whole constraint store!
551 % to the store. It can be improved by an explicit check
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/
H A Dmcg.c841 group->dentry.store = NULL;
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex144 only used for some variables (to store the variable name),
145 and dictionary string buffers (to store a reference count).
260 The handle type is intended to store references to non-{\eclipse} data.
1284 A number of variants of the standard choicepoint exist that store more
1289 The choice point creation instructions (try) simply store a subset of the
/barrelfish-master/doc/022-armv8/
H A Dreport.tex247 \texttt{x29} and \texttt{x30} have special roles i.e.\ they store
484 The x86-32, x86-64, and ARMv7 CPU drivers all store the address of the running
1065 store multiple instructions is again visible, for example on lines 27--32.
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dhybrid.tex608 in the size of the constraint store, which slows down constraint
659 may significantly increase the size of the linear constraint store and
/barrelfish-master/doc/026-device-queues/
H A Ddevif.tex446 the queue itself. In essence, we need to store
754 offset within the region, we can directly compute the buffer table entry if we store the index
/barrelfish-master/doc/008-tracing/
H A DTracing.tex137 also be extended, a possible idea would be to store the trace log in a file. In
789 To store an event or an application 16 bytes are used. As the tracing framework
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex436 \item[facts] The last alternative is to store the data as facts \index{fact}in the application. They can then be accessed from any part of the ECLiPSe code quite easily. Testing the code is simple by compiling some data files into the system. The Java interface can also store facts into the database quite easily. But changing the data for a new query can be rather complex, and may require recompiling some data modules.
442 Which of these methods should be used? This depends on the application. Passing data as arguments clearly is the cleanest way, but requires significant work on the interface and on code for testing. Using data files in fixed formats is simple if the format is defined correctly, but its use of the file system can cause problems when multiple queries should be run concurrently on the same machine. Using Prolog terms in data files has the same disadvantage, but is very simple to use if different ECLiPSe systems exchange data. EXDR files are the safest form to store data, but also the least intuitive. Using queues instead of files avoids problems with multiple instances running at the same time, but require some form of logging to allow debugging. Using facts is a valid alternative if most of the data do not change from one query to the next, but requires extra work to reclaim memory after each change. The following table tries to summarize the advantages and disadvantages of each method.
473 The principal data representation feature of ECLiPSe are named structures\index{named structure}\index{structure, named}. These are terms were each argument is linked to an argument name. We can access one or more of the arguments with the {\it with}\index{with} operator. Named structures are very similar to structures in other languages, the arguments of the structure correspond to attributes of the entity represented. Different attributes can have different types, so that we can store diverse information in a named structure.
504 \index{structure, nested}\index{nested structure}A very common data representation problem is how to access information about some structure from another structure, for example in RiskWise how to access the information about a router from an interface of the router. There are two main alternatives. The first is to insert the data of the first entity (router) directly in the representation of the second entity (interface) as an additional attribute, the second is to store a key which can be used to look up the entity. Although the first method has the advantage of avoiding the extra lookup, we do not recommend this approach. If we have recursive references to objects (in our example above if the router also contains a link to all its interfaces) then this direct representation becomes an infinite data structure, which causes problems for printing and debugging. If we use the second approach, we obviously need a way to find the entity belonging to a particular key without too much overhead. The choice of the key depends on the representation of our overall data structure, which we will discuss in the next sections.
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dgfd.tex455 state of the constraint store then the (sub-)expression
457 the constraint store then it evaluates to \verb|0|. If its
H A Dic.tex418 state of the constraint store then the (sub-)expression
420 the constraint store then it evaluates to \verb|0|. If its
H A Dextconjunto.tex298 from the constraint store.
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Deplex_relax.pl106 % supports subsumption of constraints, this will store the
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembed.tex547 The \verb.pword. C data type is used to store {\eclipse} terms. In C++ the
/barrelfish-master/doc/012-services/
H A DServices.tex782 files, and possibly store its knowledge base.

Completed in 231 milliseconds

123456