Home
last modified time | relevance | path

Searched +full:no +full:- +full:insert +full:- +full:detect (Results 1 – 25 of 475) sorted by relevance

12345678910>>...19

/freebsd/sys/contrib/device-tree/Bindings/power/supply/
H A Dmax8925_battery.txt1 max8925-battery bindings
5 - batt-detect: whether support battery detect
6 - topoff-threshold: set charging current in topoff mode
7 - fast-charge: set charging current in fast mode
8 - no-temp-support: whether support temperature protection detect
9 - no-insert-detect: whether support insert detect
13 batt-detect = <0>;
14 topoff-threshold = <1>;
15 fast-charge = <7>;
16 no-temp-support = <0>;
[all …]
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Dqcom,msm8916-wcd-analog.txt8 - compatible = "qcom,pm8916-wcd-analog-codec";
9 - reg: represents the slave base address provided to the peripheral.
10 - interrupts: List of interrupts in given SPMI peripheral.
11 - interrupt-names: Names specified to above list of interrupts in same
13 "cdc_spk_cnp_int" - Speaker click and pop interrupt.
14 "cdc_spk_clip_int" - Speaker clip interrupt.
15 "cdc_spk_ocp_int" - Speaker over current protect interrupt.
16 "mbhc_ins_rem_det1" - jack insert removal detect interrupt 1.
17 "mbhc_but_rel_det" - button release interrupt.
18 "mbhc_but_press_det" - button press event
[all …]
/freebsd/sys/contrib/device-tree/Bindings/mfd/
H A Dmax8925.txt4 - compatible : "maxim,max8925"
5 - reg : the I2C slave address for the max8925 chip
6 - interrupts : IRQ line for the max8925 chip
7 - interrupt-controller: describes the max8925 as an interrupt
9 - #interrupt-cells : should be 1.
10 - The cell is the max8925 local IRQ number
13 - maxim,tsc-irq: there are 2 IRQ lines for max8925, one is indicated in
16 max8925 consists of a large and varied group of sub-devices:
19 ------ ------------ -----------
20 max8925-onkey : : On key
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86AvoidTrailingCall.cpp1 //===----- X86AvoidTrailingCall.cpp - Insert int3 after trailing calls ----===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // The unwinder decodes forward from the current PC to detect epilogue code
20 // Second, all non-tail call jump targets must be within the *half-open*
33 //===----------------------------------------------------------------------===//
42 #define AVOIDCALL_NAME "x86-avoid-trailing-call"
70 // A real instruction is a non-meta, non-pseudo instruction. Some pseudos in INITIALIZE_PASS()
88 // is no unwind info (CFI). in runOnMachineFunction()
100 if (NextMBB && !NextMBB->isEHFuncletEntry()) in runOnMachineFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveIntervalUnion.cpp1 //===- LiveIntervalUnion.cpp - Live interval union data structure --------
[all...]
/freebsd/sys/contrib/device-tree/src/arm/marvell/
H A Dmmp2-brownstone.dts1 // SPDX-License-Identifier: GPL-2.0-only
7 /dts-v1/;
12 compatible = "mrvl,mmp2-brownstone", "mrvl,mmp2";
34 interrupt-parent = <&intcmux4>;
35 interrupt-controller;
36 #interrupt-cells = <1>;
37 maxim,tsc-irq = <0>;
41 regulator-min-microvolt = <637500>;
42 regulator-max-microvolt = <1425000>;
43 regulator-boot-on;
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstack_depot.h1 //===-- stack_depot.h -------------------------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
55 // and stack trace markers in the case where instruction pointers are 4-byte
56 // aligned, as they are on arm64), the stack trace hash in bits 1-32, and the
57 // size of the stack trace in bits 33-63.
59 // The insert() function is potentially racy in its accesses to the Tab and
61 // hash collisions, it will either return the correct stack trace or no stack
62 // trace at all, even if two instances of insert() raced with one another.
63 // This is achieved by re-checking the hash of the stack trace before
[all …]
/freebsd/sys/contrib/dev/acpica/components/utilities/
H A Dutstrsuppt.c3 * Module Name: utstrsuppt - Support functions for string-to-integer conversion
11 * Some or all of this work - Copyright (c) 1999 - 2024, Intel Corp.
28 * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
33 * license, and in no event shall the patent license extend to any additions
34 * to or modifications of the Original Intel Code. No other license or right
54 * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
82 * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
90 * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
104 * re-exports any such software from a foreign destination, Licensee shall
105 * ensure that the distribution and export/re-export of the software is in
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DPredicateInfo.cpp1 //===-- PredicateInfo.cpp - PredicateInfo Builder--------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------===//
11 //===----------------------------------------------------------------===//
36 "verify-predicateinfo", cl::init(false), cl::Hidden,
38 DEBUG_COUNTER(RenameCounter, "predicateinfo-rename",
52 return cast<PredicateWithEdge>(PB)->From; in getBranchBlock()
60 return cast<PredicateWithEdge>(PB)->From->getTerminator(); in getBranchTerminator()
69 return std::make_pair(PEdge->From, PEdge->To); in getBlockEdge()
107 return ArgA->getArgNo() < ArgB->getArgNo(); in valueComesBefore()
[all …]
H A DBypassSlowDivision.cpp1 //===- BypassSlowDivision.cpp - Bypass slow division ----------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 // For example, on Intel Atom 32-bit divides are slow enough that during
13 // positive and less than 256 use an unsigned 8-bit divide.
15 //===----------------------------------------------------------------------===//
40 #define DEBUG_TYPE "bypass-slow-division"
66 /// Operand definitely fits into BypassType. No runtime checks are needed.
91 return SlowDivOrRem->getOpcode() == Instruction::SDiv || in isSignedOp()
92 SlowDivOrRem->getOpcode() == Instruction::SRem; in isSignedOp()
[all …]
H A DMoveAutoInit.cpp1 //===-- MoveAutoInit.cpp - move auto-init inst closer to their use site----===//
5 // SPDX-License-Identifie
[all...]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/
H A Dfp_mul_impl.inc1 //===---- lib/fp_mul_impl.inc - floating point multiplication -----*- C -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // This file implements soft-float multiplication with the IEEE-754 default
12 //===----------------------------------------------------------------------===//
25 // Detect if a or b is zero, denormal, infinity, or NaN.
26 if (aExponent - 1U >= maxExponent - 1U ||
27 bExponent - 1U >= maxExponent - 1U) {
40 // infinity * non-zero = +/- infinity
49 // non-zero * infinity = +/- infinity
[all …]
/freebsd/contrib/libucl/include/
H A Ducl.h1 /* Copyright (c) 2013-2015, Vsevolod Stakhov
15 * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
47 * - @ref structures
48 * - @ref utils
49 * - @ref parser
50 * - @ref emitter
66 * UCL_ALLOC(size) - allocate memory for UCL
67 * UCL_FREE(size, ptr) - free memory of specified size at ptr
103 UCL_EOK = 0, /**< No error */
122 UCL_OBJECT = 0, /**< UCL object - key/value pairs */
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h1 //===- ADT/SCCIterator.h - Strongly Connected Comp. Iter. -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
20 //===----------------------------------------------------------------------===//
45 /// iterator and thus you cannot backtrack or re-visit nodes.
71 /// The visit counters used to detect when a complete SCC is on the stack.
74 /// nodeVisitNumbers are per-node visit numbers, also used as DFS flags.
88 /// A single "visit" within the non-recursive DFS traversal.
91 /// The stack-based DFS traversal; defined below.
176 unsigned childNum = Visited->second; in DFSVisitChildren()
[all …]
/freebsd/sys/dev/mii/
H A Dacphyreg.h1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 #define AC_INT_PD_FLT 0x0010 /* Parallel detect fault */
66 #define AC_MCTL_FRC_FEF 0x0080 /* Force Far End Fault Insert. */
69 #define AC_MCTL_ALED_SEL 0x0400 /* ActLED RX&TX - RX only */
70 #define AC_MCTL_10BT_SEL 0x0800 /* Enable 7-wire interface */
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp1 //==- UnreachableCodeChecker.cpp - Generalized dead code checker -*- C++ -*-==//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
10 // post-analysis to determine what was never visited.
12 // A similar flow-sensitive only check exists in Analysis/ReachableCode.cpp
13 //===----------------------------------------------------------------------===//
65 if (!LC->inTopFrame()) in checkEndAnalysis()
69 D = LC->getAnalysisDeclContext()->getDecl(); in checkEndAnalysis()
73 C = LC->getAnalysisDeclContext()->getUnoptimizedCFG(); in checkEndAnalysis()
[all …]
/freebsd/contrib/ntp/ntpd/
H A Drefclock_palisade.h26 * ARE DISCLAIMED. IN NO EVENT SHALL TRIMBLE NAVIGATION LTD. BE LIABLE
37 * refclock_palisade - clock driver for the Trimble Palisade GPS
46 * Sven-Thorsten Dietrich
49 * Sunnyvale, CA 94088-3642
92 #define PRECISION (-20) /* precision assumed (about 1 us) */
107 #define LENCODE_8F0B 74 /* Length of TSIP 8F-0B Packet & header */
110 #define LENCODE_8FAC 68 /* Length of Thunderbolt 8F-AC Position Packet*/
115 /* Allowed Sub-Packet ID's */
140 * Leap-Insert and Leap-Delete are encoded as follows:
141 * PALISADE_UTC_TIME set and PALISADE_LEAP_PENDING set: INSERT leap
[all …]
/freebsd/sys/kern/
H A Dsubr_pctrie.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
33 * Path-compressed radix trie implementation.
36 * - Size of the nodes should be as small as possible but still big enough
41 * - There is not a huge bias toward the number of lookup operations over
42 * the number of insert and remove operations. This basically implies
45 * - On average not many nodes are expected to be fully populated, hence
94 return ((index >> node->pn_clev) & (PCTRIE_COUNT - 1)); in pctrie_slot()
104 index = (index - node->pn_owner) >> node->pn_clev; in pctrie_keybarr()
[all …]
H A Dsubr_msgbuf.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
67 mbp->msg_ptr = ptr; in msgbuf_init()
68 mbp->msg_size = size; in msgbuf_init()
69 mbp->msg_seqmod = SEQMOD(size); in msgbuf_init()
70 mbp->msg_lastpri = -1; in msgbuf_init()
71 mbp->msg_flags = 0; in msgbuf_init()
73 mbp->msg_magic = MSG_MAGIC; in msgbuf_init()
74 bzero(&mbp->msg_lock, sizeof(mbp->msg_lock)); in msgbuf_init()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp1 //=- WebAssemblyFixIrreducibleControlFlow.cpp - Fix irreducible control flow -//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 /// Irreducible control flow means multiple-entry loops, which this pass
19 /// of blocks with a single entry and no branches back to that entry. A region
22 /// up multi-entry loops by adding a new block that can dispatch to each of the
37 /// use the "label" helper for the blocks we absolutely must and no others. We
47 /// [1] Alon Zakai. 2011. Emscripten: an LLVM-to-JavaScript compiler. In
50 /// New York, NY, USA, 301-312. DOI=10.1145/2048147.2048224
53 //===----------------------------------------------------------------------===//
[all …]
/freebsd/share/man/man3/
H A Dqueue.319 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
126 .Nd implementations of singly-linked lists, singly-linked tail queues,
232 .Bl -enum -compact -offset indent
236 Singly-linked lists
238 Singly-linked tail queues
243 .Bl -enum -compact -offset indent
256 Singly-linked lists are the simplest of the four data structures
258 Singly-linked lists are ideal for applications with large datasets
259 and few or no removals,
261 Singly-linked lists add the following functionality:
[all …]
/freebsd/sys/contrib/device-tree/Bindings/mmc/
H A Dmmc-controller.yaml1 # SPDX-License-Identifier: GPL-2.0
3 ---
4 $id: http://devicetree.org/schemas/mmc/mmc-controller.yaml#
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Ulf Hansson <ulf.hansson@linaro.org>
25 "#address-cell
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DTailRecursionElimination.cpp1 //===- TailRecursionElimination.cpp - Eliminate Tail Calls ----------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
23 // run-time constant on all exits from the function. It is possible, though
36 // in the entry block requires analysis to proves that the tail-called
47 // 4. The algorithm we use to detect if callees access their caller stack
50 //===----------------------------------------------------------------------===//
99 return !AI || AI->isStaticAlloca(); in canTRE()
105 // Start at a root value and walk its use-def chain to mark calls that use the
113 for (auto &U : V->uses()) { in walk()
[all …]
H A DMergeICmps.cpp1 //===- MergeICmps.cpp - Optimize chains of integer comparisons ------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
16 // - There are less jumps, and therefore less opportunities for mispredictions
17 // and I-cache misses.
18 // - Code size is smaller, both because jumps are removed and because the
19 // encoding of a 2*n byte compare is smaller than that of two n-byte
40 // Which will later be expanded (ExpandMemCmp) as a single 8-bytes icmp.
42 //===----------------------------------------------------------------------===//
94 // the pointer values for Base because these are non-deterministic.
[all …]
/freebsd/share/misc/
H A Dusb_hid_usages4 # - lines that do not start with a white space give the number and name of
6 # - lines that start with a white space give the number and name of
20 0x08 Multi-axis Controller
62 0x90 D-pad Up
63 0x91 D-pad Down
64 0x92 D-pad Right
65 0x93 D-pad Left
107 0xB2 Anti-Torque Control
233 0x00 Reserved (no event indicated)
278 0x2D Keyboard - and (underscore)
[all …]

12345678910>>...19