/
workunit.cpp
14746 lines (13327 loc) · 482 KB
/
workunit.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*##############################################################################
HPCC SYSTEMS software Copyright (C) 2012 HPCC Systems®.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
############################################################################## */
#include <string>
#include <unordered_set>
#include "jlib.hpp"
#include "jcontainerized.hpp"
#include "workunit.hpp"
#include "jprop.hpp"
#include "jmisc.hpp"
#include "jexcept.hpp"
#include "jiter.ipp"
#include "jptree.hpp"
#include "jtime.ipp"
#include "jencrypt.hpp"
#include "junicode.hpp"
#include "jlzw.hpp"
#include "jregexp.hpp"
#include "eclrtl.hpp"
#include "deftype.hpp"
#include <time.h>
#include "mpbase.hpp"
#include "daclient.hpp"
#include "dadfs.hpp"
#include "dafdesc.hpp"
#include "dasds.hpp"
#include "danqs.hpp"
#include "dautils.hpp"
#include "dllserver.hpp"
#include "thorplugin.hpp"
#include "thorhelper.hpp"
#include "workflow.hpp"
#include "nbcd.hpp"
#include "seclib.hpp"
#include "wuerror.hpp"
#include "wujobq.hpp"
#ifndef _CONTAINERIZED
#include "environment.hpp"
#endif
#include "daqueue.hpp"
#include "workunit.ipp"
#include "digisign.hpp"
#include <list>
#include <string>
#include <algorithm>
using namespace cryptohelper;
static int workUnitTraceLevel = 1;
static StringBuffer &getXPath(StringBuffer &wuRoot, const char *wuid)
{
// MORE - can fold in the date
return wuRoot.append("/WorkUnits/").append(wuid);
}
//To be called by eclserver, but esp etc. won't know, so we need to store it.
static StringBuffer & appendLibrarySuffix(StringBuffer & suffix)
{
#ifdef _WIN32
suffix.append("W");
#else
suffix.append("L");
#endif
#ifdef __64BIT__
suffix.append("64");
#else
suffix.append("32");
#endif
return suffix;
}
typedef MapStringTo<bool> UniqueScopes;
static void wuAccessError(const char *username, const char *action, const char *wuscope, const char *wuid, bool excpt, bool log)
{
StringBuffer err;
err.append("Workunit Access Denied - action: ").append(action).append(" user:").append(username ? username : "<Unknown>");
if (wuid)
err.append(" workunit:").append(wuid);
if (wuscope)
err.append(" scope:").append(wuscope);
//MORE - we would need more information passed in from outside if we want to make the audit message format the same as from higher level ESP calls
SYSLOG(AUDIT_TYPE_ACCESS_FAILURE, err.str());
if (log)
LOG(MCuserError, "%s", err.str());
if (excpt)
throw MakeStringException(WUERR_AccessError, "%s", err.str());
}
static bool checkWuScopeSecAccess(const char *wuscope, ISecManager *secmgr, ISecUser *secuser, int required, const char *action, bool excpt, bool log)
{
if (!secmgr || !secuser)
return true;
bool ret = secmgr->authorizeEx(RT_WORKUNIT_SCOPE, *secuser, wuscope)>=required;
if (!ret && (log || excpt))
wuAccessError(secuser->getName(), action, wuscope, NULL, excpt, log);
return ret;
}
static bool checkWuScopeListSecAccess(const char *wuscope, ISecResourceList *scopes, int required, const char *action, bool excpt, bool log)
{
if (!scopes)
return true;
bool ret=true;
if (wuscope)
{
Owned<ISecResource> res=scopes->getResource(wuscope);
if (!res || res->getAccessFlags()<required)
ret=false;
}
else
{
for (unsigned seq=0; ret && seq<scopes->count(); seq++)
{
ISecResource *res=scopes->queryResource(seq);
if (res && res->getAccessFlags()<required)
return false;
}
}
if (!ret && (log || excpt))
wuAccessError(NULL, action, wuscope, NULL, excpt, log);
return ret;
}
static bool checkWuSecAccess(IConstWorkUnit &cw, ISecManager *secmgr, ISecUser *secuser, int required, const char *action, bool excpt, bool log)
{
if (!secmgr || !secuser)
return true;
bool ret=secmgr->authorizeEx(RT_WORKUNIT_SCOPE, *secuser, cw.queryWuScope())>=required;
if (!ret && (log || excpt))
{
wuAccessError(secuser->getName(), action, cw.queryWuScope(), cw.queryWuid(), excpt, log);
}
return ret;
}
static bool checkWuSecAccess(const char *wuid, ISecManager *secmgr, ISecUser *secuser, int required, const char *action, bool excpt, bool log)
{
if (!secmgr || !secuser)
return true;
Owned<IWorkUnitFactory> factory = getWorkUnitFactory();
Owned<IConstWorkUnit> cw = factory->openWorkUnit(wuid);
bool ret=secmgr->authorizeEx(RT_WORKUNIT_SCOPE, *secuser, cw->queryWuScope())>=required;
if (!ret && (log || excpt))
{
wuAccessError(secuser->getName(), action, cw->queryWuScope(), cw->queryWuid(), excpt, log);
}
return ret;
}
void doDescheduleWorkkunit(char const * wuid)
{
StringBuffer xpath;
xpath.append("*/*/*/");
ncnameEscape(wuid, xpath);
Owned<IRemoteConnection> conn = querySDS().connect("/Schedule", myProcessSession(), RTM_LOCK_WRITE, SDS_LOCK_TIMEOUT);
if(!conn) return;
Owned<IPropertyTree> root = conn->getRoot();
bool more;
do more = root->removeProp(xpath.str()); while(more);
}
//======================================================
/*
* Graph progress support
*/
CWuGraphStats::CWuGraphStats(StatisticCreatorType _creatorType, const char * _creator, unsigned wfid, const char * _rootScope, unsigned _id, bool _merge)
: creatorType(_creatorType), creator(_creator), id(_id), merge(_merge)
{
StatsScopeId graphScopeId;
verifyex(graphScopeId.setScopeText(_rootScope));
StatsScopeId wfScopeId(SSTworkflow,wfid);
collector.setown(createStatisticsGatherer(_creatorType, _creator, wfScopeId));
collector->beginScope(graphScopeId);
}
void CWuGraphStats::beforeDispose()
{
collector->endScope();
StringBuffer tag;
tag.append("sg").append(id);
IPropertyTree &progress = queryProgressTree();
if (merge && progress.hasProp(tag))
{
VStringBuffer statsPath("%s/Stats", tag.str());
MemoryBuffer compressed;
progress.getPropBin(statsPath, compressed);
if (compressed.length())
{
MemoryBuffer serialized;
decompressToBuffer(serialized, compressed);
Owned<IStatisticCollection> prevCollection = createStatisticCollection(serialized);
prevCollection->mergeInto(*collector);
}
}
Owned<IStatisticCollection> stats = collector->getResult();
MemoryBuffer compressed;
{
MemoryBuffer serialized;
serializeStatisticCollection(serialized, stats);
compressToBuffer(compressed, serialized.length(), serialized.toByteArray());
}
unsigned minActivity = 0;
unsigned maxActivity = 0;
stats->getMinMaxActivity(minActivity, maxActivity);
//Replace the particular subgraph statistics added by this creator
IPropertyTree * subgraph = progress.setPropTree(tag);
subgraph->setProp("@c", queryCreatorTypeName(creatorType));
subgraph->setProp("@creator", creator);
subgraph->setPropInt("@minActivity", minActivity);
subgraph->setPropInt("@maxActivity", maxActivity);
subgraph->setPropBin("Stats", compressed.length(), compressed.toByteArray());
if (!progress.getPropBool("@stats", false))
progress.setPropBool("@stats", true);
}
IStatisticGatherer & CWuGraphStats::queryStatsBuilder()
{
return *collector;
}
class CConstGraphProgress : public CInterface, implements IConstWUGraphProgress
{
public:
IMPLEMENT_IINTERFACE;
CConstGraphProgress(const char *_wuid, const char *_graphName, IPropertyTree *_progress) : wuid(_wuid), graphName(_graphName), progress(_progress)
{
if (!progress)
progress.setown(createPTree());
formatVersion = progress->getPropInt("@format", PROGRESS_FORMAT_V);
}
virtual IPropertyTree * getProgressTree(bool doFormat) override
{
if (progress->getPropBool("@stats"))
return createProcessTreeFromStats(doFormat); // Should we cache that?
return LINK(progress);
}
virtual unsigned queryFormatVersion()
{
return formatVersion;
}
protected:
CConstGraphProgress(const char *_wuid, const char *_graphName) : wuid(_wuid), graphName(_graphName)
{
formatVersion = PROGRESS_FORMAT_V;
}
static void expandStats(IPropertyTree * target, IStatisticCollection & collection, bool doFormat)
{
StringBuffer formattedValue;
unsigned numStats = collection.getNumStatistics();
for (unsigned i=0; i < numStats; i++)
{
StatisticKind kind;
unsigned __int64 value;
collection.getStatistic(kind, value, i);
if (doFormat)
{
formatStatistic(formattedValue.clear(), value, kind);
target->setProp(queryTreeTag(kind), formattedValue);
}
else
{
target->setPropInt64(queryTreeTag(kind), value);
}
}
}
void expandProcessTreeFromStats(IPropertyTree * rootTarget, IPropertyTree * target, IStatisticCollection * collection, bool doFormat)
{
expandStats(target, *collection, doFormat);
StringBuffer scopeName;
Owned<IStatisticCollectionIterator> activityIter = &collection->getScopes(NULL, false);
ForEach(*activityIter)
{
IStatisticCollection & cur = activityIter->query();
cur.getScope(scopeName.clear());
const char * id = scopeName.str();
const char * tag;
IPropertyTree * curTarget = target;
switch (cur.queryScopeType())
{
case SSTedge:
tag = "edge";
id += strlen(EdgeScopePrefix);
break;
case SSTactivity:
tag = "node";
id += strlen(ActivityScopePrefix);
break;
case SSTsubgraph:
//All subgraphs are added a root elements in the progress tree
curTarget = rootTarget;
tag = "node";
id += strlen(SubGraphScopePrefix);
break;
case SSTchildgraph:
case SSTworkflow:
case SSTgraph:
// SSTworkflow and SSTgraph may be safely ignored. They are not required to produce the statistics.
expandProcessTreeFromStats(rootTarget, target, &cur, doFormat);
continue;
case SSTfunction:
case SSTchannel:
case SSTglobal:
//MORE:Should function scopes be included in the graph scope somehow, and if so how?
continue;
default:
throwUnexpected();
}
VStringBuffer xpath("%s[@id=\"%s\"]", tag, id);
IPropertyTree * next = curTarget->queryPropTree(xpath);
if (!next)
{
next = curTarget->addPropTree(tag);
next->setProp("@id", id);
}
expandProcessTreeFromStats(rootTarget, next, &cur, doFormat);
}
}
IPropertyTree * createProcessTreeFromStats(bool doFormat)
{
MemoryBuffer compressed;
MemoryBuffer serialized;
Owned<IPropertyTree> progressTree = createPTree();
Owned<IPropertyTreeIterator> iter = progress->getElements("sg*");
ForEach(*iter)
{
IPropertyTree & curSubGraph = iter->query();
curSubGraph.getPropBin("Stats", compressed.clear());
//Protect against updates that delete the stats while we are iterating
if (compressed.length())
{
decompressToBuffer(serialized.clear(), compressed);
Owned<IStatisticCollection> collection = createStatisticCollection(serialized);
expandProcessTreeFromStats(progressTree, progressTree, collection, doFormat);
}
}
return progressTree.getClear();
}
protected:
Linked<IPropertyTree> progress;
StringAttr wuid, graphName;
unsigned formatVersion;
};
extern WORKUNIT_API IConstWUGraphProgress *createConstGraphProgress(const char *_wuid, const char *_graphName, IPropertyTree *_progress)
{
return new CConstGraphProgress(_wuid, _graphName, _progress);
}
//--------------------------------------------------------------------------------------------------------------------
/*
* Create a user friendly description a scope/stats combination. Only currently used for elapsed time for root subgraphs
*/
static void createDefaultDescription(StringBuffer & description, StatisticKind kind, StatisticScopeType scopeType, const char * scope)
{
switch (kind)
{
case StTimeElapsed:
{
if (scopeType != SSTsubgraph)
break;
//Create a default description for a root subgraph
const char * colon = strchr(scope, ':');
if (!colon)
break;
const char * subgraph = colon+1;
//Check for nested subgraph
if (strchr(subgraph, ':'))
break;
assertex(strncmp(subgraph, SubGraphScopePrefix, strlen(SubGraphScopePrefix)) == 0);
StringAttr graphname;
graphname.set(scope, colon - scope);
unsigned subId = atoi(subgraph + strlen(SubGraphScopePrefix));
formatGraphTimerLabel(description, graphname, 0, subId);
return;
}
}
describeScope(description, scope);
}
/* Represents a single statistic */
class ExtractedStatistic : public CInterfaceOf<IConstWUStatistic>
{
public:
virtual IStringVal & getDescription(IStringVal & str, bool createDefault) const
{
if (!description && createDefault)
{
StringBuffer desc;
createDefaultDescription(desc, kind, scopeType, scope);
str.set(desc);
return str;
}
str.set(description);
return str;
}
virtual IStringVal & getCreator(IStringVal & str) const
{
str.set(creator);
return str;
}
virtual const char * queryScope() const
{
return scope ? scope : "";
}
virtual IStringVal & getFormattedValue(IStringVal & str) const
{
StringBuffer formatted;
formatStatistic(formatted, value, measure);
str.set(formatted);
return str;
}
virtual StatisticMeasure getMeasure() const
{
return measure;
}
virtual StatisticKind getKind() const
{
return kind;
}
virtual StatisticCreatorType getCreatorType() const
{
return creatorType;
}
virtual StatisticScopeType getScopeType() const
{
return scopeType;
}
virtual unsigned __int64 getValue() const
{
return value;
}
virtual unsigned __int64 getCount() const
{
return count;
}
virtual unsigned __int64 getMax() const
{
return max;
}
virtual unsigned __int64 getTimestamp() const
{
return timeStamp;
}
public:
StringBuffer creator;
StringBuffer description;
StringBuffer scope;
StatisticMeasure measure;
StatisticKind kind;
StatisticCreatorType creatorType;
StatisticScopeType scopeType;
unsigned __int64 value;
unsigned __int64 count;
unsigned __int64 max;
unsigned __int64 timeStamp;
};
//---------------------------------------------------------------------------------------------------------------------
/*
* The following compare functions are used to ensure that comparison are consistent with
* compareScopeName() in jstats. This ensures that the scope iterators from different sources
* are processed in a consistent order
*/
static int compareGraphNode(IInterface * const *ll, IInterface * const *rr)
{
IPropertyTree *l = (IPropertyTree *) *ll;
IPropertyTree *r = (IPropertyTree *) *rr;
unsigned lwfid = l->getPropInt("@wfid");
unsigned rwfid = r->getPropInt("@wfid");
if (lwfid != rwfid)
return lwfid > rwfid ? +1 : -1;
const char * lname = l->queryName();
const char * rname = r->queryName();
return compareScopeName(lname, rname);
}
static int compareSubGraphStatsNode(IInterface * const *ll, IInterface * const *rr)
{
IPropertyTree *l = (IPropertyTree *) *ll;
IPropertyTree *r = (IPropertyTree *) *rr;
return compareScopeName(l->queryName(), r->queryName());
}
static int compareSubGraphNode(IInterface * const *ll, IInterface * const *rr)
{
IPropertyTree *l = (IPropertyTree *) *ll;
IPropertyTree *r = (IPropertyTree *) *rr;
return l->getPropInt("@id") - r->getPropInt("@id");
}
static int compareActivityNode(IInterface * const *ll, IInterface * const *rr)
{
IPropertyTree *l = (IPropertyTree *) *ll;
IPropertyTree *r = (IPropertyTree *) *rr;
return l->getPropInt("@id") - r->getPropInt("@id");
}
static int compareEdgeNode(IInterface * const *ll, IInterface * const *rr)
{
IPropertyTree *l = (IPropertyTree *) *ll;
IPropertyTree *r = (IPropertyTree *) *rr;
//MORE: Edge needs more work
const char * leftId = l->queryProp("@id");
const char * rightId = r->queryProp("@id");
unsigned leftAc = atoi(leftId);
unsigned rightAc = atoi(rightId);
if (leftAc != rightAc)
return (int)(leftAc - rightAc);
const char * leftSep = strchr(leftId, '_');
const char * rightSep = strchr(rightId, '_');
assertex(leftSep && rightSep);
return atoi(leftSep+1) - atoi(rightSep+1);
}
//---------------------------------------------------------------------------------------------------------------------
/*
* A class for implementing a scope iterator that walks through graph progress information
*/
class CConstGraphProgressScopeIterator : public CInterfaceOf<IConstWUScopeIterator>
{
public:
CConstGraphProgressScopeIterator(const char * wuid, const ScopeFilter & _filter, __uint64 _minVersion) : filter(_filter), minVersion(_minVersion)
{
//Examine the filter, and determine if we only need to look at a single graph/subgraph
StringAttr singleGraph;
const StringArray & scopesToMatch = filter.queryScopes();
if (scopesToMatch)
{
bool seenGraph = false;
bool seenSubGraph = false;
ForEachItemIn(iScope, scopesToMatch)
{
StringArray ids;
ids.appendList(scopesToMatch.item(iScope), ":");
ForEachItemIn(i, ids)
{
const char * curId = ids.item(i);
StatsScopeId id(curId);
switch (id.queryScopeType())
{
case SSTgraph:
if (seenGraph)
{
if (singleGraph && !streq(singleGraph, curId))
singleGraph.clear();
}
else
{
if (!id.isWildcard())
singleGraph.set(curId);
seenGraph = true;
}
break;
case SSTsubgraph:
if (seenSubGraph)
{
if (singleSubGraph && !streq(singleSubGraph, curId))
singleSubGraph.clear();
}
else
{
if (!id.isWildcard())
singleSubGraph.set(curId);
seenSubGraph = true;
}
break;
}
}
}
}
rootPath.append("/GraphProgress/").append(wuid).append('/');
if (singleGraph)
rootPath.append(singleGraph).append("/");
//Don't lock the statistics while we iterate - any partial updates must not cause problems
if (daliClientActive())
conn.setown(querySDS().connect(rootPath.str(), myProcessSession(), RTM_NONE, SDS_LOCK_TIMEOUT));
if (conn && !singleGraph)
{
graphIter.setown(conn->queryRoot()->getElements("*"));
graphIter.setown(createSortedIterator(*graphIter, compareGraphNode));
}
valid = false;
}
IMPLEMENT_IINTERFACE_USING(CInterfaceOf<IConstWUScopeIterator>)
virtual bool first()
{
valid = false;
if (!conn)
return false;
if (graphIter && !graphIter->first())
return false;
if (!firstSubGraph())
{
if (!nextGraph())
return false;
}
valid = true;
return true;
}
virtual bool next()
{
if (!nextChildScope())
{
if (!nextSubGraph())
{
if (!nextGraph())
{
valid = false;
return false;
}
}
}
return true;
}
virtual bool nextSibling() override
{
if (collections.ordinality() == 0)
return false;
assertex(childIterators.ordinality() < collections.ordinality());
collections.pop();
//next will call childIterator.next() - walking the next sibling
return next();
}
virtual bool nextParent() override
{
if (collections.ordinality() == 0)
return false;
assertex(childIterators.ordinality() < collections.ordinality());
collections.pop();
if (collections.ordinality() == 0)
return false;
//Finish with this node - so next will move onto the sibling of the parent node.
finishCollection();
return next();
}
virtual bool isValid()
{
return valid;
}
protected:
bool firstSubGraph()
{
IPropertyTree & graphNode = graphIter ? graphIter->query() : *conn->queryRoot();
const char * xpath = "sg*";
StringBuffer childXpath;
if (singleSubGraph)
{
childXpath.append(singleSubGraph);
xpath = childXpath.str();
}
subgraphIter.setown(graphNode.getElements(xpath));
if (subgraphIter)
{
if (!singleSubGraph)
subgraphIter.setown(createSortedIterator(*subgraphIter, compareSubGraphStatsNode));
}
else
subgraphIter.setown(graphNode.getElements("sg0"));
if (!subgraphIter->first())
return false;
if (firstStat())
return true;
return nextSubGraph();
}
bool nextSubGraph()
{
for (;;)
{
if (!subgraphIter->next())
return false;
if (firstStat())
return true;
}
}
bool nextGraph()
{
if (!graphIter)
return false;
for (;;)
{
if (!graphIter->next())
return false;
if (firstSubGraph())
return true;
}
}
bool firstStat()
{
IPropertyTree & curSubGraph = subgraphIter->query();
if (!checkSubGraph())
return false;
curSubGraph.getPropBin("Stats", compressed.clear());
//Don't crash on old format progress...
if (compressed.length() == 0)
return false;
decompressToBuffer(serialized.clear(), compressed);
Owned<IStatisticCollection> collection = createStatisticCollection(serialized);
statsIterator.timeStamp = collection->queryWhenCreated();
if (!beginCollection(*collection))
return false;
// When workflow is root element, it is just a container. Ignore the workflow element here
// as WorkUnitStatisticsScopeIterator will produce workflow scope - don't want duplicates.
// (Note: workflow element never contains stats).
if (collections.tos().queryScopeType() == SSTworkflow)
{
if (!next())
return false;
}
//The root element of a collection is a graph - but it is only there to nest the subgraphs in.
//Do not iterate it as a separate element - unless it has some stats.
IStatisticCollection & curCollection = collections.tos();
if ((curCollection.queryScopeType() != SSTgraph) || (curCollection.getNumStatistics() != 0))
return true;
return next();
}
bool beginCollection(IStatisticCollection & collection)
{
collections.append(OLINK(collection));
curScopeType = collection.queryScopeType();
collection.getFullScope(curScopeName.clear());
ScopeCompare result = filter.compare(curScopeName);
if (result & SCequal)
return true;
//If this scope cannot be the parent of a match then discard it.
if (!(result & SCparent))
collections.pop();
//walk the next element
return nextChildScope();
}
bool nextChildScope()
{
for (;;)
{
if (collections.ordinality() == 0)
return false;
IStatisticCollection * curCollection = &collections.tos();
if (childIterators.ordinality() < collections.ordinality())
{
ScopeCompare result = filter.compare(curScopeName);
//Do not walk children scopes if it is unrelated
if (result & SCparent)
{
//Start iterating the children for the current collection
childIterators.append(curCollection->getScopes(NULL, true));
if (!childIterators.tos().first())
{
finishCollection();
continue;
}
}
else
{
//Don't walk the child scopes
collections.pop();
continue;
}
}
else if (!childIterators.tos().next())
{
finishCollection();
continue;
}
if (beginCollection(childIterators.tos().query()))
return true;
}
}
void finishCollection()
{
collections.pop();
childIterators.pop();
}
bool checkSubGraph()
{
IPropertyTree & curSubGraph = subgraphIter->query();
StatisticCreatorType creatorType = queryCreatorType(curSubGraph.queryProp("@c"), SCTnone);
const char * creator = curSubGraph.queryProp("@creator");
//MORE: Check minVersion and allow early filtering
//MORE: Potentially filter by creator type??
// if (!filter->matches(creatorType, creator, SSTall, NULL, SMeasureAll, StKindAll, AnyStatisticValue))
// return false;
statsIterator.creatorType = creatorType;
statsIterator.creator.set(creator);
return true;
}
virtual void playProperties(IWuScopeVisitor & visitor, WuPropertyTypes whichProperties) override
{
if ((whichProperties & PTstatistics))
{
/*
MORE: Code from the statsIterator class should be inlined here - code will be much simpler
but it currently needs an implementation of the IConstWUStatistic 3rd parameter
IStatisticCollection & collection = collections.tos();
ForEachItemIn(i, collection)
{
StatisticKind kind;
unsigned __int64 value;
collection->getStatistic(kind, value, i);
visitor.noteStatistic(kind, value, *this);
}
*/
statsIterator.reset(curScopeName, curScopeType, collections.tos());
ForEach(statsIterator)
statsIterator.play(visitor);
}
}
virtual bool getStat(StatisticKind kind, unsigned __int64 & value) const override
{
return collections.tos().getStatistic(kind, value);
}
virtual const char * queryAttribute(WuAttr attr, StringBuffer & scratchpad) const override
{
return nullptr;
}
virtual const char * queryHint(const char * kind) const override
{
return nullptr;
}
virtual const char * queryScope() const override
{
return curScopeName;
}
virtual StatisticScopeType getScopeType() const override
{
return curScopeType;
}
private:
class ScopeStatisticsIterator : public CInterfaceOf<IConstWUStatistic>
{
friend class CConstGraphProgressScopeIterator; // cleaner if this was removed + setScope() functions added.
public:
void reset(const char * _scopeName, StatisticScopeType _scopeType, IStatisticCollection & _collection)
{
scope.set(_scopeName);
scopeType = _scopeType;
collection = &_collection;
numStats = collection->getNumStatistics();
}
// interface IConstWUStatisticIterator
IConstWUStatistic & query()
{
return *this;
}
bool first()
{
curStatIndex = 0;
if (curStatIndex >= numStats)
return false;
collection->getStatistic(kind, value, curStatIndex);
//MORE: Allow filtering:
/*
* if (filter && !filter->matches(SCTall, NULL, SSTall, NULL, queryMeasure(kind), kind, value))
continue;
*/
return true;
}
bool next()
{
for (;;)
{
++curStatIndex;
if (curStatIndex >= numStats)
return false;
collection->getStatistic(kind, value, curStatIndex);
//MORE: Allow stats filtering
return true;
}
}
bool isValid()
{
return curStatIndex < numStats;
}
//interface IConstWUStatistic
virtual IStringVal & getDescription(IStringVal & str, bool createDefault) const override
{
if (createDefault)
{
StringBuffer description;
createDefaultDescription(description, kind, scopeType, scope);
str.set(description);
}
return str;
}
virtual IStringVal & getCreator(IStringVal & str) const override
{
str.set(creator);
return str;
}
virtual const char * queryScope() const override
{
return scope;
}
virtual IStringVal & getFormattedValue(IStringVal & str) const override
{
StringBuffer formatted;
formatStatistic(formatted, value, kind);
str.set(formatted);
return str;
}
virtual StatisticMeasure getMeasure() const override
{
return queryMeasure(kind);
}
virtual StatisticKind getKind() const override
{
return kind;
}
virtual StatisticCreatorType getCreatorType() const override