Home
last modified time | relevance | path

Searched +full:- +full:lp (Results 1 – 25 of 394) sorted by relevance

12345678910>>...16

/external/mksh/src/
Dlalloc.c1 /*-
7 * is granted to deal in this work without restriction, including un-
25 /* build with CPPFLAGS+= -DUSE_REALLOC_MALLOC=0 on ancient systems */
40 ap->next = NULL; in ainit()
46 void *lp; in findptr() local
57 *lpp = (lp = ptr - ALLOC_SIZE); in findptr()
59 while (ap->next != lp) in findptr()
60 if ((ap = ap->next) == NULL) { in findptr()
87 ALLOC_ITEM *lp = NULL; in aresize() local
93 pp = findptr(&lp, ptr, ap); in aresize()
[all …]
/external/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_draw_arrays.c20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
55 struct llvmpipe_context *lp = llvmpipe_context(pipe); in llvmpipe_draw_vbo() local
56 struct draw_context *draw = lp->draw; in llvmpipe_draw_vbo()
60 if (!llvmpipe_check_render_cond(lp)) in llvmpipe_draw_vbo()
63 if (lp->dirty) in llvmpipe_draw_vbo()
64 llvmpipe_update_derived( lp ); in llvmpipe_draw_vbo()
69 for (i = 0; i < lp->num_vertex_buffers; i++) { in llvmpipe_draw_vbo()
70 const void *buf = lp->vertex_buffer[i].user_buffer; in llvmpipe_draw_vbo()
72 buf = llvmpipe_resource_data(lp->vertex_buffer[i].buffer); in llvmpipe_draw_vbo()
77 if (info->indexed) { in llvmpipe_draw_vbo()
[all …]
Dlp_state_so.c20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
44 so->base.num_outputs = templ->num_outputs; in llvmpipe_create_stream_output_state()
45 memcpy(so->base.stride, templ->stride, sizeof(templ->stride)); in llvmpipe_create_stream_output_state()
46 memcpy(so->base.output, templ->output, in llvmpipe_create_stream_output_state()
47 templ->num_outputs * sizeof(templ->output[0])); in llvmpipe_create_stream_output_state()
56 struct llvmpipe_context *lp = llvmpipe_context(pipe); in llvmpipe_bind_stream_output_state() local
59 lp->so = lp_so; in llvmpipe_bind_stream_output_state()
61 lp->dirty |= LP_NEW_SO; in llvmpipe_bind_stream_output_state()
64 draw_set_so_state(lp->draw, &lp_so->base); in llvmpipe_bind_stream_output_state()
79 struct llvmpipe_context *lp = llvmpipe_context(pipe); in llvmpipe_set_stream_output_buffers() local
[all …]
Dlp_state_setup.c20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
86 return LLVMVectorType(LLVMFloatTypeInContext(gallivm->context), 4); in type4f()
97 LLVMBuilderRef bld = gallivm->builder; in vec4f()
120 LLVMBuilderRef bld = gallivm->builder; in vec4f_from_scalar()
140 LLVMBuilderRef builder = gallivm->builder; in store_coef()
145 LLVMBuildGEP(builder, args->a0, &idx, 1, "")); in store_coef()
149 LLVMBuildGEP(builder, args->dadx, &idx, 1, "")); in store_coef()
153 LLVMBuildGEP(builder, args->dady, &idx, 1, "")); in store_coef()
172 * Setup the fragment input attribute with the front-facing value.
180 LLVMBuilderRef builder = gallivm->builder; in emit_facing_coef()
[all …]
Dlp_state_surface.c20 * 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()
56 assert(fb->width <= LP_MAX_WIDTH); in llvmpipe_set_framebuffer_state()
57 assert(fb->height <= LP_MAX_HEIGHT); in llvmpipe_set_framebuffer_state()
61 util_copy_framebuffer_state(&lp->framebuffer, fb); in llvmpipe_set_framebuffer_state()
64 pipe_surface_reference(&lp->framebuffer.zsbuf, NULL); in llvmpipe_set_framebuffer_state()
68 if (lp->framebuffer.zsbuf) { in llvmpipe_set_framebuffer_state()
71 depth_bits = util_format_get_component_bits(lp->framebuffer.zsbuf->format, in llvmpipe_set_framebuffer_state()
80 lp->mrd = mrd; in llvmpipe_set_framebuffer_state()
[all …]
Dlp_state_fs.c21 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
34 * - early depth test
35 * - fragment shader
36 * - alpha test
37 * - depth/stencil test
38 * - blending
105 * Expand the relevant bits of mask_input to a n*4-dword mask for the
120 LLVMBuilderRef builder = gallivm->builder; in generate_quad_mask()
122 LLVMTypeRef i32t = LLVMInt32TypeInContext(gallivm->context); in generate_quad_mask()
202 for (i = 0; i < info->num_outputs; i++) in find_output_by_semantic()
[all …]
/external/llvm/test/Transforms/Inline/
Dinvoke-combine-clauses.ll1 ; RUN: opt %s -inline -S | FileCheck %s
21 %lp = landingpad i32
37 %lp = landingpad i32
39 resume i32 %lp
42 ; CHECK: %lp.i = landingpad
43 ; CHECK-NEXT: catch i8* @exception_inner
44 ; CHECK-NEXT: catch i8* @exception_outer
46 ; CHECK-NEXT: load
60 %lp = landingpad i32
62 resume i32 %lp
[all …]
/external/bison/lib/
Dobstack.c1 /* obstack.c - subroutines used implicitly by object stack macros
3 Copyright (C) 1988-1994, 1996-2006, 2009-2012 Free Software Foundation, Inc.
20 # include <shlib-compat.h>
37 program understand 'configure --with-gnu-libc' and omit the object
42 # include <gnu-versions.h>
87 abort gracefully or use longjump - but shouldn't return. This
105 was used by non-GNU-C macros to avoid multiple evaluation. The GNU C
119 (((h) -> use_extra_arg) \
120 ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
121 : (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
[all …]
/external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
Dsimple_interpolate_lsf.c4 * Use of this source code is governed by a BSD-style license
13 iLBC Speech Coder ANSI-C Source Code
24 /*----------------------------------------------------------------*
26 *---------------------------------------------------------------*/
50 int16_t lp[LPC_FILTERORDER + 1]; in WebRtcIlbcfix_SimpleInterpolateLsf() local
56 if (iLBCenc_inst->mode==30) { in WebRtcIlbcfix_SimpleInterpolateLsf()
61 WebRtcIlbcfix_LsfInterpolate2PloyEnc(lp, lsfdeqold, lsfdeq, in WebRtcIlbcfix_SimpleInterpolateLsf()
64 WEBRTC_SPL_MEMCPY_W16(syntdenum, lp, lp_length); in WebRtcIlbcfix_SimpleInterpolateLsf()
67 WebRtcIlbcfix_LsfInterpolate2PloyEnc(lp, lsfold, lsf, in WebRtcIlbcfix_SimpleInterpolateLsf()
70 WebRtcIlbcfix_BwExpand(weightdenum, lp, in WebRtcIlbcfix_SimpleInterpolateLsf()
[all …]
Ddecoder_interpolate_lsf.c4 * Use of this source code is governed by a BSD-style license
13 iLBC Speech Coder ANSI-C Source Code
24 /*----------------------------------------------------------------*
26 *---------------------------------------------------------------*/
39 int16_t lp[LPC_FILTERORDER + 1], *lsfdeq2; in WebRtcIlbcfix_DecoderInterpolateLsp() local
44 if (iLBCdec_inst->mode==30) { in WebRtcIlbcfix_DecoderInterpolateLsp()
47 WebRtcIlbcfix_LspInterpolate2PolyDec(lp, (*iLBCdec_inst).lsfdeqold, lsfdeq, in WebRtcIlbcfix_DecoderInterpolateLsp()
49 WEBRTC_SPL_MEMCPY_W16(syntdenum,lp,lp_length); in WebRtcIlbcfix_DecoderInterpolateLsp()
50 …WebRtcIlbcfix_BwExpand(weightdenum, lp, (int16_t*)WebRtcIlbcfix_kLpcChirpSyntDenum, (int16_t)lp_le… in WebRtcIlbcfix_DecoderInterpolateLsp()
56 WebRtcIlbcfix_LspInterpolate2PolyDec(lp, lsfdeq, lsfdeq2, in WebRtcIlbcfix_DecoderInterpolateLsp()
[all …]
/external/llvm/test/Transforms/SLPVectorizer/X86/
Doperandorder.ll1 ; RUN: opt < %s -basicaa -slp-vectorizer -slp-threshold=-100 -instcombine -dce -S -mtriple=i386-app…
3 …alayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-…
10 ; CHECK-LABEL: shuffle_operands1
27 ; CHECK-LABEL: shuffle_preserve_broadcast
28 ; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
34 br label %lp
36 lp:
37 %p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
46 br i1 undef, label %lp, label %ext
52 ; CHECK-LABEL: shuffle_preserve_broadcast2
[all …]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/
DLZMAInputStream.java5 * Igor Pavlov <http://7-zip.org/>
32 * to be worse (maybe 10-20&nbsp;% slower) than with {@link LZMA2InputStream}
33 * or {@link XZInputStream} (when the .xz file contains LZMA2-compressed data).
43 * limitation is due to Java using signed 32-bit integers for array
59 * Number of uncompressed bytes left to be decompressed, or -1 if
68 * the given dictionary size and LZMA properties byte (lc, lp, and pb).
75 * of lc, lp, and pb
98 int lp = props / 9; in getMemoryUsage() local
99 int lc = props - lp * 9; in getMemoryUsage()
101 return getMemoryUsage(dictSize, lc, lp); in getMemoryUsage()
[all …]
DLZMA2Options.java64 * Maximum value for lc + lp is 4.
117 * Match finder: Hash Chain 2-3-4
122 * Match finder: Binary tree 2-3-4
135 private int lp; field in LZMA2Options
171 public LZMA2Options(int dictSize, int lc, int lp, int pb, int mode, in LZMA2Options() argument
175 setLcLp(lc, lp); in LZMA2Options()
186 * The presets 0-3 are fast presets with medium compression.
187 * The presets 4-6 are fairly slow presets with high compression.
190 * The presets 7-9 are like the preset 6 but use bigger dictionaries
205 lp = LP_DEFAULT; in setPreset()
[all …]
/external/flac/libFLAC/include/private/
Dlpc.h1 /* libFLAC - Free Lossless Audio Codec library
2 * Copyright (C) 2000-2009 Josh Coalson
3 * Copyright (C) 2011-2014 Xiph.Org Foundation
9 * - Redistributions of source code must retain the above copyright
12 * - Redistributions in binary form must reproduce the above copyright
16 * - Neither the name of the Xiph.org Foundation nor the names of its
48 * --------------------------------------------------------------------
52 * IN in[0,data_len-1]
53 * IN window[0,data_len-1]
54 * OUT out[0,lag-1]
[all …]
/external/eigen/test/
Dpermutationmatrices.cpp32 LeftPermutationType lp(lv); in permutationmatrices() local
36 MatrixType m_permuted = lp * m_original * rp; in permutationmatrices()
42 Matrix<Scalar,Rows,Rows> lm(lp); in permutationmatrices()
47 VERIFY_IS_APPROX(lp.inverse()*m_permuted*rp.inverse(), m_original); in permutationmatrices()
51 VERIFY((lp*lp.inverse()).toDenseMatrix().isIdentity()); in permutationmatrices()
59 VERIFY_IS_APPROX((lp*lp2).toDenseMatrix().template cast<Scalar>(), lm*lm2); in permutationmatrices()
69 m_permuted = lp.inverse() * m_permuted; in permutationmatrices()
70 VERIFY_IS_APPROX(m_permuted, lp.inverse()*m_original); in permutationmatrices()
77 m_permuted = lp * m_permuted; in permutationmatrices()
78 VERIFY_IS_APPROX(m_permuted, lp*m_original); in permutationmatrices()
[all …]
/external/lzma/C/
DLzmaLib.h1 /* LzmaLib.h -- LZMA library interface
2 2013-01-18 : Igor Pavlov : Public domain */
19 state_size = (4 + (1.5 << (lc + lp))) KB
20 by default (lc=3, lp=0), state_size = 16 KB.
24 0 1 lc, lp and pb in encoded form.
30 ------------
32 outPropsSize -
37 -1 for any from: level, loc, lp, pb, fb, numThreads
40 level - compression level: 0 <= level <= 9;
57 dictSize - The dictionary size in bytes. The maximum value is
[all …]
/external/llvm/test/Transforms/BDCE/
Dorder.ll1 ; RUN: opt -bdce -S < %s | FileCheck %s
2 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
3 target triple = "x86_64-unknown-linux-gnu"
18 ; CHECK-LABEL: @_ZN11__sanitizerL12TestRegistryEPNS_14ThreadRegistryEb
21 lpad65.loopexit.split-lp.loopexit.split-lp:
24 lpad65.loopexit.split-lp.loopexit.split-lp.loopexit:
27 br label %lpad65.loopexit.split-lp.loopexit.split-lp
31 to label %invoke.cont70 unwind label %lpad65.loopexit.split-lp.loopexit.split-lp.loopexit
/external/v8/test/mjsunit/
Dregexp-sort.js2 // Use of this source code is governed by a BSD-style license that can be
8 var lp = lower + "|";
10 assertEquals(lx, new RegExp(uxp + lp + lower + "cat", "i").exec(lx) + "");
11 assertEquals(ux, new RegExp(uxp + lp + lower + "cat", "i").exec(ux) + "");
12 assertEquals(lower, new RegExp(lp + uxp + lower + "cat", "i").exec(lx) + "");
13 assertEquals(upper, new RegExp(lp + uxp + lower + "cat", "i").exec(ux) + "");
19 var lp = lower + "|";
21 assertEquals(lower, new RegExp(uxp + lp + lower + "cat", "i").exec(lx) + "");
22 assertEquals(ux, new RegExp(uxp + lp + lower + "cat", "i").exec(ux) + "");
23 assertEquals(lower, new RegExp(lp + uxp + lower + "cat", "i").exec(lx) + "");
[all …]
/external/llvm/lib/CodeGen/
DMachineModuleInfo.cpp1 //===-- llvm/CodeGen/MachineModuleInfo.cpp ----------------------*- C++ -*-===//
8 //===----------------------------------------------------------------------===//
57 /// Symbols - The symbols for the label.
66 /// BBCallbacks - Callbacks for the BasicBlock's that we have entries for. We
70 /// DeletedAddrLabelsNeedingEmission - This is a per-function list of symbols
95 assert(BB->hasAddressTaken() && in getAddrLabelSymbolToEmit()
101 assert(BB->getParent() == Entry.Fn && "Parent changed"); in getAddrLabelSymbolToEmit()
109 Entry.Index = BBCallbacks.size() - 1; in getAddrLabelSymbolToEmit()
110 Entry.Fn = BB->getParent(); in getAddrLabelSymbolToEmit()
115 /// takeDeletedSymbolsForFunction - If we have any deleted symbols for F, return
[all …]
/external/ltrace/sysdeps/linux-gnu/arm/
Dregs.c20 * 02110-1301 USA
43 arm_get_register(struct process *proc, enum arm_register reg, uint32_t *lp) in arm_get_register() argument
46 long l = ptrace(PTRACE_PEEKUSER, proc->pid, (void *)(reg * 4L), 0); in arm_get_register()
47 if (l == -1 && errno != 0) in arm_get_register()
48 return -1; in arm_get_register()
49 *lp = (uint32_t)l; in arm_get_register()
54 arm_set_register(struct process *proc, enum arm_register reg, uint32_t lp) in arm_set_register() argument
56 return ptrace(PTRACE_PEEKUSER, proc->pid, in arm_set_register()
57 (void *)(reg * 4L), (void *)lp); in arm_set_register()
62 uint32_t *lp) in arm_get_register_offpc() argument
[all …]
/external/tcpdump/tests/
Dforces2vvv.out26 192.168.1.142.57793 > 192.168.1.143.6706: sctp[ForCES LP]
29 192.168.1.143.6706 > 192.168.1.142.57793: sctp[ForCES LP]
32 192.168.1.142.57793 > 192.168.1.143.6706: sctp[ForCES LP]
35 192.168.1.143.6706 > 192.168.1.142.57793: sctp[ForCES LP]
46 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
61 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
68 192.168.1.143.6706 > 192.168.1.142.57793: sctp[ForCES LP]
76 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
80 192.168.1.142.57793 > 192.168.1.143.6706: sctp[ForCES LP]
83 192.168.1.142.57793 > 192.168.1.143.6706: sctp[ForCES LP]
[all …]
Dforces2vv.out26 192.168.1.142.34521 > 192.168.1.143.6706: sctp[ForCES LP]
29 192.168.1.143.6706 > 192.168.1.142.34521: sctp[ForCES LP]
32 192.168.1.142.34521 > 192.168.1.143.6706: sctp[ForCES LP]
35 192.168.1.143.6706 > 192.168.1.142.34521: sctp[ForCES LP]
46 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
61 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
68 192.168.1.143.6706 > 192.168.1.142.34521: sctp[ForCES LP]
74 AlwaysACK(0x3), prio=0, execute-all-or-none(0x1),
76 Extra flags: rsv(b5-7) 0x0 rsv(b13-31) 0x0
80 192.168.1.142.34521 > 192.168.1.143.6706: sctp[ForCES LP]
[all …]
/external/eigen/Eigen/src/SparseCholesky/
DSimplicialCholesky_impl.h4 // Copyright (C) 2008-2012 Gael Guennebaud <gael.guennebaud@inria.fr>
29 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
62 /* L(k,:) pattern: all nodes reachable in etree from nz in A(0:k-1,k) */ in analyzePattern_preordered()
63 m_parent[k] = -1; /* parent of k is not yet known */ in analyzePattern_preordered()
75 if (m_parent[i] == -1) in analyzePattern_preordered()
84 /* construct Lp index array from m_nonZerosPerCol column counts */ in analyzePattern_preordered()
85 Index* Lp = m_matrix.outerIndexPtr(); in analyzePattern_preordered() local
86 Lp[0] = 0; in analyzePattern_preordered()
88 Lp[k+1] = Lp[k] + m_nonZerosPerCol[k] + (doLDLT ? 0 : 1); in analyzePattern_preordered()
90 m_matrix.resizeNonZeros(Lp[size]); in analyzePattern_preordered()
[all …]
/external/libgsm/src/
Dlong_term.c25 * maximum of the cross-correlation function between the current
26 * sub-segment short term residual signal d[0..39] (output of
28 * of this array begins at 0 and ends at 39 for each sub-segment of the
29 * RPE-LTP analysis) and the previous reconstructed short term
30 * residual signal dp[ -120 .. -1 ]. A dynamic scaling must be
37 * once without (USE_FLOAT_MUL and FAST defined, and fast run-time
38 * option used). Every pair has first a Cut version (see the -C
54 register word * dp, /* [-120..-1] IN */
88 else scal = 6 - temp;
91 /* Search for the maximum cross-correlation and coding of the LTP lag
[all …]
/external/skia/src/opts/
DSkMorphologyImageFilter_opts.h4 * Use of this source code is governed by a BSD-style license that can be
24 radius = SkMin32(radius, width - 1); in morph()
27 const SkPMColor* lp = src; in morph() local
33 for (const SkPMColor* p = lp; p <= up; p += srcStrideX) { in morph()
40 lp += srcStrideY; in morph()
44 if (x + radius < width - 1) { upperSrc += srcStrideX; } in morph()
57 radius = SkMin32(radius, width - 1); in morph()
60 const SkPMColor* lp = src; in morph() local
65 for (const SkPMColor* p = lp; p <= up; p += srcStrideX) { in morph()
72 lp += srcStrideY; in morph()
[all …]

12345678910>>...16