Searched refs:LM (Results 1 - 16 of 16) sorted by relevance

/external/srec/seti/sltsEngine/include/
H A Dfsm_dictionary.h31 LM *letter_mapping;
H A Dlts_seq_internal.h111 typedef struct LM { /*letter mappings*/ struct
116 } LM; typedef in typeref:struct:LM
138 LM *letter_mapping;
/external/clang/lib/Parse/
H A DParseCXXInlineMethods.cpp143 LexedMethod* LM = new LexedMethod(this, FnD); local
144 getCurrentClass().LateParsedDeclarations.push_back(LM);
145 LM->TemplateScope = getCurScope()->isTemplateParamScope();
146 CachedTokens &Toks = LM->Toks;
301 void Parser::ParseLexedMethodDeclaration(LateParsedMethodDeclaration &LM) { argument
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
394 ParseLexedMethodDef(LexedMethod &LM) argument
[all...]
H A DParseObjc.cpp1932 LexedMethod* LM = new LexedMethod(this, MDecl); local
1933 CurParsedObjCImpl->LateParsedObjCMethods.push_back(LM);
1934 CachedTokens &Toks = LM->Toks;
2862 void Parser::ParseLexedObjCMethodDefs(LexedMethod &LM, bool parseMethod) { argument
2864 Decl *MCDecl = LM.D;
2874 assert(!LM.Toks.empty() && "ParseLexedObjCMethodDef - Empty body!");
2877 LM.Toks.push_back(Tok);
2878 PP.EnterTokenStream(LM.Toks.data(), LM.Toks.size(), true, false);
/external/clang/lib/Analysis/
H A DPrintfFormatString.cpp268 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
[all...]
H A DScanfFormatString.cpp223 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
[all...]
H A DFormatString.cpp579 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);
784 LM.setKind(LengthModifier::AsSizeT);
787 LM
772 namedTypeToLengthModifier(QualType QT, LengthModifier &LM) argument
[all...]
/external/clang/lib/Serialization/
H A DGlobalModuleIndex.cpp243 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
[all...]
/external/srec/seti/sltsEngine/src/
H A Drun_seq_lts.c68 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;
261 lm = (LM*) lts_alloc(1, sizeof(LM));
306 static SWIsltsResult free_letter_mapping(LM *lm)
499 LQUESTION ***pquestions, int *num_questions, LM **pl
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DFormatString.h316 LengthModifier LM; member in class:clang::analyze_format_string::FormatSpecifier
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/
H A Ddictionary.microsoft13 ATTRIBUTE MS-CHAP-LM-Enc-PW 5 string Microsoft
/external/clang/lib/Sema/
H A DSemaChecking.cpp2079 const LengthModifier &LM = FS.getLengthModifier(); local
2080 CharSourceRange LMRange = getSpecifierRange(LM.getStart(), LM.getLength());
2085 EmitFormatDiagnostic(S.PDiag(DiagID) << LM.toString() << CS.toString(),
2086 getLocationOfByte(LM.getStart()),
2090 S.Diag(getLocationOfByte(LM.getStart()), diag::note_format_fix_specifier)
2099 EmitFormatDiagnostic(S.PDiag(DiagID) << LM.toString() << CS.toString(),
2100 getLocationOfByte(LM.getStart()),
2112 const LengthModifier &LM = FS.getLengthModifier(); local
2113 CharSourceRange LMRange = getSpecifierRange(LM
[all...]
/external/llvm/tools/llvm-stress/
H A Dllvm-stress.cpp625 OwningPtr<Modifier> LM(new LoadModifier(BB, &PT, &R));
634 Modifiers.push_back(LM.get());
/external/clang/include/clang/Parse/
H A DParser.h1065 void ParseLexedMethodDeclaration(LateParsedMethodDeclaration &LM);
1067 void ParseLexedMethodDef(LexedMethod &LM);
1070 void ParseLexedObjCMethodDefs(LexedMethod &LM, bool parseMethod);
/external/chromium/third_party/libjingle/source/talk/session/phone/testdata/
H A Dvideo.rtpdump668 v:f X�?P��ǒ_��#����X;�����(H�b~�7 ���NK���5�t��>����)-^������s{�hq�b1�Mk�AF��%x�(B�Ƃ�����1����_n�� ���=�n�����.��f��E�ri!�xb.(J���'�G WֿLM:t�G/0��������W7��+{e�c�Hp_����^мu�%^��u��1��z] ��r�3c�Izq�4-
830 �LMʢ��"E4�SBlHs����Z��k4A�f�{���'e/��M�0DH��cB��Ĉ�ӧ�
936 �B��y]��ی��Z LM�4�{+�w'��)�Jcj��c\��d*�;�u�K��,���C&��1ξ,T/�'��mQB�u�a�E:�
/external/ceres-solver/docs/
H A Dsolving.tex79 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}.

Completed in 650 milliseconds