Home
last modified time | relevance | path

Searched refs:pointers (Results 1 – 25 of 531) sorted by relevance

12345678910>>...22

/openbsd-src/gnu/lib/libiberty/src/
H A Dsort.c47 void sort_pointers (size_t n, void **pointers, void **work) in sort_pointers() argument
105 bias = ((digit_t *) pointers) + j; in sort_pointers()
106 top = ((digit_t *) (pointers + n)) + j; in sort_pointers()
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp) in sort_pointers()
127 pointerp = pointers; in sort_pointers()
128 pointers = work; in sort_pointers()
150 void **pointers; in main() local
158 pointers = XNEWVEC (void*, k); in main()
163 pointers[i] = (void *) random (); in main()
164 printf ("%x\n", pointers[i]); in main()
[all …]
/openbsd-src/gnu/llvm/llvm/docs/
H A DOpaquePointers.rst11 types, there is a desire to remove pointee types from pointers.
33 Address spaces are still used to distinguish between different kinds of pointers
34 where the distinction is relevant for lowering (e.g. data vs function pointers
35 have different sizes on some architectures). Opaque pointers are not changing
37 `DataLayout <LangRef.html#langref-datalayout>`_. Opaque pointers in non-default
46 LLVM IR pointers can be cast back and forth between pointers with different
83 deal with bitcasts. When looking up through def-use chains for pointers it's
93 bitcast pointers, losing address space information.
107 mode all pointer types have a pointee type and opaque pointers cannot be used.
108 In opaque pointers mode (the default), all pointers are opaque. The opaque
[all …]
H A DStatepoints.rst43 results ("derived pointers") which point outside of the allocation or
46 allocation, but such "exterior derived pointers" may be visible to the
69 #. A safepoint is a location at which pointers visible to the compiled
96 ensure that all pointers can be read and updated if desired.
121 non-integral pointers which has not been addressed upstream. To work around
147 #. recording a mapping of live pointers (and the allocation they're
153 its result, and returns updated values for any live pointers to
156 Note that the task of identifying all live pointers to garbage
227 needs to update any of these pointers during the call, it knows
316 "Interior derived pointers" remain within the bounds of the allocation
[all …]
H A DLexicon.rst86 .. _derived pointers:
93 derived pointers pose an additional hazard that they may be invalidated at
225 .. _object pointers:
251 the pointers to point to the new value. See
285 `derived pointers`_ must not be retained across safe points and `object
286 pointers`_ must be reloaded from stack roots.
H A DAliasAnalysis.rst12 determine whether or not two pointers ever can point to the same object in
18 indicating that two pointers always point to the same object, might point to the
122 *based* the other. The most obvious example is when the two pointers point to
123 non-overlapping memory ranges. Another is when the two pointers are only ever
131 The ``MayAlias`` response is used whenever the two pointers might refer to the
140 response does not imply that the pointers compare equal.
334 use pointers). Typically alias analyses keep data structures that have entries
459 track of whether or not all of the pointers in the set are Must aliases. The
461 instructions, and can provide a list of pointers in each set.
478 structure is a hash table mapping pointers to the AliasSet they are in.
[all …]
/openbsd-src/gnu/llvm/lldb/source/Plugins/Language/ObjC/
H A DCFBasicHash.cpp64 m_exe_ctx_ref.GetProcessSP()->ReadMemory(ptr_offset, m_ht->pointers, size, in UpdateFor()
101 return m_ht_32->pointers[m_ht_32->bits.keys_offset]; in GetKeyPointer()
103 return m_ht_64->pointers[m_ht_64->bits.keys_offset]; in GetKeyPointer()
111 return m_ht_32->pointers[0]; in GetValuePointer()
113 return m_ht_64->pointers[0]; in GetValuePointer()
/openbsd-src/gnu/llvm/clang/docs/
H A DConstantInterpreter.rst85 the union of all pointers which can be cast to void.
140 even when there are live pointers to them. Pointers are only valid as
141 long as the blocks they point to are valid, so a block with pointers to
142 it whose lifetime ends is kept alive until all pointers to it go out of
160 Non-static blocks track all the pointers into them through an intrusive
161 doubly-linked list, required to adjust and invalidate all pointers when
163 all pointers to it are invalidated, emitting the appropriate diagnostics when
231 through pointer arithmetic, such as ``((int *)0x100)[20]``. Null pointers are
232 target pointers with a zero offset.
246 Void pointers, which can be built by casting any of the aforementioned
[all …]
/openbsd-src/gnu/llvm/clang/docs/analyzer/developer-docs/
H A Dnullability.rst19 Taking a branch on nullable pointers are the same like taking branch on null unspecified pointers.
54 * We can assume that these pointers are not null and we lose coverage with the analyzer. (This can …
88 Annotations on multi level pointers
91 …pointers pointing to pointers would make the checker more complicated, because this way a vector o…
107 * Unannotated pointers are treated the same way as pointers annotated with nullability unspecified …
/openbsd-src/gnu/llvm/compiler-rt/lib/asan/tests/
H A Dasan_interface_test.cpp392 std::vector<char *> pointers; in TEST() local
397 pointers.push_back((char*)malloc(size)); in TEST()
401 EXPECT_FALSE(__sanitizer_get_ownership(&pointers)); in TEST()
404 EXPECT_TRUE(__sanitizer_get_ownership(pointers[idx])); in TEST()
405 EXPECT_EQ(sizes[idx], __sanitizer_get_allocated_size(pointers[idx])); in TEST()
407 for (size_t i = 0, n = pointers.size(); i < n; i++) in TEST()
408 free(pointers[i]); in TEST()
H A Dasan_mac_test.cpp140 void *pointers[kNumPointers]; in MallocIntrospectionLockWorker() local
142 pointers[i] = malloc(i + 1); in MallocIntrospectionLockWorker()
145 free(pointers[i]); in MallocIntrospectionLockWorker()
/openbsd-src/gnu/llvm/llvm/docs/HistoricalNotes/
H A D2002-06-25-MegaPatchInfo.txt18 wrapper around a vector of pointers to the sub-objects.
20 Now, instead of having a vector to pointers of objects, the objects are
25 formed directly from pointers to the LLVM value, and invalidation is much
66 of pointers, and that Pass subclasses now all receive references to Values
67 instead of pointers, because they may never be null.
H A D2001-02-06-TypeNotationDebateResp4.txt21 > > that most programmers TODAY do not understand pointers to member
28 > In either case, I would have to look up an example to write pointers to
35 declare these pointers, and the syntax is inconsistent with the method
38 > But pointers to member functions are nowhere near as common as arrays.
64 > make function pointers easier but makes arrays much more difficult seems
67 This is not about function pointers. This is about consistency in the
H A D2001-02-06-TypeNotationDebateResp1.txt28 > that most programmers TODAY do not understand pointers to member
35 In either case, I would have to look up an example to write pointers to
38 But pointers to member functions are nowhere near as common as arrays. And
43 make function pointers easier but makes arrays much more difficult seems
H A D2001-02-13-Reference-MemoryResponse.txt9 > references: constrained pointers that cannot be manipulated: added and
14 > C++ pointers could be promoted to references in the LLVM
19 compiler could generate references instead of pointers with fairly
H A D2001-02-13-Reference-Memory.txt18 references: constrained pointers that cannot be manipulated: added and
23 C++ pointers could be promoted to references in the LLVM
/openbsd-src/gnu/llvm/clang/include/clang/Basic/
H A DTargetCXXABI.def39 /// - the representation of member function pointers is adjusted
40 /// to not conflict with the 'thumb' bit of ARM function pointers;
58 /// - member function pointers,
81 /// - representation of member function pointers adjusted as in ARM.
88 /// - representation of member function pointers adjusted as in ARM.
94 /// - representation of member function pointers is adjusted, as in ARM;
/openbsd-src/gnu/gcc/gcc/config/m32c/
H A Dm32c-modes.def23 /* 24-bit pointers, whole */
26 /* 24-bit pointers, in 32-bit units */
/openbsd-src/gnu/gcc/gcc/config/rs6000/
H A Daix64.opt25 Compile for 64-bit pointers
29 Compile for 32-bit pointers
/openbsd-src/gnu/llvm/compiler-rt/lib/lsan/
H A Dlsan_flags.inc41 LSAN_FLAG(bool, use_unaligned, false, "Consider unaligned pointers valid.")
43 "Consider pointers found in poisoned memory to be valid.")
/openbsd-src/gnu/gcc/gcc/
H A Dtree-ssa-alias.c979 free (ai->pointers[i]); in delete_alias_info()
980 free (ai->pointers); in delete_alias_info()
1179 struct alias_map_d *p_map = ai->pointers[i]; in compute_flow_insensitive_aliasing()
1278 struct alias_map_d *p_map1 = ai->pointers[i]; in compute_flow_insensitive_aliasing()
1287 struct alias_map_d *p_map2 = ai->pointers[j]; in compute_flow_insensitive_aliasing()
1361 tree ptr = ai->pointers[i]->var, tag; in finalize_ref_all_pointers()
1508 qsort (ai->pointers, ai->num_pointers, sizeof (struct alias_map_d *), in group_aliases()
1516 tree tag1 = var_ann (ai->pointers[i]->var)->symbol_mem_tag; in group_aliases()
1517 bitmap tag1_aliases = ai->pointers[i]->may_aliases; in group_aliases()
1520 if (ai->pointers[i]->grouped_p) in group_aliases()
[all …]
H A Dtree-ssa-structalias.h49 struct alias_map_d **pointers; member
/openbsd-src/gnu/usr.bin/binutils/bfd/doc/
H A Dsyms.texi20 application with pointers to the canonical information. To
22 pointers to pointers to @code{asymbol}s. This allows applications
72 pointers to pointers to symbols to the BFD being written, and
275 Return the number of bytes required to store a vector of pointers
316 the vector @var{location} with pointers to the symbols and
318 Return the actual number of symbol pointers, not
335 the table @var{location} of @var{count} pointers to symbols
/openbsd-src/gnu/usr.bin/binutils-2.17/bfd/doc/
H A Dsyms.texi20 application with pointers to the canonical information. To
22 pointers to pointers to @code{asymbol}s. This allows applications
72 pointers to pointers to symbols to the BFD being written, and
275 Return the number of bytes required to store a vector of pointers
332 the vector @var{location} with pointers to the symbols and
334 Return the actual number of symbol pointers, not
351 the table @var{location} of @var{count} pointers to symbols
/openbsd-src/gnu/usr.bin/perl/os2/OS2/OS2-Process/
H A DProcess.pm519 my %pointers;
523 return $pointers{$id} if exists $pointers{$id};
524 $pointers{$id} = &SysPointer;
/openbsd-src/gnu/gcc/gcc/doc/
H A Dgty.texi21 global variables that hold pointers to garbage-collected memory must
218 generic pointers (that is, @code{PTR}) and then use it with a specific
243 several different types, which might not necessarily all be pointers.
297 The type machinery expects all pointers to point to the start of an
300 convert the original object to and from the pointer, such pointers
324 Some data structures depend on the relative ordering of pointers. If
327 changing the pointers in the object that's pointed to by the field the
338 of pointers. @code{reorder} functions can be expensive. When

12345678910>>...22