Lines Matching full:time
63 // time valgrind --tool=massif --depth=100 konqueror
75 // [Introduction of --time-unit=i as the default slowed things down by
78 // - get_XCon accounts for about 9% of konqueror startup time. Try
103 time=0
111 time=353
125 n_events: n time(ms) total(B) useful-heap(B) admin-heap(B) stacks(B)
154 -------------------------------------------------------------------------------- n time(ms) total(B) useful-heap(B) admin-heap(B) stacks(B)
201 // - Normal: these record the current time, total memory size, total heap
272 // --time-unit=i.
283 // Incremented every time memory is allocated/deallocated, by the
285 // memory. An alternative to milliseconds as a unit of program "time".
294 // would be an artificial time gap between the first and second snapshots.
454 else if VG_XACT_CLO(arg, "--time-unit=i", clo_time_unit, TimeI) {}
455 else if VG_XACT_CLO(arg, "--time-unit=ms", clo_time_unit, TimeMS) {}
456 else if VG_XACT_CLO(arg, "--time-unit=B", clo_time_unit, TimeB) {}
483 " --time-unit=i|ms|B time unit: instructions executed, milliseconds\n"
817 // children at the same time.
955 // Linear search, ugh -- about 10% of time for konqueror startup tried
957 // Nb: this search hits about 98% of the time for konqueror
1045 // Time is measured either in i or ms or bytes, depending on the --time-unit
1048 typedef Long Time;
1063 Time time;
1078 tl_assert(snapshot->time == UNUSED_SNAPSHOT_TIME);
1085 tl_assert(snapshot->time != UNUSED_SNAPSHOT_TIME);
1129 snapshot->time = UNUSED_SNAPSHOT_TIME;
1163 snapshot->time,
1171 // time-spans, because that gives us the most even distribution of snapshots
1172 // over time. (It's possible to lose interesting spikes, however.)
1176 // We have to do this one snapshot at a time, rather than finding the (N/2)
1182 // That becomes our minimum time interval.
1187 Time min_timespan;
1203 // for snapshot n = d(N-1,N)+d(N,N+1), where d(A,B) is the time between
1217 Time timespan = snapshots[jn].time - snapshots[jp].time;
1259 // time interval. Note that above we were finding timespans by measuring
1267 // change), and the time gap between them will not change. However, the
1268 // time between the remaining cullable snapshots will grow ever larger.
1282 Time timespan = snapshots[i].time - snapshots[i-1].time;
1299 VERB(2, "New time interval = %lld (between snapshots %d and %d)\n",
1306 static Time get_time(void)
1308 // Get current time, in whatever time unit we're using.
1313 // to zero and us taking our first snapshot. We determine that time
1318 // so when the time-unit is 'ms' we always have a big gap between the
1322 static Time start_time_ms;
1333 tl_assert2(0, "bad --time-unit value");
1339 // Nb: we call the arg "my_time" because "time" shadows a global declaration
1340 // in /usr/include/time.h on Darwin.
1342 take_snapshot(Snapshot* snapshot, SnapshotKind kind, Time my_time,
1369 snapshot->time = my_time;
1379 // Take a snapshot, if it's time, or if we've hit a peak.
1383 // 'min_time_interval' is the minimum time interval between snapshots.
1384 // If we try to take a snapshot and less than this much time has passed,
1388 static Time min_time_interval = 0;
1390 static Time earliest_possible_time_of_next_snapshot = 0;
1396 // Nb: we call this variable "my_time" because "time" shadows a global
1397 // declaration in /usr/include/time.h on Darwin.
1398 Time my_time = get_time();
1402 // Only do a snapshot if it's time.
1416 // because many peaks remain peak only for a short time.
1478 // Work out the earliest time when the next snapshot can happen.
2090 else { tl_assert2(0, "bad --time-unit value"); }
2206 // expensive (eg. 15% of execution time for konqueror
2255 FP("time=%lld\n", snapshot->time);
