| /src/external/bsd/openldap/dist/servers/slapd/back-wt/ |
| attr.c | 102 char **indexes = NULL; local
114 indexes = ldap_str2charray( argv[1], "," );
116 if( indexes == NULL ) {
118 "no indexes specified: %s\n",
125 if( indexes == NULL ) {
131 for ( i = 0; indexes[i] != NULL; i++ ) {
134 rc = slap_str2index( indexes[i], &index );
140 "index type \"%s\" undefined", indexes[i] );
157 "no indexes selected" );
358 if ( indexes != NULL ) ldap_charray_free( indexes )
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/bn/ |
| bn_ctx.c | 48 /* Array of indexes into the bignum stack */
49 unsigned int *indexes; member in struct:bignum_ctx_stack
100 while (bnidx++ < stack->indexes[fpidx])
256 st->indexes = NULL;
262 OPENSSL_free(st->indexes);
263 st->indexes = NULL;
276 memcpy(newitems, st->indexes, sizeof(*newitems) * st->depth);
277 OPENSSL_free(st->indexes);
278 st->indexes = newitems;
281 st->indexes[(st->depth)++] = idx
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/bn/ |
| bn_ctx.c | 48 /* Array of indexes into the bignum stack */
49 unsigned int *indexes; member in struct:bignum_ctx_stack
100 while (bnidx++ < stack->indexes[fpidx])
252 st->indexes = NULL;
258 OPENSSL_free(st->indexes);
259 st->indexes = NULL;
276 memcpy(newitems, st->indexes, sizeof(*newitems) * st->depth);
277 OPENSSL_free(st->indexes);
278 st->indexes = newitems;
281 st->indexes[(st->depth)++] = idx
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/bn/ |
| bn_ctx.c | 60 /* Array of indexes into the bignum stack */
61 unsigned int *indexes; member in struct:bignum_ctx_stack
108 while (bnidx++ < stack->indexes[fpidx])
245 st->indexes = NULL;
251 OPENSSL_free(st->indexes);
252 st->indexes = NULL;
269 memcpy(newitems, st->indexes, sizeof(*newitems) * st->depth);
270 OPENSSL_free(st->indexes);
271 st->indexes = newitems;
274 st->indexes[(st->depth)++] = idx
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/back-mdb/ |
| attr.c | 210 char **indexes = NULL; local
222 indexes = ldap_str2charray( argv[1], "," );
224 if( indexes == NULL ) {
226 "no indexes specified: %s\n",
233 if( indexes == NULL ) {
239 for ( i = 0; indexes[i] != NULL; i++ ) {
241 rc = slap_str2index( indexes[i], &index );
247 "index type \"%s\" undefined", indexes[i] );
264 "no indexes selected" );
482 if ( indexes != NULL ) ldap_charray_free( indexes )
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/ |
| value.c | 269 /* assign new indexes to an attribute's ordered values */
319 * If the values have indexes, sort them.
350 /* If values have indexes, sort the values */
352 int *indexes, j, idx; local
376 indexes = ch_malloc( vals * sizeof(int) );
379 indexes[i] = strtol(a->a_vals[i].bv_val+1, &ptr, 0);
381 ch_free( indexes );
388 idx = indexes[i];
392 while ((j > 0) && (indexes[j-1] > idx)) {
393 indexes[j] = indexes[j-1]
[all...] |
| /src/external/gpl3/gdb/dist/gdb/dwarf2/ |
| read-debug-names.c | 350 std::vector<std::unique_ptr<cooked_index_shard>> indexes; local
351 indexes.push_back (std::move (m_map.shard));
357 table->set_contents (std::move (indexes), &m_warnings, nullptr);
|
| read.c | 2330 indexes that matched in a temporary vector and ignore
4982 std::vector<std::unique_ptr<cooked_index_shard>> indexes;
4985 indexes.push_back (std::move (std::get<0> (one_result)));
4992 indexes.push_back (m_index_storage.release ());
4993 indexes.shrink_to_fit ();
5001 table->set_contents (std::move (indexes), &m_warnings,
7983 indexes, and a pool of 32-bit section numbers. The index sections will be
8002 array of 32-bit indexes (using the byte order of the application binary),
4976 std::vector<std::unique_ptr<cooked_index_shard>> indexes; local
|
| /src/external/gpl3/gdb.old/dist/gdb/dwarf2/ |
| read-debug-names.c | 350 std::vector<std::unique_ptr<cooked_index_shard>> indexes; local
351 indexes.push_back (std::move (m_map.shard));
357 table->set_contents (std::move (indexes), &m_warnings, nullptr);
|
| read.c | 2319 indexes that matched in a temporary vector and ignore
4892 std::vector<std::unique_ptr<cooked_index_shard>> indexes;
4895 indexes.push_back (std::move (std::get<0> (one_result)));
4902 indexes.push_back (m_index_storage.release ());
4903 indexes.shrink_to_fit ();
4911 table->set_contents (std::move (indexes), &m_warnings,
7903 indexes, and a pool of 32-bit section numbers. The index sections will be
7922 array of 32-bit indexes (using the byte order of the application binary),
4886 std::vector<std::unique_ptr<cooked_index_shard>> indexes; local
|
| /src/external/gpl3/binutils/dist/gas/config/ |
| obj-elf.c | 458 htab_t indexes; /* Maps group name to index in head array. */ member in struct:group_list
508 if (!groups.indexes)
512 groups.indexes = htab_create_alloc (16, hash_string_tuple, eq_string_tuple,
518 *group_idx = str_hash_find_int (groups.indexes, match->group_name);
554 str_hash_insert_int (groups.indexes, match->group_name, i, 0);
3029 if (groups.indexes)
3031 htab_delete (groups.indexes);
|
| /src/external/gpl3/binutils.old/dist/gas/config/ |
| obj-elf.c | 454 htab_t indexes; /* Maps group name to index in head array. */ member in struct:group_list
504 if (!groups.indexes)
508 groups.indexes = htab_create_alloc (16, hash_string_tuple, eq_string_tuple,
514 *group_idx = str_hash_find_int (groups.indexes, match->group_name);
550 str_hash_insert_int (groups.indexes, match->group_name, i, 0);
3195 if (groups.indexes)
3197 htab_delete (groups.indexes);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-if-conv.cc | 1973 vec <int> *indexes; member in struct:ifcvt_arg_entry
1991 len = arg.indexes->length ();
1995 e = gimple_phi_arg_edge (phi, (*arg.indexes)[i]);
2246 /* Create hashmap for PHI node which contain vector of argument indexes
2286 args[i].indexes = indices;
2296 && args[0].indexes->length () == 1)
2298 index0 = (*args[0].indexes)[0];
|
| genmatch.cc | 1039 /* A map of capture identifiers to indexes. */
1831 dt_operand **indexes; member in class:dt_simplify
1836 indexes (indexes_), info (NULL) {}
1875 static dt_node *insert_operand (dt_node *, operand *, dt_operand **indexes,
2048 dt_operand **indexes)
2051 dt_simplify *n = new dt_simplify (s, pattern_no, indexes);
2109 decision_tree::insert_operand (dt_node *p, operand *o, dt_operand **indexes,
2118 if (indexes[capt_index] == 0)
2121 q = insert_operand (p, c->what, indexes, pos, parent);
2136 dt_operand *match_op = indexes[cc_index]
2189 dt_operand **indexes = XCNEWVEC (dt_operand *, s->capture_max + 1); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-if-conv.cc | 2034 /* Create hashmap for PHI node which contain vector of argument indexes
2077 vec<int> *indexes; local
2078 indexes = phi_arg_map.get (args[0]);
2079 index0 = (*indexes)[0];
2112 vec<int> *indexes; local
2119 indexes = phi_arg_map.get (args[i]);
2124 cond = gen_phi_arg_condition (phi, indexes, gsi);
|
| genmatch.cc | 889 /* A map of capture identifiers to indexes. */
1676 dt_operand **indexes; member in class:dt_simplify
1681 indexes (indexes_), info (NULL) {}
1720 static dt_node *insert_operand (dt_node *, operand *, dt_operand **indexes,
1887 dt_operand **indexes)
1890 dt_simplify *n = new dt_simplify (s, pattern_no, indexes);
1948 decision_tree::insert_operand (dt_node *p, operand *o, dt_operand **indexes,
1957 if (indexes[capt_index] == 0)
1960 q = insert_operand (p, c->what, indexes, pos, parent);
1975 dt_operand *match_op = indexes[cc_index]
2028 dt_operand **indexes = XCNEWVEC (dt_operand *, s->capture_max + 1); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| constexpr.cc | 3592 /* Verify that if the last index is missing, all indexes
3608 that CONSTRUCTOR either has all indexes or none,
3609 we need to add indexes to all elements. */
5729 releasing_vec ctors, indexes; local
5815 vec_safe_push (indexes, index);
5909 for (unsigned i = 0; i < vec_safe_length (indexes); i++)
5912 = get_or_insert_ctor_field (*valp, indexes[i], index_pos_hints[i]);
|
