HomeSort by: relevance | last modified time | path
    Searched refs:prime (Results 1 - 25 of 26) sorted by relevancy

1 2

  /src/games/primes/
pr_tbl.c 45 * prime - prime table
57 const uint64_t prime[] = { variable in typeref:typename:const uint64_t[]
548 /* pr_limit - largest prime in the prime table */
549 const uint64_t *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
primes.h 50 * prime[i] is the (i-1)th prime.
56 extern const uint64_t prime[]; /* must be >=32 bit unsigned values */
57 extern const uint64_t *const pr_limit; /* largest prime in the prime array */
primes.c 60 * -d: print difference to previous prime, e.g. 3 (1)
84 * sieve, table[i] == 1 if and only if 2*i-1 is prime.
214 const uint64_t *p; /* prime table pointer */
215 uint64_t fact_lim; /* highest prime for current block */
249 for (p = &prime[0], factor = prime[0];
298 factor = 17; /* 17 is first prime to use */
299 p = &prime[7]; /* 19 is next prime, pi(19)=7 */
  /src/sys/external/bsd/drm2/dist/drm/vmwgfx/
ttm_object.c 33 * While no substantial code is shared, the prime code is inspired by
607 * ttm_prime_refcount_release - refcount release method for a prime object.
612 * underlying object. At the same time it cleans up the prime object.
619 struct ttm_prime_object *prime; local in function:ttm_prime_refcount_release
622 prime = container_of(base, struct ttm_prime_object, base);
623 BUG_ON(prime->dma_buf != NULL);
624 mutex_destroy(&prime->mutex);
625 if (prime->refcount_release)
626 prime->refcount_release(&base);
641 struct ttm_prime_object *prime local in function:ttm_prime_dmabuf_release
672 struct ttm_prime_object *prime; local in function:ttm_prime_fd_to_handle
709 struct ttm_prime_object *prime; local in function:ttm_prime_handle_to_fd
    [all...]
vmwgfx_bo.c 43 * @prime: The prime object providing user visibility.
47 struct ttm_prime_object prime; member in struct:vmw_user_buffer_object
490 ttm_prime_object_kfree(vmw_user_bo, prime);
561 prime.base);
581 user_bo = container_of(base, struct vmw_user_buffer_object, prime.base);
634 &user_bo->prime,
646 *p_base = &user_bo->prime.base;
649 *handle = user_bo->prime.base.handle;
674 if (likely(ttm_ref_object_exists(tfile, &vmw_user_bo->prime.base))
    [all...]
vmwgfx_surface.c 55 struct ttm_prime_object prime; member in struct:vmw_user_surface
657 prime.base)->srf.res);
679 ttm_prime_object_kfree(user_srf, prime);
696 container_of(base, struct vmw_user_surface, prime.base);
867 user_srf->prime.base.shareable = false;
868 user_srf->prime.base.tfile = NULL;
901 ret = ttm_prime_object_init(tfile, res->backup_size, &user_srf->prime,
911 rep->sid = user_srf->prime.base.handle;
921 ttm_prime_object_kfree(user_srf, prime);
967 prime.base)
    [all...]
ttm_object.h 142 * struct ttm_prime_object - Modified base object that is prime-aware
303 * @ops: DMA buf ops for prime objects of this device.
332 struct ttm_prime_object *prime,
  /src/sys/external/bsd/drm2/dist/drm/i915/selftests/
scatterlist.c 284 unsigned long prime; local in function:igt_sg_alloc
287 for_each_prime_number(prime, max_order) {
288 unsigned long size = BIT(prime);
329 const unsigned long max = PAGE_SIZE; /* not prime! */
331 unsigned long prime; local in function:igt_sg_trim
334 for_each_prime_number(prime, max) {
342 err = alloc_table(&pt, prime, max, *npages, &prng,
350 if (pt.st.orig_nents != prime ||
351 pt.st.nents != prime) {
353 pt.st.nents, pt.st.orig_nents, prime);
    [all...]
i915_request.c 542 unsigned long n, prime; local in function:live_nop_request
551 for_each_prime_number_from(prime, 1, 8192) {
556 for (n = 0; n < prime; n++) {
583 if (prime == 1)
598 prime, div64_u64(ktime_to_ns(times[1]), prime));
697 unsigned long n, prime; local in function:live_empty_request
715 for_each_prime_number_from(prime, 1, 8192) {
718 for (n = 0; n < prime; n++) {
730 if (prime == 1
    [all...]
i915_gem_gtt.c 357 unsigned long npages, prime, flags; local in function:fill_hole
368 for_each_prime_number_from(prime, 2, max_step) {
369 for (npages = 1; npages <= max_pages; npages *= prime) {
408 pr_err("%s(%s) pin (forward) failed with err=%d on size=%lu pages (prime=%lu), offset=%llx\n",
409 __func__, p->name, err, npages, prime, offset);
481 pr_err("%s(%s) pin (backward) failed with err=%d on size=%lu pages (prime=%lu), offset=%llx\n",
482 __func__, p->name, err, npages, prime, offset);
541 if (igt_timeout(end_time, "%s timed out (npages=%lu, prime=%lu)\n",
542 __func__, npages, prime)) {
905 unsigned long prime; local in function:shrink_hole
    [all...]
  /src/sys/arch/mipsco/obio/
asc.c 293 int prime, err; local in function:asc_dma_setup
323 prime = (uint32_t)paddr & 0x3f;
324 blocks = (prime + count + 63) >> 6;
337 /* If non block-aligned transfer prime FIFO manually */
338 if (prime) {
339 /* Enable DMA to prime the FIFO buffer */
349 RAMBO_FIFO, p, prime>>1);
352 while (prime > 0) {
355 prime -= 2;
  /src/sys/external/bsd/drm2/dist/drm/
drm_prime.c 60 * Similar to GEM global names, PRIME file descriptors are also used to share
66 * Drivers that support the PRIME API implement the
98 * Self-importing: If userspace is using PRIME as a replacement for flink then
399 * Generic release function for dma_bufs exported as PRIME buffers. GEM drivers
417 * drm_gem_prime_fd_to_handle - PRIME import function for GEM drivers
423 * This is the PRIME import function which must be used mandatorily by GEM
442 mutex_lock(&file_priv->prime.lock);
444 ret = drm_prime_lookup_buf_handle(&file_priv->prime,
473 ret = drm_prime_add_buf_handle(&file_priv->prime,
475 mutex_unlock(&file_priv->prime.lock)
    [all...]
drm_file.c 178 drm_prime_init_file_private(&file->prime);
189 drm_prime_destroy_file_private(&file->prime);
298 drm_prime_destroy_file_private(&file->prime);
drm_gem.c 219 mutex_lock(&filp->prime.lock);
221 drm_prime_remove_buf_handle_locked(&filp->prime,
224 mutex_unlock(&filp->prime.lock);
  /src/sys/external/bsd/drm2/dist/include/drm/
drm_file.h 352 * @prime:
354 * Per-file buffer caches used by the PRIME buffer sharing code.
356 struct drm_prime_file_private prime; member in struct:drm_file
  /src/sys/arch/sparc/include/
cgtworeg.h 230 } prime; member in union:cg2fb::__anonc9f02afb0c0a
  /src/sys/arch/sun3/include/
cg2reg.h 221 } prime; member in union:cg2fb::__anonf05fb6430c0a
  /src/sys/external/gpl2/dts/dist/arch/arm/boot/dts/
exynos4412-odroidu3.dts 13 #include "exynos4412-prime.dtsi"
  /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/allwinner/
Makefile 30 dtb-$(CONFIG_ARCH_SUNXI) += sun50i-h5-orangepi-prime.dtb
sun50i-h5-orangepi-prime.dts 13 model = "Xunlong Orange Pi Prime";
14 compatible = "xunlong,orangepi-prime", "allwinner,sun50i-h5";
  /src/usr.bin/make/unit-tests/
varmod-ifelse.mk 197 .if ${1 2 3 4 5:L:@n@$n:${ ("${PRIMES:M$n}" != "") :?prime:not_prime}@} != \
198 "1:not_prime 2:prime 3:prime 4:not_prime 5:prime"
  /src/sys/external/bsd/drm2/dist/drm/i915/gem/selftests/
i915_gem_context.c 83 unsigned long end_time, prime; local in function:live_nop_switch
121 for_each_prime_number_from(prime, 2, 8192) {
125 for (n = 0; n < prime; n++) {
159 prime);
167 if (prime == 2)
181 prime - 1, div64_u64(ktime_to_ns(times[1]), prime - 1));
  /src/sys/netinet/
dccp_tfrc.c 1808 static const int prime[] = { 2, 3, 5, 7, 11, 13, 17, 19, 0 }; local in function:normalize
1821 for (i = 0; prime[i]; i++)
1822 while (*num % prime[i] == 0 && *denom % prime[i] == 0) {
1823 *num /= prime[i];
1824 *denom /= prime[i];
  /src/games/factor/
factor.c 56 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\
123 static void pr_print(BIGNUM *, int, int); /* print a prime */
228 for (fact = &prime[0]; !BN_is_one(val); ++fact) {
  /src/sys/external/bsd/drm2/dist/drm/selftests/
test-drm_mm.c 1047 unsigned int prime; local in function:igt_align
1064 for_each_prime_number_from(prime, 1, max_count) {
1065 u64 size = next_prime_number(prime);
1068 size, prime, i,
1071 mode->name, prime);

Completed in 31 milliseconds

1 2