search for: nondeterminist

We're presently running Samba 1.9.15 on a Dec Alpha running OSF-3.2. We've been running this configuration for over a year and have developed a new problem in the last few weeks. Intermiddently, when a user attempts to save a file or copy (via desktop) a file to the server, the server returns a disk full error. If the user tries the exact same transaction, it usually works on the second

Hello I have a Samba PDC in domain KEVF_D4 called OBERON and a NT4 workstation NEPTUN in workgroup (not domain, workgroup) WORKGROUP I tried to map \\oberon\linux from OBERON using smbclient \\\\oberon\\linux -U <username> and gave password and it worked. I tried to map \\oberon\linux from NEPTUN and 1) got error message: "\\Oberon is not accessible. Logon failure: the user has not

On Fri, Jan 08, 2010 at 05:04:17PM -0800, Chris Lattner wrote: > On Jan 8, 2010, at 5:01 PM, Julien Lerouge wrote: > >Hello, > > > >The CodeExtractor contains a std::set<BasicBlock*> to keep track > >of the > >blocks to extract. Iterators on this set are not deterministic, and so > >the functions that are generated are not (the order of the >

On Jan 8, 2010, at 5:01 PM, Julien Lerouge wrote: > Hello, > > The CodeExtractor contains a std::set<BasicBlock*> to keep track of > the > blocks to extract. Iterators on this set are not deterministic, and so > the functions that are generated are not (the order of the > inputs/outputs can change). > > The attached patch uses a SetVector instead. Ok to apply ?

https://bugzilla.mindrot.org/show_bug.cgi?id=3475 Bug ID: 3475 Summary: ED25519 signature verification nondeterministic spurious failure Product: Portable OpenSSH Version: v9.0p1 Hardware: amd64 OS: Linux Status: NEW Severity: critical Priority: P5 Component: ssh Assignee: unassigned-bugs at mindr...

Hello, The CodeExtractor contains a std::set<BasicBlock*> to keep track of the blocks to extract. Iterators on this set are not deterministic, and so the functions that are generated are not (the order of the inputs/outputs can change). The attached patch uses a SetVector instead. Ok to apply ? Thanks, Julien -- Julien Lerouge PGP Key Id: 0xB1964A62 PGP Fingerprint: 392D 4BAD DB8B CE7F

> It is important to note that this applies to trap representations and not to unspecified values. A structure or union never has a trap representation. Yes, nondeterministic bits would work for padding of struct/union, as described in (3) The third case is the value of struct/union padding. For the members of struct/union, it is allowed to have trap representation, so poison can be used. Juneyoung On Fri, Oct 9, 2020 at 5:37 AM Hubert Tong <hubert.reinterpretcas...

Further to that, I thought an example might be useful. In the following code, n should end up with a value that varies nondeterministically with the scheduling decisions made by the underlying run time system -- my model checker, for example, should in theory be able to enumerate all possible values. Anyway, if you look at the compiler output (see below), the volatile global variable, n, has vanished, with the printf output...

...t; On Thu, Oct 8, 2020 at 7:13 PM Juneyoung Lee <juneyoung.lee at sf.snu.ac.kr> > wrote: > >> > It is important to note that this applies to trap representations and >> not to unspecified values. A structure or union never has a trap >> representation. >> Yes, nondeterministic bits would work for padding of struct/union, as >> described in (3) The third case is the value of struct/union padding. >> For the members of struct/union, it is allowed to have trap >> representation, so poison can be used. >> > At what point are the members considere...

...Store forwarding isn’t free; needs insertion of freeze (store x, p; v = load freeze p => store x, p; v = freeze x) (3) The third case is the value of struct/union padding. Padding is filled with unspecified value in C, so it is too undefined to use poison. We can fill it with defined bits nondeterministically chosen at allocation time (freeze poison). ``` <C> struct { char a; // 3 bytes padding int b; } s; v = s.b; => <IR> s = alloca {i8, i32} // alloca initializes bytes in a type-dependent manner // s[0], s[4~7]: poison // s[1~3]: let's fill these bytes with nondet. bit...

Sarah Thompson wrote: > Further to that, I thought an example might be useful. In the following > code, n should end up with a value that varies nondeterministically with > the scheduling decisions made by the underlying run time system -- my > model checker, for example, should in theory be able to enumerate all > possible values. Anyway, if you look at the compiler output (see below), > the volatile global variable, n, has vanished, with...

...<juneyoung.lee at sf.snu.ac.kr> >>> wrote: >>> >>>> > It is important to note that this applies to trap representations and >>>> not to unspecified values. A structure or union never has a trap >>>> representation. >>>> Yes, nondeterministic bits would work for padding of struct/union, as >>>> described in (3) The third case is the value of struct/union padding. >>>> For the members of struct/union, it is allowed to have trap >>>> representation, so poison can be used. >>>> >>>...

...e. *. Because llvm-gcc has no byte-swap builtin, the LLVM optimizer recognizes common bswap idioms and automatically changes them into the intrinsic. *. llvm-gcc now bootstraps correctly on darwin-x86 and darwin-ppc (any others?), which exposed several cases where optimizers were nondeterministic. Target Independent Code Generator Improvements: *. Nate contributed support for lowering switch instructions into jump tables, instead of always lowering them to conditional branch trees. *. The ExecutionEngine::freeMachineCodeForFunction now actually frees machine code for func...

....ac.kr> wrote: >>>>> >>>>>> > It is important to note that this applies to trap representations >>>>>> and not to unspecified values. A structure or union never has a trap >>>>>> representation. >>>>>> Yes, nondeterministic bits would work for padding of struct/union, as >>>>>> described in (3) The third case is the value of struct/union padding. >>>>>> For the members of struct/union, it is allowed to have trap >>>>>> representation, so poison can be used. >&...

...t operand. I would take "replaces the value" to mean "replaces the entire value", but it could be read otherwise, I suppose. The current code seems to me to assume holes in structs can't ever be validly accessed, which isn't right, as we see here. They are often nondeterministic (this is explicit for initialization in C99) but not always. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20080311/85880817/attachment.html>

...mb_vwv[ 9]= 22 (0x16) smb_vwv[10]= 68 (0x44) smb_vwv[11]= 0 (0x0) smb_vwv[12]= 0 (0x0) smb_vwv[13]= 1 (0x1) smb_vwv[14]= 5 (0x5) smb_bcc=25 Any ideas what's going on? In previous postings regarding this type of problem, it sounds like the Windows client is somewhat nondeterministic in whether or not it is willing to treat a given share as a DFS root? Any suggestions for additional debugging data that might be provided to further isolate the issue? Thanks much for any assistance... -- Paul B. Henson | (909) 979-6361 | http://www.csupomona.edu/~henson/ Operating Syst...

..."replaces the value" to mean "replaces the entire > value", but it could be read otherwise, I suppose. > > The current code seems to me to assume holes in structs can't ever > be validly accessed, which isn't right, as we see here. They are > often nondeterministic (this is explicit for initialization in C99) > but not always. > > _______________________________________________ > LLVM Developers mailing list > LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu > http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev -------------- next p...

Someone recently posted on the x2go list that he had a problem with jerky videos playing remotely on Ubuntu, but solved it by installing a low latency kernel that was available as an alternative. That made me curious as to whether CentOS has an equivalent - or a way to build something similar. -- Les Mikesell lesmikesell at gmail.com

...be a problem. I know a bit about how Michael Norrish dealt with this sort of thing in his formal semantics for C. For example, integer width is modeled as a constant, but one with an unspecified value. Other C level choices such as order of evaluation of function arguments are modeled using nondeterministic choice. My understanding is that these are not too difficult at the level of the language specification, but that they make proofs about portable C code very difficult. I don't have a sense if the platform leaks in LLVM are bad ones or not. > One of the reasons why you have not had su...

...d send by accident. It seems there's some background I'm > missing though. Can I read up on this "as-if" rule anywhere? > >From the latest C++0x draft (n2588), 1.9/1 [intro.execution]: "The semantic descriptions in this International Standard define a parameterized nondeterministic abstract machine. This International Standard places no requirement on the structure of conforming implementations. In particular, they need not copy or emulate the structure of the abstract machine. Rather, conforming implementations are required to emulate (only) the observable behavior of the...