search for: su

Unfortuantely we don't know if a particular load is a real 2d image (as would be a cube face or 2d array element), or a layer of a 3d image. Since we pass in the TIC reference, the instruction's type has to match what's in the TIC (experimentally). In order to properly support bindless images, this also can't be done by looking at the current bindings and generating appropriate code. As a result all plain 2d loads are converted into a pair of 2d/3d loads, with appropriate predicates to ensure only one of those actually executes, and the values are all merged in...

Hi, I write again regarding buildSchedGraph(), as I am still not happy about things there. I have found at least two examples which do not work out: 1) SU(2) Store "Value A" SU(1) Store "Value A" SU(0) Load "Value A" If MIsNeedChainEdge() returns false for SU(0) and SU(1), SU(0) is inserted into RejectedMemNodes and removed from its MemUses SU list, as this list is cleared. Therefore SU(2) must be handled with adjust...

Hi, Thank you for the reply. >It looks to me like we can choose any subset of edges here and be correct. We're basically trying to prune/pinch the DAG edges here. They can easily blow up with AA sched. I would guess that isCtrl() edges are good ones to bypass because they could be a low-latecy edges, whereas true data dependencies from a load are expected to be &g...

...19, 2011, at 10:53 PM, Hal Finkel wrote: > > > Here's my "thought experiment" (from PR11589): I have a bunch of > > load-fadd-store chains to schedule. A store takes two cycles to > > clear > > its last pipeline stage. The fadd takes longer to compute its result > > (say 5 cycles), but can sustain a rate of 1 independent add per > > cycle. > > As the scheduling is bottom-up, it will schedule a store, then it > > has a > > choice: it can schedule another store (at a 1 cycle penalty), or it > > can > > schedule the...

...think I found the problem somewhere else. I was a bit confused and missed the fact that adjustChainDeps() is called a few lines down and does just what I wanted :-) I would like to instead ask another question: Why is I->isCtrl() used in code like // Iterate over chain dependencies only. for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); I != E; ++I) if (I->isCtrl()) iterateChainSucc (AA, MFI, SUa, I->getSUnit(), ExitSU, Depth, Visited); ? I thought only chain edges are relevant, and would instead use if (J->getKind() == SDep::Order)...

...l Finkel wrote: > > > > > Here's my "thought experiment" (from PR11589): I have a bunch of > > > load-fadd-store chains to schedule. A store takes two cycles to > > > clear > > > its last pipeline stage. The fadd takes longer to compute its result > > > (say 5 cycles), but can sustain a rate of 1 independent add per > > > cycle. > > > As the scheduling is bottom-up, it will schedule a store, then it > > > has a > > > choice: it can schedule another store (at a 1 cycle penalty), or it > > &...

Here is a bit more data. After PrescheduleNodesWithMultipleUses has been run, the following Predecessor/Successor links are 'dumpAll'ed. (I attach the full dumpAll before & after "Prescheduling SU #7 next to PredSU #4 to guide scheduling in the presence of multiple uses") SU(3) Predecessors: val SU(5): Latency=1 ch SU(7): Latency=1 val SU(7): Latency=1 SU(7): ch S...

Hi, I have reasoned through and believe the problem is with the PrescheduleNodesWithMultipleUses. Take the following DAG (arrow to predecessor): Destroy Destroy ^ ^ | | | | SetUp----->PredSU <-----SU ^ ^ ^ | | | | | | ----------- | --------- | | | Setup ^ | When there are two successors of PredSU with type getCallFrameDestroyOpcode and there is order bet...

...ome more test; before if i shut off the wireless, winbind stop immediately responding. Now, it worked for some minutes, then stop responding and seems behave badly as my first test (eg, loooooon gelay for everything, machine totally unusable, ...). So still it is not a solution.... > I would suggest that 'does not work fully in rfc2307 mode' is nearer the > truth. It sounds like the ID's are being pulled from the cache, but it > is falling over trying to get the homedir, shell etc. Look at my other post: i can have a domain in rfc2307 and a client in rid, if i don'...

> Message: 1 > Date: Thu, 16 Dec 2004 20:31:05 +0800 > From: Ganbold <ganbold@micom.mng.net> > Subject: Strange command histories in hacked shell server Just a minor comment on one portion of your message. [All deleted except the pertinent part - wjv] > Machine is configured in such way that everyone can create an account itself. > Some user dir permissions: > ... > drwxr-xr-x...

...ote: >>> >>>> Here's my "thought experiment" (from PR11589): I have a bunch of >>>> load-fadd-store chains to schedule. A store takes two cycles to >>>> clear >>>> its last pipeline stage. The fadd takes longer to compute its result >>>> (say 5 cycles), but can sustain a rate of 1 independent add per >>>> cycle. >>>> As the scheduling is bottom-up, it will schedule a store, then it >>>> has a >>>> choice: it can schedule another store (at a 1 cycle penalty), or it &...

Hi, I have revisited the issue in buildSchedGraph() I talked about previously, and attached a few patches. The first tries to fix the issue, and the other two try to illustrate associated issues, emerged from applying it. Is it OK to commit the first patch? [PATCH] Bugfix for missed dependency from store to load in buildS...

...s the domain user, the user seemed to be known, but the password was reported as incorrect. I logged the user out and logged in a local Unix user. When I ran 'getent', I got this: adminuser at ubugdm: $ getent passwd usertest3 usertest3:*:20002:20005::/home/usertest3:/bin/bash Trying to su to the domain user, produced this: adminuser at ubugdm: $ su - usertest3 Password: su: Authentication failure I found this when checking /var/log/auth.log Jun 29 10:45:57 ubugdm su: pam_unix(su-l:auth): authentication failure; logname= uid=1000 euid=0 tty=/dev/pts/0 ruser=adminuser rhost= user=u...

...n slapd.conf and do: ldapsearch -x -ZZ -b 'dc=yourdomain,dc=com' '(objectclass=*)' -d 127 in the end I get: ldap_chkResponseList for msgid=2, all=1 ldap_chkResponseList returns NULL wait4msg (infinite timeout), msgid 2 wait4msg continue, msgid 2, all 1 ** Connections: * host: s2.dbb.su.se port: 389 (default) refcnt: 2 status: Connected last used: Mon Mar 7 10:09:15 2005 ** Outstanding Requests: * msgid 2, origid 2, status InProgress outstanding referrals 0, parent count 0 ** Response Queue: Empty ldap_chkResponseList for msgid=2, all=1 ldap_chkResponseList return...

I am obviously missing something basic here but can someone explain to me what is wrong with the first statement, which returns nothing? $ history | grep ^su $ history | grep su 2997 su -l 3024 su -l 3050 su -l 3054 su -l Thanks, -- *** E-Mail is NOT a SECURE channel *** James B. Byrne mailto:ByrneJB at Harte-Lyne.ca Harte & Lyne Limited http://www.harte-lyne.ca 9 Brockley Drive vox:...

Hi, Can anyone help me to understand the ScheduleDAGInstrs::buildSchedGraph() method? I find the handling of AliasChain is disturbing since: 1. A new alias chain add deps to all possibly aliasing SUs, and then clears those lists. 2. When AliasChain is present, the addChainDependency() method is called, but the target hook areMemAccessesTriviallyDisjoint() called inside MIsNeedChainEdge() allows this edge to be skipped. This means that I get a case where SU0...

...0; i<n; ++i) { a[i] += b[i]; } } int main(int argc, char** argv) { __remote int* __restrict a = A; __remote int* __restrict b = B; #pragma unroll 4 for(int i=0; i<4; ++i) { a[i] += b[i]; } return 0; } vec_add give following schedule: *** Final schedule for %bb.8 *** SU(0): %33:gpr = LW %56:gpr, -8 :: (load 4 from %ir.scevgep8, !tbaa !14, !noalias !13, addrspace 1) SU(1): %34:gpr = LW %55:gpr, -8 :: (load 4 from %ir.scevgep14, !tbaa !14, !noalias !13, addrspace 1) SU(4): %36:gpr = LW %56:gpr, -4 :: (load 4 from %ir.scevgep10, !tbaa !14, !noalias !13, addrspa...

Hi, I have an assert firing due to PickNodeToScheduleBottomUp(): 1. having a CallResource in use pushing an interference of current SUnit. 2. having no more SUnits in the AvailableQueue 3. The only interference being the SUnit that just failed due to a Call Resource. 4. An attempt to duplicate this node which has the 'Call Resource' as a physical register. Thus the call to getMinimalPhysRegClass() asserts - Ca...

Hi, I see that currently physical register uses marked as "undef" can still cause dependencies. Is this intentional? SU(9): %D5<def,undef> = LDrid %R0, 0, %R10<imp-def>, %R11<imp-def> # preds left : 0 # succs left : 11 # rdefs left : 0 Latency : 1 Depth : 0 Height : 0 Successors: ... val SU(14): Latency=1 val S...

On a couple servers I have one running 5.0 Release, another running 5.0 Stable I have a problem with su. If I login to the server using a regular account, then su - to root, then I try to su - to any other account, other than the one I originally logged in as the su works but with this error: su: No controlling tty (open /dev/tty: Permission denied) su: warning: won't have full job control W...