Searched refs:unknowns (Results 1 - 7 of 7) sorted by relevance

/netbsd-current/external/bsd/openldap/dist/servers/lloadd/
H A Dmain.c231 parse_debug_unknowns( char **unknowns, int *levelp ) argument
235 for ( i = 0; unknowns[i] != NULL; i++ ) {
237 if ( str2loglevel( unknowns[i], &level ) ) {
238 fprintf( stderr, "unrecognized log level \"%s\"\n", unknowns[i] );
248 parse_debug_level( const char *arg, int *levelp, char ***unknowns )
263 ldap_charray_add( unknowns, levels[i] );
/netbsd-current/external/bsd/openldap/dist/servers/slapd/
H A Dmain.c239 parse_debug_unknowns( char **unknowns, int *levelp ) argument
243 for ( i = 0; unknowns[ i ] != NULL; i++ ) {
245 if ( str2loglevel( unknowns[ i ], &level )) {
247 "unrecognized log level \"%s\"\n", unknowns[ i ] );
257 parse_debug_level( const char *arg, int *levelp, char ***unknowns )
273 ldap_charray_add( unknowns, levels[ i ] );
H A Dproto-slap.h1250 parse_debug_level LDAP_P(( const char *arg, int *levelp, char ***unknowns ));
1256 parse_debug_unknowns LDAP_P(( char **unknowns, int *levelp ));
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-object-size.cc46 bitmap visited, reexamine, unknowns; member in struct:object_size_info
267 bitmap_set_bit (osi->unknowns, SSA_NAME_VERSION (oldval));
268 bitmap_set_bit (osi->unknowns, SSA_NAME_VERSION (old_wholeval));
880 if (bitmap_bit_p (osi->unknowns, SSA_NAME_VERSION (expr)))
937 /* Step 1: Propagate unknowns into expressions. */
962 /* Release all unknowns. */
963 EXECUTE_IF_SET_IN_BITMAP (osi->unknowns, 0, i, bi)
1092 osi.unknowns = BITMAP_ALLOC (NULL);
1112 BITMAP_FREE (osi.unknowns);
/netbsd-current/external/gpl3/gdb.old/dist/gdbserver/
H A Dserver.cc2312 std::vector<const char *> unknowns; local
2382 unknowns.push_back (feature.c_str ());
2388 target_process_qsupported (unknowns);
/netbsd-current/external/gpl3/gdb/dist/gdbserver/
H A Dserver.cc2305 std::vector<const char *> unknowns; local
2381 unknowns.push_back (feature.c_str ());
2387 target_process_qsupported (unknowns);
/netbsd-current/external/mit/isl/dist/doc/
H A Dimplementation.tex305 There are two places in the above algorithm where the unknowns $\vec x$
309 To deal with negative unknowns, \textcite[Appendix A.2]{Fea91}
343 specify that the unknowns may be negative or that the maximum should
348 negative unknowns and maximization are by far the most common applications
354 are made on the sign of the unknowns. Instead, the sign of the unknowns
357 does explicitly add non-negativity constraints on the unknowns unless
378 over the combined space of unknowns and parameters.
500 It is also possible to perform a similar compression on the unknowns,

Completed in 284 milliseconds