| /external/srec/seti/sltsEngine/include/ |
| fsm_dictionary.h | 31 LM *letter_mapping;
|
| lts_seq_internal.h | 111 typedef struct LM { /*letter mappings*/
116 } LM;
138 LM *letter_mapping;
|
| /external/clang/lib/Parse/ |
| ParseCXXInlineMethods.cpp | 143 LexedMethod* LM = new LexedMethod(this, FnD);
144 getCurrentClass().LateParsedDeclarations.push_back(LM);
145 LM->TemplateScope = getCurScope()->isTemplateParamScope();
146 CachedTokens &Toks = LM->Toks;
301 void Parser::ParseLexedMethodDeclaration(LateParsedMethodDeclaration &LM) {
303 ParseScope TemplateScope(this, Scope::TemplateParamScope, LM.TemplateScope);
304 if (LM.TemplateScope)
305 Actions.ActOnReenterTemplateScope(getCurScope(), LM.Method);
308 Actions.ActOnStartDelayedCXXMethodDeclaration(getCurScope(), LM.Method);
314 for (unsigned I = 0, N = LM.DefaultArgs.size(); I != N; ++I)
[all...] |
| ParseObjc.cpp | [all...] |
| /external/clang/lib/Analysis/ |
| PrintfFormatString.cpp | 268 switch (LM.getKind()) {
277 switch (LM.getKind()) {
301 switch (LM.getKind()) {
326 if (LM.getKind() == LengthModifier::AsLongDouble)
332 switch (LM.getKind()) {
360 if (LM.getKind() == LengthModifier::AsWideChar) {
411 LM.setKind(LengthModifier::None);
426 LM.setKind(LengthModifier::AsWideChar);
428 LM.setKind(LengthModifier::None);
468 LM.setKind(LengthModifier::None)
[all...] |
| ScanfFormatString.cpp | 223 switch (LM.getKind()) {
258 switch (LM.getKind()) {
295 switch (LM.getKind()) {
310 switch (LM.getKind()) {
324 switch (LM.getKind()) {
340 switch (LM.getKind()) {
395 LM.setKind(LengthModifier::AsWideChar);
397 LM.setKind(LengthModifier::None);
407 LM.setKind(LengthModifier::None);
415 LM.setKind(LengthModifier::AsChar)
[all...] |
| FormatString.cpp | 227 LengthModifier lm(lmPosition, lmKind);
228 FS.setLengthModifier(lm);
579 switch (LM.getKind()) {
686 switch (LM.getKind()) {
743 if (LM.getKind() == LengthModifier::AsLongDouble) {
761 if (LM.getKind() == LengthModifier::AsLongDouble ||
762 LM.getKind() == LengthModifier::AsQuad) {
763 LengthModifier FixedLM(LM);
773 LengthModifier &LM) {
780 LM.setKind(LengthModifier::AsSizeT)
[all...] |
| /external/clang/lib/Serialization/ |
| GlobalModuleIndex.cpp | 243 for (LoadedModulesMap::iterator LM = LoadedModules.begin(),
245 LM != LMEnd; ++LM) {
246 unsigned ID = LM->first;
249 if (LM->second.File == 0)
252 for (unsigned I = 0, N = LM->second.Dependencies.size(); I != N; ++I) {
253 unsigned DepID = LM->second.Dependencies[I];
258 if (LM->second.File)
261 LM->second.File = 0;
289 for (LoadedModulesMap::iterator LM = LoadedModules.begin()
[all...] |
| /external/srec/seti/sltsEngine/src/ |
| run_seq_lts.c | 68 static SWIsltsResult load_letter_mapping(PORT_FILE *fp, LM **ppLetterMap);
69 static SWIsltsResult free_letter_mapping(LM *lm);
75 LQUESTION ***pquestions, int *num_questions, LM **plm, PORT_FILE *fp);
76 static SWIsltsResult free_trees(RT_LTREE **trees, int num_letters, LQUESTION **questions, int num_questions, LM *lm);
253 static SWIsltsResult load_letter_mapping(PORT_FILE *fp, LM **ppLetterMap)
257 LM * lm; local
261 lm = (LM*) lts_alloc(1, sizeof(LM))
1007 LM *lm; local
[all...] |
| /external/clang/include/clang/Analysis/Analyses/ |
| FormatString.h | 316 LengthModifier LM;
328 void setLengthModifier(LengthModifier lm) {
329 LM = lm;
347 return LM;
371 /// assign the appropriate value to LM and return true.
372 static bool namedTypeToLengthModifier(QualType QT, LengthModifier &LM);
|
| /external/ppp/pppd/plugins/radius/etc/ |
| dictionary.microsoft | 13 ATTRIBUTE MS-CHAP-LM-Enc-PW 5 string Microsoft
|
| /external/clang/lib/Sema/ |
| SemaChecking.cpp | [all...] |
| /external/llvm/tools/llvm-stress/ |
| llvm-stress.cpp | 625 OwningPtr<Modifier> LM(new LoadModifier(BB, &PT, &R));
634 Modifiers.push_back(LM.get());
|
| /external/clang/include/clang/Parse/ |
| Parser.h | [all...] |
| /external/chromium/third_party/libjingle/source/talk/session/phone/testdata/ |
| video.rtpdump | 287 ???´?ffp??c??io?Ęc??O^;.e8?]!\ ?2???b@?S #?dg?~?n?jm3W?g????C?ob?J???`PsU6?? ??=Uz`a??????' ?}5??^??[??b???Y? ?4?rc ?T????{???3??^??????7?? \V?? Lm?V????h= ??.EE???8??V??? B?? ???pp[?b?i?G[?Ws?*?1E?b?Z???]b???u? DS?7?????X' ?j? y:jz???????s>F9?????{A-???[?:?.?u*?????.????j?~?K?????> ?bG?+r?Q[=???P?e'? ?T?(L?`b??????3?/??b<_"??Jf??|??9x?cP?? ???=?n?O??.?? f ??&?r ,!??b,
[all...] |
| /external/ceres-solver/docs/ |
| solving.tex | 79 The factorization methods are based on computing an exact solution of~\eqref{eq:lsqr} using a Cholesky or a QR factorization and lead to an exact step Levenberg-Marquardt algorithm. But it is not clear if an exact solution of~\eqref{eq:lsqr} is necessary at each step of the LM algorithm to solve~\eqref{eq:nonlinsq}. In fact, we have already seen evidence that this may not be the case, as~\eqref{eq:lsqr} is itself a regularized version of~\eqref{eq:linearapprox}. Indeed, it is possible to construct non-linear optimization algorithms in which the linearized problem is solved approximately. These algorithms are known as inexact Newton or truncated Newton methods~\cite{nocedal2000numerical}.
476 \item{\texttt{lm\_min\_diagonal } ($10^6$)} The
481 \item{\texttt{lm\_max\_diagonal } ($10^{32}$)} The
[all...] |
