Searched refs:sections (Results 1 - 23 of 23) sorted by relevance

/barrelfish-2018-10-04/tools/fastmodels/
H A Dbuild_multiboot.c77 struct multiboot_tag_elf_sections *sections= local
87 sections->type= MULTIBOOT_TAG_TYPE_ELF_SECTIONS;
88 sections->size= sizeof(struct multiboot_tag_elf_sections)
90 sections->num= shnum;
91 sections->entsize= sizeof(Elf64_Shdr);
92 sections->shndx= shndx;
94 Elf64_Shdr *shdrs= (Elf64_Shdr *)sections->sections;
H A Dtest_mkmb.c108 Elf64_Shdr *shdrs= (Elf64_Shdr *)sect_tag->sections;
/barrelfish-2018-10-04/kernel/include/
H A Dmultiboot2.h312 char sections[0]; member in struct:multiboot_tag_elf_sections
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/
H A Dpod2man.pl73 sections are to use 1 for user commands, 2 for system calls, 3 for
82 Don't complain when required sections aren't present.
219 (W) Required sections include NAME, DESCRIPTION, and if you're
/barrelfish-2018-10-04/doc/017-arm/
H A DARM.tex322 address space using ``sections'' (1MB large pages), obviating the need
328 Unit, and a few others). These are also mapped using sections.
700 kernel on ARMv7-a. In subsequent sections we will go more into details
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumserrors.tex66 %The types of events can be classified into the following sections:
H A Dumsintro.tex95 %The following sections outline some remarkable features of {\eclipse}:
H A Dumsopsys.tex42 following sections.
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Ddatabase-sec.tex401 The following sections will illustrate
417 The following sections demonstrate how different operators are used
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextchr.tex31 % Deleted sections on Opium (no longer in Eclipse),
32 % plus new sections on the new CHR library
H A Dextfd.tex591 predicates in sections \ref{domaccess} and \ref{dommodify}.
H A Dobsman.tex696 predicates in sections \ref{domaccess} and \ref{dommodify}.
/barrelfish-2018-10-04/doc/011-idc/
H A DIDC.tex464 below, and described in the following sections:
516 The remaining fields are documented in the following sections.
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex240 In the following sections we will first investigate the considerable
1127 The actual program codes in the following sections all follow this schema,
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex468 The next question is how the data should be represented inside \index{internal data}the application. For this purpose we will have to introduce data structures\index{data structures} which allow rapid access to information, which deal with multiple data sets in different parts of the application and where we can add information in a structured way. It should be clear that the built-in fact data base cannot be used for this purpose. Instead, we have to pass the information via arguments of the predicates. In the following sections, we will discuss how the data should be structured to simplify access and coding.
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.
2090 If an individual clause is long, it should be broken into sections, and
2092 lines should be used to show the separation into sections. Comments should
/barrelfish-2018-10-04/doc/019-device-drivers/
H A DDeviceDriver.tex350 suitable device is explained in the following sections. Drivers are started in
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex150 In the following two sections we shall examine the \ECL facilities for
171 %sections has been chosen for pedagogical purposes.
2127 In the preceding sections we have encountered two optimisation
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex234 In the following sections we will first investigate the considerable
/barrelfish-2018-10-04/doc/026-device-queues/
H A Ddevif.tex100 In this section, we explain the terms and the meaning of them as they are used in the following sections.
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembremoteproto.tex643 in more detail in their own sections.
H A Dembjava.tex67 QuickTest.java} works. In the other sections of the document you will
/barrelfish-2018-10-04/doc/014-bulk-transfer/
H A Dbulk-transfer.tex56 following two sub-sections.
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex467 reasons that will be explained in the following sub-sections.
873 The previous sections describes how to initialize and clear an mp\_int structure. To further support operations
1244 Another commonly used technique in the source routines is that certain sections of code are nested. This is used in
1251 the various temporary variables required do not propagate into other sections of code.
5250 These algorithms serve mostly to simplify other algorithms where small constants are required. The last two sections discuss how to manipulate

Completed in 161 milliseconds