| /third_party/gstreamer/gstreamer/libs/gst/check/libcheck/ |
| D | check_list.c | 18 * MA 02110-1301, USA.
46 maybe_grow (List * lp) in maybe_grow() argument
48 if (lp->n_elts >= lp->max_elts) { in maybe_grow()
49 lp->max_elts *= LGROW; in maybe_grow()
50 lp->data = in maybe_grow()
51 (void **) erealloc (lp->data, lp->max_elts * sizeof (lp->data[0])); in maybe_grow()
58 List *lp; in check_list_create() local
60 lp = (List *) emalloc (sizeof (List)); in check_list_create()
61 lp->n_elts = 0; in check_list_create()
62 lp->max_elts = LINIT; in check_list_create()
[all …]
|
| D | check_list.h | 18 * MA 02110-1301, USA.
32 int check_list_at_end (List * lp);
35 void check_list_front (List * lp);
40 void check_list_add_front (List * lp, void *val);
44 void check_list_add_end (List * lp, void *val);
47 void *check_list_val (List * lp);
50 void check_list_advance (List * lp);
53 void check_list_free (List * lp);
55 void check_list_apply (List * lp, void (*fp) (void *));
58 bool check_list_contains (List * lp, void *val);
|
| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_draw_arrays.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
60 if (!indirect && (!draws[0].count || !info->instance_count)) in llvmpipe_draw_vbo()
63 struct llvmpipe_context *lp = llvmpipe_context(pipe); in llvmpipe_draw_vbo() local
64 struct draw_context *draw = lp->draw; in llvmpipe_draw_vbo()
68 if (!llvmpipe_check_render_cond(lp)) in llvmpipe_draw_vbo()
71 if (indirect && indirect->buffer) { in llvmpipe_draw_vbo()
76 if (lp->dirty) in llvmpipe_draw_vbo()
77 llvmpipe_update_derived( lp ); in llvmpipe_draw_vbo()
82 for (i = 0; i < lp->num_vertex_buffers; i++) { in llvmpipe_draw_vbo()
83 const void *buf = lp->vertex_buffer[i].is_user_buffer ? in llvmpipe_draw_vbo()
[all …]
|
| D | lp_surface.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
52 src_format = src->format; in lp_resource_copy_ms()
54 for (unsigned i = 0; i < MAX2(src->nr_samples, dst->nr_samples); i++) { in lp_resource_copy_ms()
57 … src, 0, PIPE_MAP_READ, MIN2(i, src->nr_samples - 1), in lp_resource_copy_ms()
68 pipe->texture_unmap(pipe, src_trans); in lp_resource_copy_ms()
74 dst_trans->stride, dst_trans->layer_stride, in lp_resource_copy_ms()
76 src_box->width, src_box->height, src_box->depth, in lp_resource_copy_ms()
78 src_trans->stride, src_trans->layer_stride, in lp_resource_copy_ms()
80 pipe->texture_unmap(pipe, dst_trans); in lp_resource_copy_ms()
81 pipe->texture_unmap(pipe, src_trans); in lp_resource_copy_ms()
[all …]
|
| D | lp_state_setup.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
95 LLVMBuilderRef builder = gallivm->builder; in store_coef()
100 LLVMBuildGEP(builder, args->a0, &idx, 1, "")); in store_coef()
104 LLVMBuildGEP(builder, args->dadx, &idx, 1, "")); in store_coef()
108 LLVMBuildGEP(builder, args->dady, &idx, 1, "")); in store_coef()
118 store_coef(gallivm, args, slot, vert, args->bld.zero, args->bld.zero); in emit_constant_coef4()
123 * Setup the fragment input attribute with the front-facing value.
131 LLVMBuilderRef builder = gallivm->builder; in emit_facing_coef()
132 LLVMTypeRef float_type = LLVMFloatTypeInContext(gallivm->context); in emit_facing_coef()
133 LLVMValueRef a0_0 = args->facing; in emit_facing_coef()
[all …]
|
| D | lp_state_surface.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
52 struct llvmpipe_context *lp = llvmpipe_context(pipe); in llvmpipe_set_framebuffer_state() local
54 boolean changed = !util_framebuffer_state_equal(&lp->framebuffer, fb); in llvmpipe_set_framebuffer_state()
57 assert(fb->width <= LP_MAX_WIDTH); in llvmpipe_set_framebuffer_state()
58 assert(fb->height <= LP_MAX_HEIGHT); in llvmpipe_set_framebuffer_state()
65 enum pipe_format depth_format = fb->zsbuf ? in llvmpipe_set_framebuffer_state()
66 fb->zsbuf->format : PIPE_FORMAT_NONE; in llvmpipe_set_framebuffer_state()
70 if (fb->zsbuf && fb->zsbuf->context != pipe) { in llvmpipe_set_framebuffer_state()
74 for (i = 0; i < fb->nr_cbufs; i++) { in llvmpipe_set_framebuffer_state()
75 if (fb->cbufs[i] && in llvmpipe_set_framebuffer_state()
[all …]
|
| D | lp_state_derived.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
42 * The vertex info describes how to convert the post-transformed vertices
51 const struct tgsi_shader_info *fsInfo = &llvmpipe->fs->info.base; in compute_vertex_info()
52 struct vertex_info *vinfo = &llvmpipe->vertex_info; in compute_vertex_info()
56 draw_prepare_shader_outputs(llvmpipe->draw); in compute_vertex_info()
63 llvmpipe->color_slot[0] = -1; in compute_vertex_info()
64 llvmpipe->color_slot[1] = -1; in compute_vertex_info()
65 llvmpipe->bcolor_slot[0] = -1; in compute_vertex_info()
66 llvmpipe->bcolor_slot[1] = -1; in compute_vertex_info()
67 llvmpipe->viewport_index_slot = -1; in compute_vertex_info()
[all …]
|
| D | lp_state_sampler.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
52 if (state->min_mip_filter == PIPE_TEX_MIPFILTER_LINEAR) in llvmpipe_create_sampler_state()
53 state->min_mip_filter = PIPE_TEX_MIPFILTER_NEAREST; in llvmpipe_create_sampler_state()
57 state->min_mip_filter = PIPE_TEX_MIPFILTER_NONE; in llvmpipe_create_sampler_state()
60 state->mag_img_filter = PIPE_TEX_FILTER_NEAREST; in llvmpipe_create_sampler_state()
61 state->min_img_filter = PIPE_TEX_FILTER_NEAREST; in llvmpipe_create_sampler_state()
79 assert(start + num <= ARRAY_SIZE(llvmpipe->samplers[shader])); in llvmpipe_bind_sampler_states()
81 draw_flush(llvmpipe->draw); in llvmpipe_bind_sampler_states()
89 llvmpipe->samplers[shader][start + i] = sampler; in llvmpipe_bind_sampler_states()
92 /* find highest non-null samplers[] entry */ in llvmpipe_bind_sampler_states()
[all …]
|
| D | lp_jit.c | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
30 * C - JIT interfaces
35 #include <llvm/Config/llvm-config.h>
48 LLVMContextRef lc = gallivm->context; in create_jit_texture_type()
70 gallivm->target, texture_type, in create_jit_texture_type()
73 gallivm->target, texture_type, in create_jit_texture_type()
76 gallivm->target, texture_type, in create_jit_texture_type()
79 gallivm->target, texture_type, in create_jit_texture_type()
82 gallivm->target, texture_type, in create_jit_texture_type()
85 gallivm->target, texture_type, in create_jit_texture_type()
[all …]
|
| D | lp_state_cs.c | 49 #include "util/mesa-sha1.h"
66 generate_compute(struct llvmpipe_context *lp, in generate_compute() argument
70 struct gallivm_state *gallivm = variant->gallivm; in generate_compute()
71 const struct lp_compute_shader_variant_key *key = &variant->key; in generate_compute()
75 LLVMTypeRef int32_type = LLVMInt32TypeInContext(gallivm->context); in generate_compute()
99 cs_type.norm = FALSE; /* values are not limited to [0,1] or [-1,1] */ in generate_compute()
100 cs_type.width = 32; /* 32-bit float */ in generate_compute()
106 arg_types[0] = variant->jit_cs_context_ptr_type; /* context */ in generate_compute()
117 arg_types[11] = variant->jit_cs_thread_data_ptr_type; /* per thread data */ in generate_compute()
118 arg_types[12] = int32_type; /* coro only - num X loops */ in generate_compute()
[all …]
|
| /third_party/mksh/ |
| D | lalloc.c | 1 /*-
7 * is granted to deal in this work without restriction, including un-
28 /* build with CPPFLAGS+= -DUSE_REALLOC_MALLOC=0 on ancient systems */
48 struct lalloc_item *lp = ptr; in free_osimalloc() local
50 if (munmap(lp, lp->len)) in free_osimalloc()
57 struct lalloc_item *lp, *lold = ptr; in remalloc() local
61 if (lold && lold->len >= size) in remalloc()
64 if ((lp = mmap(NULL, size, PROT_READ | PROT_WRITE, in remalloc()
65 MAP_ANON | MAP_PRIVATE, -1, (off_t)0)) == MAP_FAILED) in remalloc()
67 if (ALLOC_ISUNALIGNED(lp)) in remalloc()
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | jpeg2000dwt.c | 20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
53 p[i0 - 1] = p[i0 + 1]; in extend53()
54 p[i1] = p[i1 - 2]; in extend53()
55 p[i0 - 2] = p[i0 + 2]; in extend53()
56 p[i1 + 1] = p[i1 - 3]; in extend53()
64 p[i0 - i] = p[i0 + i]; in extend97_float()
65 p[i1 + i - 1] = p[i1 - i - 1]; in extend97_float()
74 p[i0 - i] = p[i0 + i]; in extend97_int()
75 p[i1 + i - 1] = p[i1 - i - 1]; in extend97_int()
91 for (i = ((i0+1)>>1) - 1; i < (i1+1)>>1; i++) in sd_1d53()
[all …]
|
| D | lsp.h | 2 * LSP computing for ACELP-based codecs
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
29 (I.F) means fixed-point value with F fractional and I integer bits
38 * @param lp_order LP filter order
57 * @param[out] lsp LSP coefficients (-0x8000 <= (0.15) < 0x8000)
59 * @param lp_order LP filter order
71 * @brief LSP to LP conversion (3.2.6 of G.729)
72 * @param[out] lp decoded LP coefficients (-0x8000 <= (3.12) < 0x8000)
73 * @param lsp LSP coefficients (-0x8000 <= (0.15) < 0x8000)
74 * @param lp_half_order LP filter order, divided by 2
[all …]
|
| D | celp_filters.h | 2 * various filters for CELP-based codecs
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
30 * LP synthesis filter.
32 * - the array out[-filter_length, -1] must
37 * @param filter_length filter length (10 for 10th order LP filter). Must be
50 * LP zero synthesis filter.
54 * - the array in[-filter_length, -1] must
57 * @param filter_length filter length (10 for 10th order LP filter;
84 * fc_out[n] = sum(i,0,len-1){ fc_in[i] * filter[(len + n - i)%len] }
94 * out[k] = in[k] + fac * lagged[k-lag] with wrap-around
[all …]
|
| D | lsp.c | 2 * LSP routines for ACELP-based codecs
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
38 O(n) if data already sorted, O(n^2) - otherwise */ in ff_acelp_reorder_lsf()
39 for(i=0; i<lp_order-1; i++) in ff_acelp_reorder_lsf()
40 for(j=i; j>=0 && lsfq[j] > lsfq[j+1]; j--) in ff_acelp_reorder_lsf()
48 lsfq[lp_order-1] = FFMIN(lsfq[lp_order-1], lsfq_max);//Is warning required ? in ff_acelp_reorder_lsf()
67 1, -1607, -3211, -4808, -6393, -7962, -9513, -11040,
68 -12541, -14012, -15449, -16848, -18207, -19523, -20791, -22009,
69 -23174, -24283, -25334, -26324, -27250, -28111, -28904, -29627,
70 -30279, -30858, -31363, -31792, -32144, -32419, -32616, -32736, -32768,
[all …]
|
| /third_party/musl/src/stdlib/ |
| D | qsort.c | 22 /* Minor changes by Rich Felker for integration in musl, 2011-04-27. */
25 Run time: Worst case O(n log n), close to O(n) in the mostly-sorted case. */
38 int r = ntz(p[0] - 1); in pntz()
63 width -= l; in cycle()
71 n -= 8 * sizeof(size_t); in shl()
76 p[1] |= p[0] >> (sizeof(size_t) * 8 - n); in shl()
83 n -= 8 * sizeof(size_t); in shr()
88 p[0] |= p[1] << (sizeof(size_t) * 8 - n); in shr()
92 static void sift(unsigned char *head, size_t width, cmpfun cmp, void *arg, int pshift, size_t lp[]) in sift() argument
100 rt = head - width; in sift()
[all …]
|
| /third_party/cups/ |
| D | cups.spec | 6 # http://www.apache.org/licenses/LICENSE-2.0
20 Summary: CUPS is the standards-based, open source printing system for linux operating systems.
24 Source0: https://github.com/OpenPrinting/cups/releases/download/v%{version}/cups-%{version}-source.…
29 Patch1: cups-system-auth.patch
30 Patch2: cups-multilib.patch
31 Patch3: cups-banners.patch
32 Patch4: cups-direct-usb.patch
33 Patch5: cups-driverd-timeout.patch
34 Patch6: cups-usb-paperout.patch
35 Patch7: cups-uri-compat.patch
[all …]
|
| /third_party/gstreamer/gstreamer/tests/benchmarks/ |
| D | mass-elements.scm | 2 # -*- scheme -*-
3 exec guile -s $0 "$@"
20 ;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 ;; mass-elements. Guile 1.6.
25 (use-modules (srfi srfi-13)
26 (srfi srfi-1)
27 (ice-9 optargs)
28 (ice-9 popen))
32 (define (read-lines port)
33 (let lp ((lines '()))
[all …]
|
| D | complexity.scm | 2 # -*- scheme -*-
3 exec guile -s $0 "$@"
20 ;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 (use-modules (srfi srfi-13)
26 (srfi srfi-1)
27 (ice-9 optargs)
28 (ice-9 popen)
29 (ice-9 rdelim))
33 (define (read-lines port)
34 (let lp ((lines '()))
[all …]
|
| /third_party/ltp/testcases/kernel/fs/fsx-linux/ |
| D | fsx-linux.c | 3 * Copyright (c) 1998-2001 Apple Computer, Inc. All rights reserved.
17 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
28 * Rewrite and enhancements 1998-2001 Conrad Minshall -- conrad@mac.com
32 * Small changes to work under Linux -- davej@suse.de
37 * Add multi-file testing feature -- Zach Brown <zab@clusterfs.com>
106 unsigned long simulatedopcount = 0; /* -b flag */
107 int closeprob = 0; /* -c flag */
108 int debug = 0; /* -d flag */
109 unsigned long debugstart = 0; /* -D flag */
110 unsigned long maxfilelen = 256 * 1024; /* -l flag */
[all …]
|
| /third_party/ltp/testcases/network/tcp_cmds/sendfile/ |
| D | testsf_s.c | 37 char *lp; in main() local
47 tst_brkm(TBROK, NULL, "usage: listen-address listen-port"); in main()
62 if (!hp || !hp->ai_addr || hp->ai_addr->sa_family != AFI) { in main()
67 memcpy(&sa, hp->ai_addr, hp->ai_addrlen); in main()
127 lp = &rbuf[0]; in main()
132 while (*lp != '=') { /* convert ascii to integer */ in main()
133 nbuf[count] = *lp; in main()
135 lp++; in main()
141 lp++; in main()
143 tst_resm(TINFO, "The file to send is %s", lp); in main()
[all …]
|
| /third_party/openssl/crypto/bn/ |
| D | bn_conv.c | 2 * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.
25 buf = OPENSSL_malloc(a->top * BN_BYTES * 2 + 2); in BN_bn2hex()
31 if (a->neg) in BN_bn2hex()
32 *p++ = '-'; in BN_bn2hex()
33 for (i = a->top - 1; i >= 0; i--) { in BN_bn2hex()
34 for (j = BN_BITS2 - 8; j >= 0; j -= 8) { in BN_bn2hex()
36 v = (int)((a->d[i] >> j) & 0xff); in BN_bn2hex()
58 BN_ULONG *bn_data = NULL, *lp; in BN_bn2dec() local
61 /*- in BN_bn2dec()
81 lp = bn_data; in BN_bn2dec()
[all …]
|
| /third_party/libsnd/src/GSM610/ |
| D | long_term.c | 20 * maximum of the cross-correlation function between the current
21 * sub-segment short term residual signal d [0..39] (output of
23 * of this array begins at 0 and ends at 39 for each sub-segment of the
24 * RPE-LTP analysis) and the previous reconstructed short term
25 * residual signal dp [-120 .. -1]. A dynamic scaling must be
32 * once without (USE_FLOAT_MUL and FAST defined, and fast run-time
33 * option used). Every pair has first a Cut version (see the -C
49 register int16_t * dp, /* [-120..-1] IN */ in Cut_Calculation_of_the_LTP_parameters()
82 else scal = 6 - temp ; in Cut_Calculation_of_the_LTP_parameters()
85 /* Search for the maximum cross-correlation and coding of the LTP lag in Cut_Calculation_of_the_LTP_parameters()
[all …]
|
| /third_party/musl/src/locale/ |
| D | strfmon.c | 13 int lp, rp, w, fw; in vstrfmon_l() local
19 n--; in vstrfmon_l()
45 case '-': in vstrfmon_l()
53 fw = 10*fw + (*fmt-'0'); in vstrfmon_l()
54 lp = 0; in vstrfmon_l()
56 if (*fmt=='#') for (lp=0, fmt++; isdigit(*fmt); fmt++) in vstrfmon_l()
57 lp = 10*lp + (*fmt-'0'); in vstrfmon_l()
59 rp = 10*rp + (*fmt-'0'); in vstrfmon_l()
63 w = lp + 1 + rp; in vstrfmon_l()
70 return -1; in vstrfmon_l()
[all …]
|
| /third_party/toybox/scripts/ |
| D | mcm-buildall.sh | 3 # Script to build all cross and native compilers supported by musl-libc.
6 if [ ! -d litecross ]
8 echo Run this script in musl-cross-make directory to make "ccc" directory.
10 echo " "git clone https://github.com/richfelker/musl-cross-make
11 echo " "cd musl-cross-make
12 echo ' ~/toybox/scripts/mcm-buildall.sh'
19 BOOTSTRAP=i686-linux-musl
21 [ -z "$OUTPUT" ] && OUTPUT="$PWD/ccc"
25 rm -rf "$OUTPUT" host-* *.log
33 LP="$PATH"
[all …]
|