| /freebsd/lib/libc/xdr/ |
| H A D | xdr.3 | 78 and their corresponding external representations.
97 the array elements' C form, and their external
110 and their external representations.
123 strings and their external representations.
143 and their external representations.
182 precision numbers and their external representations.
194 (actually integers) and their external representations.
206 and their external representations.
260 integers and their external representations.
298 and their external representations.
[all …]
|
| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | bib | 21 …ng creature that moveth, which the waters brought forth abundantly, after their kind, and every wi…
25 And God made the beast of the earth after his kind, and cattle after their kind, and every thing th…
108 Male and female created he them; and blessed them, and called their name Adam, in the day when they…
158 Of fowls after their kind, and of cattle after their kind, of every creeping thing of the earth aft…
174 They, and every beast after his kind, and all the cattle after their kind, and every creeping thing…
203 …ping thing, and every fowl, and whatsoever creepeth upon the earth, after their kinds, went forth …
229 …upon both their shoulders, and went backward, and covered the nakedness of their father; and their…
240 …ere the isles of the Gentiles divided in their lands; every one after his tongue, after their fami…
255 These are the sons of Ham, after their families, after their tongues, in their countries, and in th…
265 And their dwelling was from Mesha, as thou goest unto Sephar a mount of the east.
[all …]
|
| /freebsd/contrib/openbsm/bin/praudit/ |
| H A D | praudit.1 | 60 Do not convert user and group IDs to their names but leave in their
72 Prints the records in their raw, numeric form.
76 Prints the tokens in their short form.
86 in their long form.
87 Events are displayed as per their descriptions given in
89 UIDs and GIDs are expanded to their names;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/ |
| H A D | MsgPack.h | 34 /// For example, FixStr objects encode their size in the five least significant
35 /// bits of their first byte, which is identified by the bit pattern "101" in
46 /// For example, FixStr objects encode their size in the five least significant
47 /// bits of their first byte, which is identified by the bit pattern "101" in
59 /// For example, FixStr objects encode their size in the five least significant
60 /// bits of their first byte, so the largest encodable size is 0b00011111.
80 /// Negative FixNum objects encode their signed integer value in one byte, but
81 /// they must have the pattern "111" as their three most significant bits. This
|
| /freebsd/sys/dev/vmware/vmci/ |
| H A D | vmci_call_defs.h | 13 * All structs here are an integral size of their largest member, ie. a struct
62 * Struct size is 16 bytes. All fields in struct are aligned to their natural
83 * aligned to their natural alignment.
93 * bitmap. All fields in struct are aligned to their natural alignment.
103 * bitmap. All fields in struct are aligned to their natural alignment.
112 * in struct are aligned to their natural alignment.
121 * multiple of 8 bytes, and all fields are aligned to their natural alignment.
150 * be a multiple of 8 bytes, and fields must be aligned to their natural
182 * their natural alignment.
|
| /freebsd/sys/contrib/ck/src/ |
| H A D | ck_barrier_tournament.c | 36 * move on to the next round, while losers spin in their current rounds
37 * on their own flags. During the last round, the champion of the tournament
137 * CK_BARRIER_TOURNAMENT_LOSERs set the flags of their opponents and wait until in ck_barrier_tournament()
138 * their opponents release them after the tournament is over. in ck_barrier_tournament()
147 * CK_BARRIER_TOURNAMENT_WINNERs wait until their current opponent sets their flag; they then in ck_barrier_tournament()
172 * Winners inform their old opponents the tournament is over in ck_barrier_tournament()
173 * by setting their flags. in ck_barrier_tournament()
|
| /freebsd/crypto/libecc/src/fp/ |
| H A D | fp_montgomery.c | 23 * Inputs and outputs are in their Montgomery form.
34 * Inputs and outputs are in their Montgomery form.
45 * Inputs and outputs are in their Montgomery form.
56 * Inputs and outputs are in their Montgomery form.
68 * Inputs and outputs are in their Montgomery form.
|
| /freebsd/sys/dev/isci/scil/ |
| H A D | sci_overview.h | 77 of the SCI classes and their relationships.
138 that child object structures shall contain an instance of their parent's
139 structure as the very first member of their structure. As a result, parent
206 The following UML diagram graphically depicts the SCI base classes and their
222 because the user is now enabled to easily determine their pertinent information
223 inside of their SCI user callback methods.
233 being able to determine their data structures based on the SCI object handles.
241 - The user might set the scif_controller association to their adapter or
243 - The user might set the scif_domain association to their SCSI bus object.
|
| /freebsd/share/doc/psd/15.yacc/ |
| H A D | ss11 | 42 ability, in their endless search for ``one more feature''.
43 Their irritating unwillingness to learn how to
44 do things my way has usually led to my doing things their way;
48 and A. Snyder will recognize some of their ideas in the current version
|
| /freebsd/usr.bin/gprof/ |
| H A D | gprof.1 | 61 By convention these libraries have their name suffixed with
93 including the time of their call graph descendants.
95 and how their times are propagated to this function.
100 a listing of the members of the cycle and their contributions to the
314 their profiled children propagated to them, but they will appear
316 not have their time propagated further.
319 Any profiled children of signal catchers should have their times
|
| /freebsd/share/doc/papers/kernmalloc/ |
| H A D | kernmalloc.t | 216 unused parts of their address space can be paged out.
236 processes can allocate cheaply on their run-time stack.
244 cannot afford to use it as their primary memory allocator.
245 Instead they will build their own memory allocator on top of the
246 original by maintaining their own pool of memory blocks.
252 If they have their own free lists,
318 Unlike user processes that can only grow and shrink their heap at one end,
366 none of their strategies could be used without some modification.
464 Clients indicate their willingness (and ability) to wait with a flag
467 the allocator guarrentees that their request will succeed.
[all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/opp/ |
| H A D | opp-v2-base.yaml | 30 their DVFS state together, i.e. they share clock/voltage/current lines.
40 Their name isn't significant but their phandle can be used to reference an
55 to relate the values to their clocks or the order in which the clocks
71 relate the values to their power supplies or the order in which the supplies
98 values to their power supplies or the order in which the supplies need
113 values to their power supplies or the order in which the supplies need
|
| /freebsd/usr.bin/renice/ |
| H A D | renice.8 | 53 to have their scheduling priority altered.
57 their scheduling priority altered.
81 and can only monotonically increase their ``nice value''
124 Non super-users cannot increase scheduling priorities of their own processes,
|
| /freebsd/share/man/man9/ |
| H A D | sysctl_ctx_init.9 | 68 as well as their proper removal when needed.
115 together with all their allocated memory,
142 maintain their original positions in the tree.
150 but also frees their memory (provided that oid_refcnt == 0),
219 Note that both trees are removed, and their resources freed,
|
| /freebsd/contrib/tzcode/ |
| H A D | newctime.3 | 151 to their normal ranges.
173 but with their values forced to their normal ranges; the final value of
213 are like their unsuffixed counterparts, except that they accept an
228 are like their unsuffixed counterparts, except that they accept an
|
| /freebsd/share/doc/papers/relengr/ |
| H A D | 3.t | 88 change their parts of the distribution at will.
121 in their own software that will require change.
138 but also of determining their cause and developing a fix for the problem.
203 of their own alpha sites that are particularly interested
210 direct alpha sites, so their reports need to be filtered
249 make any revisions to their software.
272 out who made the change and what their explanation was
331 upcoming changes in preparation for merging them into their
|
| /freebsd/share/doc/papers/newvm/ |
| H A D | 0.t | 55 into their address spaces, to map device memory into their address
58 different) parts of their address space, or by arranging to share
67 coordinate their access to these shared structures. In System V,
|
| /freebsd/share/doc/papers/jail/ |
| H A D | paper.ms | 46 In Jail, users with privilege find that the scope of their requests
64 their need for strong application support, high network performance
85 However, these providers have a number of concerns on their plate, both in
86 terms of protecting the integrity and confidentiality of their own
87 files and services from their customers, as well as protecting the files
92 maintain their own software, and to manage their own services,
109 scope of their functionality, and effectiveness at what they provide \s-2[CHROOT]\s+2.
115 with processes outside their compartment is possible.
124 their partition.
|
| /freebsd/share/man/man7/ |
| H A D | tests.7 | 48 operating system behave correctly on their hardware platform and also to ensure
107 recursively, execute them, store their results and debugging data in Kyua's
114 It is possible to restrict which tests to run by providing their names in
150 Test suites are configured by defining their configuration
173 The tests will undo any changes in their cleanup phases.
|
| /freebsd/contrib/llvm-project/lld/docs/ |
| H A D | NewLLD.rst | 113 I'll give you the list of objects and their numbers LLD has to read and process
143 be understood as the interactions between them. Once you understand their
193 Chunks know about their size, how to copy their data to mmap'ed outputs,
204 InputSection knows about their size and how to copy themselves to
277 an executable or a DLL to a different address than their image
294 by not only their names but by their contents. If two read-only sections
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | FunctionComparator.h | 45 /// globals need to maintain their relative order. Globals are assigned a number
160 /// compared by their contents.
180 /// Floats (with same fltSemantics) are sorted according to their value.
183 /// The structures. Structures are grouped at the tail, again because of their
214 /// look at their particular properties (bit-width for vectors, and
216 /// If these properties are equal - compare their contents.
228 /// If left and right values are references to their functions, then
237 /// their functions. If right value was met first during scanning,
306 /// We can treat these types as equal whenever their IDs are same.
311 /// Then both Left and Right are to be expanded and their elemen
[all...] |
| /freebsd/sys/contrib/device-tree/Bindings/mfd/ |
| H A D | max77620.txt | 16 - #interrupt-cells: is <2> and their usage is compliant to the 2 cells
26 Optional subnodes and their properties:
64 and their child for FPS specific. The child node name for FPS are "fps0",
68 regulators, GPIOs and 32kHz clocks are provided in their respective
130 under their respective sub-system directories.
|
| /freebsd/lib/geom/virstor/ |
| H A D | gvirstor.8 | 270 happens during their execution.
277 components will always remain constant during their existence.
288 If such file systems attempt to spread their structures across the drive
291 their efforts will be effectively foiled by sequential allocation of
294 and all their structures will be physically allocated at the start
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | OutputSection.h | 28 // placed at the end of their segment.
52 // as-is so their file size is the same as their address space size.
83 // For output sections that don't have explicit ordering requirements, their
|
| /freebsd/share/doc/papers/diskperf/ |
| H A D | conclusions.ms | 96 disk tests on their UDA50/RA81.
98 of Emulex for making their machines available
101 arranged to make their equipment available for the tests.
103 Sam Leffler on their machines to refine our benchmarks.
|