Lines Matching refs:scheme

11 This scheme works by allocating, for each static type used to make a virtual
39 The scheme will cause the virtual tables for A, B and C to be laid out
102 The scheme as described above is the fully general variant of the scheme.
257 Of course, this alignment scheme works best if the address points are
265 This scheme introduces tradeoffs between decreased space overhead for
286 At a high level, the interleaving scheme consists of three steps: 1) split virtual table groups into
290 The interleaving scheme implemented in LLVM is inspired by [1]_ but has its own
299 The interleaving scheme, however, can only work with individual virtual tables so it must split the…
300 In comparison, the old scheme does not require the splitting but it is more efficient when the comb…
308 This step is common to both the old scheme described above and the interleaving scheme.
309 For the interleaving scheme, since the combined virtual tables have been split in the previous step,
311 For the old scheme, the same property may not hold since it may work on combined virtual tables.
341 This step is where the interleaving scheme deviates from the old scheme. Instead of laying out
342 whole virtual tables in the previously computed order, the interleaving scheme lays out table
355 Note that the interleaving scheme in the CFI implementation guarantees both properties above wherea…
430 function pointer is a member of the function type's bit vector. This scheme
544 In the monolithic scheme a call site is instrumented as
552 In the cross-DSO scheme it becomes
738 This case will be handled similarly to the cross-DSO scheme using the slow path callback.
762 and is properly aligned, and if the checks fail it will either trap (in monolithic scheme)
763 or call the slow path function (cross-DSO scheme).
783   //    (monolithic binary scheme).
785   //    (cross-DSO scheme).
798 software-only scheme.