| /freebsd/crypto/openssl/doc/designs/ddd/ |
| H A D | REPORT.md | 5 requirement to develop a QUIC API that required only minimal changes to existing
12 diffs were the expected changes which would be needed to the baseline demos to
14 able to support QUIC. This analysis concluded that the changes needed to
22 This document discusses the planned changes and the actual changes for each demo
26 unplanned changes have been folded into the original baseline demo files guarded
29 QUIC. (The originally planned changes, and the final changes, are added in
30 separate, clearly-labelled commits; to view the originally planned changes only,
39 ### Originally planned changes
49 ### Actual changes
51 The following additional changes needed to be made:
[all …]
|
| /freebsd/crypto/heimdal/ |
| H A D | NEWS | 93 API changes
173 Changes in release 1.1
187 Changes in release 1.0.2
193 Changes in release 1.0.1
209 Changes in release 1.0
231 Changes in release 0.8.1
244 Changes in release 0.8
284 Changes in release 0.7.2
306 Changes in release 0.7.1
310 Changes in release 0.7
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Format/ |
| H A D | WhitespaceManager.cpp | 60 Changes.push_back(Change(Tok, /*CreateReplacement=*/true, Tok.WhitespaceRange, in replaceWhitespace()
70 Changes.push_back(Change(Tok, /*CreateReplacement=*/false, in addUntouchableToken()
95 Changes.push_back( in replaceWhitespaceInToken()
104 if (Changes.empty()) in generateReplacements()
107 llvm::sort(Changes, Change::IsBeforeInFile(SourceMgr)); in generateReplacements()
130 Changes[0].PreviousEndOfTokenColumn = 0; in calculateLineBreakInformation()
131 Change *LastOutsideTokenChange = &Changes[0]; in calculateLineBreakInformation()
132 for (unsigned I = 1, e = Changes.size(); I != e; ++I) { in calculateLineBreakInformation()
133 auto &C = Changes[I]; in calculateLineBreakInformation()
134 auto &P = Changes[I - 1]; in calculateLineBreakInformation()
[all …]
|
| H A D | WhitespaceManager.h | 90 /// Functor to sort changes in original source order.
122 // Changes might be in the middle of a token, so we cannot just keep the
215 /// \brief Align consecutive C/C++ preprocessor macros over all \c Changes.
218 /// Align consecutive assignments over all \c Changes.
221 /// Align consecutive bitfields over all \c Changes.
229 /// Align consecutive declarations over all \c Changes.
232 /// Align consecutive declarations over all \c Changes.
235 /// Align consecutive short case statements over all \c Changes.
238 /// Align consecutive TableGen DAGArg colon over all \c Changes.
241 /// Align consecutive TableGen cond operator colon over all \c Changes.
[all …]
|
| /freebsd/contrib/tzdata/ |
| H A D | NEWS | 8 Changes to future timestamps
16 Changes to past timestamps
21 Changes to code
35 Changes to future timestamps
43 Changes to past timestamps
53 Changes to data
58 Changes to code
96 Changes to documentation
117 Changes to past timestamps
137 changes affect a few transitions in 1917-1921, 1924, and 1940
[all …]
|
| H A D | CONTRIBUTING | 15 ## Contributing technical changes
17 To email small changes, please run a POSIX shell command like
21 For more-elaborate or possibly controversial changes,
28 Changes should contain commentary citing reliable sources.
31 For changes that fix sensitive security-related bugs, please see the
34 Please submit changes against either the latest release
52 * Switch to a new branch for the changes. Choose a different
64 changes by citing reliable sources.
66 * Debug the changes locally, e.g.:
|
| /freebsd/contrib/tzcode/ |
| H A D | NEWS | 8 Changes to future timestamps
16 Changes to past timestamps
21 Changes to code
35 Changes to future timestamps
43 Changes to past timestamps
53 Changes to data
58 Changes to code
96 Changes to documentation
117 Changes to past timestamps
137 changes affect a few transitions in 1917-1921, 1924, and 1940
[all …]
|
| /freebsd/contrib/diff/ |
| H A D | AUTHORS | 33 Assigns changes to diff.
36 Assigns changes to diff.
42 Assigns changes to GNU Diff.
45 Assigns changes to diff (for -D).
48 Disclaims changes by Thomas May to diff.
51 Disclaims changes to diff.
54 Disclaims changes by Wayne Davison to diff.
57 Disclaims changes to diff.
61 Disclaims changes to GNU Diff.
65 Disclaims changes to GNU Diff by Paul Eggert.
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 116 void UpdatedSearchState(const changeset_ty &Changes, in UpdatedSearchState() argument
119 DDA.UpdatedSearchState(Changes, Sets, Required); in UpdatedSearchState()
137 DAGDeltaAlgorithmImpl(DAGDeltaAlgorithm &DDA, const changeset_ty &Changes,
142 /// GetTestResult - Get the test result for the active set \p Changes with
143 /// \p Required changes from the cache, executing the test if necessary.
145 /// \param Changes - The set of active changes being minimized, which should
147 /// \param Required - The set of changes which have previously been
150 bool GetTestResult(const changeset_ty &Changes, const changeset_ty &Required);
153 /// Helper object for minimizing an active set of changes.
160 /// UpdatedSearchState - Callback used when the search state changes.
[all …]
|
| H A D | DeltaAlgorithm.cpp | 16 bool DeltaAlgorithm::GetTestResult(const changeset_ty &Changes) { in GetTestResult() argument
17 if (FailedTestsCache.count(Changes)) in GetTestResult()
20 bool Result = ExecuteOneTest(Changes); in GetTestResult()
22 FailedTestsCache.insert(Changes); in GetTestResult()
43 DeltaAlgorithm::Delta(const changeset_ty &Changes, in Delta() argument
45 // Invariant: union(Res) == Changes in Delta()
46 UpdatedSearchState(Changes, Sets); in Delta()
50 return Changes; in Delta()
54 if (Search(Changes, Sets, Res)) in Delta()
62 return Changes; in Delta()
[all …]
|
| /freebsd/contrib/lyaml/ |
| H A D | NEWS.md | 1 # lyaml NEWS - User visible changes
3 ## Noteworthy changes in release 6.2.8 (2022-10-22) [stable]
14 ## Noteworthy changes in release 6.2.7 (2020-11-27) [stable]
21 ## Noteworthy changes in release 6.2.6 (2020-08-28) [stable]
29 ## Noteworthy changes in release 6.2.5 (2020-04-15) [stable]
38 ## Noteworthy changes in release 6.2.4 (2019-07-20) [stable]
46 ## Noteworthy changes in release 6.2.3 (2018-09-16) [stable]
53 ## Noteworthy changes in release 6.2.2 (2018-03-28) [stable]
61 ## Noteworthy changes in release 6.2.1 (2018-02-20) [stable]
71 ## Noteworthy changes in release 6.2 (2017-11-26) [stable]
[all …]
|
| /freebsd/contrib/diff/src/ |
| H A D | ed.c | 43 enum changes changes; in print_ed_hunk() local
50 changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1); in print_ed_hunk()
51 if (!changes) in print_ed_hunk()
58 fprintf (outfile, "%c\n", change_letter[changes]); in print_ed_hunk()
61 if (changes != OLD) in print_ed_hunk()
83 but print the changes in the order they appear in the input files,
98 enum changes changes = analyze_hunk (hunk, &f0, &l0, &f1, &l1); in pr_forward_ed_hunk() local
99 if (!changes) in pr_forward_ed_hunk()
104 fprintf (outfile, "%c", change_letter[changes]); in pr_forward_ed_hunk()
110 if (changes == OLD) in pr_forward_ed_hunk()
[all …]
|
| H A D | normal.c | 38 describing changes in consecutive lines. */
47 enum changes changes = analyze_hunk (hunk, &first0, &last0, &first1, &last1); in print_normal_hunk() local
48 if (!changes) in print_normal_hunk()
55 fprintf (outfile, "%c", change_letter[changes]); in print_normal_hunk()
60 if (changes & OLD) in print_normal_hunk()
64 if (changes == CHANGED) in print_normal_hunk()
68 if (changes & NEW) in print_normal_hunk()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DeltaAlgorithm.h | 28 /// (2) If the predicate returns true for a set of changes, it should return
47 /// GetTestResult - Get the test result for the \p Changes from the
50 /// \param Changes - The change set to test.
52 bool GetTestResult(const changeset_ty &Changes);
54 /// Split - Partition a set of changes \p S into one or two subsets.
57 /// Delta - Minimize a set of \p Changes which has been partitioned into
59 changeset_ty Delta(const changeset_ty &Changes,
63 /// removed from \p Changes while still satisfying the predicate.
65 /// \param Res - On success, a subset of Changes which satisfies the
68 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets,
[all …]
|
| H A D | DAGDeltaAlgorithm.h | 26 /// The DAG should be used to represent dependencies in the changes which are
33 /// eagerly prune large subsets of changes. As with \see DeltaAlgorithm, the DAG
52 /// Run - Minimize the DAG formed by the \p Changes vertices and the
54 /// changes and returning the smallest set which still satisfies the test
57 /// \param Changes The list of changes.
59 /// \param Dependencies The list of dependencies amongst changes. For each
60 /// (x,y) in \p Dependencies, both x and y must be in \p Changes. The
64 changeset_ty Run(const changeset_ty &Changes,
67 /// UpdatedSearchState - Callback used when the search state changes.
68 virtual void UpdatedSearchState(const changeset_ty &Changes, in UpdatedSearchState() argument
|
| /freebsd/crypto/openssl/ |
| H A D | NEWS.md | 4 This file gives a brief overview of the major changes between each OpenSSL
5 release. For more details please read the CHANGES file.
26 ### Major changes between OpenSSL 3.5.3 and OpenSSL 3.5.4 [30 Sep 2025]
46 ### Major changes between OpenSSL 3.5.2 and OpenSSL 3.5.3 [16 Sep 2025]
59 ### Major changes between OpenSSL 3.5.1 and OpenSSL 3.5.2 [5 Aug 2025]
67 ### Major changes between OpenSSL 3.5.0 and OpenSSL 3.5.1 [1 Jul 2025]
77 ### Major changes between OpenSSL 3.4 and OpenSSL 3.5.0 [8 Apr 2025]
83 changes:
132 ### Major changes between OpenSSL 3.4.0 and OpenSSL 3.4.1 [11 Feb 2025]
145 ### Major changes between OpenSSL 3.3 and OpenSSL 3.4.0 [22 Oct 2024]
[all …]
|
| /freebsd/contrib/ntp/sntp/libevent/ |
| H A D | kqueue.c | 78 struct kevent *changes; member
141 kqueueop->changes = mm_calloc(NEVENT, sizeof(struct kevent)); in kq_init()
142 if (kqueueop->changes == NULL) in kq_init()
150 memset(&kqueueop->changes[0], 0, sizeof kqueueop->changes[0]); in kq_init()
151 kqueueop->changes[0].ident = -1; in kq_init()
152 kqueueop->changes[0].filter = EVFILT_READ; in kq_init()
153 kqueueop->changes[0].flags = EV_ADD; in kq_init()
160 kqueueop->changes, 1, kqueueop->events, NEVENT, NULL) != 1 || in kq_init()
212 struct event_change *in_ch = &changelist->changes[ in kq_build_changes_list()
271 struct kevent *changes; kq_dispatch() local
[all...] |
| /freebsd/contrib/libevent/ |
| H A D | kqueue.c | 78 struct kevent *changes; member
141 kqueueop->changes = mm_calloc(NEVENT, sizeof(struct kevent)); in kq_init()
142 if (kqueueop->changes == NULL) in kq_init()
150 memset(&kqueueop->changes[0], 0, sizeof kqueueop->changes[0]); in kq_init()
151 kqueueop->changes[0].ident = -1; in kq_init()
152 kqueueop->changes[0].filter = EVFILT_READ; in kq_init()
153 kqueueop->changes[0].flags = EV_ADD; in kq_init()
160 kqueueop->changes, 1, kqueueop->events, NEVENT, NULL) != 1 || in kq_init()
212 struct event_change *in_ch = &changelist->changes[i]; in kq_build_changes_list()
226 newchanges = mm_realloc(kqop->changes, in kq_build_changes_list()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/ |
| H A D | Tracker.h | 9 // This file is the component of SandboxIR that tracks all changes made to its
12 // Tracking changes
14 // The user needs to call `Tracker::save()` to enable tracking changes
20 // the `Tracker::Changes` vector. All of this is done transparently to
23 // Reverting changes
27 // change objects in `Tracker::Changes` in reverse order, calling their
30 // Accepting changes
32 // The user needs to either revert or accept changes before the tracker object
35 // through the change objects in `Tracker::Changes` in order, calling
66 /// This runs when changes get reverted.
[all …]
|
| /freebsd/usr.sbin/ppp/ |
| H A D | slcompress.c | 166 register u_int changes = 0; in sl_compress_tcp() local
283 * changes in the order: urgent, window, ack, seq (the order minimizes the in sl_compress_tcp()
289 changes |= NEW_U; in sl_compress_tcp()
302 changes |= NEW_W; in sl_compress_tcp()
310 changes |= NEW_A; in sl_compress_tcp()
318 changes |= NEW_S; in sl_compress_tcp()
320 switch (changes) { in sl_compress_tcp()
341 * actual changes match one of our special case encodings -- send packet in sl_compress_tcp()
350 changes = SPECIAL_I; in sl_compress_tcp()
358 changes = SPECIAL_D; in sl_compress_tcp()
[all …]
|
| /freebsd/sys/net/ |
| H A D | slcompress.c | 159 u_int changes = 0; in sl_compress_tcp() local
270 * receiver expects changes in the order: urgent, window, in sl_compress_tcp()
277 changes |= NEW_U; in sl_compress_tcp()
288 changes |= NEW_W; in sl_compress_tcp()
296 changes |= NEW_A; in sl_compress_tcp()
304 changes |= NEW_S; in sl_compress_tcp()
307 switch(changes) { in sl_compress_tcp()
326 * actual changes match one of our special case encodings -- in sl_compress_tcp()
335 changes = SPECIAL_I; in sl_compress_tcp()
343 changes = SPECIAL_D; in sl_compress_tcp()
[all …]
|
| /freebsd/share/doc/papers/relengr/ |
| H A D | 3.t | 147 Further changes are requested in a change log rather than
154 changes to the distribution are no longer made by people outside
222 to concentrate on tracking the changes being made to the system
230 they accurately reflect any changes to the programs that
260 begins a careful review of all the changes to the
267 All the changes are checked to ensure that they are reasonable,
269 The process often turns up questionable changes.
283 the changes were removed from the source before final distribution.
286 changes to the system.
292 changes to every user-level command
[all …]
|
| /freebsd/ |
| H A D | CONTRIBUTING.md | 19 changes where the contributor already has a GitHub account.
31 that are security-related, problem reports, works in progress, changes that are controversial
32 and need discussion, or changes that require specialized review.
36 * The request is substantive in nature. We generally don't accept minor or cosmetic changes unless …
40 * It touches fewer than about 10 files and the changes are less than about 200 lines. Changes large…
43 * The scope of the pull request should not change during review. If the review suggests changes tha…
51 …deally, you'd also create a test case that shows an actual bug that's being fixed by these changes.
59 More complex changes may be submitted as pull requests, but they may be closed
77 their own consistent style that deviates from style(9). Style changes take time
79 their time. Trivial spelling changes take this valuable time, but rerturn little
[all …]
|
| /freebsd/contrib/ntp/ |
| H A D | README.patches | 11 > (make and test your changes to ntp-stable first)
12 > (commit your changes to ntp-stable)
14 > bk pull ../ntp-stable (get your changes from ntp-stable)
15 > (resolve any problems and test your changes)
16 > (commit your changes to ntp-dev)
18 With the current release of bitkeeper it is *much* easier to move changes
19 from ntp-stable to ntp-dev than it is to move changes from ntp-dev to
22 If you make your changes in the above order and then submit them,
|
| /freebsd/contrib/pf/libevent/ |
| H A D | kqueue.c | 65 struct kevent *changes; member
114 kqueueop->changes = malloc(NEVENT * sizeof(struct kevent)); in kq_init()
115 if (kqueueop->changes == NULL) { in kq_init()
121 free (kqueueop->changes); in kq_init()
128 kqueueop->changes[0].ident = -1; in kq_init()
129 kqueueop->changes[0].filter = EVFILT_READ; in kq_init()
130 kqueueop->changes[0].flags = EV_ADD; in kq_init()
137 kqueueop->changes, 1, kqueueop->events, NEVENT, NULL) != 1 || in kq_init()
141 free(kqueueop->changes); in kq_init()
168 newchange = realloc(kqop->changes, in kq_insert()
[all …]
|