search for: undecid

...aid, it would be interesting to add gcov to the testsuite to get a measure > of how many percent of the application we're exercising.... > >> A static analysis will not be able to see through things like virtual >> method calls. > > Not even in theory? It's provably undecidable to do so in general, because aliasing is statically undecidable. http://academic.research.microsoft.com/Publication/857191/the-undecidability-of-aliasing (and the more complicated paper it cites by Landi). This is not to say it's not possible to resolve any of them sometimes, it means in g...

On Sun, Jul 3, 2011 at 10:34 PM, Reid Kleckner <reid.kleckner at gmail.com> wrote: > An easier way would be to use a coverage tool like gcov to see what's > actually *used* when the app is run normally.  Then you can ask the > question, what percentage of all lines of code are dead? We need something that can do this using static analysis... Otherwise we can just use Eclipse

...on what goes into the controller to access a third value for a radio button. In my migration I defined the column as a string with a default value of nil. The column itself is actually a question(no question mark appears in the column though)with three choices in the radio button form: yes, no, and undecided. Everything works fine, but I don''t know how to get undecided to display in the table instead of yes. I''m sure this is a common scenario, but I can''t seem to get the controller stuff right, HELP! This is what I currently have in my controller: def Undecided #GET /ach...

We are undecided right now if we will be streaming through a linux based computer or through a windows computer. Any opinions out there? We have heard that windows presents a major problem with viruses, etc. when trying to stream. Also, can icecast be used with both linux and windows? Thanks. -------------- n...

...uot;) on Windows works fine. On the other hand, a "Rterm.exe --no-save < RLadyBug-Ex.R" in a command shell under Windows reproduces the error. My first guess was that the very long line was causing the problem, but when I open RLadyBug-Ex.R in Emacs, change the coding system from "undecided-dos" to "undecided-unix" and save the file "Rterm.exe --no-save < RLadyBug-Ex.R" works fine.... Does anybody has an idea what is causing the error and how to fix this? Best regards, Michael H?hle -- --- * checking for working latex ... OK * using log directory ...

Does anyone have any experience using R to pull/push data from an ODBC compliant database? I'm working on a small project and am undecided about whether to use just R or use some other software for extracting and transforming. TIA Samir. The information contained in this e-mail transmission is confidential and may be privileged. It is intended only for the addressee(s) stated above. If you are not an addressee, any use, disse...

...dd gcov to the testsuite to get a measure >> of how many percent of the application we're exercising.... >> >>> A static analysis will not be able to see through things like virtual >>> method calls. >> >> Not even in theory? > > It's provably undecidable to do so in general, because aliasing is > statically undecidable. > http://academic.research.microsoft.com/Publication/857191/the-undecidability-of-aliasing > (and the more complicated paper it cites by Landi). > > This is not to say it's not possible to resolve any of them...

Hi all, How''s this look? I based it on http://msdn.microsoft.com/en-us/library/aa366789(VS.85).aspx. I''m undecided as to when I should raise an error versus when I should just let it fall through, but this is how it is for now. You''ll need the latest windows-pr from CVS, btw. Regards, Dan PS - Where should I put it? In Windows::File directly? In a separate helper module? require ''windo...

...followed through as I was ambivalent about how people would perceive the signal-to-noise ratio. It's similar for the blog: is info about release candidates valuable for those not involved enough to read llvm-dev, or would it be perceived as noise, hiding more important contents? I'm pretty undecided...

...these packages were not updated after the recent security issues, I decided to remove them to avoid pushing people to use outdated and insecure packages with the believe they are ok because they are hosted on samba.org I am looking to see if I have time to start publishing packages for Etch, I am undecided yet, and I may discontinue this service. If someone is highly motivated and wants to give a hand, please contact me privately. Simo. -- Simo Sorce Samba Team GPL Compliance Officer email: idra@samba.org http://samba.org

...as general as possible. Examples would be "x, y are (not) aliased", "loop trip count = x" (where x is either a static constant, or an expression", "branch cond. is true most of the time" (or x% of the time), and other information that might be statically undecidable, but the developer knows the answer to. thanks, Anthony

...for (k = 0; k < ip[2]; ++k) { a[k] = (k+11)/(k+2); } } ---------- example 2 ---------- test2(int *a) { int k, ip[4]; vbar(ip, 4, 7); for (k = 0; k < ip[2]; ++k) { a[k] = (k+11)/(k+2); } } However, in both cases the trip count is the same and equally undecidable, since "vbar()" is an external function. Note that in each example that is the only code in the file and I am running my pass as: opt -O1 -licm -load ... -mypass < test.bc > /dev/null Any suggestions? thanks, Anthony

...aled hamidouche wrote: > I'm wandring to know how many times a block is executed inside a > loop ? > knowing that I can't use getSmallConstantTripCount() because the > number is unkown "for (i=0;i<N;i++) for example" In general, the number of iterations is undecidable. For example: int main(char **argv, int N) { for (int i = 0; i < N; i++) { std::cout << "arg: " << argv[i] << std::endl; } return 0; } If you are parsing code whose iterations can be determined, please post it. Trevor

Hi, Is there any facility in LLVM to identify recursion in a call graph? I realize this is undecidable in the general case due to function pointers, but at least the static cases could be identified. I don't even care about whole-program recursion, just looking at a single module would suffice. But I don't see anything like this already in LLVM, so do I simply write some code to...

Hi all, i am coding to analyze an IR with multi-level pointers, and i am eager to know whether there exists a way to find the pointee pointer directly, if only given an upper level pointer. For example, in the following demo, C code: int i = 10; int *p = &i; int **pp; *pp = &p; IR code: %i = alloca i32, align 4 %p = alloca i32*, align 8 %pp = alloca i32**, align 8 store

> Timo Sirainen wrote: > Our typical projects have several million user accounts. I think 100k > users is around the minimum. Interesting. So che choice for object storage is driven by the number of accounts rather than the amount of data stored? For example I am heading towards 10 TB online with "just" 10k users. It wouldn't be worth? Paolo

...d about 1.5K of code (for x86-64), which isn't so bad, except that it means that *every* program now pulls in stdio, which in turn depends on malloc() and some other pieces of code. I have not yet implemented fscanf(), however, which may cause additional bloat. As of this point, I'm a bit undecided about stdio in klibc. If you care about it, you may want to check out the stdio branch from the klibc repository and try it out. -hpa

..., 16, 14, 14, 8, 9, 6, 7, 9.5, 6), Chalita.PMDB = c(11, 11, 11, 10, 9, 7, 5, 8, 6, 8, 7, 5, 7, 5, 6, 5, 5, 6, 4.3, 6), Others = c(8, 7, 7, 4, 7, 6, 4, 5, 6, 7, 9, 5, 8, 6, 10, 12, 15, 15, 8.6, 16), Null = c(8, 8, 8, NA, 8, 10, 10, NA, 13, 9, 8, 12, 10, NA, 10, 12, 14, 11, 13.1, 11), Undecided = c(6, 8, 6, NA, 6, 8, 13, NA, 6, 7, 4, 9, 7, 13, 6, 10, 9, 6, 13.3, 5), Round = structure(c(3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 3L, 2L), .Label = c("year before", "off campaign", "first", "second"), class...

>> I may sound stupid but can someone tell me that after applying >> optimization sequences randomly whether we can surely say that the >> final output is correct? > > Answering this question is equivalent to solving the Halting Problem. Prooving correctness of a compiler is really an NP problem. This goes for any compiler backend. All you can do is have enough test

> Prooving correctness of a compiler is really an NP problem. This goes for > any compiler backend. All you can do is have enough test cases. No. To be in NP it would be necessary for a Non-deterministic Polynomial algorithm to exist. There is no such algorithm. The problem is undecidable. It doesn't means that it is impossible to prove the correctness of a compiler. It means that no algorithm can do it. >From a practical point of view, I think that the original question was: Are the different optimizations "expected" to work in any order or do they have some...