HomeSort by: relevance | last modified time | path
    Searched defs:chain (Results 1 - 25 of 35) sorted by relevancy

1 2

  /src/sys/external/bsd/drm2/dist/drm/i915/gem/
i915_gem_fence.c 18 struct i915_sw_fence chain; member in struct:stub_fence
24 struct stub_fence *stub = container_of(fence, typeof(*stub), chain);
53 i915_sw_fence_fini(&stub->chain);
77 i915_sw_fence_init(&stub->chain, stub_notify);
82 if (i915_sw_fence_await_reservation(&stub->chain,
102 i915_sw_fence_commit(&stub->chain);
  /src/sys/external/bsd/drm2/dist/drm/i915/
i915_sw_fence_work.h 30 struct i915_sw_fence chain; member in struct:dma_fence_work
43 i915_sw_fence_commit(&f->chain);
  /src/usr.bin/make/unit-tests/
varmod-subst.mk 7 all: mod-subst-chain
248 mod-subst-chain:
var-scope-local.mk 61 # Target-local variables in a chain of inference rules
62 all: inference-rule-chain.ir-to dir/subdir/inference-rule-chain.ir-to
63 inference-rule-chain.ir-gen-from: .PHONY
64 dir/subdir/inference-rule-chain.ir-gen-from: .PHONY
  /src/usr.sbin/acpitools/aml/
aml_name.h 47 struct aml_name *chain; member in struct:aml_name
  /src/bin/sh/
output.h 49 struct output *chain; member in struct:output
  /src/lib/libc/stdlib/
hcreate.c 201 struct internal_head *table, *chain; local in function:hsearch_r
216 chain = &table[hashval & (head->size - 1)];
217 ie = SLIST_FIRST(chain);
239 SLIST_INSERT_HEAD(chain, ie, link);
  /src/sys/arch/ofppc/stand/ofwboot/
boot.c 156 chain(boot_entry_t entry, char *args, void *ssym, void *esym) function in typeref:typename:void
178 panic("chain");
296 chain((boot_entry_t)(uintptr_t)entry, bootline, ssym, esym);
  /src/sys/arch/shark/stand/ofwboot/
boot.c 148 chain(void (*entry)(int (*)(void *), void *, u_int), char *args, void *ssym, function in typeref:typename:void
176 panic("chain");
302 chain((void *)entry, bootline, ssym, esym);
  /src/sys/external/bsd/drm2/linux/
linux_dma_fence_chain.c 35 #include <linux/dma-fence-chain.h>
44 * dma_fence_chain_init(chain, prev, fence, seqno)
46 * Initialize a fence chain node. If prev was already a chain,
47 * extend it; otherwise; create a new chain context.
50 dma_fence_chain_init(struct dma_fence_chain *chain, struct dma_fence *prev,
56 spin_lock_init(&chain->dfc_lock);
57 chain->dfc_prev = prev; /* consume caller's reference */
58 chain->dfc_fence = fence; /* consume caller's reference */
59 init_irq_work(&chain->dfc_irq_work, &dma_fence_chain_irq_work)
93 struct dma_fence_chain *chain = container_of(work, local in function:dma_fence_chain_irq_work
104 struct dma_fence_chain *chain = container_of(cb, local in function:dma_fence_chain_callback
114 struct dma_fence_chain *chain = to_dma_fence_chain(fence); local in function:dma_fence_chain_enable_signaling
158 struct dma_fence_chain *chain = to_dma_fence_chain(fence); local in function:dma_fence_chain_release
247 struct dma_fence_chain *chain, *prev_chain; local in function:dma_fence_chain_walk
291 struct dma_fence_chain *chain; local in function:dma_fence_chain_find_seqno
    [all...]
  /src/sys/arch/pmax/tc/
dtvar.h 49 } chain; member in struct:dt_msg
  /src/sys/dev/raidframe/
rf_psstatus.h 54 * descriptor. Note that we use just one lock for the whole hash chain.
101 rf_declare_mutex2(mutex); /* mutex for this hash chain */
103 int lock; /* 1 if this hash chain is locked,
105 RF_ReconParityStripeStatus_t *chain; /* the hash chain */ member in struct:RF_PSStatusHeader_s
  /src/sys/kern/
kern_uidinfo.c 139 uint64_t chain; local in function:uid_stats
150 chain = 0;
153 chain++;
155 if (chain > 0) {
157 hs->hash_items += chain;
158 if (chain > hs->hash_maxchain)
159 hs->hash_maxchain = chain;
vfs_bio.c 1176 * Just look on what would be its hash chain. If it's there, return
1188 /* Search hash chain */
1976 uint64_t chain; local in function:bufhash_stats
1986 chain = 0;
1990 chain++;
1994 if (chain > 0) {
1996 hs->hash_items += chain;
1997 if (chain > hs->hash_maxchain)
1998 hs->hash_maxchain = chain;
vfs_vnode.c 1337 uint64_t chain; local in function:vcache_stats
1347 chain = 0;
1350 chain++;
1353 if (chain > 0) {
1355 hs->hash_items += chain;
1356 if (chain > hs->hash_maxchain)
1357 hs->hash_maxchain = chain;
  /src/sys/arch/macppc/stand/ofwboot/
boot.c 199 chain(boot_entry_t entry, char *args, void *ssym, void *esym) function in typeref:typename:void
220 panic("chain");
356 chain((boot_entry_t)(uintptr_t)entry, bootline, ssym, esym);
  /src/sys/arch/ia64/include/
pte.h 80 uint64_t chain; /* pa of collision chain */ member in struct:ia64_lpte
  /src/sys/netinet/
ip_encap.h 86 struct pslist_entry chain; member in struct:encaptab
  /src/sys/uvm/
uvm_bio.c 1118 uint64_t chain; local in function:ubchash_stats
1128 chain = 0;
1131 chain++;
1134 if (chain > 0) {
1136 hs->hash_items += chain;
1137 if (chain > hs->hash_maxchain)
1138 hs->hash_maxchain = chain;
  /src/lib/libcompat/regexp/
regexp.c 379 char *chain; local in function:regbranch
386 chain = NULL;
393 if (chain == NULL) /* First piece. */
396 regtail(chain, latest);
397 chain = latest;
399 if (chain == NULL) /* Loop ran zero times. */
721 - regtail - set the next-pointer at the end of a node chain
  /src/sys/arch/amiga/dev/
siopvar.h 41 * at most MAXPHYS/PAGE_SIZE+1 chain elements to describe, i.e. if none of
69 } chain[DMAMAXIO]; member in struct:siop_ds
81 TAILQ_ENTRY(siop_acb) chain;
  /src/sys/external/bsd/drm2/dist/drm/
drm_syncobj.c 240 * @chain: chain node to use to add the point
241 * @fence: fence to encapsulate in the chain node
244 * Add the chain node as new timeline point to the syncobj.
247 struct dma_fence_chain *chain,
262 dma_fence_chain_init(chain, prev, fence, point);
263 rcu_assign_pointer(syncobj->fence, &chain->base);
269 /* Walk the chain once to trigger garbage collection */
932 struct dma_fence_chain *chain; local in function:drm_syncobj_transfer_to_timeline
944 chain = kzalloc(sizeof(struct dma_fence_chain), GFP_KERNEL)
1594 struct dma_fence_chain *chain; local in function:drm_syncobj_query_ioctl
    [all...]
  /src/sys/arch/sun3/dev/
xy.c 1150 /* chain bit handled later */
1394 iopb = xyc_chain(xycsc, iorq); /* build chain */
1425 * xyc_chain: build a chain. return dvma address of first element in
1426 * the chain. iorq != NULL: means we only want that item on the chain.
1432 int togo, chain, hand; local in function:xyc_chain
1458 * NORM case: do round robin and maybe chain (if allowed and possible)
1461 chain = 0;
1472 xycsc->xy_chain[chain] = &xycsc->reqs[hand];
1473 iopb = xycsc->xy_chain[chain]->iopb
    [all...]
  /src/games/adventure/
init.c 114 emerald, pyramid, pearl, rug, chain, spices, back, look, cave, variable in typeref:typename:int
231 chain = vocab(DECR('c', 'h', 'a', 'i', 'n'), 1, 0);
  /src/sys/dev/vme/
xy.c 1298 /* chain bit handled later */
1534 dmaiopb = xyc_chain(xycsc, iorq); /* build chain */
1564 * xyc_chain: build a chain. return dvma address of first element in
1565 * the chain. iorq != NULL: means we only want that item on the chain.
1571 int togo, chain, hand; local in function:xyc_chain
1596 * NORM case: do round robin and maybe chain (if allowed and possible)
1598 chain = 0;
1610 xycsc->xy_chain[chain] = &xycsc->reqs[hand];
1611 iopb = xycsc->xy_chain[chain]->iopb
    [all...]

Completed in 51 milliseconds

1 2