/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
H A D | en_tx.c | 260 ring->context.usr_page = cpu_to_be32(ring->bf.uar->index); 320 struct mlx4_en_tx_ring *ring, u32 index, u8 owner) { 321 struct mlx4_en_tx_info *tx_info = &ring->tx_info[index]; 323 + (index * TXBB_SIZE)); 336 struct mlx4_en_tx_ring *ring, u32 index) { 340 tx_info = &ring->tx_info[index]; 397 u16 index; local 410 index = cons_index & size_mask; 411 cqe = &buf[(index << factor) + factor]; 459 index 319 mlx4_en_stamp_wqe(struct mlx4_en_priv *priv, struct mlx4_en_tx_ring *ring, u32 index, u8 owner) argument 335 mlx4_en_free_tx_desc(struct mlx4_en_priv *priv, struct mlx4_en_tx_ring *ring, u32 index) argument 492 u16 index; local 916 u32 index, bf_index, ring_size; local [all...] |
H A D | mcg.c | 86 static int mlx4_READ_ENTRY(struct mlx4_dev *dev, int index, argument 88 return mlx4_cmd_box(dev, 0, mailbox->dma, index, 0, MLX4_CMD_READ_MCG, 92 static int mlx4_WRITE_ENTRY(struct mlx4_dev *dev, int index, argument 94 return mlx4_cmd(dev, mailbox->dma, index, 0, MLX4_CMD_WRITE_MCG, 144 enum mlx4_steer_type steer, unsigned int index, u32 qpn) { 164 new_entry->index = index; 195 err = mlx4_READ_ENTRY(dev, index, mailbox); 217 err = mlx4_WRITE_ENTRY(dev, index, mailbox); 234 enum mlx4_steer_type steer, unsigned int index, u3 143 new_steering_entry(struct mlx4_dev *dev, u8 port, enum mlx4_steer_type steer, unsigned int index, u32 qpn) argument 233 existing_steering_entry(struct mlx4_dev *dev, u8 port, enum mlx4_steer_type steer, unsigned int index, u32 qpn) argument 663 find_entry(struct mlx4_dev *dev, u8 port, u8 *gid, enum mlx4_protocol prot, struct mlx4_cmd_mailbox *mgm_mailbox, int *prev, int *index) argument 987 int index, prev; local [all...] |
/barrelfish-2018-10-04/usr/drivers/solarflair/sfxge/common/ |
H A D | efx_sram.c | 176 unsigned int index; local 180 for (index = 0; index < sizeof (efx_qword_t); index++) 181 eqp->eq_u8[index] = offset + index; 231 unsigned int index; local 233 for (index = 0; index < sizeof (efx_qword_t); index [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/ |
H A D | GraphViewer.java | 110 public ViewletData getViewletAt(java.util.List index) argument 112 return viewletDataStore.getViewletDataAt(index); 119 public Collection getViewletDataAt(java.util.List index) argument 122 result.add(getViewletAt(index)); 298 java.util.List index; 300 index = stringToIndexList(elem.getName()); 308 int i = ((Integer)index.get(dim)).intValue(); 315 removeElement(index); 321 * Map an element index to the viewlet type which represents it 323 protected ViewletType elementToViewletType(java.util.List index) { argument 348 removeElement(java.util.List index) argument 365 insertNode(ViewletDataStore store, java.util.List index, ViewletData data, ViewletType type) argument 385 insertEdge(ViewletDataStore store, java.util.List index, Node fromNode, Node toNode, ViewletData data, ViewletType type) argument 616 getToolTip(java.util.List index) argument 836 getElement(java.util.List index) argument 1017 insertNewViewletAt(ViewletType newViewletType, java.util.List index, int col, int row ) argument 1449 private int[][] index; field in class:GraphViewer.InsertViewletCommand 1451 InsertViewletCommand(GraphViewer viewer, int[][] index, ViewletType viewletType) argument [all...] |
H A D | ViewletArrayViewer.java | 89 public ViewletData getViewletAt(List index) argument 91 return viewletDataStore.getViewletDataAt(index); 98 public Collection getViewletDataAt(List index) argument 101 result.add(getViewletAt(index));
|
H A D | InterestSpec.java | 121 public Object arg(int index) argument 123 switch(index) 132 throw new IllegalArgumentException("Argument index must be between 1 and "+
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | wm_interface.c | 576 sprintf(buf,"set worker_stat(%d,scheduling) 0.0",cur->index); 578 sprintf(buf,"set worker_stat(%d,idling) 0.0",cur->index); 580 sprintf(buf,"set worker_stat(%d,copying) 0.0",cur->index); 582 sprintf(buf,"set worker_stat(%d,recomputing) 0.0",cur->index); 584 sprintf(buf,"set worker_stat(%d,working) 0.0",cur->index); 586 sprintf(buf,"set worker_stat(%d,user_cpu) 0.0",cur->index); 588 sprintf(buf,"set worker_stat(%d,system_cpu) 0.0",cur->index); 590 sprintf(buf,"set worker_stat(%d,other) 0.0", cur->index); 592 sprintf(buf,"set worker_stat(%d,low_res_elapsed) 0.0",cur->index); 594 sprintf(buf,"set worker_machine(%d) %s",cur->index, [all...] |
H A D | wm_types.h | 40 int index; member in struct:worker_struct
|
/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/ |
H A D | pds.mdt.c | 370 unsigned index; 378 index = intfc_no % 0x10 + intfc_no / 0x10; 379 index = index % (MDT_MAX_NOF_INTFCS / 2); 380 if (msg_intfcs[index].intfc_no == intfc_no) 381 *intfc_index = index; 383 index = MDT_MAX_NOF_INTFCS - 1; 384 while (index && 385 (msg_intfcs[index].intfc_no != intfc_no)) 386 index 369 unsigned index; local 425 unsigned index; local [all...] |
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/ |
H A D | mthca_allocator.c | 117 void *mthca_array_get(struct mthca_array *array, int index) argument 119 int p = (index * sizeof (void *)) >> PAGE_SHIFT; 122 return array->page_list[p].page[index & MTHCA_ARRAY_MASK]; 127 int mthca_array_set(struct mthca_array *array, int index, void *value) argument 129 int p = (index * sizeof (void *)) >> PAGE_SHIFT; 138 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = value; 144 void mthca_array_clear(struct mthca_array *array, int index) argument 146 int p = (index * sizeof (void *)) >> PAGE_SHIFT; 152 array->page_list[p].page[index & MTHCA_ARRAY_MASK] = NULL; 155 pr_debug("Array %p index [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | runtime.tex | 30 {\eclipse} does arithmetic\index{arithmetic} with a variety of numeric types: 32 \item integers (on the implementation level we distinguish small integers\index{integers} 33 and bignums\index{bignums}) 34 \item floats (double\index{double} precisions, older versions supported single and double) 35 \item rationals\index{rationals} 36 \item bounded reals\index{bounded reals} (reals represented by an enclosing interval) 38 Bignum and rational arithmetic are implemented using the GMP\index{GMP} multi-precision 44 are first made equal (by coercing\index{coercing} the argument with the lower type in the 50 that same type. The implementation relies on function tables\index{function tables} which are 51 indexed on type tags\index{tag [all...] |
/barrelfish-2018-10-04/tools/demo/Aquarium/ |
H A D | Events.cs | 151 protected override void InsertItem(int index, TemporalTraceEvent item)
argument 153 base.InsertItem(index, item);
157 protected override void RemoveItem(int index)
argument 159 base.RemoveItem(index);
163 protected override void SetItem(int index, TemporalTraceEvent item)
argument 165 base.SetItem(index, item);
|
/barrelfish-2018-10-04/lib/libc/db/recno/ |
H A D | rec_search.c | 79 t->bt_cur.index = recno - total; 114 --GETRINTERNAL(h, parent->index)->nrecs; 116 ++GETRINTERNAL(h, parent->index)->nrecs;
|
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/viewers/ |
H A D | GanttTaskViewletType.java | 84 java.util.List index, 86 if (((Integer)(index.get(0))).intValue() == -1) { 91 // when the first index is given as -1, this will force 94 ArrayList index2 = new ArrayList(index); 156 super.customizeElement(store, index, element); 172 java.util.List index = (java.util.List)(range.iterator().next()); 176 java.util.List index = (java.util.List)(range.iterator().next()); 178 ll.add(new DisplayTaskInDetailAction(store,index)); 188 List index; field in class:GanttTaskViewletType.DisplayTaskInDetailAction 192 java.util.List index) { 83 customizeElement(ViewletDataStore store, java.util.List index, Element element) argument 191 DisplayTaskInDetailAction(ViewletDataStore store, java.util.List index) argument [all...] |
H A D | ChartBarViewletType.java | 80 java.util.List index = (java.util.List)it.next(); 81 Data data = (Data)store.getViewletDataAt(index); 89 java.util.List index = (java.util.List)it.next(); 90 Data data = (Data)store.getViewletDataAt(index); 93 store.setViewletDataAt(index,data); 123 /** Calculate a unique index for each index ("index") with a store 126 protected int calcIndex(List size, List index) { argument 131 Integer offset = (Integer)(index 138 customizeElement(ViewletDataStore store, java.util.List index, Element element) argument 207 getMin(ViewletDataStore store, List index) argument 214 getMax(ViewletDataStore store, List index) argument [all...] |
H A D | BoundsViewletType.java | 85 java.util.List index, 87 Data data = (Data)(store.getViewletDataAt(index)); 270 // List index = (List)it.next(); 271 // Data data = (Data)(store.getViewletDataAt(index)); 273 // faded.add(index); 282 * For the given index, return the smallest pertinent value 284 public double getMin(ViewletDataStore store, List index) { argument 285 return ((Data)(store.getViewletDataAt(index))).absoluteMin; 289 * For the given index, return the largest pertinent value 291 public double getMax(ViewletDataStore store, List index) { argument 84 customizeElement(ViewletDataStore store, java.util.List index, Element element) argument 498 List index; field in class:BoundsViewletType.DisplayBoundsInDetailAction 501 DisplayBoundsInDetailAction(ViewletDataStore store, java.util.List index) argument [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 93 The tutorial is aimed at programmers learning how to develop applications with ECLiPSe and tries to codify a 'best practice'\index{best practice} for developers. It assumes a basic familarity with concepts of constraint and logic programming and is not a reference manual, so many concepts and language elements are only introduced very briefly. The material also includes some general topics from software engineering. Knowledge of general OO-related methodologies may be helpful to put that material into context. 100 The methodology developed in the CHIC-II project \index{CHIC-II} looks at a much wider methodology question (http://www.icparc.ic.ac.uk/chic2/methodology/)\index{methodology}. It not only covers problems like how to select a problem solving technology to fit a particular problem, but also discusses project related issues like team composition\index{team composition}, rapid prototyping\index{rapid prototyping} and development of problem specifications. On the other hand, it does not discuss the details of developing an ECLiPSe application once the main design choices have been taken. 120 We first review the overall application structure\index{application structure} found in systems developed at Parc Technologies (at least those using ECLiPSe for part of their development). We distinguish between two application types, one a full application with user-interface, database, reporting, etc, and the other a much smaller system, typically reading data from and to files and performing a single, batch type operation. 164 Examples of the first type (see figure~\ref{fullapplication}) are Parc Technologies applications (http://www.parc-technologies.com) like AirPlanner\index{AirPlanner} and RiskWise\index{RiskWise}\footnote{In the following we use a number of examples from the RiskWise application. It is a network analysis tool for IP networks, which uses a constraint solver to determine traffic pattern in the network. If this doesn't make any sense to you, relax. An understanding of the networking application domain is not required to follow this tutorial.}, where everything except the problem solver is developed in Java\index{Java} or related tools. The interface between the main application and the problem solver written in ECLiPSe is via a Java-ECLiPSe interface. In this interface, the main application poses queries for the ECLiPSe solver, passing data and arguments into ECLiPSe. The problem solver then runs the query and returns results as variable bindings in the given query. The Java side only knows about these queries, their data format and the expected results. The internals of the solver, how the queries are resolved, is completely hidden. This defines a nice interface between the application parts, as long as the queries are well defined and documented. Once that design is frozen, the developers for the different parts can continue development independently from each other, using stubs or dummy routines to simulate the other application parts. 166 The NDI-Mapper\index{ND [all...] |
/barrelfish-2018-10-04/lib/libc/db/btree/ |
H A D | bt_search.c | 79 t->bt_cur.index = idx = base + (lim >> 1); 113 t->bt_cur.index = base; 118 * No match found. Base is the smallest index greater than 119 * key and may be zero or a last + 1 index. If it's non-zero, 156 e.index = 0; 191 e.index = NEXTINDEX(e.page) - 1;
|
H A D | bt_delete.c | 106 status = __bt_dleaf(t, NULL, h, c->pg.index); 181 /* Move to the next index. */ 182 if (parent->index != NEXTINDEX(h) - 1) { 183 idx = parent->index + 1; 236 /* Move to the next index. */ 237 if (parent->index != 0) { 238 idx = parent->index - 1; 307 if (__bt_dleaf(t, key, h, e->index)) { 320 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); 323 if (e->index [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/ |
H A D | INSTALL | 47 install_file 644 index.html ../doc
|
/barrelfish-2018-10-04/include/ |
H A D | strings.h | 60 char *index(const char *, int) __pure; /* LEGACY */
|
/barrelfish-2018-10-04/usr/acpi/arch/x86/ |
H A D | ioapic.h | 38 struct ioapic *find_ioapic_by_index(int index);
|
/barrelfish-2018-10-04/lib/acpica/source/components/utilities/ |
H A D | utclib.c | 632 UINT32 index; local 724 index = (UINT32) ((UINT8) *String - '0'); 728 index = (UINT32) toupper (*String); 729 if (isupper (index)) 731 index = index - 'A' + 10; 739 if (index >= Base) 748 if (ReturnValue > ((ACPI_UINT32_MAX - (UINT32) index) / 757 ReturnValue += index;
|
/barrelfish-2018-10-04/lib/phoenix/ |
H A D | taskQ.c | 153 * @param tq tq to index 154 * @param idx index of queue to destroy in tq 183 * Initialize a queue for a given index in the task queue 305 int index; local 317 index = (lgrp < 0) ? rand_r(&tq->seeds[tid]) : lgrp; 318 index %= tq->num_queues; 320 lock_acquire (tq->locks[index].per_thread[tid]); 321 queue_push_back (tq->queues[index], &entry->queue_elem); 322 lock_release (tq->locks[index].per_thread[tid]); 334 int index; local 411 int i, ret, index; local [all...] |
/barrelfish-2018-10-04/lib/acpica/tests/aslts/bin/ |
H A D | diffproc | 368 local rval=0 index=0 index_of_last_found=0 length=0 382 ARRAY[$index]="$line" 383 index=$[ $index + 1 ] 386 length=$index 405 index=$index_of_last_found 409 if [ "$index" -ge "$length" ]; then 413 line="${ARRAY[$index]}" 414 index=$[ $index [all...] |