Home
last modified time | relevance | path

Searched full:adjacent (Results 1 – 25 of 418) sorted by relevance

12345678910>>...17

/freebsd/usr.bin/uniq/
H A Duniq.152 comparing adjacent lines, and writes a copy of each unique input line to
63 The second and succeeding copies of identical adjacent input lines are
65 Repeated lines in the input will not be detected if they are not adjacent,
99 A field is a string of non-blank characters separated from adjacent fields
125 .\"characters separated from adjacent fields
159 are not adjacent:
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-unique.mk3 # Tests for the :u variable modifier, which discards adjacent duplicate
11 . warning The modifier ':u' must merge adjacent duplicate words.
31 . warning The modifier ':u' must merge _all_ adjacent duplicate words.
H A Dvarmod-to-upper.mk19 # not as a list of words. Therefore, the adjacent spaces are preserved.
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Davxvnniint16intrin.h26 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
63 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
99 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
137 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
174 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
211 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
247 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
285 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
322 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
359 /// Multiply groups of 2 adjacent pairs of unsigned 16-bit integers in \a __A with
[all …]
H A Davxvnniintrin.h46 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
69 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
92 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
113 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
134 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
157 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
180 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
201 /// Multiply groups of 2 adjacent pairs of signed 16-bit integers in \a __A with
H A Davxvnniint8intrin.h25 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
62 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
98 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
136 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
173 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
210 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
246 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
284 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in \a __A with
321 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
358 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in \a __A with
[all …]
H A Dtmmintrin.h182 /// Horizontally adds the adjacent pairs of values contained in 2 packed
205 /// Horizontally adds the adjacent pairs of values contained in 2 packed
228 /// Horizontally adds the adjacent pairs of values contained in 2 packed
251 /// Horizontally adds the adjacent pairs of values contained in 2 packed
274 /// Horizontally adds, with saturation, the adjacent pairs of values contained
300 /// Horizontally adds, with saturation, the adjacent pairs of values contained
326 /// Horizontally subtracts the adjacent pairs of values contained in 2
349 /// Horizontally subtracts the adjacent pairs of values contained in 2
372 /// Horizontally subtracts the adjacent pairs of values contained in 2
395 /// Horizontally subtracts the adjacent pairs of values contained in 2
[all …]
H A Damxintrin.h138 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in src0 with
157 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in src0 with
176 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in src0 with
195 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in src0 with
353 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in src0 with
376 /// Multiply groups of 4 adjacent pairs of signed 8-bit integers in src0 with
399 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in src0 with
422 /// Multiply groups of 4 adjacent pairs of unsigned 8-bit integers in src0 with
/freebsd/sys/contrib/device-tree/Bindings/interrupt-controller/
H A Dsocionext,synquacer-exiu.txt4 that forwards a block of 32 configurable input lines to 32 adjacent
15 - socionext,spi-base : The SPI number of the first SPI of the 32 adjacent
H A Dsocionext,synquacer-exiu.yaml14 that forwards a block of 32 configurable input lines to 32 adjacent
31 description: The SPI number of the first SPI of the 32 adjacent ones the
/freebsd/share/man/man9/
H A DVOP_GETPAGES.962 If other adjacent pages are backed by adjacent regions of the same file,
68 method does the converse; that is to say, it writes out adjacent dirty
/freebsd/lib/libc/string/
H A Dswab.333 .Nd swap adjacent bytes
49 swapping adjacent bytes.
/freebsd/sys/sys/
H A Dgpio.h154 * Simultaneously read and/or change up to 32 adjacent pins.
157 * This accesses an adjacent set of up to 32 pins starting at first_pin within
179 uint32_t first_pin; /* First pin in group of 32 adjacent */
188 * Simultaneously configure up to 32 adjacent pins. This is intended to change
/freebsd/contrib/llvm-project/libcxx/modules/std/
H A Dnumeric.cppm
/freebsd/sys/dev/gpio/
H A Dgpiobus_if.m110 # Simultaneously read and/or change up to 32 adjacent pins.
125 # Simultaneously configure up to 32 adjacent pins.
H A Dgpio_if.m178 # Simultaneously read and/or change up to 32 adjacent pins.
192 # Simultaneously configure up to 32 adjacent pins.
/freebsd/sys/dev/thunderbolt/
H A Drouter_var.h188 * len - The number of adjacent paths
203 * len - The number of adjacent paths
219 * num - The number of adjacent counter sets to read
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/MCTargetDesc/
H A DRISCVFixupKinds.h63 // instruction in a pair composed of adjacent auipc+jalr instructions.
66 // pair composed of adjacent auipc+jalr instructions.
/freebsd/usr.bin/nl/
H A Dnl.1169 specify the number of adjacent blank lines to be considered as one.
172 2 results in only the second adjacent blank line being numbered.
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h124 // Adjacent intervals that map to the same value are coalesced.
127 // in an interval, and if two intervals are adjacent so they can be coalesced.
153 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce.
155 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
178 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce.
179 static inline bool adjacent(const T &a, const T &b) { in adjacent() function
551 // The intervals are kept sorted and fully coalesced so there are no adjacent
560 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1))
641 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { in insertFrom()
644 if (i != Size && value(i) == y && Traits::adjacent( in insertFrom()
[all...]
H A DAddressRanges.h119 /// and adjacent([100,200), [200,300)) address ranges are combined during
163 /// parts([100,200), [200,300)). Adjacent([100,200), [200,300)) address
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp8 // Replace sequences of "narrow" stores to adjacent memory locations with
282 // Check if store instructions S1 and S2 are adjacent. More precisely,
299 /// Given a sequence of adjacent stores, and a maximum size of a single wide
348 // Be greedy: keep accumulating stores as long as they are to adjacent in selectStores()
355 // Stores are sorted, so if S1 and S2 are not adjacent, there won't be in selectStores()
/freebsd/stand/kboot/kboot/arch/powerpc64/
H A Dload_addr.c135 /* Join overlapping/adjacent regions */ in kboot_get_phys_load_segment()
140 /* We have overlapping/adjacent regions! */ in kboot_get_phys_load_segment()
/freebsd/contrib/llvm-project/llvm/lib/Frontend/OpenMP/
H A DOMP.cpp37 // immediately following leaf construct, find the first sequence of adjacent in getFirstCompositeRange()
40 // If such a sequence of adjacent loop-associated directives does not exist, in getFirstCompositeRange()
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DRandstruct.cpp75 // The current bucket containing the run of adjacent bitfields to ensure they in randomizeStructureLayoutImpl()
76 // remain adjacent. in randomizeStructureLayoutImpl()

12345678910>>...17