Why am I not getting a warning from Perl? - perl
Consider these two use cases:
sub test1 {
my $v = 1;
sub test2 { print $v }
# ...
}
and
for (0..3) {
my $foo = $_;
sub test1 { print $foo }
# ...
}
The first one produces a Variable will not stay shared warning, while the second doesn't. It seems that the variable is not shared in both cases. Why isn't there any warning in the second case?
It seems that this may be a bug or omission in the warnings pragma.
Adding to the fun, this arrangement gives a different warning:
BEGIN {*outer = sub {
my $x;
sub inner {$x}
}}
Which warns Variable "$x" is not available
These warnings all come from the pad_findlex() API call defined in pad.c.
806 =for apidoc pad_findlex
807
808 Find a named lexical anywhere in a chain of nested pads. Add fake entries
809 in the inner pads if it's found in an outer one.
810
811 Returns the offset in the bottom pad of the lex or the fake lex.
812 cv is the CV in which to start the search, and seq is the current cop_seq
813 to match against. If warn is true, print appropriate warnings. The out_*
814 vars return values, and so are pointers to where the returned values
815 should be stored. out_capture, if non-null, requests that the innermost
816 instance of the lexical is captured; out_name_sv is set to the innermost
817 matched namesv or fake namesv; out_flags returns the flags normally
818 associated with the IVX field of a fake namesv.
819
820 Note that pad_findlex() is recursive; it recurses up the chain of CVs,
821 then comes back down, adding fake entries as it goes. It has to be this way
822 because fake namesvs in anon protoypes have to store in xlow the index into
823 the parent pad.
824
825 =cut
826 */
827
828 /* the CV has finished being compiled. This is not a sufficient test for
829 * all CVs (eg XSUBs), but suffices for the CVs found in a lexical chain */
830 #define CvCOMPILED(cv) CvROOT(cv)
831
832 /* the CV does late binding of its lexicals */
833 #define CvLATE(cv) (CvANON(cv) || SvTYPE(cv) == SVt_PVFM)
834
835
836 STATIC PADOFFSET
837 S_pad_findlex(pTHX_ const char *name, const CV* cv, U32 seq, int warn,
838 SV** out_capture, SV** out_name_sv, int *out_flags)
839 {
840 dVAR;
841 I32 offset, new_offset;
842 SV *new_capture;
843 SV **new_capturep;
844 const AV * const padlist = CvPADLIST(cv);
845
846 PERL_ARGS_ASSERT_PAD_FINDLEX;
847
848 *out_flags = 0;
849
850 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
851 "Pad findlex cv=0x%"UVxf" searching \"%s\" seq=%d%s\n",
852 PTR2UV(cv), name, (int)seq, out_capture ? " capturing" : "" ));
853
854 /* first, search this pad */
855
856 if (padlist) { /* not an undef CV */
857 I32 fake_offset = 0;
858 const AV * const nameav = MUTABLE_AV(AvARRAY(padlist)[0]);
859 SV * const * const name_svp = AvARRAY(nameav);
860
861 for (offset = AvFILLp(nameav); offset > 0; offset--) {
862 const SV * const namesv = name_svp[offset];
863 if (namesv && namesv != &PL_sv_undef
864 && strEQ(SvPVX_const(namesv), name))
865 {
866 if (SvFAKE(namesv)) {
867 fake_offset = offset; /* in case we don't find a real one */
868 continue;
869 }
870 /* is seq within the range _LOW to _HIGH ?
871 * This is complicated by the fact that PL_cop_seqmax
872 * may have wrapped around at some point */
873 if (COP_SEQ_RANGE_LOW(namesv) == PERL_PADSEQ_INTRO)
874 continue; /* not yet introduced */
875
876 if (COP_SEQ_RANGE_HIGH(namesv) == PERL_PADSEQ_INTRO) {
877 /* in compiling scope */
878 if (
879 (seq > COP_SEQ_RANGE_LOW(namesv))
880 ? (seq - COP_SEQ_RANGE_LOW(namesv) < (U32_MAX >> 1))
881 : (COP_SEQ_RANGE_LOW(namesv) - seq > (U32_MAX >> 1))
882 )
883 break;
884 }
885 else if (
886 (COP_SEQ_RANGE_LOW(namesv) > COP_SEQ_RANGE_HIGH(namesv))
887 ?
888 ( seq > COP_SEQ_RANGE_LOW(namesv)
889 || seq <= COP_SEQ_RANGE_HIGH(namesv))
890
891 : ( seq > COP_SEQ_RANGE_LOW(namesv)
892 && seq <= COP_SEQ_RANGE_HIGH(namesv))
893 )
894 break;
895 }
896 }
897
898 if (offset > 0 || fake_offset > 0 ) { /* a match! */
899 if (offset > 0) { /* not fake */
900 fake_offset = 0;
901 *out_name_sv = name_svp[offset]; /* return the namesv */
902
903 /* set PAD_FAKELEX_MULTI if this lex can have multiple
904 * instances. For now, we just test !CvUNIQUE(cv), but
905 * ideally, we should detect my's declared within loops
906 * etc - this would allow a wider range of 'not stayed
907 * shared' warnings. We also treated already-compiled
908 * lexes as not multi as viewed from evals. */
909
910 *out_flags = CvANON(cv) ?
911 PAD_FAKELEX_ANON :
912 (!CvUNIQUE(cv) && ! CvCOMPILED(cv))
913 ? PAD_FAKELEX_MULTI : 0;
914
915 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
916 "Pad findlex cv=0x%"UVxf" matched: offset=%ld (%lu,%lu)\n",
917 PTR2UV(cv), (long)offset,
918 (unsigned long)COP_SEQ_RANGE_LOW(*out_name_sv),
919 (unsigned long)COP_SEQ_RANGE_HIGH(*out_name_sv)));
920 }
921 else { /* fake match */
922 offset = fake_offset;
923 *out_name_sv = name_svp[offset]; /* return the namesv */
924 *out_flags = PARENT_FAKELEX_FLAGS(*out_name_sv);
925 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
926 "Pad findlex cv=0x%"UVxf" matched: offset=%ld flags=0x%lx index=%lu\n",
927 PTR2UV(cv), (long)offset, (unsigned long)*out_flags,
928 (unsigned long) PARENT_PAD_INDEX(*out_name_sv)
929 ));
930 }
931
932 /* return the lex? */
933
934 if (out_capture) {
935
936 /* our ? */
937 if (SvPAD_OUR(*out_name_sv)) {
938 *out_capture = NULL;
939 return offset;
940 }
941
942 /* trying to capture from an anon prototype? */
943 if (CvCOMPILED(cv)
944 ? CvANON(cv) && CvCLONE(cv) && !CvCLONED(cv)
945 : *out_flags & PAD_FAKELEX_ANON)
946 {
947 if (warn)
948 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
949 "Variable \"%s\" is not available", name);
950 *out_capture = NULL;
951 }
952
953 /* real value */
954 else {
955 int newwarn = warn;
956 if (!CvCOMPILED(cv) && (*out_flags & PAD_FAKELEX_MULTI)
957 && !SvPAD_STATE(name_svp[offset])
958 && warn && ckWARN(WARN_CLOSURE)) {
959 newwarn = 0;
960 Perl_warner(aTHX_ packWARN(WARN_CLOSURE),
961 "Variable \"%s\" will not stay shared", name);
962 }
963
964 if (fake_offset && CvANON(cv)
965 && CvCLONE(cv) &&!CvCLONED(cv))
966 {
967 SV *n;
968 /* not yet caught - look further up */
969 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
970 "Pad findlex cv=0x%"UVxf" chasing lex in outer pad\n",
971 PTR2UV(cv)));
972 n = *out_name_sv;
973 (void) pad_findlex(name, CvOUTSIDE(cv),
974 CvOUTSIDE_SEQ(cv),
975 newwarn, out_capture, out_name_sv, out_flags);
976 *out_name_sv = n;
977 return offset;
978 }
979
980 *out_capture = AvARRAY(MUTABLE_AV(AvARRAY(padlist)[
981 CvDEPTH(cv) ? CvDEPTH(cv) : 1]))[offset];
982 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
983 "Pad findlex cv=0x%"UVxf" found lex=0x%"UVxf"\n",
984 PTR2UV(cv), PTR2UV(*out_capture)));
985
986 if (SvPADSTALE(*out_capture)
987 && !SvPAD_STATE(name_svp[offset]))
988 {
989 Perl_ck_warner(aTHX_ packWARN(WARN_CLOSURE),
990 "Variable \"%s\" is not available", name);
991 *out_capture = NULL;
992 }
993 }
994 if (!*out_capture) {
995 if (*name == '#')
996 *out_capture = sv_2mortal(MUTABLE_SV(newAV()));
997 else if (*name == '%')
998 *out_capture = sv_2mortal(MUTABLE_SV(newHV()));
999 else
1000 *out_capture = sv_newmortal();
1001 }
1002 }
1003
1004 return offset;
1005 }
1006 }
1007
1008 /* it's not in this pad - try above */
1009
1010 if (!CvOUTSIDE(cv))
1011 return NOT_IN_PAD;
1012
1013 /* out_capture non-null means caller wants us to capture lex; in
1014 * addition we capture ourselves unless it's an ANON/format */
1015 new_capturep = out_capture ? out_capture :
1016 CvLATE(cv) ? NULL : &new_capture;
1017
1018 offset = pad_findlex(name, CvOUTSIDE(cv), CvOUTSIDE_SEQ(cv), 1,
1019 new_capturep, out_name_sv, out_flags);
1020 if ((PADOFFSET)offset == NOT_IN_PAD)
1021 return NOT_IN_PAD;
1022
1023 /* found in an outer CV. Add appropriate fake entry to this pad */
1024
1025 /* don't add new fake entries (via eval) to CVs that we have already
1026 * finished compiling, or to undef CVs */
1027 if (CvCOMPILED(cv) || !padlist)
1028 return 0; /* this dummy (and invalid) value isnt used by the caller */
1029
1030 {
1031 /* This relies on sv_setsv_flags() upgrading the destination to the same
1032 type as the source, independent of the flags set, and on it being
1033 "good" and only copying flag bits and pointers that it understands.
1034 */
1035 SV *new_namesv = newSVsv(*out_name_sv);
1036 AV * const ocomppad_name = PL_comppad_name;
1037 PAD * const ocomppad = PL_comppad;
1038 PL_comppad_name = MUTABLE_AV(AvARRAY(padlist)[0]);
1039 PL_comppad = MUTABLE_AV(AvARRAY(padlist)[1]);
1040 PL_curpad = AvARRAY(PL_comppad);
1041
1042 new_offset
1043 = pad_add_name_sv(new_namesv,
1044 (SvPAD_STATE(*out_name_sv) ? padadd_STATE : 0),
1045 SvPAD_TYPED(*out_name_sv)
1046 ? SvSTASH(*out_name_sv) : NULL,
1047 SvOURSTASH(*out_name_sv)
1048 );
1049
1050 SvFAKE_on(new_namesv);
1051 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1052 "Pad addname: %ld \"%.*s\" FAKE\n",
1053 (long)new_offset,
1054 (int) SvCUR(new_namesv), SvPVX(new_namesv)));
1055 PARENT_FAKELEX_FLAGS_set(new_namesv, *out_flags);
1056
1057 PARENT_PAD_INDEX_set(new_namesv, 0);
1058 if (SvPAD_OUR(new_namesv)) {
1059 NOOP; /* do nothing */
1060 }
1061 else if (CvLATE(cv)) {
1062 /* delayed creation - just note the offset within parent pad */
1063 PARENT_PAD_INDEX_set(new_namesv, offset);
1064 CvCLONE_on(cv);
1065 }
1066 else {
1067 /* immediate creation - capture outer value right now */
1068 av_store(PL_comppad, new_offset, SvREFCNT_inc(*new_capturep));
1069 DEBUG_Xv(PerlIO_printf(Perl_debug_log,
1070 "Pad findlex cv=0x%"UVxf" saved captured sv 0x%"UVxf" at offset %ld\n",
1071 PTR2UV(cv), PTR2UV(*new_capturep), (long)new_offset));
1072 }
1073 *out_name_sv = new_namesv;
1074 *out_flags = PARENT_FAKELEX_FLAGS(new_namesv);
1075
1076 PL_comppad_name = ocomppad_name;
1077 PL_comppad = ocomppad;
1078 PL_curpad = ocomppad ? AvARRAY(ocomppad) : NULL;
1079 }
1080 return new_offset;
1081 }
It seems it has to do with if the containing pad is held within a CV or not, but I am not sure of the exact specifics.
Related
Find the Median of a list<int> in Dart
I have a list of integers which contains times in milliseconds (ex. 1433, 834, 1020..). I need to calculate the Median. I developed the following code but the Median I get is completely wrong compared to the one I calculate in Excel. Any ideas? is there any Dart/flutter library I could use for statistics? /// Calculate median static int calculateMedian(TimeRecordNotifier timeRecordNotifier) { List<int> mList = List(); timeRecordNotifier.timeRecords.forEach((element) { mList.add(element.partialTime); }); //clone list List<int> clonedList = List(); clonedList.addAll(mList); int median; //sort list clonedList.sort((a, b) => a.compareTo(b)); if (clonedList.length == 1) median = mList[clonedList.length - 1]; else if (clonedList.length % 2 == 1) median = mList[(((clonedList.length) / 2) - 1).round()]; else { int lower = mList[((clonedList.length ~/ 2) - 1)]; int upper = mList[(clonedList.length ~/ 2)]; median = ((lower + upper) / 2.0).round(); } return median; } On the following dataset the expected median value is 901,5, however this algorithm gives me 461 131 144 203 206 241 401 415 427 439 439 452 455 456 469 471 471 483 483 491 495 495 502 505 512 521 522 523 547 551 561 610 727 745 777 790 793 892 911 924 943 957 977 978 989 992 1008 1024 1039 1070 1074 1092 1115 1139 1155 1159 1174 1176 1194 1203 1208 1227 1228 1248 1270 1271 1272 1273 1276 1284 1290 1294 1439 1740 1786
I refactored the code into this using NumDart implementation and now it works. thanks #MartinM for you comment! /// Calculate median static int calculateMedian(TimeRecordNotifier timeRecordNotifier) { List<int> mList = List(); timeRecordNotifier.timeRecords.forEach((element) { mList.add(element.partialTime); }); //clone list List<int> clonedList = List(); clonedList.addAll(mList); //sort list clonedList.sort((a, b) => a.compareTo(b)); int median; int middle = clonedList.length ~/ 2; if (clonedList.length % 2 == 1) { median = clonedList[middle]; } else { median = ((clonedList[middle - 1] + clonedList[middle]) / 2.0).round(); } return median; }
Parsing unformatted log file and exporting it into CSV
I have tried couple of things, didn't tried using regex bcoz I am not good with this. The log file looks exactly like this. timestamp : 2018121 streams : Total : 579 461 0 0 24 80 0 ABC : 630 A-1 : 98 B-2 : 87 C-3 : 0 timestamp : 2018127 stream : Total : 476 372 0 0 20 74 0 10 0 ABC : 511 B-2 : 77 C-3 : 0 D-4: 86 timestamp : 2018128 stream : Total : 76 37 0 0 20 74 0 10 0 ABC : 517 A-1 : 74 C-3 : 9 D-4 : 18 I am trying to export in csv in a transpose manner. For streams I just want to export only the first value. timestamp streams ABC A-1 B-2 C-3 D-4 2018121 579 630 98 87 0 NULL 2018127 476 511 NULL 77 0 186 2018128 76 517 74 NULL 9 18
Hi i think you have to perform your proper logic code because your file was soo tipycal i have work around 10 minutes you have this result it's small code snapp i have done some change in input because you have in line streams and in other stream ... and in line ' ' and in other ' ' ? soo i think you have a issues in your log generator. Input : timestamp : 2018121 streams : Total : 579 461 0 0 24 80 0 ABC : 630 A-1 : 98 B-2 : 87 C-3 : 0 timestamp : 2018127 stream : Total : 476 372 0 0 20 74 0 10 0 ABC : 511 B-2 : 77 C-3 : 0 D-4: 86 timestamp : 2018128 stream : Total : 76 37 0 0 20 74 0 10 0 ABC : 517 A-1 : 74 C-3 : 9 D-4 : 18 Some Code : $fileContent = Get-Content "C:\Temp\logTest.log" $resultTab = #(); $beginIdentifierRows = "timestamp".ToLower(); for($i = 0; $i -lt $fileContent.Length; $i++){ if($fileContent[$i].ToLower().StartsWith($beginIdentifierRows)){ #Read all rows value strams to D-4 or other $A1 = "NULL"; $B2 = "NULL"; $C3 = "NULL"; $D4 = "NULL"; $streams= "NULL"; $ABC = "NULL"; $timestamp = $fileContent[$i].Split(":")[1]; # Write-Host $fileContent[$i]; $jj = 0; for($j = $i + 1; $j -lt ($i + 6); $j++){ $lineContentJ = $fileContent[$j].Replace(" "," ").Replace(" "," ").Replace(" "," ").Replace(" "," ").Replace(" "," "); # $lineContentJ switch -Wildcard ($lineContentJ) { "ABC *"{ # streams todo $ABC = $lineContentJ.Split(":")[1]; break; } "stream*"{ # streams todo $streams = $lineContentJ.Split(":")[2].Split(" ")[1]; break; } "A-1 *"{ # A-1 todo $A1 = $lineContentJ.Split(":")[1]; break; } "B-2 *"{ # B-2 todo $B2 = $lineContentJ.Split(":")[1]; break; } "C-3 *"{ # C-3 todo $C3 = $lineContentJ.Split(":")[1]; break; } "D-4 *"{ # D-4 todo $D4 = $lineContentJ.Split(":")[1]; break; } }$jj = $j; } $i=$jj; $array_name = [pscustomobject]#{timestamp = $timestamp; streams = $streams; ABC = $ABC; "A-1" = $A1; "B-2"=$B2; "C-3" = $C3; "D-4"=$D4} $resultTab += $array_name; } #else { #Do nothing #} } $resultTab | ft; RESULT : timestamp streams ABC A-1 B-2 C-3 D-4 --------- ------- --- --- --- --- --- 2018121 579 630 98 87 0 NULL 2018127 476 511 NULL 77 0 86 2018128 76 517 74 NULL 9 18
SVD on a non-square matrix using LAPACK dgesvd_
I have to compute SVD on a non-square matrix. I am using LAPACK's dgesvd_ routine for that. I have no problems with a square matrix, for which I receive expected values, compared with MATLAB. But I cannot produce expected results for a 4x5 matrix. I know the solution should match that of MATLAB since the singular values returned are sorted in descending order. I can see though that some of singular values can be found in original A input array to SVD. That indicates I must call dgesvd_ wrong or I refer incorrectly to the results, this might have to do with leading array dimensions. In each case I first issue a call with LWORK = -1, querying LAPACK for optimal values, which are next input to the following call to compute SVD. I am not sure about all the meaning of the returned values and if they are valid, if they should be changed, etc. I assume they are OK, so I use them in a following call to compute SVD. So this code works as expected (3x3 matrix): 41 /* Reference data. */ 42 double ref_array_A[3][3] = { 43 { 1, 2, 3}, 44 { 2, 4, 5 }, 45 { 3, 5, 6 } 46 }; 47 48 double ref_array_U[3][3] = { 49 { -0.327985, -0.736976, -0.591009 }, 50 { -0.591009, -0.327985, 0.736976 }, 51 { -0.736976, 0.591009, -0.327985 } 52 }; 53 54 double ref_array_Sigma[3][1] = { 55 { 11.344814 }, 56 { 0.515729 }, 57 { 0.170915 } 58 }; 59 60 double ref_array_VT[3][3] = { 61 { -0.327985, -0.591009, -0.736976 }, 62 { 0.736976, 0.327985, -0.591009 }, 63 { -0.591009, 0.736976, -0.327985 } 64 }; 66 /* MATLAB result 67 * 68 * >> A = [ 1, 2, 3; 2, 4, 5; 3, 5, 6] 69 * 70 * A = 71 * 1 2 3 72 * 2 4 5 73 * 3 5 6 74 * 75 * >> [U, S, V] = svd(A) 76 * 77 * U = 78 * -0.3280 -0.7370 -0.5910 79 * -0.5910 -0.3280 0.7370 80 * -0.7370 0.5910 -0.3280 81 * 82 * S = 83 * 11.3448 0 0 84 * 0 0.5157 0 85 * 0 0 0.1709 86 * 87 * V = 88 * -0.3280 0.7370 -0.5910 89 * -0.5910 0.3280 0.7370 90 * -0.7370 -0.5910 -0.3280 91 */ double WORK_QUERY = 0; 206 207 208 /* Call dgesvd_ with lwork = -1 to query optimal workspace size. */ 209 210 JOBU = 'A'; 211 JOBVT = 'A'; 212 M = 3; 213 N = 3; 214 LDA = 3; /* (out) */ 215 LDU = 3; /* (out) */ 216 S = NULL; /* (don't care) */ 217 U = NULL; /* (don't care) */ 218 VT = NULL; /* (don't care) */ 219 LDVT = 3; /* (out) */ 220 WORK = NULL; /* (out) , because LWORK is 0 do not care */ 221 LWORK = 4 * M * N * M *N + 6 * M * N + dd_max(M, N); 222 223 A = calloc(M * N, sizeof(double)); 224 if (!A) { 225 goto ddt2_fail_sys; 226 } 227 for (i = 0; i < M; ++i) { 228 for (j = 0; j < N; ++j) { 229 A[i * N + j] = ref_array_A[i][j]; 230 } 231 } 232 233 S = calloc(dd_min(M, N), sizeof(double)); 234 if (!S) { 235 goto ddt2_fail_sys; 236 } 237 238 U = calloc(LDU * M, sizeof(double)); 239 if (!U) { 240 goto ddt2_fail_sys; 241 } 242 243 VT = calloc(LDVT * N, sizeof(double)); 244 if (!A) { 245 goto ddt2_fail_sys; 246 } 247 248 fprintf(stderr, "Reference array A:\n"); 249 dd_walk_dbl_arr_rowwise(A, M, N, cb_dbl, cb_dbl_row_end); 250 251 fprintf(stderr, "Reference array U:\n"); 252 dd_walk_dbl_arr_rowwise(&ref_array_U[0][0], M, M, cb_dbl, cb_dbl_row_end); 253 254 fprintf(stderr, "Reference array Sigma:\n"); 255 dd_walk_dbl_arr_rowwise(&ref_array_Sigma[0][0], dd_min(M, N), 1, cb_dbl, cb_dbl_row_end); 256 257 fprintf(stderr, "Reference array VT:\n"); 258 dd_walk_dbl_arr_rowwise(&ref_array_VT[0][0], N, N, cb_dbl, cb_dbl_row_end); LWORK = -1; 261 dgesvd_("A", "A", &M, &N, A, &LDA, S, U, &LDU, VT, &LDVT, &WORK_QUERY, &LWORK, &INFO); 262 if (INFO != 0) { 263 if (INFO < 0) { 264 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"the %d-th argument had illegal value\"\n", INFO); 265 } else { 266 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"DBDSDC didn't converge, updating process failed\"\n"); 267 } 268 return -1; 269 } 270 271 LWORK = (int) WORK_QUERY; 272 WORK = calloc(LWORK, sizeof(double)); 273 if (!WORK) { 274 goto ddt2_fail_sys; 275 } 276 277 fprintf(stderr, "LAPACK's dgesvd_ query optimal results: LDA %d, LDU %d, LDVT %d, LWORK %d, WORK_QUERY %f\n", LDA, LDU, LDVT, LWORK, WORK_QUERY); 278 fprintf(stderr, "Rest of params: M %d, N %d\n", M, N); 279 280 /* Compute SVD. */ 281 dgesvd_(&JOBU, &JOBVT, &M, &N, A, &LDA, S, U, &LDU, VT, &LDVT, WORK, &LWORK, &INFO); 282 if (INFO != 0) { 283 if (INFO < 0) { 284 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"the %d-th argument had illegal value\"\n", INFO); 285 } else { 286 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"DBDSDC didn't converge, updating process failed\"\n"); 287 } 288 return -1; 289 } 290 291 fprintf(stderr, "LAPACK's dgesvd_ SVD completed\n"); 292 293 fprintf(stderr, "Result A:\n"); 294 dd_walk_dbl_arr_rowwise(A, M, N, cb_dbl, cb_dbl_row_end); 295 296 fprintf(stderr, "Result U**T:\n"); 297 dd_walk_dbl_arr_rowwise(U, LDU, M, cb_dbl, cb_dbl_row_end); 298 fprintf(stderr, "Result U:\n"); 299 dd_walk_dbl_arr_colwise(U, LDU, M, cb_dbl, cb_dbl_row_end); 300 301 302 fprintf(stderr, "Result S:\n"); 303 dd_walk_dbl_arr_rowwise(S, dd_min(M, N), 1, cb_dbl, cb_dbl_row_end); 304 305 fprintf(stderr, "Result VT:\n"); 306 dd_walk_dbl_arr_rowwise(VT, LDVT, N, cb_dbl, cb_dbl_row_end); 307 308 free(WORK); 309 free(A); 310 free(S); 311 free(U); 312 free(VT); 313 314 return 0; Proper result: peter#xx:~$ ./test4 Reference array A: 1.000000 2.000000 3.000000 2.000000 4.000000 5.000000 3.000000 5.000000 6.000000 Reference array U: -0.327985 -0.736976 -0.591009 -0.591009 -0.327985 0.736976 -0.736976 0.591009 -0.327985 Reference array Sigma: 11.344814 0.515729 0.170915 Reference array VT: -0.327985 -0.591009 -0.736976 0.736976 0.327985 -0.591009 -0.591009 0.736976 -0.327985 LAPACK's dgesvd_ query optimal results: LDA 3, LDU 3, LDVT 3, LWORK 201, WORK_QUERY 201.000000 Rest of params: M 3, N 3 LAPACK's dgesvd_ SVD completed Result A: -3.741657 0.421793 0.632690 10.643576 1.261481 -0.720622 0.478213 -0.279401 -0.211863 Result U**T: -0.327985 -0.591009 -0.736976 -0.736976 -0.327985 0.591009 -0.591009 0.736976 -0.327985 Result U: -0.327985 -0.736976 -0.591009 -0.591009 -0.327985 0.736976 -0.736976 0.591009 -0.327985 Result S: 11.344814 0.515729 0.170915 Result VT: -0.327985 0.736976 -0.591009 -0.591009 0.327985 0.736976 -0.736976 -0.591009 -0.327985 But not this (4x5 matrix): 39 /* Reference data. */ 40 double ref_array_A[4][5] = { 41 { 1, 0, 0, 0, 2 }, 42 { 0, 0, 3, 0, 0 }, 43 { 0, 0, 0, 0, 0 }, 44 { 0, 2, 0, 0, 0 } 45 }; 46 47 double ref_array_U[4][4] = { 48 { 0, 0, 1, 0 }, 49 { 0, 1, 0, 0 }, 50 { 0, 0, 0, -1 }, 51 { 1, 0, 0, 0 } 52 }; 53 54 double ref_array_Sigma[4][5] = { 55 { 2, 0, 0, 0, 0 }, 56 { 0, 3, 0, 0, 0 }, 57 { 0, 0, 2.236068, 0, 0 }, 58 { 0, 0, 0, 0, 0 } 59 }; 60 61 double ref_array_VT[5][5] = { 62 { 0, 1, 0, 0, 0 }, 63 { 0, 0, 1, 0, 0 }, 64 { 0.447214, 0, 0, 0, 0.894427 }, 65 { 0, 0, 0, 1, 0 }, 66 { -0.894427, 0, 0, 0, -0.447214 } 67 }; 68 69 /* MATLAB result 70 * 71 * >> A = [ 1 0 0 0 2; 0 0 3 0 0 ; 0 0 0 0 0 ;0 2 0 0 0 ]; 72 * >> [U, S, V] = svd(A) 73 * 74 * U = 75 * 0 1 0 0 76 * 1 0 0 0 77 * 0 0 0 -1 78 * 0 0 1 0 79 * 80 * S = 81 * 3.0000 0 0 0 0 82 * 0 2.2361 0 0 0 83 * 0 0 2.0000 0 0 84 * 0 0 0 0 0 85 * 86 * V = 87 * 0 0.4472 0 0 -0.8944 88 * 0 0 1.0000 0 0 89 * 1.0000 0 0 0 0 90 * 0 0 0 1.0000 0 91 * 0 0.8944 0 0 0.4472 92 */ double WORK_QUERY = 0; 206 207 208 /* Call dgesvd_ with lwork = -1 to query optimal workspace size. */ 209 210 JOBU = 'A'; 211 JOBVT = 'A'; 212 M = 4; 213 N = 5; 214 LDA = 4; /* (out) */ 215 LDU = 4; /* (out) */ 216 S = NULL; /* (don't care) */ 217 U = NULL; /* (don't care) */ 218 VT = NULL; /* (don't care) */ 219 LDVT = 5; /* (out) */ 220 WORK = NULL; /* (out) , because LWORK is 0 do not care */ 221 LWORK = 4 * M * N * M *N + 6 * M * N + dd_max(M, N); 222 223 A = calloc(M * N, sizeof(double)); 224 if (!A) { 225 goto ddt2_fail_sys; 226 } 227 for (i = 0; i < M; ++i) { 228 for (j = 0; j < N; ++j) { 229 A[i * N + j] = ref_array_A[i][j]; 230 } 231 } 232 233 S = calloc(M * N, sizeof(double)); 234 if (!S) { 235 goto ddt2_fail_sys; 236 } 237 238 U = calloc(LDU * M, sizeof(double)); 239 if (!U) { 240 goto ddt2_fail_sys; 241 } 242 243 VT = calloc(LDVT * N, sizeof(double)); 244 if (!A) { 245 goto ddt2_fail_sys; 246 } 247 248 fprintf(stderr, "Reference array A:\n"); 249 dd_walk_dbl_arr_rowwise(A, M, N, cb_dbl, cb_dbl_row_end); 250 251 fprintf(stderr, "Reference array U:\n"); 252 dd_walk_dbl_arr_rowwise(&ref_array_U[0][0], M, M, cb_dbl, cb_dbl_row_end); 253 254 fprintf(stderr, "Reference array Sigma:\n"); 255 dd_walk_dbl_arr_rowwise(&ref_array_Sigma[0][0], M, N, cb_dbl, cb_dbl_row_end); 256 257 fprintf(stderr, "Reference array VT:\n"); 258 dd_walk_dbl_arr_rowwise(&ref_array_VT[0][0], N, N, cb_dbl, cb_dbl_row_end); 259 260 LWORK = -1; 261 dgesvd_("A", "A", &M, &N, A, &LDA, S, U, &LDU, VT, &LDVT, &WORK_QUERY, &LWORK, &INFO); if (INFO != 0) { 263 if (INFO < 0) { 264 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"the %d-th argument had illegal value\"\n", INFO); 265 } else { 266 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"DBDSDC didn't converge, updating process failed\"\n"); 267 } 268 return -1; 269 } 270 271 LWORK = (int) WORK_QUERY; 272 WORK = calloc(LWORK, sizeof(double)); 273 if (!WORK) { 274 goto ddt2_fail_sys; 275 } 276 277 fprintf(stderr, "LAPACK's dgesvd_ query optimal results: LDA %d, LDU %d, LDVT %d, LWORK %d, WORK_QUERY %f\n", LDA, LDU, LDVT, LWORK, WORK_QUERY); 278 fprintf(stderr, "Rest of params: M %d, N %d\n", M, N); 279 280 /* Compute SVD. */ 281 dgesvd_(&JOBU, &JOBVT, &M, &N, A, &LDA, S, U, &LDU, VT, &LDVT, WORK, &LWORK, &INFO); 282 if (INFO != 0) { 283 if (INFO < 0) { 284 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"the %d-th argument had illegal value\"\n", INFO); 285 } else { 286 fprintf(stderr, "Error on LAPACK's dgesvd_ query: \"DBDSDC didn't converge, updating process failed\"\n"); 287 } 288 return -1; 289 } 290 291 fprintf(stderr, "LAPACK's dgesvd_ SVD completed\n"); 292 293 fprintf(stderr, "Result A:\n"); 294 dd_walk_dbl_arr_rowwise(A, M, N, cb_dbl, cb_dbl_row_end); 295 296 fprintf(stderr, "Result U:\n"); 297 dd_walk_dbl_arr_rowwise(U, LDU, M, cb_dbl, cb_dbl_row_end); 298 299 fprintf(stderr, "Result S:\n"); 300 dd_walk_dbl_arr_rowwise(S, M, N, cb_dbl, cb_dbl_row_end); 301 302 fprintf(stderr, "Result VT:\n"); 303 dd_walk_dbl_arr_rowwise(VT, LDVT, N, cb_dbl, cb_dbl_row_end); 304 305 free(WORK); 306 free(A); 307 free(S); 308 free(U); 309 free(VT); 310 311 return 0; Bad result: peter#xx:~/$ ./test2 Reference array A: 1.000000 0.000000 0.000000 0.000000 2.000000 0.000000 0.000000 3.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 2.000000 0.000000 0.000000 0.000000 Reference array U: 0.000000 0.000000 1.000000 0.000000 0.000000 1.000000 0.000000 0.000000 0.000000 0.000000 0.000000 -1.000000 1.000000 0.000000 0.000000 0.000000 Reference array Sigma: 2.000000 0.000000 0.000000 0.000000 0.000000 0.000000 3.000000 0.000000 0.000000 0.000000 0.000000 0.000000 2.236068 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 Reference array VT: 0.000000 1.000000 0.000000 0.000000 0.000000 0.000000 0.000000 1.000000 0.000000 0.000000 0.447214 0.000000 0.000000 0.000000 0.894427 0.000000 0.000000 0.000000 1.000000 0.000000 -0.894427 0.000000 0.000000 0.000000 -0.447214 LAPACK's dgesvd_ query optimal results: LDA 4, LDU 4, LDVT 5, LWORK 300, WORK_QUERY 300.000000 Rest of params: M 4, N 5 LAPACK's dgesvd_ SVD completed Result A: -3.000000 -2.000000 0.000000 -1.000000 0.500000 -2.236068 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.500000 -0.236068 0.000000 0.000000 Result U: 0.707107 0.000000 0.000000 0.707107 -0.707107 0.000000 -0.000000 0.707107 0.000000 0.000000 1.000000 0.000000 0.000000 1.000000 0.000000 0.000000 Result S: 3.872983 1.732051 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 Result VT: 0.182574 -0.408248 0.000000 0.000000 -0.894427 0.912871 0.408248 0.000000 0.000000 0.000000 -0.000000 -0.000000 1.000000 0.000000 0.000000 -0.000000 -0.000000 0.000000 1.000000 0.000000 0.365148 -0.816497 0.000000 0.000000 0.447214 What do I do wrong in general matrix case?
The function dgesvd_ expects the matrices in column-major order, while your code supplies the data in row-major style: 227 for (i = 0; i < M; ++i) { 228 for (j = 0; j < N; ++j) { 229 A[i * N + j] = ref_array_A[i][j]; 230 } 231 } Effectively, your code is thus calculating SVD of [ 1 2 0 0 2 ] [ 1 0 0 0 ] ^ T [ 0 0 0 0 0 ] = [ 2 0 0 3 ] [ 0 0 0 0 0 ] [ 0 0 0 0 ] [ 0 3 0 0 0 ] [ 2 0 0 0 ] which indeed yields approximately 3.87, 1.73. This error does not occur in the first example since the matrix is square (M=N) and symmetric. Also, the parameter S is supposed to be just one-dimensional array (as in your first example). Since you print it then in row-major format with dd_walk_dbl_arr_rowwise(S, M, N, cb_dbl, cb_dbl_row_end);, these values appear consecutively in the first row...
Base 36 counter without I or O
we have a requirement to make our serial numbers Base 36 (0-9,A-Z). My initial thought was store the counter in decimal and convert to hex only when required for display. This makes the counting simple, however there is another requirement to not use I or O because it'll be confused with 1 and 0 on the barcodes human readable portion. This makes it a bit of a nightmare. Language is unimportant, but the counter itself will be held in SQL Server 2012+. Anyone have any experiences with this problem? Edit: I've rewritten a method I found to test in C#. It allows any string of base characters to be passed in. ie. string baseChars = "0123456789ABCDEFGHJKLMNPQRSTUVWXYZ"; It's not pretty but its a start! private string GetCustomBase(int iValue, string baseChars) { int baseNum = baseChars.Length; int value= iValue; string result = ""; while( value > 0 ) { result = baseChars[ 0 + (value % baseNum)] + result; value = value / baseNum; } return result; } private int GetDecimal(string strValue, string baseChars) { int baseNum = baseChars.Length; string strAmendedValue = strValue; int iResult = 0; //Each char one at a time (from right) for (int i = 0; i < strValue.Length; i++) { string c = strValue.Substring(strValue.Length - i -1, 1); int iPos = baseChars.IndexOf(c); //get actual value (0 = 0, A = 10 etc.) int iPowerVal = (int)Math.Pow((double)baseNum, (double)(i)); iResult = iResult + (iPowerVal * iPos); } return iResult; }
An implementation of the suggestion in the question comments. As language is unimportant, here's a Ruby version: class Integer def to_34_IO_shifted to_s(34).upcase.tr("IJKLMNOPQRSTUVWX", "JKLMNPQRSTUVWXYZ") end end class String def from_34_IO_shifted upcase.tr("JKLMNPQRSTUVWXYZIO", "IJKLMNOPQRSTUVWX10").to_i(34) end end puts 170.times.map { |x| x.to_34_IO_shifted }.join(' ') x = 73644 x34 = x.to_34_IO_shifted x10 = x34.from_34_IO_shifted puts "\n#{x} -> '#{x34}' -> #{x10}" puts "'10' -> #{'10'.from_34_IO_shifted}" puts "'IO' -> #{'IO'.from_34_IO_shifted}" Output: 0 1 2 3 4 5 6 7 8 9 A B C D E F G H J K L M N P Q R S T U V W X Y Z 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F 1G 1H 1J 1K 1L 1M 1N 1P 1Q 1R 1S 1T 1U 1V 1W 1X 1Y 1Z 20 21 22 23 24 25 26 27 28 29 2A 2B 2C 2D 2E 2F 2G 2H 2J 2K 2L 2M 2N 2P 2Q 2R 2S 2T 2U 2V 2W 2X 2Y 2Z 30 31 32 33 34 35 36 37 38 39 3A 3B 3C 3D 3E 3F 3G 3H 3J 3K 3L 3M 3N 3P 3Q 3R 3S 3T 3U 3V 3W 3X 3Y 3Z 40 41 42 43 44 45 46 47 48 49 4A 4B 4C 4D 4E 4F 4G 4H 4J 4K 4L 4M 4N 4P 4Q 4R 4S 4T 4U 4V 4W 4X 4Y 4Z 73644 -> '1VQ0' -> 73644 '10' -> 34 'IO' -> 34 EDIT: made it so that I and O are interpreted as 1 and 0, in case someone does misread it.
nrpe unable to run custom perl script: Return Code: 1, Output: NRPE: Unable to read output
I'm trying to implement a custom perl nagios script to check for rogue dhcp servers remotely with nrpe. On the central server when i run: /usr/local/nagios/libexec/check_nrpe -H 10.9.0.25 -c check_roguedhcp In my debugging logs i'm seeing this: Host is asking for command 'check_roguedhcp' to be run... Running command: sudo /usr/lib64/nagios/plugins/check_roguedhcp.pl Command completed with return code 1 and output: Return Code: 1, Output: NRPE: Unable to read output Locally if i run the script (even as the nrpe user) I get the expected output. On the local server my /etc/nagios/nrpe.cfg has the following settings: command[check_roguedhcp]=sudo /usr/lib64/nagios/plugins/check_roguedhcp.pl command[check_dhcp]=sudo /usr/lib64/nagios/plugins/check_dhcp -v nrpe_user=nrpe nrpe_group=nagios ps aux shows nrpe is running as user nrpe (nrpe is in group nagios) nrpe 5941 0.0 0.1 52804 2384 ? Ss 08:25 0:00 /usr/sbin/nrpe -c /etc/nagios/nrpe.cfg -d I've added the command to /etc/sudoers %nagios ALL=(ALL) NOPASSWD: /usr/lib/nagios64/plugins/check_dhcp, /usr/lib64/nagios/plugins/check_roguedhcp.pl on my central server that does the nrpe calls, i have the following service groups and configurations: define servicegroup{ servicegroup_name rogue_dhcp alias All dhcp monitors } define service{ name security-service servicegroups rogue_dhcp register 0 max_check_attempts 1 } Nagios can run any other check_users etc script via nrpe on this server. Here's the perl script itself, though we know that the file executes locally just fine. 1 #!/usr/bin/perl -w 2 # nagios: -epn 3 # the above makes nagios run the script separately. 4 use POSIX; 5 use lib "/usr/lib64/nagios/plugins"; 6 use utils qw(%ERRORS); 7 8 sub fail_usage { 9 if (scalar #_) { 10 print "$0: error: \n"; 11 map { print " $_\n"; } #_; 12 } 13 print "$0: Usage: \n"; 14 print "$0 [-v [-v [-v]]] [ []] \n"; 15 print "$0 [-v [-v [-v]]] [-s] [[-s] [[-s] ]] \n"; 16 print " \n"; 17 exit 3 ; 18 } 19 20 my $verbose = 0; 21 my %servers=( 22 "x", "10.x.x.x", 23 "x", "10.x.x.x", 24 "x", "10.x.x.x", 25 "x", "10.x.x.x" 26 ); 27 28 # examine commandline args 29 while ($ARGV=$ARGV[0]) { 30 my $myarg = $ARGV; 31 if ($ARGV eq '-s') { 32 shift #ARGV; 33 if (!($ARGV = $ARGV[0])) { fail_usage ("$myarg needs an argument"); } 34 if ($ARGV =~ /^-/) { fail_usage ("$myarg must be followed by an argument"); } 35 if (!defined($servers{$ARGV})) { $servers{$ARGV}=1; } 36 } 37 elsif ($ARGV eq '-v' ) { $verbose++; } 38 elsif ($ARGV eq '-h' or $ARGV eq '--help' ) { fail_usage ; } 39 elsif ($ARGV =~ /^-/ ) { fail_usage " invalid option ($ARGV)"; } 40 elsif ($ARGV =~ /^\d+\.\d+\.\d+\.\d+$/) 41 # servers should be ip addresses. I'm not doing detailed checks for this. 42 { if (!defined($servers{$ARGV})) { $servers{$ARGV}=1; } } 43 else { last; } 44 shift #ARGV; 45 } 46 # for some reason I can't test for empty ARGs in the while loop 47 #ARGV = grep {!/^\s*$/} #ARGV; 48 if (scalar #ARGV) { fail_usage "didn't understand arguments: (".join (" ",#ARGV).")"; } 49 50 my $serversn = scalar keys %servers; 51 52 if ($verbose > 2) { 53 print "verbosity=($verbose)\n"; 54 print "servers = ($serversn)\n"; 55 if ($serversn) { for my $i (keys %servers) { print "server ($i)\n"; } } 56 } 57 58 if (!$serversn) { fail_usage "no servers"; } 59 my $responses=0; 60 my $responders=""; 61 my #check_dhcp = qx{/usr/lib64/nagios/plugins/check_dhcp -v}; 62 foreach my $value (#check_dhcp) { 63 if ($value =~ /Added offer from server \# /i){ 64 $value =~ m/(\d+\.\d+\.\d+\.\d+)/i; 65 my $host = $1; 66 # we find a server in our list 67 if (defined($servers{$host})) { $responses++; $responders.="$host "; } 68 # we find a rogue DHCP server. Danger Will Robinson! 69 else { 70 print "DHCP:CRITICAL: DHCP service running on $host"; 71 exit $ERRORS{'OK'} 72 } 73 } 74 } 75 # we saw all the servers in our list. All is good. 76 if ($responses == $serversn) { 77 print "DHCP:OK: $responses of $serversn Expected Responses to DHCP Broadcast"; 78 exit $ERRORS{'OK'}; 79 } 80 # we found no DHCP responses. 81 if ($responses == 0) { 82 print "DHCP:OK: no rogue servers detected!!!!#!##"; 83 exit $ERRORS{'OK'} 84 } 85 # we found less DHCP servers than we should have. Oh Nos! 86 $responders =~ s/ $//; 87 print "DHCP:OK: $responses of $serversn Responses to DHCP Broadcast. ($responders) responded. "; 88 exit $ERRORS{'OK'}; Here's what I am seeing (of relevance) when I do an strace of the nrpe process. 955 6950 stat("/usr/lib64/nagios/plugins/check_roguedhcp.pl", {st_mode=S_IFREG|S_ISUID|S_ISGID|0755, st_size=2799, ...}) = 0 956 6950 setresuid(4294967295, 4294967295, 4294967295) = 0 957 6950 setresgid(4294967295, 536347864, 4294967295) = 0 958 6950 setgroups(3, [536347864, 536347137, 536353632]) = 0 959 6950 open("/dev/tty", O_RDWR|O_NOCTTY) = -1 ENXIO (No such device or address) 960 6950 socket(PF_NETLINK, SOCK_RAW, 9) = 3 961 6950 fcntl(3, F_SETFD, FD_CLOEXEC) = 0 962 6950 fcntl(3, F_SETFD, FD_CLOEXEC) = 0 963 6950 ioctl(0, SNDCTL_TMR_TIMEBASE or TCGETS, 0x7fff3de81ac0) = -1 ENOTTY (Inappropriate ioctl for device) 964 6950 ioctl(1, SNDCTL_TMR_TIMEBASE or TCGETS, 0x7fff3de81ac0) = -1 EINVAL (Invalid argument) 965 6950 ioctl(2, SNDCTL_TMR_TIMEBASE or TCGETS, 0x7fff3de81ac0) = -1 ENOTTY (Inappropriate ioctl for device) 966 6950 getcwd("/", 4096) = 2 967 6950 sendto(3, "d\0\0\0c\4\5\0\1\0\0\0\0\0\0\0cwd=\"/\" cmd=\"/us"..., 100, 0, {sa_family=AF_NETLINK, pid=0, groups=00000000}, 12) = 100 968 6950 poll([{fd=3, events=POLLIN}], 1, 500) = 1 ([{fd=3, revents=POLLIN}]) 969 6950 recvfrom(3, "$\0\0\0\2\0\0\0\1\0\0\0&\33\0\0\0\0\0\0d\0\0\0c\4\5\0\1\0\0\0"..., 8988, MSG_PEEK|MSG_DONTWAIT, {sa_family=AF_NE TLINK, pid=0, groups=00000000}, [12]) = 36 970 6950 recvfrom(3, "$\0\0\0\2\0\0\0\1\0\0\0&\33\0\0\0\0\0\0d\0\0\0c\4\5\0\1\0\0\0"..., 8988, MSG_DONTWAIT, {sa_family=AF_NETLINK, pi d=0, groups=00000000}, [12]) = 36 971 6950 write(2, "sudo", 4) = 4 972 6950 write(2, ": ", 2) = 2 973 6950 write(2, "sorry, you must have a tty to ru"..., 38) = 38 974 6950 write(2, "\n", 1) = 1 975 6950 setresuid(4294967295, 4294967295, 4294967295) = 0 976 6950 setresgid(4294967295, 4294967295, 4294967295) = 0 977 6950 exit_group(1) = ? 978 6949 <... read resumed> "", 4096) = 0 979 6949 --- SIGCHLD (Child exited) # 0 (0) --- 980 6949 close(5) = 0 981 6949 wait4(6950, [{WIFEXITED(s) && WEXITSTATUS(s) == 1}], 0, NULL) = 6950 970 6950 recvfrom(3, "$\0\0\0\2\0\0\0\1\0\0\0&\33\0\0\0\0\0\0d\0\0\0c\4\5\0\1\0\0\0"..., 8988, MSG_DONTWAIT, {sa_family=AF_NETLINK, pi d=0, groups=00000000}, [12]) = 36 971 6950 write(2, "sudo", 4) = 4 972 6950 write(2, ": ", 2) = 2 973 6950 write(2, "sorry, you must have a tty to ru"..., 38) = 38 974 6950 write(2, "\n", 1) = 1 975 6950 setresuid(4294967295, 4294967295, 4294967295) = 0 976 6950 setresgid(4294967295, 4294967295, 4294967295) = 0 977 6950 exit_group(1) = ?
This was solved by adding the following to /etc/sudoers Defaults:nagios !requiretty
in my case i have resolved changing permissions of scripts file under /nagios/libexec/ do not work with root:root and WORK with nagios:nagios user permission!
I changed permission of my specific script on libexec folder to allow the "Other" (non-root users) to execute it chmod 755 myfile.pl, and it worked well.