What is the time complexity of find_get_pages_tag?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP












0















I am required to find the dirty pages in some offset range, so I am using find_get_pages_tag() for it, but I am concerned about its complexity since this call would be called multiple times from my code. I looked through the definition of this function on bootlin, seems worst case is O(n). Is this correct?



My kernel release is
2.6.32-754.3.5.el6.x86_64










share|improve this question













migrated from unix.stackexchange.com Feb 1 at 18:20


This question came from our site for users of Linux, FreeBSD and other Un*x-like operating systems.






















    0















    I am required to find the dirty pages in some offset range, so I am using find_get_pages_tag() for it, but I am concerned about its complexity since this call would be called multiple times from my code. I looked through the definition of this function on bootlin, seems worst case is O(n). Is this correct?



    My kernel release is
    2.6.32-754.3.5.el6.x86_64










    share|improve this question













    migrated from unix.stackexchange.com Feb 1 at 18:20


    This question came from our site for users of Linux, FreeBSD and other Un*x-like operating systems.




















      0












      0








      0








      I am required to find the dirty pages in some offset range, so I am using find_get_pages_tag() for it, but I am concerned about its complexity since this call would be called multiple times from my code. I looked through the definition of this function on bootlin, seems worst case is O(n). Is this correct?



      My kernel release is
      2.6.32-754.3.5.el6.x86_64










      share|improve this question














      I am required to find the dirty pages in some offset range, so I am using find_get_pages_tag() for it, but I am concerned about its complexity since this call would be called multiple times from my code. I looked through the definition of this function on bootlin, seems worst case is O(n). Is this correct?



      My kernel release is
      2.6.32-754.3.5.el6.x86_64







      linux filesystems rhel linux-kernel






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Jan 31 at 12:28









      mahesh bhosalemahesh bhosale

      157




      157




      migrated from unix.stackexchange.com Feb 1 at 18:20


      This question came from our site for users of Linux, FreeBSD and other Un*x-like operating systems.









      migrated from unix.stackexchange.com Feb 1 at 18:20


      This question came from our site for users of Linux, FreeBSD and other Un*x-like operating systems.
























          0






          active

          oldest

          votes











          Your Answer






          StackExchange.ifUsing("editor", function ()
          StackExchange.using("externalEditor", function ()
          StackExchange.using("snippets", function ()
          StackExchange.snippets.init();
          );
          );
          , "code-snippets");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "1"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54485105%2fwhat-is-the-time-complexity-of-find-get-pages-tag%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Stack Overflow!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54485105%2fwhat-is-the-time-complexity-of-find-get-pages-tag%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown






          Popular posts from this blog

          How to check contact read email or not when send email to Individual?

          Displaying single band from multi-band raster using QGIS

          How many registers does an x86_64 CPU actually have?