search for: unfett

...statements that define symbols before and after the loop. The LLVM optimizations shouldn't move loop code around these inline assembly statements (if the statements are labeled as modifying memory in a volatile manner), but optimizations between the inline assembly statements should remain unfettered. Granted, you might pessimize optimization a bit, but whether that's an issue depends upon your application. -- John T. > That said, especially at low optimization levels, you may be able to get at least an approximation of what you're after from debug information. See http://llvm...

...define symbols before and after the loop.  The LLVM > optimizations shouldn't move loop code around these inline assembly > statements (if the statements are labeled as modifying memory in a > volatile manner), but optimizations between the inline assembly > statements should remain unfettered. By the way, is it possible to insert additional labels using the inline assembly statements? I understand this may degrade the optimization quality, but it could be done at the last optimization stage. Alexander Potapenko

...configured this on roll my own SAMBA servers that I can control with all levers at my disposal with the security keys... commercial products with SAMBA integration do not expose all levers. This in fact should be part of the GPL IMO. Give users not only access to the source, but provide them with unfettered access to control the software. It is not clear to me how DHCP and AD integrate. Currently I have clients issued assigned fixed IPs by DHCP to get around this.

...estricted areas of the site to be used from public places where a password might be sniffed. The damage that could be done by taking snapshots of the content from one session with a spy program is minimal. What the owner of the server does NOT want, though, is to allow unauthorized parties to gain unfettered access by stealing the password via a key sniffer. After considering the readily available alternatives, I'd like to try using s/key one-time passwords with "basic" authentication (which works on most browsers). But how do I lash Apache and s/key together under FreeBSD, and get...

...Association. Its international membership includes scientists, engineers, and system administrators working on the cutting edge of systems and software. For nearly 25 years, USENIX conferences have emphasized the exchange of technical excellence, practical solutions and the open airing of issues, unfettered by stodginess or commercialism.

...to have Samba know to "reach into" the boxes and get the info for rsync-ing. Doable? A fool's errand? The setup: * In-home LAN consisting of 3-4 PCs running W2K and WXP; one FreeBSD server running SAMBA. * No PDC; everyone is on the same workgroup and everyone has equal and unfettered (no login/password and all can overwrite) access to /storage on the BSD box via Samba. Ideal situation: Designated directories on the windows boxes are rsync'd 2-3 times a day during times of low use. Alternate: The whole Windows drive is rsync'd onto a Samba share on the BSD box,...

Is is possible to assign one name to a client, but have multiple ip addresses (3 or more) say for a laptop that can be connected by wireless, hardline on laptop, or hard-line on docking station where DHCP server issues multiple ip addresses for each connection which could be used simultaneously or individually? and have nslookup yield the one of the working/connected ip address or say first

In general, this is not possible. Consider, for example, the fact that various optimization passes may reorder the code, including such things as hoisting computations outside of the loop, and enclosing loops, scheduling those instructions before others that did not originate from source lines within the loop, etc. That's not to mention things like loop unrolling. That said, especially at low

Hi, all What I want to do is to locate the range of a for-loop statement in a binary. For example, given a for-loop statement belows, for (stat1; stat2; stat3) { /* do something */ } Is it possible to get information about the range (binary address) of the above for-loop, say, 0x0100 - 0x0120. One idea comes up in my mind is adding passes to retrieve such information in LLVM, then use

https://bugs.freedesktop.org/show_bug.cgi?id=28810 Summary: Blank consoles (Ctrl+Alt+Fn) after X starts on Arch Linux with FX5200 card. Product: xorg Version: git Platform: x86-64 (AMD64) OS/Version: Linux (All) Status: NEW Severity: critical Priority: medium Component: Driver/nouveau

Is it possible to use encryption only for authenticate and then switch to no encryption? I've looked at the code for OpenSSH 3.5p1, cipher.c, and it looks like the answer is no, at least for protocol 1. However, I cannot tell if that is a deliberate design limitation of the implementation or if it is inherent in ssh protocol 2. My dilemma is a customer who wants to use their network IDS

Hello folks, I use to think that a relational databases without foreign keys constraints enforced strictly by the RDBMS were no good, piece of crap, data junk. However, I''ve also learned the hard way that FKs constraints imposes serious difficulties when moving data around, specially between different DBs, or for loading test data or for upgrading DBs schemas, or for porting DBs

Hi all, you probably have all heard by now that the Xen Project Advisory Board (a group of vendors who provide funds to the Xen Project that are intended to be used for the good of the community) recently created the Test Framework Working Group.http://wiki.xenproject.org/wiki/AB_WG/Test_Frameworkcontains more information about the group. The working group had its first meeting a few weeks

I''ve been running some multithreaded tests on Ferret. Using a single Ferret::Index::Index inside a DRb server, it definitely behaves for me as if all readers are locked out of the index when writing is going on in that index, not just optimization -- at least when segment merging happens, which is when the writes take the longest and you can therefore least afford to lock out all reads.