HomeSort by: relevance | last modified time | path
    Searched refs:stores (Results 1 - 25 of 82) sorted by relevancy

1 2 3 4

  /src/crypto/external/apache2/openssl/dist/crypto/x509/
by_store.c 120 STACK_OF(CACHED_STORE) *stores = X509_LOOKUP_get_method_data(ctx);
121 sk_CACHED_STORE_pop_free(stores, free_store);
131 STACK_OF(CACHED_STORE) *stores = X509_LOOKUP_get_method_data(ctx);
158 if (stores == NULL) {
159 stores = sk_CACHED_STORE_new_null();
160 if (stores != NULL)
161 X509_LOOKUP_set_method_data(ctx, stores);
163 if (stores == NULL || sk_CACHED_STORE_push(stores, store) <= 0) {
195 STACK_OF(CACHED_STORE) *stores = X509_LOOKUP_get_method_data(ctx)
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
ipa-modref.h 1 /* Search for references that a functions loads or stores.
30 /* Load and stores in function (transitively closed to all callees) */
32 modref_records *stores; variable
40 /* Side effects does not include memory loads and stores which are
41 expressed using loads, stores and calls_interposable fields. */
61 stores are optimized out. */
91 /* All flags implied when we know we can ignore stores (i.e. when handling
ipa-modref.cc 1 /* Search for references that a functions loads or stores.
21 /* Mod/ref pass records summary about loads and stores performed by the
39 This is used by tree-ssa-alias to disambiguate load/stores
280 : loads (NULL), stores (NULL), retslot_flags (0), static_chain_flags (0),
291 if (stores)
292 ggc_delete (stores);
347 return stores && !stores->every_base;
355 /* Load and stores in functions using types rather then alias sets.
360 modref_records_lto *stores; variable
    [all...]
gimple-ssa-store-merging.cc 21 /* The purpose of the store merging pass is to combine multiple memory stores
23 or bit-field values, to consecutive locations, into fewer wider stores.
25 For example, if we have a sequence peforming four byte stores to
66 These stores can be a result of structure element initializers, array stores
75 2) Analyze the chains of stores recorded in phase 1) (i.e. the vector of
76 store_immediate_info objects) and coalesce contiguous stores into
77 merged_store_group objects. For bit-field stores, we don't need to
78 require the stores to be contiguous, just their surrounding bit regions
80 between adjacent stores, such as one store storing a constant an
1813 auto_vec<store_immediate_info *> stores; member in class:__anon13747::merged_store_group
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-modref.h 1 /* Search for references that a functions loads or stores.
30 /* Load and stores in function (transitively closed to all callees) */
32 modref_records *stores; variable
40 /* Side effects does not include memory loads and stores which are
41 expressed using loads, stores and calls_interposable fields. */
61 stores are optimized out. */
91 /* All flags implied when we know we can ignore stores (i.e. when handling
ipa-modref.cc 1 /* Search for references that a functions loads or stores.
21 /* Mod/ref pass records summary about loads and stores performed by the
39 This is used by tree-ssa-alias to disambiguate load/stores
278 : loads (NULL), stores (NULL), retslot_flags (0), static_chain_flags (0),
289 if (stores)
290 ggc_delete (stores);
345 return stores && !stores->every_base;
353 /* Load and stores in functions using types rather then alias sets.
358 modref_records_lto *stores; variable
    [all...]
gimple-ssa-store-merging.cc 21 /* The purpose of the store merging pass is to combine multiple memory stores
23 or bit-field values, to consecutive locations, into fewer wider stores.
25 For example, if we have a sequence peforming four byte stores to
66 These stores can be a result of structure element initializers, array stores
75 2) Analyze the chains of stores recorded in phase 1) (i.e. the vector of
76 store_immediate_info objects) and coalesce contiguous stores into
77 merged_store_group objects. For bit-field stores, we don't need to
78 require the stores to be contiguous, just their surrounding bit regions
80 between adjacent stores, such as one store storing a constant an
1729 auto_vec<store_immediate_info *> stores; member in class:__anon16175::merged_store_group
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/MCTargetDesc/
HexagonShuffler.cpp 219 // If this packet contains an instruction that bars slot-1 stores,
415 if (Summary.stores == 1 && SafeToMoveToSlot0)
418 else if (Summary.stores >= 1) {
420 // Error if no more slots available for stores.
421 reportError("invalid instruction packet: too many stores");
426 // Update the next highest slot available to stores.
430 if (Summary.store1 && Summary.stores > 1) {
432 reportError("invalid instruction packet: too many stores");
499 ++Summary.stores;
507 ++Summary.stores;
    [all...]
HexagonShuffler.h 147 // Number of memory operations, loads, solo loads, stores, solo stores,
148 // single stores.
152 unsigned stores; member in struct:llvm::HexagonShuffler::HexagonPacketSummary
  /src/libexec/httpd/lua/
optparse.lua 15 -- - store_true: stores key, true
16 -- - store_false: stores key, false
  /src/crypto/external/bsd/netpgp/dist/bindings/lua/
optparse.lua 15 -- - store_true: stores key, true
16 -- - store_false: stores key, false
  /src/crypto/external/bsd/netpgp/dist/src/hkpclient/
optparse.lua 15 -- - store_true: stores key, true
16 -- - store_false: stores key, false
  /src/external/gpl3/gcc/dist/gcc/config/rs6000/
rs6000-pcrel-opt.cc 66 We also optimize stores to the address of an external variable using the
137 unsigned long stores; member in struct:__anon13419
518 counters.stores++;
704 /* We can only optimize loads and stores. Ignore everything else. */
849 fprintf (dump_file, "# of PCREL_OPT stores = %lu (adjacent %lu)\n",
850 counters.stores, counters.adjacent_stores);
853 fprintf (dump_file, "# of failed PCREL_OPT stores = %lu\n",
  /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
rs6000-pcrel-opt.cc 66 We also optimize stores to the address of an external variable using the
137 unsigned long stores; member in struct:__anon15847
518 counters.stores++;
704 /* We can only optimize loads and stores. Ignore everything else. */
849 fprintf (dump_file, "# of PCREL_OPT stores = %lu (adjacent %lu)\n",
850 counters.stores, counters.adjacent_stores);
853 fprintf (dump_file, "# of failed PCREL_OPT stores = %lu\n",
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.arch/
arc-analyze-prologue.S 240 ; ENTER_S that stores BLINK.
249 ; ENTER_S that stores FP.
258 ; ENTER_S that stores R13, FP and BLINK.
267 ; ENTER_S that stores R13-R15
276 ; ENTER_S that stores everything it could.
792 ; Two stores at the same adddress. GDB should report only the R14.
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.arch/
arc-analyze-prologue.S 240 ; ENTER_S that stores BLINK.
249 ; ENTER_S that stores FP.
258 ; ENTER_S that stores R13, FP and BLINK.
267 ; ENTER_S that stores R13-R15
276 ; ENTER_S that stores everything it could.
792 ; Two stores at the same adddress. GDB should report only the R14.
  /src/crypto/external/bsd/openssl/dist/apps/
list.c 1170 STACK_OF(OSSL_STORE_LOADER) *stores = sk_OSSL_STORE_LOADER_new(store_cmp);
1173 if (stores == NULL) {
1179 stores); local
1180 sk_OSSL_STORE_LOADER_sort(stores);
1181 for (i = 0; i < sk_OSSL_STORE_LOADER_num(stores); i++) {
1182 const OSSL_STORE_LOADER *m = sk_OSSL_STORE_LOADER_value(stores, i);
1199 sk_OSSL_STORE_LOADER_pop_free(stores, OSSL_STORE_LOADER_free);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 79 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads)
619 /// 1 for loads, 0 for stores. (see comment in SUList)
758 // on it, stores and loads kept separately. Two SUs are trivially
761 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/);
763 // Certain memory accesses are known to not alias any SU in Stores
773 // These do not depend on one other (or normal loads or stores), but
906 addBarrierChain(Stores);
948 // An unknown store depends on all stores and loads.
949 addChainDependencies(SU, Stores);
955 Stores.insert(SU, UnknownValue)
    [all...]
  /src/external/gpl3/gdb/dist/sim/bfin/
dv-bfin_dma.c 160 bu16 *stores[] = { local
185 *stores[idx] = flows[idx];
  /src/external/gpl3/gdb.old/dist/sim/bfin/
dv-bfin_dma.c 160 bu16 *stores[] = { local
185 *stores[idx] = flows[idx];
  /src/usr.bin/make/unit-tests/
escape.mk 32 # in a variable assignment stores "#" as part of the value.
36 # newline in a variable assignment simply stores the backslashes as part
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 201 void reduceHugeMemNodeMaps(Value2SUsMap &stores,
  /src/crypto/external/apache2/openssl/dist/apps/
list.c 1324 STACK_OF(OSSL_STORE_LOADER) *stores = sk_OSSL_STORE_LOADER_new(store_cmp);
1327 if (stores == NULL) {
1333 stores); local
1334 sk_OSSL_STORE_LOADER_sort(stores);
1335 for (i = 0; i < sk_OSSL_STORE_LOADER_num(stores); i++) {
1336 const OSSL_STORE_LOADER *m = sk_OSSL_STORE_LOADER_value(stores, i);
1352 sk_OSSL_STORE_LOADER_pop_free(stores, OSSL_STORE_LOADER_free);
  /src/external/lgpl3/gmp/dist/mpn/alpha/ev6/
add_n.asm 53 C Pair loads and stores where possible
55 C Stores are delayed every third cycle
56 C Loads and stores are delayed by fills
58 C L moves because of loads and stores
sub_n.asm 53 C Pair loads and stores where possible
55 C Stores are delayed every third cycle
56 C Loads and stores are delayed by fills
58 C L moves because of loads and stores

Completed in 51 milliseconds

1 2 3 4