| /src/lib/libskey/ |
| skeysubr.c | 111 u_int32_t results[4]; local in function:keycrunch_md4
119 MD4Final((unsigned char *) (void *) results, &md);
123 results[0] ^= results[2];
124 results[1] ^= results[3];
126 (void)memcpy(result, results, SKEY_BINKEY_SIZE);
137 u_int32_t results[4]; local in function:keycrunch_md5
146 MD5Final((unsigned char *) (void *)results, &md);
150 results[0] ^= results[2]
236 u_int32_t results[4]; local in function:f_md4
252 u_int32_t results[4]; local in function:f_md5
[all...] |
| /src/common/lib/libc/gen/ |
| radixtree.c | 807 void **results, const unsigned int maxresults, const unsigned int tagmask,
858 results[nfound] = entry_ptr(*vpp);
922 * results should be an array large enough to hold maxresults pointers.
942 * In the case of dense == true, a node returned via results[N] is always for
948 void **results, unsigned int maxresults, bool dense)
953 return gang_lookup_scan(t, &path, results, maxresults, 0, false, dense);
965 void **results, unsigned int maxresults, bool dense)
970 return gang_lookup_scan(t, &path, results, maxresults, 0, true, dense);
984 void **results, unsigned int maxresults, bool dense, unsigned int tagmask)
990 return gang_lookup_scan(t, &path, results, maxresults, tagmask, false
1191 void *results[3]; local in function:test1
1576 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
1598 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
1623 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
1646 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
1677 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
1709 struct testnode *results[TEST2_GANG_LOOKUP_NODES]; local in function:test2
[all...] |
| /src/sys/lib/libunwind/ |
| DwarfParser.hpp | 286 pint_t upToPC, PrologInfo *results,
288 // Clear results.
289 memset(results, 0, sizeof(*results));
295 (pint_t)(-1), rememberStack, results, ctx))
299 upToPC - fdeInfo.pcStart, rememberStack, results,
310 PrologInfo *results, unw_proc_info_t *ctx) {
313 PrologInfo initialState = *results;
350 results->savedRegisters[reg].location = kRegisterInCFA;
351 results->savedRegisters[reg].value = offset
[all...] |
| /src/tests/lib/libc/membar/ |
| t_seqlock.c | 64 uint64_t results[2]; variable in typeref:typename:uint64_t[2]
134 results[result]++;
178 ATF_REQUIRE(results[0] != 0);
179 ATF_REQUIRE_MSG(results[1] == 0,
181 results[0], results[1]);
|
| /src/usr.bin/make/unit-tests/ |
| depsrc-meta.mk | 20 check-results:
27 @${MAKE} -r -f ${MAKEFILE} check-results
30 @${MAKE} -r -f ${MAKEFILE} check-results -j1
|
| deptgt-begin-fail.mk | 3 # Test for a .BEGIN target whose command results in an error.
|
| deptgt-begin-fail-indirect.mk | 3 # Test for a .BEGIN target whose dependency results in an error.
|
| varname-dot-make-jobs.mk | 19 # These results will not be static, we need NCPU
20 # to compute expected results.
|
| varname-make_print_var_on_error.mk | 15 # does not expand the node-local variables like .TARGET. This results in the
|
| varname-make_print_var_on_error-jobs.mk | 17 # does not expand the node-local variables like .TARGET. This results in the
|
| /src/games/boggle/boggle/ |
| extern.h | 56 void results(void);
|
| /src/share/doc/papers/diskperf/ |
| Makefile | 6 SRCS= abs.ms motivation.ms equip.ms methodology.ms tests.ms results.ms \
|
| /src/sys/ufs/lfs/ |
| ulfs_lookup.c | 154 struct ulfs_lookup_results *results; local in function:ulfs_lookup
194 * Produce the auxiliary lookup results into i_crap. Increment
196 * stale results. This should not be done this way. XXX.
198 results = &dp->i_crap;
265 &results->ulr_offset, &bp, nameiop == DELETE ? &prevoff : NULL)) {
268 (results->ulr_offset & bmask));
271 results->ulr_offset = roundup(dp->i_size, dirblksiz);
280 if (nameiop != LOOKUP || results->ulr_diroff == 0 ||
281 results->ulr_diroff >= dp->i_size) {
283 results->ulr_offset = 0
[all...] |
| /src/tests/modules/x86_pte_tester/ |
| x86_pte_tester.c | 66 } results; member in struct:__anon91e1af1f0108
212 tester_ctx.results.n_rwx += (NBPD_L4 / PAGE_SIZE);
214 tester_ctx.results.n_rwx += (NBPD_L3 / PAGE_SIZE);
216 tester_ctx.results.n_rwx += (NBPD_L2 / PAGE_SIZE);
218 tester_ctx.results.n_rwx += (NBPD_L1 / PAGE_SIZE);
237 tester_ctx.results.n_shstk += (NBPD_L4 / PAGE_SIZE);
239 tester_ctx.results.n_shstk += (NBPD_L3 / PAGE_SIZE);
241 tester_ctx.results.n_shstk += (NBPD_L2 / PAGE_SIZE);
243 tester_ctx.results.n_shstk += (NBPD_L1 / PAGE_SIZE);
269 tester_ctx.results.kernel_map_with_low_ptes |= true
[all...] |
| /src/tests/bin/sh/ |
| t_varval.sh | 125 rm -f results || :
127 atf_check -s exit:0 -o save:results -e empty ${TEST_SH} ||
128 atf_fail 'making results'
129 test -z $( grep -v "^13$" results ) ||
130 atf_fail "Incorrect lengths: $(grep -nv '^13$' results)"
143 rm -f results || :
145 atf_check -s exit:0 -o save:results -e empty ${TEST_SH} ||
146 atf_fail 'making results'
149 test $( wc -l < results ) -eq 256 ||
150 atf_fail "incorrect line count in results"
[all...] |
| t_here.sh | 109 results() function
172 results
266 results
298 results
335 results
384 results
448 results
515 results
|
| t_expand.sh | 658 results() function
732 results
789 results
960 results # results so far anyway...
1045 results
1058 # Note that the expected results for these tests are identical
1097 results
1131 results # FIXED: 'PR bin/52090 expect 7 of 14 subtests to fail'
1144 # Note that the expected results for these tests are identica
[all...] |
| /src/sys/ufs/ext2fs/ |
| ext2fs_lookup.c | 307 struct ufs_lookup_results *results; local in function:ext2fs_lookup
342 * Produce the auxiliary lookup results into i_crap. Increment
344 * stale results. This should not be done this way. XXX.
346 results = &dp->i_crap;
375 if (nameiop != LOOKUP || results->ulr_diroff == 0 ||
376 results->ulr_diroff >= ext2fs_size(dp)) {
378 results->ulr_offset = 0;
381 results->ulr_offset = results->ulr_diroff;
382 if ((entryoffsetinblock = results->ulr_offset & bmask) &
[all...] |
| /src/sys/ufs/ufs/ |
| ufs_lookup.c | 111 calc_count(struct ufs_lookup_results *results, int dirblksiz, doff_t prevoff)
113 if ((results->ulr_offset & (dirblksiz - 1)) == 0)
114 results->ulr_count = 0;
116 results->ulr_count = results->ulr_offset - prevoff;
148 struct ufs_lookup_results *results)
151 slot->offset = results->ulr_offset;
153 results->ulr_reclen = slot->size;
176 * If we didn't find a slot, then set results->ulr_count to 0 indicating
178 * then the new entry can be put in the range from results->ulr_offset t
353 struct ufs_lookup_results *results; local in function:ufs_lookup
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| selftest_workarounds.c | 195 print_results(const struct intel_engine_cs *engine, const u32 *results)
201 u32 actual = results[i];
211 struct drm_i915_gem_object *results; local in function:check_whitelist
217 results = read_nonprivs(ctx, engine);
218 if (IS_ERR(results))
219 return PTR_ERR(results);
222 i915_gem_object_lock(results);
224 err = i915_gem_object_set_to_cpu_domain(results, false);
225 i915_gem_object_unlock(results);
231 vaddr = i915_gem_object_pin_map(results, I915_MAP_WB)
481 u32 *cs, *results; local in function:check_dirty_whitelist
[all...] |
| /src/sys/dev/raidframe/ |
| rf_evenodd_dagfuncs.c | 72 rf_RegularESubroutine(node, node->results[1]);
130 if (node->params[i + 1].p != node->results[0]) { /* results[0] is buf ptr
136 destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset);
225 rf_RegularESubroutine(node, node->results[0]);
280 rf_DegrESubroutine(node, node->results[1]);
401 memset(node->results[0], 0,
406 if (node->params[i + 1].p != node->results[0]) {
415 destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset - failedSUOffset);
431 rf_DegrESubroutine(node, node->results[0])
[all...] |
| rf_dag.h | 54 struct RF_PropHeader_s { /* structure for propagation of results */
56 RF_PropHeader_t *next; /* linked list for multiple results/params */
98 int numResults; /* number of results produced by *funcPtr */
114 void **results; /* array of results produced by *funcPtr */ member in struct:RF_DagNode_s
121 RF_DagNode_t *next; /* next in terms of propagating results */
|
| rf_dagfuncs.c | 424 if (node->params[i + 1].p != node->results[0]) {
426 (char *) node->params[i + 1].p, (char *) node->results[0]);
455 if (node->params[i + 1].p != node->results[0]) {
456 retcode = rf_bxor((char *) node->params[i + 1].p, (char *) node->results[0],
496 if (node->params[i + 1].p != node->results[0]) {
500 destbuf = ((char *) node->results[0]) + rf_RaidAddressToByte(raidPtr, suoffset - failedSUOffset);
|
| /src/tools/make/ |
| configure.ac | 60 dnl Display results
62 AC_MSG_NOTICE([========== configure results for make ===========])
|
| /src/tests/usr.bin/realpath/ |
| t_realpath.sh | 30 # Test data and expected results
204 results=$3
213 EXP=${results%%$'\n'*}
216 results=${results#"${EXP}"}; results=${results#$'\n'}
218 test -z "${EXP}" && atf_fail "Too few results (test botch)"
262 if test -n "${results}"
266 N=$(( $(printf '%s\n' "${results}" | wc -l) )
[all...] |
