search for: getlink

...*** 712,717 **** --- 712,720 ---- debug3("SSH_FXP_READLINK %s -> %s", path, filename); + if (attrib != NULL) + *attrib = *a; + xfree(longname); buffer_free(&msg); *************** *** 719,724 **** --- 722,774 ---- return(filename); } + int + do_getlink(struct sftp_conn *conn, char *path) + { + char *dest; + u_int status = 0; + int ret; + struct stat statb; + char *filename; + Attrib *a; + Attrib attrib; + + a = do_lstat(conn, path, 0); + if (a == NULL || !S_ISLNK(a->perm)) { + if (a != NULL) + error("%s is not a symlink&...

http://bugzilla.mindrot.org/show_bug.cgi?id=428 ------- Additional Comments From gfernandez at livevault.com 2002-11-07 01:35 ------- Created an attachment (id=168) --> (http://bugzilla.mindrot.org/attachment.cgi?id=168&action=view) changes to implement getlink this patch includes changes to sftp-int.c ------- You are receiving this mail because: ------- You are the assignee for the bug, or are watching the assignee.

llvm, What is the best way to implement a traversal of the DS graph, starting at a scalar and processing all nodes to which the scalar allows access? Currently the links vector is not public and there is no apparent way to bound the getLink call (ie a getNumLinks call).... Dave

1. What is the difference between DSNodeHandle and DSNode? What do the functions getLink() and getSize() do? 2. In the previous email, you mentioned that we can use DSNode::getPointerSize() to get the number of links, But I checked the doxygen documentation, there is no such member for DSNode. 3. Previously I use the following code: for( df_iterator<DSNode*> I = df_begin(pnode)...

...g Li <xli3 at santoor.cs.uiuc.edu> > > Subject: [LLVMdev] DSGraph questions > > Sender: llvmdev-admin at cs.uiuc.edu > > Date: Sun, 10 Nov 2002 11:25:53 -0600 (CST) > > > > 1. What is the difference between DSNodeHandle and DSNode? What do the > > functions getLink() and getSize() do? > > > DSNodeHandle is essentially like an edge in the DSGraph. > It serves two main purposes: > (1) It keeps track of which byte offset is being pointed to within > the target node. > (2) It keeps track of how many objects have pointers to a DSNode, >...

...is week. > From: Xiaodong Li <xli3 at santoor.cs.uiuc.edu> > Subject: [LLVMdev] DSGraph questions > Sender: llvmdev-admin at cs.uiuc.edu > Date: Sun, 10 Nov 2002 11:25:53 -0600 (CST) > > 1. What is the difference between DSNodeHandle and DSNode? What do the > functions getLink() and getSize() do? DSNodeHandle is essentially like an edge in the DSGraph. It serves two main purposes: (1) It keeps track of which byte offset is being pointed to within the target node. (2) It keeps track of how many objects have pointers to a DSNode, so that it can check if the numbe...

...release()" on the unique_ptr to ensure ownership was never really taken). > We had three derivative types of pointers > (Shared/Owned/Linked) which would just differ on the default behaviour > of construction / destruction, but all of them could still explicitly > call getClear / getLink / etc. > > The downside was that almost every interaction with smart pointers had > to be carefully planned and there was a lot of room for errors, > My hope is that having a single construct for conditional ownership will be less confusing than the existing ad-hoc solutions in many pl...

On Wed, Sep 24, 2014 at 7:50 PM, Justin Bogner <mail at justinbogner.com> wrote: > Anton Yartsev <anton.yartsev at gmail.com> writes: > > Hello everyone, > > > > I bring to discussion the necessity/design of a new type of smart > pointer. > > r215176 and r217791 rise the problem, D5443 is devoted to the solution. > > r215176 applies several

...Status: NEW Severity: enhancement Priority: P3 Component: sftp AssignedTo: openssh-unix-dev at mindrot.org ReportedBy: gfernandez at livevault.com Currently there is no way using sftp to transfer a symlink. The attached patch adds a command "getlink" that allows a symlink to be transferred. ------- You are receiving this mail because: ------- You are the assignee for the bug, or are watching the assignee.

> What is the best way to implement a traversal of the DS graph, starting at > a scalar and processing all nodes to which the scalar allows access? > Currently the links vector is not public and there is no apparent way to > bound the getLink call (ie a getNumLinks call).... Warning, untested code follows, but you should get the idea: #include "llvm/Analysis/DSGraphTraits.h" DSNode *N = ... // Visit all children of a node... for (DSNode::iterator I = N->begin(), E = N->end(); I != E; ++I) if (I->getNode()...

...; Content-Length: 1073 > > > > What is the best way to implement a traversal of the DS graph, starting at > > a scalar and processing all nodes to which the scalar allows access? > > Currently the links vector is not public and there is no apparent way to > > bound the getLink call (ie a getNumLinks call).... > > Warning, untested code follows, but you should get the idea: > > > #include "llvm/Analysis/DSGraphTraits.h" > > DSNode *N = ... > > // Visit all children of a node... > for (DSNode::iterator I = N->begin(), E = N-&g...

...e bonuses of the new representation: 1. Only the DSNode interface changed, mostly in implementation details, so hopefully client code shouldn't be effected. As a metric, nothing had to change in BottomUp or TopDownClosure.cpp for the new representation. The biggest change is that the getLink(...) methods now return a reference to a DSNodeHandle instead of a pointer. 2. The new representation is much smaller and less computationally intensive to update, meaning that the datastructure analysis itself should be much faster. 3. The new representation is *much* simpler to *understa...

...visit(I->getNode(), I->getOffset()); The return type of I->getNode() is 'const DSNode *' type. Is there a 'DSNode *' type iterator? Besides, Can I use the following code to visit the children of N? for( unsigned i=0; i < N->getNumLinks(); i++) { visit( N->getLink() ) } Thanks, Jerry

On Thu, Jan 15, 2015 at 1:26 PM, Nick Lewycky <nlewycky at google.com> wrote: > On 15 January 2015 at 13:10, Daniel Berlin <dberlin at dberlin.org> wrote: > >> Yes. >> I've attached an updated patch that does the following: >> >> 1. Fixes the partialalias of globals/arguments >> 2. Enables partialalias for cases where nothing has been unified to

...878 net: rtnetlink: add possibility to use alternative names as message handle cc6090e985d7 net: rtnetlink: introduce helper to get net_device instance by ifname 7af12cba4ef0 net: rtnetlink: unify the code in __rtnl_newlink get dev with the rest 88f4fb0c7496 net: rtnetlink: put alternative names to getlink message 36fbf1e52bd3 net: rtnetlink: add linkprop commands to add and delete alternative ifnames ff92741270bf net: introduce name_node struct to be used in hashlist 6958c97a488c net: procfs: use index hashlist instead of name hashlist be2

Inline George > On Jan 26, 2015, at 1:05 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > > George, given that, can you just build constexpr handling (it's not as easy as you think) as a separate funciton and have it use it in the right places? Will do. :) > FWIW, my current list of CFLAA issues is: > > 1. Unknown values (results from ptrtoint, incoming

George, given that, can you just build constexpr handling (it's not as easy as you think) as a separate funciton and have it use it in the right places? FWIW, my current list of CFLAA issues is: 1. Unknown values (results from ptrtoint, incoming pointers, etc) are not treated as unknown. These should be done through graph edge (so that they can be one way, otherwise, you will unify

...nInfo(Builder.build(), std::move(ReturnedValues)); @@ -993,18 +1080,18 @@ CFLAliasAnalysis::query(const AliasAnalysis::Location &LocA, auto SetB = *MaybeB; if (SetA.Index == SetB.Index) - return AliasAnalysis::PartialAlias; + return AliasAnalysis::MayAlias; auto AttrsA = Sets.getLink(SetA.Index).Attrs; auto AttrsB = Sets.getLink(SetB.Index).Attrs; // Stratified set attributes are used as markets to signify whether a member - // of a StratifiedSet (or a member of a set above the current set) has + // of a StratifiedSet (or a member of a set above the current set) has...

...izePass() override { InitializeAliasAnalysis(this); } @@ -993,7 +996,7 @@ CFLAliasAnalysis::query(const AliasAnalysis::Location &LocA, auto SetB = *MaybeB; if (SetA.Index == SetB.Index) - return AliasAnalysis::PartialAlias; + return AliasAnalysis::MayAlias; auto AttrsA = Sets.getLink(SetA.Index).Attrs; auto AttrsB = Sets.getLink(SetB.Index).Attrs; diff --git a/lib/CodeGen/Passes.cpp b/lib/CodeGen/Passes.cpp index a5d3210..b2e42e7 100644 --- a/lib/CodeGen/Passes.cpp +++ b/lib/CodeGen/Passes.cpp @@ -400,10 +400,10 @@ void TargetPassConfig::addIRPasses() { // Add TypeBasedAl...