search for: unvisit

...mation at the nodes can > only move in one direction in the lattice and can change at most once. > > I haven't thought this through entirely, but it looks like we could > implement this by keeping track of which basic blocks we never visited > before and special-casing previously unvisited basic blocks in join(). > This is because you don't really init all the info to bottom for real. It tries to be lazy. Otherwise, they'd all have outlocs of bottom. They are only theoretically initialized, so things get the wrong answer. For example, this code is not right: // For...

...of VarLocs that > // can be joined. > for (auto p : MBB.predecessors()) { > auto OL = OutLocs.find(p); > // Join is null in case of empty OutLocs from any of the pred. > if (OL == OutLocs.end()) > return false; > > > This is wrong if the block is unvisited (as you say) > > This is actually non-trivial to fix, IMHO. > > For example, the following looks kinda right: > > for (auto p : MBB.predecessors()) { > if (p is not visited) > continue; > auto OL = OutLocs.find(p); > // Join is null in case of e...

Adrian, I am currently investigating issues where variables that one would expect to be available in a debugger are not in code that is compiled at optimisations other than -O0 The main problem appears to be with the LiveDebugValues::join() method because it does not allow variables to be propagated into blocks unless all predecessor blocks have an Outgoing Location for that variable. As a

And I got this lousy LatexParser. Ah well... A new cut of the automatic WxRuby documentation is now viewable online at http://www.pressure.to/wxruby/. There''s also a pdf version http://www.pressure.to/wxruby/wxruby.pdf [3MB, 751 pages!] and a tarball http://www.pressure.to/wxruby/wxruby2.tar.gz [1.3MB] In terms of output, it''s no advance on what Sean has already done.

...len = blen - 4; } @@ -1502,7 +1527,9 @@ hivex_visit (hive_h *h, const struct hivex_visitor *visitor, size_t len, return hivex_visit_node (h, hivex_root (h), visitor, len, opaque, flags); } -static int hivex__visit_node (hive_h *h, hive_node_h node, const struct hivex_visitor *vtor, char *unvisited, void *opaque, int flags); +static int hivex__visit_node (hive_h *h, hive_node_h node, + const struct hivex_visitor *vtor, + char *unvisited, void *opaque, int flags); int hivex_visit_node (hive_h *h, hive_node_h node, @@ -1550,7 +1577,8 @@ hivex__visit_node (hive_h *h, hive_no...

...Cannot play in Window mode: > > I selected Play in Window in the settings. Hit OK and it was still in full screen. Went back to the settings and changed the resolution to the smallest one. Again, it was in full screen mode. > > #6 Gradient missing: > > AOM does show visited and unvisited areas properly but there is not any gradient texture from visited to unvisited like under Windows. > > #7 Related to gradient: > > New uncovered land isn't smooth, it goes by block. If one block on the grid has been touched with the smallest amount of the line of sight of an all...

...er to maintain and expand. The first version of this redesign would try to: * Split the code into chunks and discard those that fail the given test * Discard functions, instructions and metadata that don’t influence the interesting-ness test * Remove unused parameters from functions * Eliminate unvisited conditional paths * Rename variables to more regular ones (such as “a”, “b”, “c”, etc.) Once these passes are implemented, more meaningful reductions (such as type reduction) would be added to the tool, to even further reduce IR. ## Background on historical bugpoint issues ### Root Cause An...

...hem. - move around in directory structure. - use "df" and such commands. But ... - all kind of syslog activity freezes, no new stuff to /var/log/, although all the processes seem to run as usual. - Apache seems to serve pages it already has been serving, but trying to surf to the yet unvisited page, it will hang. - restarting any service via "/etc/rc.d/init.d/x restart" fails (will hang when service is stopping). Server is a dual P3 Xeon 700 MHz / 1 GB RAM / 200 GB (hardware) RAID-5 SCSI. Distribution used is a fresh Red Hat 7.3 install, updated with up2date whenever nece...

This is, hopefully, a full fix for handling of li-records. See: https://bugzilla.redhat.com/show_bug.cgi?id=717583 https://bugzilla.redhat.com/show_bug.cgi?id=987463 Rich.

...er to maintain and expand. The first version of this redesign would try to: * Split the code into chunks and discard those that fail the given test * Discard functions, instructions and metadata that don’t influence the interesting-ness test * Remove unused parameters from functions * Eliminate unvisited conditional paths * Rename variables to more regular ones (such as “a”, “b”, “c”, etc.) Once these passes are implemented, more meaningful reductions (such as type reduction) would be added to the tool, to even further reduce IR. ## Background on historical bugpoint issues ### Root Cause An...

...re that bit however you want. You can store a bit that all operands of an operation were visited at least once. That is equivalent to "all operands != unknown". But you can't dual purpose the bit with undef, because undef is an actual value state. it tells you nothing about visited or unvisited, only the value. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20161230/7c6eef58/attachment.html>

Hi Daniel, On Fri, Dec 30, 2016 at 9:47 PM, Daniel Berlin <dberlin at dberlin.org> wrote: >> >>> Is there a case in your algorithm in which treating an >>> unknown as an undef will be a problem? >>> > Yes, if you try to optimize undefs in any way, no if you move them to > overdefined :) > > IE given phi [a, undef, undef, undef] > > with

..., hive_node_h node, { int skip_bad = flags & HIVEX_VISIT_SKIP_BAD; char *name = NULL; + char *last_modified = NULL; hive_value_h *values = NULL; hive_node_h *children = NULL; char *key = NULL; @@ -1584,8 +1618,11 @@ hivex__visit_node (hive_h *h, hive_node_h node, BITMAP_CLR (unvisited, node); name = hivex_node_name (h, node); + last_modified = hivex_node_mtime (h, node); + if (h->msglvl >= 2) + fprintf(stderr, "hivex__visit_node: last_modified: %s\n", last_modified ? last_modified : "NULL" ); if (!name) return skip_bad ? 0 : -1; - if (vt...

...hive_node_h node, { int skip_bad = flags & HIVEX_VISIT_SKIP_BAD; char *name = NULL; + char *last_modified = NULL; hive_value_h *values = NULL; hive_node_h *children = NULL; char *key = NULL; @@ -1584,10 +1658,24 @@ hivex__visit_node (hive_h *h, hive_node_h node, BITMAP_CLR (unvisited, node); name = hivex_node_name (h, node); + last_modified = hivex_node_mtime (h, node); + if (h->msglvl >= 2) + fprintf(stderr, "hivex__visit_node: last_modified: %s\n", last_modified ? last_modified : "NULL" ); if (!name) return skip_bad ? 0 : -1; + + /* R...