Searched refs:pointers (Results 1 - 18 of 18) sorted by relevance

/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dsort.c44 /* POINTERS and WORK are both arrays of N pointers. When this
47 void sort_pointers (size_t n, void **pointers, void **work) argument
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp)
127 pointerp = pointers;
150 void **pointers; local
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dsort.c44 /* POINTERS and WORK are both arrays of N pointers. When this
47 void sort_pointers (size_t n, void **pointers, void **work) argument
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp)
127 pointerp = pointers;
150 void **pointers; local
[all...]
/freebsd-11-stable/sys/contrib/ck/include/
H A Dck_hp.h66 void **pointers; member in struct:ck_hp_record
81 ck_pr_store_ptr(&record->pointers[i], pointer);
90 ck_pr_fas_ptr(&record->pointers[i], pointer);
92 ck_pr_store_ptr(&record->pointers[i], pointer);
102 void **pointers = record->pointers; local
106 *pointers++ = NULL;
/freebsd-11-stable/sys/contrib/ck/src/
H A Dck_hp.c43 * This is an implementation of hazard pointers as detailed in:
47 * hazard pointers until it is safe to do so. Preventing arbitrary re-use
136 void **pointers)
141 entry->pointers = pointers;
145 memset(pointers, 0, state->degree * sizeof(void *));
176 if (ck_pr_load_ptr(&record->pointers) == NULL)
180 hazard = ck_pr_load_ptr(&record->pointers[i]);
203 if (ck_pr_load_ptr(&record->pointers) == NULL)
210 pointer = ck_pr_load_ptr(&record->pointers[
134 ck_hp_register(struct ck_hp *state, struct ck_hp_record *entry, void **pointers) argument
[all...]
/freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/decls/
H A DMakefile22 tst.pointers.d \
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-structalias.h39 /* Array of SSA_NAME pointers processed by the points-to collector. */
47 /* POINTERS contains all the _DECL pointers with unique memory tags
49 struct alias_map_d **pointers; member in struct:alias_info
59 all the aliases of all the pointers found in the program. */
71 /* Memory tag for all the PTR_IS_REF_ALL pointers. */
H A Dtree-ssa-alias.c560 conversions between pointers and integers.
575 pointed-to data type of the pointers in the program. These tags are
583 In this phase, we go through all the pointers we found in points-to
668 /* Collect all pointers and addressable variables, compute alias sets,
669 create memory tags for pointers and promote variables whose address is
697 /* If the program contains ref-all pointers, finalize may-alias information
813 pointers inside INDIRECT_REFs, so an expression like
982 free (ai->pointers[i]);
983 free (ai->pointers);
1011 /* Create name tags for all the pointers tha
[all...]
/freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/
H A DMakefile44 pointers \
/freebsd-11-stable/contrib/ntp/sntp/libopts/
H A Dtokenize.c142 * high and we'll squander the space for a few extra pointers.
195 * An array of @code{tkn_ct + 1} pointers to substring tokens, with
/freebsd-11-stable/contrib/gdb/gdb/
H A Dgdbarch.sh438 # whole scheme for dealing with "frames" and "frame pointers" needs a
1334 printf " /* per-architecture data-pointers */\n"
1406 /*per-architecture data-pointers and swap regions */
1807 /* Keep a registry of per-architecture data-pointers required by GDB
/freebsd-11-stable/contrib/gcclibs/libmudflap/
H A Dmf-runtime.c1069 /* Remove any low/high pointers for this object from the lookup cache. */
1496 max_objs of their pointers in objs[]. Return total count of
1596 max_objs of their pointers in objs[]. Return total count of
1934 char **pointers; local
1937 pointers = (char **) buffer;
1941 pointers[i] = chars;
1945 *symbols = pointers;
2466 pointers into an array, then cleverly re-linking them. */
/freebsd-11-stable/contrib/llvm-project/libunwind/src/
H A DUnwindRegistersRestore.S71 # pointers and temporaries as on unix even though win64 normally
/freebsd-11-stable/targets/pseudo/tests/
H A DMakefile.depend77 cddl/usr.sbin/dtrace/tests/common/pointers \
/freebsd-11-stable/share/mk/
H A Dsrc.opts.mk317 # endian systems generically (they jump to null pointers or try to read
/freebsd-11-stable/contrib/dtc/Documentation/
H A Ddtc-paper.tex138 its internals. In practice that means we must not use pointers
/freebsd-11-stable/contrib/opie/
H A Dconfigure1922 echo $ac_n "checking to see if your compiler can handle void pointers""... $ac_c" 1>&6
1923 echo "configure:1924: checking to see if your compiler can handle void pointers" >&5
/freebsd-11-stable/crypto/openssl/crypto/bn/asm/
H A Dsparcv9a-mont.pl73 # exclusively for pointers, indexes and other small values...
165 add $rp,$num,$rp ! readjust input pointers to point
/freebsd-11-stable/contrib/amd/doc/
H A Dtexinfo.tex7180 % has such constructs (when documenting function pointers).

Completed in 347 milliseconds