Searched refs:table (Results 101 - 125 of 153) sorted by relevance

1234567

/barrelfish-master/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/viewers/
H A DChartBarViewletType.java39 import javax.swing.table.*;
187 * in this table
/barrelfish-master/lib/openssl-1.0.0d/crypto/whrlpool/asm/
H A Dwp-x86_64.pl26 # Opteron performance by compressing the table to 2KB and replacing
52 $table=".Ltable";
80 lea $table(%rip),%rbp
209 .type $table,\@object
210 $table:
/barrelfish-master/doc/026-device-queues/
H A Ddevif.tex748 the card driver which adds the required mappings to a hardware register table
751 table entries is limited ($\approx$140000) so registering big amount of memory with
753 for a region id the corresponding first entry of the buffer table. Since the buffer id is the
754 offset within the region, we can directly compute the buffer table entry if we store the index
759 \caption{Translation from region id + buffer id to buffer table entry of the solarflare card}
765 \texttt{devq\_enqueue()} now, the region and buffer id are translated to an buffer table
770 buffer table index to region and buffer id is not necessary on \texttt{devq\_dequeue()}.
793 // add a memory region to the buffer table
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/
H A Dmlx4_devif_queue.c274 /* set gid and pkey table operating lengths by default
682 err = mlx4_init_icm_table(priv, &priv->eq_table.table, init_hca->eqc_base,
750 err = mlx4_init_icm_table(priv, &priv->cq_table.table, init_hca->cqc_base,
758 err = mlx4_init_icm_table(priv, &priv->srq_table.table, init_hca->srqc_base,
770 * group table now. The table isn't very big and it's a lot
773 err = mlx4_init_icm_table(priv, &priv->mcg_table.table, init_hca->mc_base,
784 err_unmap_srq: /*mlx4_cleanup_icm_table(priv, &priv->srq_table.table);*/
786 err_unmap_cq: /*mlx4_cleanup_icm_table(priv, &priv->cq_table.table);*/
800 err_unmap_eq: /*mlx4_cleanup_icm_table(priv, &priv->eq_table.table);*/
[all...]
/barrelfish-master/lib/libc/gen/
H A Dglob.c914 struct xlocale_collate *table = local
940 if (table->__collate_load_error ?
/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Dembexdr.tex40 in the following table. For details of the mapping between Java
H A Dembsumcxx.tex114 given method table.
175 checks whether the EC_word is a handle whose method table
H A Ddbi.tex173 The cursor can then be used to insert several rows into the employee table.
439 "create table accounts \
450 table, and then to initialise it with two rows. The rows processed counts
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dbuiltins.tex179 Prolog level and definition stored in a table. Character classes and
/barrelfish-master/lib/openssl-1.0.0d/crypto/x509v3/
H A Dx509v3.h389 #define EXT_BITSTRING(nid, table) { nid, 0, ASN1_ITEM_ref(ASN1_BIT_STRING), \
395 table}
/barrelfish-master/include/openssl/
H A Dx509v3.h389 #define EXT_BITSTRING(nid, table) { nid, 0, ASN1_ITEM_ref(ASN1_BIT_STRING), \
395 table}
/barrelfish-master/usr/eclipseclp/Contrib/
H A Drdtok.pl43 It uses a hash table. Another difference is the way characters are
44 classified: the Dec-10 tokeniser and WLIST have a table which maps
/barrelfish-master/doc/000-overview/
H A DOverview.tex196 dispatcher, it brings in the base page table pointed to by the vspace
310 \item \emph{Page table} capabilities refer to memory which holds page
311 table pages. There is a different capability type for each level of
337 in the page table, the process is secure: the user cannot map a frame
341 capability for the page table itself.
348 the construction of an invalid page table for any architecture, nor
352 a valid page table for any other core, even if the cores have
/barrelfish-master/lib/tzcode/zic/
H A Dzic.c2418 byword(word, table)
2420 register const struct lookup * const table;
2425 if (word == NULL || table == NULL)
2430 for (lp = table; lp->l_word != NULL; ++lp)
2437 for (lp = table; lp->l_word != NULL; ++lp)
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextpropia.tex202 We first define logical conjunction by its truth table:
232 This information is held in the following table.
H A Dgfd.tex867 \item[\biptxtrefni{table(+Vars, ++Table)}{table/2!gfd}{../bips/lib/gfd/table-2.html}]
870 \biptxtrefni{table(+Vars, ++Table, +Option)}{table/3!gfd}{../bips/lib/gfd/table-3.html}
/barrelfish-master/lib/openssl-1.0.0d/crypto/rc4/asm/
H A Drc4-ia64.pl153 # interfere with the S[] table values stored there. This is
515 /* Prefetch the state-table. It contains 256 elements of size SZ */
/barrelfish-master/usr/skb/programs/
H A Dirq_routing_new.pl61 % X86 specific. irte (interrupt remapping table entry) index links the Index used in the dmar_* predicates
704 % lookup routing table to see if we have an entry
732 % The first translation involves the ACPI int override table
803 % * msix: The MSIX vector table
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dpropiachr.tex147 each product is listed in a table, together with its profit.
269 table {\em Comparing Annotations}.
271 \begin{table}[tb]
285 \end{table}
H A Dtutorial.tex37 % tocbibind forces Contents, Bibliography and Index into the table of contents
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsstring.tex89 This mapping is done via a table called the {\em dictionary}.
H A Dumsarith.tex347 This table gives an overview:
392 predefined arithmetic functions shown in the table.
428 arithmetic functions (as listed in the table above):
H A Dumsdeveltools.tex502 This will print the results in a table like the following:
521 Each row of the table shows the information for a particular predicate
523 The table is sorted according to entry port count ($call+redo+resume$).
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex442 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.
444 \begin{table}[htbp]
465 \end{table}
514 As key \index{key}we can use numbers, atoms or arbitrary terms, but atoms would be the most common key in a hash table. This is very useful when converting input data, since the external data representation often will use names (atoms) to identify objects.
516 While it is possible to iterate over all items of a hash table, this is not as simple as iteration over a list or an array.
524 Each of the alternative representations given above has some advantages and disadvantages. To obtain a very flexible representation, we can choose a multi-representation structure\index{multi representation}. In this structure, a collection of items is represented as a list and as a hash table and as an array. The list representation can be used for a very simple iteration over all items, the hash table is used in the initial data input phase to find items with a given name and the array of items is used in the core routines of the solver for the fastest access by an integer index.
526 The memory requirements of this multi-representation scheme are quite low. The storage to hold the items themselves is shared for all representations, we only need the additional space for the list, hash table and array structures.
1688 \begin{table}[htbp]
1699 \end{table}
[all...]
/barrelfish-master/usr/eclipseclp/documents/megalog/
H A Ddatabase-sec.tex416 and conditions. The operators are given in table~\ref{ops}.
420 \begin{table}
441 \end{table}

Completed in 208 milliseconds

1234567