Searched refs:new (Results 176 - 200 of 257) sorted by relevance

1234567891011

/barrelfish-master/usr/eclipseclp/documents/megalog/
H A Dkernel-lst.tex100 \item[createdb(+DatabasePath)]{Create a new database or open a database if it already exists.}
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dextsuspend.tex326 to compound terms, the new terms are again scanned by \predspec{equal_arg/4},
327 but the new continuations are prepended to the list.
328 As a matter of fact, it does not matter if we put the new
472 This can be solved by introducing a new variable
H A Dumslanguage.tex113 to an existing structure except that one or more fields have new
268 but also to build a new list during an iteration. For example
407 This means that, in every iteration, these variables are new (even if a variable
502 Map a list (construct a new list from an existing list):
1010 the new one.
1035 program creating new atoms dynamically at runtime.
/barrelfish-master/lib/openssl-1.0.0d/crypto/bio/
H A DMakefile81 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
82 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/cms/
H A DMakefile73 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
74 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/des/
H A DMakefile102 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
103 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/dsa/
H A DMakefile71 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
72 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/ec/
H A DMakefile74 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
75 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/ocsp/
H A DMakefile72 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
73 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/pem/
H A DMakefile72 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
73 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/lib/openssl-1.0.0d/crypto/ts/
H A DMakefile80 $(PERL) -pe 'if (/^# DO NOT DELETE THIS LINE/) {print; exit(0);}' $(MAKEFILE) >Makefile.new
81 mv -f Makefile.new $(MAKEFILE)
/barrelfish-master/doc/015-disk-driver-arch/
H A Ddesign.tex85 Flounder layer in our system (specifically the \acs{ahci} backend) adding new
H A Drunning.tex78 region completely contains another and thus is split into three new regions, we
H A Dusage.tex1 This lab project contains a new testcase \verb+ata_rw28_test+ to test the
/barrelfish-master/lib/libc/net/
H A Dgetaddrinfo.c635 * that entry may be moved elsewhere in the new list,
636 * we keep the pointer and will restore it in the new
753 struct policyqueue *new; local
755 if ((new = malloc(sizeof(*new))) == NULL) {
759 new->pc_policy = *pol;
760 TAILQ_INSERT_TAIL(head, new, pc_entry);
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dhybrid.tex87 However in general there is no method to recognise for a new problem
94 The {\tt ic} solver communicates new tightened bounds to the
207 linear solver derives a new lower bound for $End$. In case this
707 the new minimum {\em NewMin}:
823 Otherwise a violated constraint is selected, and a new linear
825 The linear solver then wakes and generates a new solution.
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex88 At the same time we provide a number of programming concepts, standard templates that can be used for many ECLiPSe programming tasks. A knowledge of these concepts helps the programmer not only to understand existing code more rapidly, but also should lead to standard solutions whenever a new problem has to be solved.
104 The ECLiPSe documentation contains most of the information provided in this tutorial, but presents it in a very different way. Invariably, it describes all features of the system, many of which are only required for quite specific (if important) tasks like developing new constraint engines inside the system. It can be difficult to find which parts of the documentation contains important hints to solve a particular problem. On the other hand, it will be useful to look up each feature in the user manual and/or the reference manual as they occur in the tutorial.
263 \item[transform] We then use these data structures to create new, transformed data in the tranformation part of the application.
269 Once we have decided on a top-level structure, we must consider the input/output arguments of each part. We have to decide which data must be fed into which modules, where new data structures will be created and which other modules require this data. For each piece of information we must identify its source and its possible sinks. Designing these data flows is an iterative process, assigning functionality to modules and making sure that the required information is available. The design aim should be to minimize the amount of information that must be passed across module boundaries and to arrange functions in the correct data flow order, so that all information is produced before it is required in another module.
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.
428 \item[arguments] In the first alternative, all data are passed in arguments to the query. Multiple items of the same type will usually be represented as lists, with structures to hold different attributes of the different objects. This form has the advantage that each query can be run with a completely new data set without changing the database or creating a new set of files. But debugging data in this form can be more difficult, as there is not direct way to look up some data item. This method also requires work on the Java side to build all the data structures before a call to the ECLiPSe solver. A similar effort is required to develop testing code written in ECLiPSe which exercises the interface.
430 \item[data files] The second alternative is to use data files in a fixed format. The ECLiPSe program then has to read these files and build the internal data structures at the same time. Depending on the format, this may require parsing the input format with definite clause grammars (DCG) \index{DCG}\index{definite clause grammar}(see section \ref{howtousedcgs}), adding to the development effort\footnote{ECLiPSEe 5.4 contains a freeware XML (http://www.xml.org) parser which handles most of the detail of parsing XML files. This makes the use of XML as a data exchange format for ECLiPSe are very exiting new possibility. The parser is described in the ``Third Party Library'' section of the reference manual.}. But as the files can be read and written easily, it is quite simple to create test data sets and to analyze problems by hand. The design for the fixed format may require some extra effort if we want to use the full character set for atoms and strings. A proper quoting mechanism may be required in order to distinguish say a comma separator from a comma contained inside a data field.
436 \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.
558 It is tempting to ignore warnings in order to get the code running as quickly as possible. That would be a big mistake. We should eliminate all warnings about singleton variables\index{singleton variable} and missing predicate \index{missing predicate}definitions before continuing. Not only will this lead to the detection of problems in the code at this point, we will also immediately see if new warning
[all...]
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembsumcxx.tex213 \item[void EC_refs::set(int i, EC_word new)]\ \\
214 assign the term new to the i'th reference.
H A Dembvb.tex169 Create a new EclipseStream. 'Key' must be the symbolic name of an
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextpropia.tex285 Thus the new definition of \verb0sum0 is:
401 constraint is delayed again until new information becomes available.
/barrelfish-master/usr/eclipseclp/documents/visualisation/
H A Dannotate.tex143 runs new variables may be introduced which the user has an interest in
239 assign a name to the new position of an expanded dimension.
/barrelfish-master/lib/openssl-1.0.0d/crypto/
H A Dsparccpuid.S213 add %o1,%o2,%o0 ! OpenSSL expects the new value
/barrelfish-master/doc/006-routing/
H A DRouting.tex136 \item A mechanism to set up new multi-hop channels between dispatchers addressed by end-point identifiers
177 Those additional channels are needed to ensure that the default monitor binding is not congested or even blocked by multi-hop messages. For example, suppose that a client's dispatcher receives a lot of multi-hop messages within a short period of time. The client reacts to this by allocating more memory. If multi-hop messages are sent over the default monitor binding, the message coming from the memory server will be blocked, therefore this will result in a dead lock. By creating new monitor bindings and not using the default monitor binding, we can prevent such a scenario.
230 Once the multi-hop channel is set-up, messages can be sent in both directions. A message can be sent by invoking the \texttt{multihop\_send\_message} function of the interconnect driver. This function requires that the message payload is passed as one (char) array. If a user-defined message contains multiple arguments that are not stored in continuous memory locations, either the user-defined message must be split up in multiple multi-hop messages, or a new array must be allocated and all message arguments must be copied into the newly allocated array (see chapter~\ref{chapter: flounder integration} for a discussion).
292 Flounder is a stub compiler which generates stubs for defined interfaces. To support multi-hop messaging, we created a new back-end code generator for the flounder stub compiler that generates code to use the multi-hop interconnect driver. Applications do not interact with the multi-hop interconnect driver directly, but only over the generated stubs. The stubs for the multi-hop interconnect driver have the exact same interface as stubs for other interconnect drivers. This makes application code independent of the interconnect driver used for communication.
297 If two dispatchers want to communicate with the help of the multi-hop interconnect driver, they must acquire binding objects for each endpoint of the channel. In any binding attempt, one dispatcher must act as the client and the other as the service (however, once a binding is established, the communication process on both sides of the binding is indistinguishable). The binding phase is merged with channel set-up, i.e. a new multi-hop channel will be created during the binding process.
301 If an application wants to create a new multi-hop channel, it can pass the flag \texttt{IDC\_BIND\_FLAG\_MULTIHOP} as an argument to the interface's bind function. This changes the order of the interconnect drivers: The multi-hop interconnect driver will come in second place, directly after the LMP driver. The LMP driver is first, because it is preferable to the multi-hop interconnect driver if client and service are running on the same core. If the multi-hop interconnect driver fails to establish a binding for some reason, the binding process continues as normal with the other interconnect drivers.
473 Any dispatcher in the system can create a new application group
474 and any node in an application group can create a new multicast group
/barrelfish-master/usr/eclipseclp/lib_tcl/
H A Dtkeclipse.tcl673 ;# if there is a nl, then a new line was started
863 .tkecl.mbar.file add command -label "Edit new ..." -command tkecl:edit_new_popup
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Dos_support.c415 ec_rename(char *old, char *new) argument
419 return rename(os_filename(old, winold), os_filename(new, winnew));
1646 /* signals that new settings have been accepted and old_xxx are valid */
1733 * the new times and return the old ones.
1776 double first, /* new initial interval (0: stop timer) */
1777 double interv, /* new periodic interval (0: one shot) */
1810 /* write new parameters into the descriptor */
1824 /* wait for thread to accept new times and return old ones */
1917 /* signals that new settings have been accepted and old_xxx are valid */
2007 * the new time
[all...]

Completed in 199 milliseconds

1234567891011